Manuel Sorge

Pascal Kunz

Frank Sommer

Proceedings of the International Conference on Machine Learning, 2023

The Influence of Dimensions on the Complexity of Computing Decision Trees.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Maarten Löffler

Fabrizio Montecchiani

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

Game Implementation: What Are the Obstructions?

[BibT_eX]

[DOI]

Seyedeh Negar Layegh Khavidaki

Sebastian Vincent Haydn

Sofia Simola

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

2022

Packing Directed Cycles Quarter- and Half-Integrally.

[BibT_eX]

[DOI]

Comb., December, 2022

Constant Congestion Brambles in Directed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Threshold Treewidth and Hypertree Width.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Constant Congestion Brambles.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Planarizing Graphs and Their Drawings by Vertex Splitting.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Turbocharging Heuristics for Weak Coloring Numbers.

[BibT_eX]

[DOI]

Alexander Dobler

Anaïs Villedieu

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Matchings under Preferences: Strength of Stability and Tradeoffs.

[BibT_eX]

[DOI]

Piotr Skowron

ACM Trans. Economics and Comput., 2021

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.

[BibT_eX]

[DOI]

Laurent Bulteau

Niels Grüttemeier

J. Comput. Syst. Sci., 2021

Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings.

[BibT_eX]

[DOI]

Shaohua Li

Marcin Pilipczuk

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

Optimal Discretization is Fixed-parameter Tractable.

[BibT_eX]

[DOI]

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

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

[BibT_eX]

[DOI]

Wojciech Czerwinski

Yann Disser

Bartlomiej Wróblewski

Anna Zych-Pawlewicz

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

On (Coalitional) Exchange-Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Fractional Matchings under Preferences: Stability and Optimality.

[BibT_eX]

[DOI]

Sanjukta Roy

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.

[BibT_eX]

[DOI]

Iyad Kanj

Erik Jan van Leeuwen

SIAM J. Discret. Math., 2020

h-Index manipulation by undoing merges.

[BibT_eX]

[DOI]

Quant. Sci. Stud., 2020

Efficient algorithms for measuring the funnel-likeness of DAGs.

[BibT_eX]

[DOI]

Marcelo Garlet Millani

Hendrik Molter

J. Comb. Optim., 2020

A Double Exponential Lower Bound for the Distinct Vectors Problem.

[BibT_eX]

[DOI]

Marcin Pilipczuk

Discret. Math. Theor. Comput. Sci., 2020

On Dynamic Parameterized k-Path.

[BibT_eX]

[DOI]

Wojciech Czerwinski

Yann Disser

Bartlomiej Wróblewski

Anna Zych-Pawlewicz

CoRR, 2020

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2019

Assessing the computational complexity of multilayer subgraph detection.

[BibT_eX]

[DOI]

Robert Bredereck

Netw. Sci., 2019

The complexity of routing with collision avoidance.

[BibT_eX]

[DOI]

Till Fluschnik

Marco Morik

J. Comput. Syst. Sci., 2019

The parameterized complexity of the minimum shared edges problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Computational complexity aspects of point visibility graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard.

[BibT_eX]

[DOI]

Shaohua Li

Marcin Pilipczuk

CoRR, 2019

The Minimum Feasible Tileset Problem.

[BibT_eX]

[DOI]

Yann Disser

Stefan Kratsch

Algorithmica, 2019

Packing Directed Circuits Quarter-Integrally.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

On Computing Centroids According to the p-Norms of Hamming Distance Vectors.

[BibT_eX]

[DOI]

Danny Hermelin

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Matchings under Preferences: Strength of Stability and Trade-Offs.

[BibT_eX]

[DOI]

Piotr Skowron

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.

[BibT_eX]

[DOI]

Iyad A. Kanj

Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2018

A Note on Clustering Aggregation.

[BibT_eX]

[DOI]

Danny Hermelin

CoRR, 2018

Matching algorithms for assigning orthologs after genome duplication events.

[BibT_eX]

[DOI]

Guillaume Fertin

Falk Hüffner

Comput. Biol. Chem., 2018

The Parameterized Complexity of Centrality Improvement in Networks.

[BibT_eX]

[DOI]

Clemens Hoffmann

Hendrik Molter

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Cluster Editing in Multi-Layer and Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

How Hard Is It to Satisfy (Almost) All Roommates?.

[BibT_eX]

[DOI]

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

2017

Be sparse! Be dense! Be robust!: elements of parameterized algorithmics.

[BibT_eX]

[DOI]

PhD thesis, 2017

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2017

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.

[BibT_eX]

[DOI]

Networks, 2017

Algorithmic Aspects of Point Visibility Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

A Parameterized View on Multi-Layer Cluster Editing.

[BibT_eX]

[DOI]

CoRR, 2017

On Kernelization and Approximation for the Vector Connectivity Problem.

[BibT_eX]

[DOI]

Stefan Kratsch

Algorithmica, 2017

The Complexity of Routing with Few Collisions.

[BibT_eX]

[DOI]

Till Fluschnik

Marco Morik

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

[BibT_eX]

[DOI]

Robert Bredereck

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Exploiting hidden structure in selecting dimensions that distinguish vectors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

The Minimum Shared Edges Problem on Planar Graphs.

[BibT_eX]

[DOI]

Till Fluschnik

CoRR, 2016

H-index manipulation by merging articles: Models, theory, and experiments.

[BibT_eX]

[DOI]

Toby Walsh

Artif. Intell., 2016

Finding Secluded Places of Special Interest in Graphs.

[BibT_eX]

[DOI]

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

Twins in Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

Iyad A. Kanj

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Enumerating maximal cliques in temporal graphs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On the Parameterized Complexity of Computing Balanced Partitions in Graphs.

[BibT_eX]

[DOI]

Ondrej Suchý

Theory Comput. Syst., 2015

An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.

[BibT_eX]

[DOI]

Iyad A. Kanj

CoRR, 2015

Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.

[BibT_eX]

[DOI]

Kolja Stahl

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Finding Highly Connected Subgraphs.

[BibT_eX]

[DOI]

Falk Hüffner

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

Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

Constant-factor approximations for Capacitated Arc Routing without triangle inequality.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

On Google Scholar H-Index Manipulation by Merging Articles.

[BibT_eX]

[DOI]

Toby Walsh

CoRR, 2014

Exploiting a hypergraph model for finding Golomb rulers.

[BibT_eX]

[DOI]

Acta Informatica, 2014

2013

A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On the Parameterized Complexity of Computing Graph Bisections.

[BibT_eX]

[DOI]

Ondrej Suchý

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

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

A new view on Rural Postman based on Eulerian Extension and Matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Exact combinatorial algorithms and experiments for finding maximum k-plexes.

[BibT_eX]

[DOI]

Hannes Moser

J. Comb. Optim., 2012

Finding Dense Subgraphs of Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

On Making Directed Graphs Eulerian

[BibT_eX]

[DOI]

CoRR, 2011

From Few Components to an Eulerian Graph by Adding Arcs.

[BibT_eX]

[DOI]

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

2010

Algorithmic Aspects of Golomb Ruler Construction

[BibT_eX]

[DOI]

CoRR, 2010

2009

Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.

[BibT_eX]

[DOI]

Hannes Moser