( en | de | ru )

 

Disambiguation of "Wrochna, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Lower Bounds for the Complexity of Multicoloring.

, , , , and . ESA, volume 87 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Michal Wrochna

Marcin Wlodarski

Marcin Grzegorzek

Marcin Siatkowski

Marcin Wlodarczak

 

Other publications of authors with the same name

Treewidth-Pliability and PTAS for Max-CSPs., , and . SODA, page 473-483. SIAM, (2021)PTAS for Sparse General-Valued CSPs., , and . LICS, page 1-11. IEEE, (2021)On Directed Feedback Vertex Set Parameterized by Treewidth., , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 65-78. Springer, (2018)On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs., and . STACS, volume 47 of LIPIcs, page 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Integer Programming and Incidence Treedepth., , , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 194-204. Springer, (2019)Edge Bipartization Faster Than 2^k., , and . IPEC, volume 63 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor., , and . IPEC, volume 89 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth., , , , and . ACM Trans. Algorithms, 14 (3): 34:1-34:45 (2018)Integer Programming and Incidence Treedepth., , , , , and . CoRR, (2020)The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems., , , and . SIAM J. Comput., 49 (6): 1232-1248 (2020)