Author of the publication

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.

 

Other publications of authors with the same name

Dominating sets reconfiguration under token sliding., , and . CoRR, (2019)Enumerating Minimal Dominating Sets in Triangle-Free Graphs., , , and . STACS, volume 126 of LIPIcs, page 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Diameter of Colorings Under Kempe Changes., , , , , , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 52-64. Springer, (2019)Recognizing Graphs Close to Bipartite Graphs., , , , and . MFCS, volume 83 of LIPIcs, page 70:1-70:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Global discharging methods for coloring problems in graphs. (Méthodes de déchargement global pour des problèmes de coloration dans les graphes).. University of Montpellier, France, (2015)Sparse graphs with bounded induced cycle packing number have logarithmic treewidth., , , , , , , and . SODA, page 3006-3028. SIAM, (2023)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)Decomposing the edges of a graph into simpler structures.. BCC, page 103-132. Cambridge University Press, (2021)Exploring the Space of Colourings with Kempe Changes (Invited Talk).. MFCS, volume 272 of LIPIcs, page 1:1-1:2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , and . CoRR, (2018)