| Publication | Date of Publication | Type |
|---|
| On the complexity of establishing hereditary graph properties via vertex splitting | 2026-06-08 | Paper |
| Cluster editing parameterized above modification-disjoint P₃-Packings | 2026-04-21 | Paper |
| Turbocharging heuristics for weak coloring numbers | 2025-06-19 | Paper |
Packing directed cycles quarter- and half-integrally
Combinatorica | 2025-06-19 | Paper |
The influence of dimensions on the complexity of computing decision trees
Artificial Intelligence | 2025-05-30 | Paper |
Planarizing graphs and their drawings by vertex splitting
Journal of Computational Geometry | 2025-05-22 | Paper |
Cluster editing parameterized above modification-disjoint P₃-packings
ACM Transactions on Algorithms | 2025-02-21 | Paper |
The complexity of cluster vertex splitting and company
Discrete Applied Mathematics | 2025-02-19 | Paper |
Cluster editing for multi-layer and temporal graphs
Theory of Computing Systems | 2024-11-12 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
A note on clustering aggregation for binary clusterings
Operations Research Letters | 2024-06-17 | Paper |
| Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788388 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788441 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7765417 (Why is no real title available?) | 2023-11-14 | Paper |
| The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. | 2023-11-13 | Paper |
Planarizing graphs and their drawings by vertex splitting
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Constant Congestion Brambles
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
Algorithmica | 2023-04-28 | Paper |
Threshold Treewidth and Hypertree Width
Journal of Artificial Intelligence Research | 2022-08-30 | Paper |
Cluster Editing in Multi-Layer and Temporal Graphs.
(available as arXiv preprint) | 2022-07-21 | Paper |
On (coalitional) exchange-stable matching
(available as arXiv preprint) | 2022-06-01 | Paper |
scientific article; zbMATH DE number 7525509 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
scientific article; zbMATH DE number 7525465 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
Constant congestion brambles in directed graphs
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
scientific article; zbMATH DE number 7378721 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
How hard is it to satisfy (almost) all roommates?
(available as arXiv preprint) | 2021-07-28 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Journal of Computer and System Sciences | 2021-06-30 | Paper |
A double exponential lower bound for the distinct vectors problem
(available as arXiv preprint) | 2021-01-05 | Paper |
| A double exponential lower bound for the distinct vectors problem | 2021-01-05 | Paper |
The parameterized complexity of centrality improvement in networks
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Solving partition problems almost always requires pushing many vertices around
SIAM Journal on Discrete Mathematics | 2020-03-11 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
| Approximation algorithms for mixed, windy, and capacitated arc routing problems | 2019-10-24 | Paper |
The parameterized complexity of the minimum shared edges problem
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Packing Directed Cycles Quarter- and Half-Integrally
(available as arXiv preprint) | 2019-07-04 | Paper |
The complexity of routing with collision avoidance
Journal of Computer and System Sciences | 2019-05-03 | Paper |
The minimum feasible tileset problem
Algorithmica | 2019-03-11 | Paper |
Computational complexity aspects of point visibility graphs
Discrete Applied Mathematics | 2019-02-08 | Paper |
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Discrete Optimization | 2019-01-14 | Paper |
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Discrete Optimization | 2019-01-14 | Paper |
Constant-factor approximations for capacitated arc routing without triangle inequality
Operations Research Letters | 2018-09-28 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs
Lecture Notes in Computer Science | 2018-08-17 | Paper |
h-Index Manipulation by Undoing Merges
(available as arXiv preprint) | 2018-07-12 | Paper |
| Finding secluded places of special interest in graphs | 2018-04-10 | Paper |
The complexity of routing with few collisions
(available as arXiv preprint) | 2017-11-22 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
| Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs | 2017-10-17 | Paper |
On kernelization and approximation for the vector connectivity problem
Algorithmica | 2017-10-10 | Paper |
On kernelization and approximation for the vector connectivity problem
Algorithmica | 2017-10-10 | Paper |
| On kernelization and approximation for the vector connectivity problem | 2017-09-29 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
The parameterized complexity of the minimum shared edges problem
(available as arXiv preprint) | 2017-07-13 | Paper |
| The complexity of arc routing problems | 2017-07-11 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
Artificial Intelligence | 2016-10-21 | Paper |
Exploiting hidden structure in selecting dimensions that distinguish vectors
Journal of Computer and System Sciences | 2015-12-30 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
The minimum feasible tileset problem
Lecture Notes in Computer Science | 2015-11-20 | Paper |
On the parameterized complexity of computing balanced partitions in graphs
Theory of Computing Systems | 2015-09-04 | Paper |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
Discrete Applied Mathematics | 2015-07-24 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments | 2015-06-18 | Paper |
Finding highly connected subgraphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Exploiting a hypergraph model for finding Golomb rulers
Acta Informatica | 2014-11-14 | Paper |
Effective and efficient data reduction for the subset interconnection design problem
Algorithms and Computation | 2014-01-14 | Paper |
On the parameterized complexity of computing graph bisections
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
A parameterized complexity analysis of combinatorial feature selection problems
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs | 2013-06-27 | Paper |
A new view on rural postman based on Eulerian extension and matching
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Finding dense subgraphs of sparse graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Exploiting a Hypergraph Model for Finding Golomb Rulers
Lecture Notes in Computer Science | 2012-11-02 | Paper |
A new view on rural postman based on Eulerian extension and matching
Lecture Notes in Computer Science | 2012-01-13 | Paper |
From few components to an Eulerian graph by adding ARCS
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
