2025
The complexity of cluster vertex splitting and company.
Discret. Appl. Math., 2025
2024
Cluster Editing for Multi-Layer and Temporal Graphs.
Theory Comput. Syst., October, 2024
Cluster Editing Parameterized above Modification-disjoint <i>P</i><sub>3</sub>-packings.
ACM Trans. Algorithms, January, 2024
A note on clustering aggregation for binary clusterings.
Oper. Res. Lett., 2024
The role of twins in computing planar supports of hypergraphs.
J. Graph Algorithms Appl., 2024
Witty: An Efficient Solver for Computing Minimum-Size Decision Trees.
CoRR, 2024
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
2023
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
Algorithmica, May, 2023
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
On Computing Optimal Tree Ensembles.
Proceedings of the International Conference on Machine Learning, 2023
The Influence of Dimensions on the Complexity of Computing Decision Trees.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
Game Implementation: What Are the Obstructions?
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Packing Directed Cycles Quarter- and Half-Integrally.
Comb., December, 2022
Constant Congestion Brambles in Directed Graphs.
SIAM J. Discret. Math., 2022
Threshold Treewidth and Hypertree Width.
J. Artif. Intell. Res., 2022
Constant Congestion Brambles.
Discret. Math. Theor. Comput. Sci., 2022
Planarizing Graphs and Their Drawings by Vertex Splitting.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
Turbocharging Heuristics for Weak Coloring Numbers.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
Matchings under Preferences: Strength of Stability and Tradeoffs.
ACM Trans. Economics and Comput., 2021
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.
J. Comput. Syst. Sci., 2021
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Optimal Discretization is Fixed-parameter Tractable.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
,
,
,
,
,
,
,
,
,
,
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
On (Coalitional) Exchange-Stable Matching.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021
Fractional Matchings under Preferences: Stability and Optimality.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
2020
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
SIAM J. Discret. Math., 2020
h-Index manipulation by undoing merges.
Quant. Sci. Stud., 2020
Efficient algorithms for measuring the funnel-likeness of DAGs.
J. Comb. Optim., 2020
A Double Exponential Lower Bound for the Distinct Vectors Problem.
Discret. Math. Theor. Comput. Sci., 2020
On Dynamic Parameterized k-Path.
,
,
,
,
,
,
,
,
,
,
CoRR, 2020
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
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.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2019
Assessing the computational complexity of multilayer subgraph detection.
Netw. Sci., 2019
The complexity of routing with collision avoidance.
J. Comput. Syst. Sci., 2019
The parameterized complexity of the minimum shared edges problem.
J. Comput. Syst. Sci., 2019
Computational complexity aspects of point visibility graphs.
Discret. Appl. Math., 2019
Cluster Editing parameterized above the size of a modification-disjoint P<sub>3</sub> packing is para-NP-hard.
CoRR, 2019
The Minimum Feasible Tileset Problem.
Algorithmica, 2019
Packing Directed Circuits Quarter-Integrally.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
On Computing Centroids According to the p-Norms of Hamming Distance Vectors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Matchings under Preferences: Strength of Stability and Trade-Offs.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
2018
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
J. Comput. Syst. Sci., 2018
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discret. Optim., 2018
A Note on Clustering Aggregation.
CoRR, 2018
Matching algorithms for assigning orthologs after genome duplication events.
Comput. Biol. Chem., 2018
The Parameterized Complexity of Centrality Improvement in Networks.
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
How Hard Is It to Satisfy (Almost) All Roommates?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Be sparse! Be dense! Be robust!: elements of parameterized algorithmics.
PhD thesis, 2017
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
Soc. Netw. Anal. Min., 2017
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.
Networks, 2017
Algorithmic Aspects of Point Visibility Graphs.
CoRR, 2017
A Parameterized View on Multi-Layer Cluster Editing.
CoRR, 2017
On Kernelization and Approximation for the Vector Connectivity Problem.
Algorithmica, 2017
The Complexity of Routing with Few Collisions.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
Assessing the Computational Complexity of Multi-layer Subgraph Detection.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Exploiting hidden structure in selecting dimensions that distinguish vectors.
J. Comput. Syst. Sci., 2016
The Minimum Shared Edges Problem on Planar Graphs.
CoRR, 2016
H-index manipulation by merging articles: Models, theory, and experiments.
Artif. Intell., 2016
Finding Secluded Places of Special Interest in Graphs.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Twins in Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
Enumerating maximal cliques in temporal graphs.
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.
SIAM J. Discret. Math., 2015
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
Theory Comput. Syst., 2015
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems.
Discret. Appl. Math., 2015
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
CoRR, 2015
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
Finding Highly Connected Subgraphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015
2014
Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
Oper. Res. Lett., 2014
On Google Scholar H-Index Manipulation by Merging Articles.
CoRR, 2014
Exploiting a hypergraph model for finding Golomb rulers.
Acta Informatica, 2014
2013
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs.
CoRR, 2013
On the Parameterized Complexity of Computing Graph Bisections.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2012
A new view on Rural Postman based on Eulerian Extension and Matching.
J. Discrete Algorithms, 2012
Exact combinatorial algorithms and experiments for finding maximum k-plexes.
J. Comb. Optim., 2012
Finding Dense Subgraphs of Sparse Graphs.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
2011
On Making Directed Graphs Eulerian
CoRR, 2011
From Few Components to an Eulerian Graph by Adding Arcs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
2010
Algorithmic Aspects of Golomb Ruler Construction
CoRR, 2010
2009
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009