| Publication | Date of Publication | Type |
|---|
Cluster editing for multi-layer and temporal graphs
Theory of Computing Systems | 2024-11-12 | Paper |
| On kernels for \(d\)-path vertex cover | 2024-08-06 | Paper |
On kernels for \(d\)-path vertex cover
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| Generating Faster Algorithms for d-Path Vertex Cover | 2024-05-03 | Paper |
Maximizing Social Welfare in Score-Based Social Distance Games
Electronic Proceedings in Theoretical Computer Science | 2024-02-28 | Paper |
Hedonic diversity games: a complexity picture with more than two colors
Artificial Intelligence | 2023-12-14 | Paper |
Minimum eccentricity shortest path problem with respect to structural parameters
Algorithmica | 2023-03-09 | Paper |
Constant factor approximation for tracking paths and fault tolerant feedback vertex set
Discrete Optimization | 2023-03-03 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
Polynomial kernels for tracking shortest paths
Information Processing Letters | 2022-10-28 | Paper |
Constant factor approximation for tracking paths and fault tolerant feedback vertex set
Approximation and Online Algorithms | 2022-10-19 | Paper |
Cluster Editing in Multi-Layer and Temporal Graphs.
(available as arXiv preprint) | 2022-07-21 | Paper |
Faster FPT algorithm for 5-path vertex cover
(available as arXiv preprint) | 2022-07-21 | Paper |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
(available as arXiv preprint) | 2022-07-18 | Paper |
| On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations | 2022-07-03 | Paper |
Minimum eccentricity shortest path problem with respect to structural parameters
Lecture Notes in Computer Science | 2022-03-22 | Paper |
A parameterized complexity view on collapsing \(k\)-cores
Theory of Computing Systems | 2021-12-18 | Paper |
Waypoint routing on bounded treewidth graphs
Information Processing Letters | 2021-10-19 | Paper |
A parameterized complexity view on collapsing \(k\)-cores
(available as arXiv preprint) | 2021-08-04 | Paper |
A tight lower bound for planar Steiner orientation
Algorithmica | 2019-06-27 | Paper |
A simple streaming bit-parallel algorithm for swap pattern matching
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | 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 |
| Finding secluded places of special interest in graphs | 2018-04-10 | Paper |
Extending the kernel for planar Steiner tree to the number of Steiner vertices
Algorithmica | 2017-10-10 | Paper |
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Journal of Scheduling | 2017-09-01 | Paper |
Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation)
(available as arXiv preprint) | 2017-04-25 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2017-01-26 | Paper |
On directed Steiner trees with multiple roots
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
On the parameterized complexity of computing balanced partitions in graphs
Theory of Computing Systems | 2015-09-04 | Paper |
A refined complexity analysis of degree anonymization in graphs
Information and Computation | 2015-06-09 | Paper |
On structural parameterizations for the 2-club problem
Discrete Applied Mathematics | 2015-04-28 | Paper |
On explaining integer vectors by few homogeneous segments
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Solving multicut faster than \(2^{n }\)
Algorithms - ESA 2014 | 2014-10-08 | Paper |
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
Journal of Computer and System Sciences | 2014-06-10 | Paper |
| Parameterized problems related to Seidel's switching | 2014-03-25 | 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 |
An FPT algorithm for Tree Deletion Set
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithmica | 2013-11-11 | Paper |
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
On explaining integer vectors by few homogenous segments
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A refined complexity analysis of degree anonymization in graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
An FPT algorithm for tree deletion set
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics | 2013-01-24 | Paper |
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics | 2012-05-11 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithms and Computation | 2011-12-16 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Clustered planarity: small clusters in cycles and Eulerian graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Parameterized Complexity of Generalized Domination Problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
What makes equitable connected partition easy
Parameterized and Exact Computation | 2010-01-14 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
Algorithms and Computation | 2009-12-17 | Paper |
Clustered Planarity: Clusters with Few Outgoing Edges
Graph Drawing | 2009-03-03 | Paper |
Clustered Planarity: Small Clusters in Eulerian Graphs
Graph Drawing | 2008-03-25 | Paper |
