Tomohiro Koana

Magnus Wahlström

CoRR, 2024

Determinantal Sieving.

[BibT_eX]

[DOI]

Eduard Eiben

Magnus Wahlström

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences.

[BibT_eX]

[DOI]

Games Econ. Behav., November, 2023

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Essentially Tight Kernels for (Weakly) Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

The complexity of binary matrix completion under diameter constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

The complexity of gerrymandering over graphs: Paths and trees.

[BibT_eX]

[DOI]

Matthias Bentert

Discret. Appl. Math., 2023

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem.

[BibT_eX]

[DOI]

Lito Goldmann

Leon Kellerhals

CoRR, 2023

A refined complexity analysis of fair districting over graphs.

[BibT_eX]

[DOI]

Niclas Boehmer

Auton. Agents Multi Agent Syst., 2023

Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Correlating Theory and Practice in Finding Clubs and Plexes.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Matthias Bentert

Klaus Heeger

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Algorithms for Colored Clustering.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

Parameterized Complexity of Geodetic Set.

[BibT_eX]

[DOI]

Leon Kellerhals

J. Graph Algorithms Appl., 2022

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma.

[BibT_eX]

[DOI]

Niklas Wünsche

CoRR, 2022

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees.

[BibT_eX]

[DOI]

Leon Kellerhals

Pascal Kunz

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

The Complexity of Finding Fair Many-To-One Matchings.

[BibT_eX]

[DOI]

Niclas Boehmer

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Viatcheslav Korenwein

Philipp Zschoche

ACM J. Exp. Algorithmics, 2021

Detecting and enumerating small induced subgraphs in c-closed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Binary Matrix Completion Under Diameter Constraints.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Algorithms for Matrix Completion with Radius Constraints.

[BibT_eX]

[DOI]