PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kowalik, Lukasz"

Author of the publication

copydeleteadd this publication to your clipboard
Towards optimal kernel for connected vertex cover in planar graphs.

, , and . Discrete Applied Mathematics, 161 (7-8): 1154-1161 (2013)

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.

Lukasz Brodecki University of Stuttgart

 

Other publications of authors with the same name

A Planar Linear Arboricity Conjecture., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 204-216. Springer, (2010)35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality., and . WADS, volume 4619 of Lecture Notes in Computer Science, page 589-600. Springer, (2007)Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 471-482. Springer, (2009)Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time., , and . SODA, page 594-603. SIAM, (2014)On the Fine-Grained Complexity of Rainbow Coloring., , and . SIAM J. Discrete Math., 32 (3): 1672-1705 (2018)Probably Optimal Graph Motifs, , and . CoRR, (2012)Tight Lower Bounds for the Complexity of Multicoloring., , , , and . TOCT, 11 (3): 13:1-13:19 (2019)Spotting Trees with Few Leaves., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 243-255. Springer, (2015)Short Cycles in Planar Graphs.. WG, volume 2880 of Lecture Notes in Computer Science, page 284-296. Springer, (2003)Tight Lower Bounds for the Complexity of Multicoloring., , , , and . ESA, volume 87 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)