Author of the publication

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

, , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)

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

Boolean and $F_p$-Matrix Factorization: From Theory to Practice., , , and . IJCNN, page 1-8. IEEE, (2022)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Fixed-Parameter Tractability of Maximum Colored Path and Beyond., , , , and . CoRR, (2022)Tree Containment Above Minimum Degree is FPT., , , and . CoRR, (2023)Lossy Kernelization of Same-Size Clustering., , , , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 96-114. Springer, (2022)Parameterized Complexity of Categorical Clustering with Size Constraints., , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 385-398. Springer, (2021)Exploring Subexponential Parameterized Complexity of Completion Problems., , , and . CoRR, (2013)Approximating acyclicity parameters of sparse hypergraphs, , and . CoRR, (2008)Exact (Exponential) Algorithms for the Dominating Set Problem., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 245-256. Springer, (2004)Minimizing Rosenthal Potential in Multicast Games., , , and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 525-536. Springer, (2012)