Author of the publication

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.

, , , , and . ISAAC, volume 181 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs., , , , , and . Algorithmica, 83 (8): 2634-2650 (2021)The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs., , , , and . ISAAC, volume 181 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Subexponential-time algorithms for finding large induced sparse subgraphs., , , , , and . CoRR, (2019)Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs., and . SIAM J. Comput., 50 (2): 487-508 (2021)The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width., , , , and . ICALP, volume 229 of LIPIcs, page 66:1-66:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Complexity of k-Means Clustering when Little is Known., , , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 6960-6987. PMLR, (2022)The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs., , , , and . Algorithmica, 85 (5): 1202-1250 (May 2023)Tree decompositions meet induced matchings: beyond Max Weight Independent Set., , , , , and . CoRR, (2024)Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs., and . CoRR, (2019)Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs., and . SODA, page 1578-1590. SIAM, (2020)