Davis Issac

Kirill Simonov

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

2023

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs.

[BibT_eX]

[DOI]

Katrin Casel

Tobias Friedrich

Ziena Zeif

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

Upper bounding rainbow connection number by forest number.

[BibT_eX]

[DOI]

Discret. Math., 2022

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Balanced Crown Decomposition for Connectivity Constraints.

[BibT_eX]

[DOI]

Katrin Casel

Tobias Friedrich

Ziena Zeif

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.

[BibT_eX]

[DOI]

Ralf Borndörfer

Katrin Casel

Stephan Schwartz

Ziena Zeif

Proceedings of the Approximation, 2021

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Ashutosh Rai

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

On some covering, partitions, and connectivity problems in graphs.

[BibT_eX]

[DOI]

PhD thesis, 2019

Hadwiger's conjecture for squares of 2-trees.

[BibT_eX]

[DOI]

Sanming Zhou

Eur. J. Comb., 2019

2018

Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition.

[BibT_eX]

[DOI]

Yun Kuen Cheung

CoRR, 2018

Sampling in Space Restricted Settings.

[BibT_eX]

[DOI]

Algorithmica, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Algorithms and Bounds for Very Strong Rainbow Coloring.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition.

[BibT_eX]

[DOI]

Yun Kuen Cheung

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016

An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs.

[BibT_eX]

[DOI]

Sanming Zhou

CoRR, 2016

On the Parameterized Complexity of Biclique Cover and Partition.

[BibT_eX]

[DOI]

Andreas Karrenbauer

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Hadwiger's Conjecture and Squares of Chordal Graphs.

[BibT_eX]

[DOI]