Author of the publication

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.

, , , , and . Theor. Comput. Sci., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph., and . WG, volume 5344 of Lecture Notes in Computer Science, page 300-311. (2008)On Approximating the d-Girth of a Graph., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 467-481. Springer, (2011)Edge-Simple Circuits through 10 Ordered Vertices in Square Grids., , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 134-145. Springer, (2009)Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs., , and . SIAM J. Discret. Math., 25 (4): 1490-1505 (2011)On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings., and . Algorithmica, 83 (8): 2351-2373 (2021)A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps., and . Theor. Comput. Sci., (2022)Hitting minors on bounded treewidth graphs. III. Lower bounds., , and . J. Comput. Syst. Sci., (2020)An O(log OPT)-approximation for covering and packing minor models of $θr., , , and . CoRR, (2015)Parameterized complexity of computing maximum minimal blocking and hitting sets., , , and . CoRR, (2021)A Unifying Model for Locally Constrained Spanning Tree Problems., , , and . CoRR, (2020)