A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

Some of the ideas presented in this paper were later used by the author for preparing algorithmic tasks for several contests where the author was a member of the scientific committee (e.g. ACM ICPC Southeastern regional contest 2009 and Balkan olympiad in informatics 2011). Such tasks (including the task statement and solutions) can be found in the attached zip archive.

Data and Resources

Additional Info

Field Value
Source Proceedings of the IEEE International Conference on Automation, Quality and Testing, Robotics. Poster Session.
Author Andreica, Mugurel Ionut
Maintainer CCSD
Last Updated June 3, 2026, 05:44 (UTC)
Created June 3, 2026, 05:44 (UTC)
Identifier hal-00285194
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Parallel and Distributed Systems Laboratory [Bucarest] ; Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România] (UPB)
coverage Cluj-Napoca, Romania
creator Andreica, Mugurel Ionut
date 2008-05-22T00:00:00
harvest_object_id 5da0527c-20a8-47dc-846d-d39aa9745d74
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-01-14T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/0806.0840
set_spec type:COMM