Matthias Mnich

Simon Omlor

J. Sched., December, 2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2024

New Support Size Bounds and Proximity Bounds for Integer Linear Programming.

[BibT_eX]

[DOI]

Sebastian Berndt

Tobias Stamm

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates.

[BibT_eX]

[DOI]

Matthias Kaul

Hendrik Molter

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

Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities.

[BibT_eX]

[DOI]

Laura Codazzi

Gergely Csáji

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

No Polynomial Kernels for Knapsack.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP.

[BibT_eX]

[DOI]

Susanne Armbruster

Martin Nägele

Proceedings of the Approximation, 2024

2023

High-multiplicity N-fold IP via configuration LP.

[BibT_eX]

[DOI]

Math. Program., 2023

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Checkpoint Placement for Systematic Fault-Injection Campaigns.

[BibT_eX]

[DOI]

Christian Dietrich

Tim-Marek Thomas

Proceedings of the IEEE/ACM International Conference on Computer Aided Design, 2023

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding.

[BibT_eX]

[DOI]

Ariel Kulik

Hadas Shachnai

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots.

[BibT_eX]

[DOI]

Max Deppert

Matthias Kaul

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

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.

[BibT_eX]

[DOI]

Benjamin Bergougnoux

Vera Chekan

Robert Ganian

Mamadou Moustapha Kanté

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

2022

Hitting Weighted Even Cycles in Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

A 3/2-Approximation for the Metric Many-Visits Path TSP.

[BibT_eX]

[DOI]

Kristóf Bérczi

Roland Vincze

SIAM J. Discret. Math., December, 2022

Parameterized algorithms for generalizations of Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

Dániel Marx

Discret. Optim., 2022

Resolving Infeasibility of Linear Systems: A Parameterized Approach.

[BibT_eX]

[DOI]

Kristóf Bérczi

Lydia Mirabel Mendoza Cadena

CoRR, 2022

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values.

[BibT_eX]

[DOI]

Gregory Z. Gutin

CoRR, 2022

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem.

[BibT_eX]

[DOI]

Ariel Kulik

Hadas Shachnai

CoRR, 2022

Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems.

[BibT_eX]

[DOI]

Kristóf Bérczi

Roland Vincze

CoRR, 2022

Recent Advances in Practical Data Reduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

Parameterized complexity of configuration integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Reachability Switching Games.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

2020

Voting and Bribing in Single-Exponential Time.

[BibT_eX]

[DOI]

Dusan Knop

Martin Koutecký

ACM Trans. Economics and Comput., 2020

Time- and Space-optimal Algorithm for the Many-visits TSP.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Dynamic Parameterized Problems and Algorithms.

[BibT_eX]

[DOI]

Josh Alman

Virginia Vassilevska Williams

ACM Trans. Algorithms, 2020

Odd Multiway Cut in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Karthekeyan Chandrasekaran

Sahand Mozaffari

SIAM J. Discret. Math., 2020

Combinatorial n-fold integer programming and applications.

[BibT_eX]

[DOI]

Dusan Knop

Martin Koutecký

Math. Program., 2020

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes.

[BibT_eX]

[DOI]

Discret. Optim., 2020

Recent Advances in Practical Data Reduction.

[BibT_eX]

[DOI]

CoRR, 2020

Dense Steiner problems: Approximation algorithms and inapproximability.

[BibT_eX]

[DOI]

CoRR, 2020

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.

[BibT_eX]

[DOI]

Ildikó Schlotter

Algorithmica, 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Hitting Long Directed Cycles Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Engineering Kernelization for Maximum Cut.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Domination When the Stars Are Out.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs.

[BibT_eX]

[DOI]

Simon Omlor

CoRR, 2019

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP.

[BibT_eX]

[DOI]

CoRR, 2019

Multitype Integer Monoid Optimization and Applications.

[BibT_eX]

[DOI]

CoRR, 2019

Resolving Infeasibility of Linear Systems: A Parameterized Approach.

[BibT_eX]

[DOI]

Lydia Mirabel Mendoza Cadena

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

New algorithms for maximum disjoint paths based on tree-likeness.

[BibT_eX]

[DOI]

Krzysztof Fleszar

Joachim Spoerhase

Math. Program., 2018

Big data algorithms beyond machine learning.

[BibT_eX]

[DOI]

Künstliche Intell., 2018

Improved bounds for minimal feedback vertex sets in tournaments.

[BibT_eX]

[DOI]

Eva-Lotta Teutrine

J. Graph Theory, 2018

Improved integrality gap upper bounds for traveling salesperson problems with distances one and two.

[BibT_eX]

[DOI]

Tobias Mömke

Eur. J. Oper. Res., 2018

Linear-time recognition of map graphs with outerplanar witness.

[BibT_eX]

[DOI]

Ignaz Rutter

Jens M. Schmidt

Discret. Optim., 2018

New deterministic algorithms for solving parity games.

[BibT_eX]

[DOI]

Heiko Röglin

Clemens Rösner

Discret. Optim., 2018

Time- and space-optimal algorithms for the many-visits TSP.

[BibT_eX]

[DOI]

CoRR, 2018

Parameterized complexity of machine scheduling: 15 open problems.

[BibT_eX]

[DOI]

René van Bevern

Comput. Oper. Res., 2018

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts.

[BibT_eX]

[DOI]

Michael Etscheid

Algorithmica, 2018

New Approximation Algorithms for (1, 2)-TSP.

[BibT_eX]

[DOI]

Anna Adamaszek

Katarzyna Paluch

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

A Unifying Framework for Manipulation Problems.

[BibT_eX]

[DOI]

Dusan Knop

Martin Koutecký

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Large Independent Sets in Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Zdenek Dvorák

SIAM J. Discret. Math., 2017

Polynomial kernels for weighted problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Polynomial kernels for deletion to classes of acyclic digraphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Discret. Optim., 2017

Stable Marriage with Covering Constraints-A Complete Computational Trichotomy.

[BibT_eX]

[DOI]

Ildikó Schlotter

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Parameterized complexity dichotomy for Steiner Multicut.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Lower Bounds for Locally Highly Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Large Independent Sets in Subquartic Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

On Routing Disjoint Paths in Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A 7/3-Approximation for Feedback Vertex Sets in Tournaments.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

László A. Végh

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Interval scheduling and colorful independent sets.

[BibT_eX]

[DOI]

J. Sched., 2015

Scheduling and fixed-parameter tractability.

[BibT_eX]

[DOI]

Andreas Wiese

Math. Program., 2015

Max-Cut Parameterized Above the Edwards-Erdős Bound.

[BibT_eX]

[DOI]

Robert Crowston

Mark Jones

Algorithmica, 2015

When Does Schwartz Conjecture Hold?

[BibT_eX]

[DOI]

Yash Raj Shrestha

Yongjie Yang

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Algorithmica, 2014

Treewidth Computation and Kernelization in the Parallel External Memory Model.

[BibT_eX]

[DOI]

Riko Jacob

Tobias Lieber

Proceedings of the Theoretical Computer Science, 2014

2013

Kernel and fast algorithm for dense triplet inconsistency.

[BibT_eX]

[DOI]

Sylvain Guillemot

Theor. Comput. Sci., 2013

Feedback Vertex Sets in Tournaments.

[BibT_eX]

[DOI]

Serge Gaspers

J. Graph Theory, 2013

Scheduling Meets Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Andreas Wiese

CoRR, 2013

Improved integrality gap upper bounds for TSP with distances one and two.

[BibT_eX]

[DOI]

Tobias Mömke

CoRR, 2013

2012

Induced Matchings in Subcubic Planar Graphs.

[BibT_eX]

[DOI]

Ross J. Kang

Tobias Müller

SIAM J. Discret. Math., 2012

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Bisections above Tight Lower Bounds.

[BibT_eX]

[DOI]

Rico Zenklusen

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

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

2011

A linear kernel for planar connected dominating set.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Saket Saurabh

Theor. Comput. Sci., 2011

Book review.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Planar k-Path in Subexponential Time and Polynomial Space.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Saket Saurabh

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

2010

Betweenness parameterized above tight lower bound.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels

[BibT_eX]

[DOI]

CoRR, 2010

Ranking and Drawing in Subexponential Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.

[BibT_eX]

[DOI]

Leo van Iersel

Steven Kelk