Tomohiro Koana

CoRR, September, 2025

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms.

[BibT_eX]

[DOI]

CoRR, April, 2025

FPT algorithms over linear delta-matroids with applications.

[BibT_eX]

[DOI]

Eduard Eiben

Magnus Wahlström

CoRR, February, 2025

Faster Minimization of Total Weighted Completion Time on Parallel Machines.

[BibT_eX]

[DOI]

Danny Hermelin

Dvir Shabtay

CoRR, February, 2025

Faster Algorithms on Linear Delta-Matroids.

[BibT_eX]

[DOI]

Magnus Wahlström

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Faster Edge Coloring by Partition Sieving.

[BibT_eX]

[DOI]

Shyan Akmal

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

New parameterized algorithms for matching and packing problems (Neue parametrisierte Algorithmen für Matching- und Packprobleme)

[BibT_eX]

[DOI]

PhD thesis, 2024

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem.

[BibT_eX]

[DOI]

Lito Goldmann

Leon Kellerhals

Discret. Math. Theor. Comput. Sci., 2024

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K<sub>4</sub>-Minor.

[BibT_eX]

[DOI]

Carla Groenland

Jesper Nederlof

CoRR, 2024

Determinantal Sieving.

[BibT_eX]

[DOI]

Eduard Eiben

Magnus Wahlström

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

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.

[BibT_eX]

[DOI]

Nidhi Purohit

Kirill Simonov

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor.

[BibT_eX]

[DOI]

Carla Groenland

Jesper Nederlof

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

The complexity of binary matrix completion under diameter constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 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

FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations 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

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

Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 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

A Refined Complexity Analysis of Fair Districting over Graphs.

[BibT_eX]

[DOI]

Niclas Boehmer

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 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

The Complexity of Gerrymandering over Graphs: Paths and Trees.

[BibT_eX]

[DOI]

Matthias Bentert

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Essentially Tight Kernels For (Weakly) Closed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

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 Complexity of Geodetic Set.

[BibT_eX]

[DOI]

Leon Kellerhals

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

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Exploiting c-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Parameterized Algorithms for Matrix Completion with Radius Constraints.

[BibT_eX]

[DOI]