| Publication | Date of Publication | Type |
|---|
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2025-01-06 | Paper |
| Compound logics for modification problems | 2024-11-14 | Paper |
| Faster parameterized algorithms for modification problems to minor-closed classes | 2024-11-14 | Paper |
A more accurate view of the flat wall theorem
Journal of Graph Theory | 2024-09-16 | Paper |
Faster parameterized algorithms for modification problems to minor-closed classes
TheoretiCS | 2024-09-10 | Paper |
Redicolouring digraphs: directed treewidth and cycle-degeneracy
Discrete Applied Mathematics | 2024-08-09 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs
Discrete Applied Mathematics | 2024-02-14 | Paper |
| A new framework for kernelization lower bounds: the case of maximum minimal vertex cover | 2024-02-12 | Paper |
| On the Complexity of the Median and Closest Permutation Problems | 2023-11-28 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
SIAM Journal on Computing | 2023-08-10 | Paper |
Target set selection with maximum activation time
Discrete Applied Mathematics | 2023-08-02 | Paper |
| Redicolouring digraphs: directed treewidth and cycle-degeneracy | 2023-07-13 | Paper |
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2023-06-28 | Paper |
Reducing the vertex cover number via edge contractions
Journal of Computer and System Sciences | 2023-06-12 | Paper |
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Parameterized complexity of computing maximum minimal blocking and hitting sets
Algorithmica | 2023-02-16 | Paper |
| Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization | 2023-02-03 | Paper |
On the complexity of finding large odd induced subgraphs and odd colorings
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
Algorithmica | 2022-10-27 | Paper |
| Faster parameterized algorithms for modification problems to minor-closed classes | 2022-10-05 | Paper |
Adapting the directed grid theorem into an FPT algorithm
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
| A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. | 2022-07-18 | Paper |
| Hitting forbidden induced subgraphs on bounded treewidth graphs | 2022-07-18 | Paper |
| Reducing graph transversals via edge contractions | 2022-07-18 | Paper |
| Adapting the directed grid theorem into an \textsf{FPT} algorithm | 2022-04-27 | Paper |
A relaxation of the directed disjoint paths problem: a global congestion metric helps
Theoretical Computer Science | 2021-12-01 | Paper |
A relaxation of the directed disjoint paths problem: a global congestion metric helps
Theoretical Computer Science | 2021-12-01 | Paper |
Hitting forbidden induced subgraphs on bounded treewidth graphs
Information and Computation | 2021-11-25 | Paper |
Hitting forbidden induced subgraphs on bounded treewidth graphs
Information and Computation | 2021-11-25 | Paper |
| Compound Logics for Modification Problems | 2021-11-04 | Paper |
| A complexity dichotomy for hitting small planar minors parameterized by treewidth | 2021-08-04 | Paper |
On the complexity of finding large odd induced subgraphs and odd colorings
Algorithmica | 2021-07-26 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Reducing graph transversals via edge contractions
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
Algorithmica | 2021-06-11 | Paper |
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
Algorithmica | 2021-06-11 | Paper |
| A more accurate view of the Flat Wall Theorem | 2021-02-12 | Paper |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hitting minors on bounded treewidth graphs. I: General upper bounds
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Maximum cuts in edge-colored graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
| Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth | 2020-05-27 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
(available as arXiv preprint) | 2020-05-27 | Paper |
| How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? | 2020-05-27 | Paper |
Hitting forbidden induced subgraphs on bounded treewidth graphs
(available as arXiv preprint) | 2020-04-17 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Algorithmica | 2020-04-14 | Paper |
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Theoretical Computer Science | 2020-03-12 | Paper |
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Theoretical Computer Science | 2020-03-12 | Paper |
Hitting minors on bounded treewidth graphs. III. Lower bounds
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Hitting minors on bounded treewidth graphs. III. Lower bounds
Journal of Computer and System Sciences | 2020-02-24 | Paper |
On the complexity of finding internally vertex-disjoint long directed paths
Lecture Notes in Computer Science | 2020-02-12 | Paper |
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
(available as arXiv preprint) | 2019-09-30 | Paper |
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
Algorithmica | 2019-09-10 | Paper |
Approximating maximum uniquely restricted matchings in bipartite graphs
Discrete Applied Mathematics | 2019-09-05 | Paper |
Upper bounds on the uniquely restricted chromatic index
Journal of Graph Theory | 2019-08-15 | Paper |
Counting Gallai 3-colorings of complete graphs
Discrete Mathematics | 2019-07-18 | Paper |
Explicit linear kernels for packing problems
Algorithmica | 2019-04-25 | Paper |
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
A linear kernel for planar total dominating set
(available as arXiv preprint) | 2018-12-10 | Paper |
| A linear kernel for planar total dominating set | 2018-12-10 | Paper |
scientific article; zbMATH DE number 6987353 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-30 | Paper |
| scientific article; zbMATH DE number 6987353 (Why is no real title available?) | 2018-11-30 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Theoretical Computer Science | 2018-09-27 | Paper |
A tight Erdős-Pósa function for wheel minors
SIAM Journal on Discrete Mathematics | 2018-09-14 | Paper |
Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
(available as arXiv preprint) | 2018-06-15 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
Algorithmica | 2018-05-23 | Paper |
On the number of labeled graphs of bounded treewidth
European Journal of Combinatorics | 2018-05-18 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Theoretical Computer Science | 2018-05-17 | Paper |
Ruling out FPT algorithms for weighted coloring on forests
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Maximum cuts in edge-colored graphs
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
An FPT 2-approximation for tree-cut decomposition
Algorithmica | 2018-02-28 | Paper |
On the number of labeled graphs of bounded treewidth
Lecture Notes in Computer Science | 2018-01-04 | Paper |
Uniquely restricted matchings and edge colorings
(available as arXiv preprint) | 2018-01-04 | Paper |
Improved FPT algorithms for weighted independent set in bull-free graphs
Discrete Mathematics | 2017-12-20 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Bulletin of Mathematical Biology | 2017-10-20 | Paper |
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
Theory of Computing Systems | 2017-10-12 | Paper |
Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism
(available as arXiv preprint) | 2017-09-29 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Minors in graphs of large \(\theta_r\)-girth
European Journal of Combinatorics | 2017-08-31 | Paper |
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
Theoretical Computer Science | 2017-08-24 | Paper |
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
Journal of Computer and System Sciences | 2017-05-26 | Paper |
A linear kernel for planar red-blue dominating set
Discrete Applied Mathematics | 2017-03-15 | Paper |
| Explicit linear kernels via dynamic programming | 2017-03-03 | Paper |
On the parameterized complexity of the edge monitoring problem
Information Processing Letters | 2017-02-21 | Paper |
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
Theoretical Computer Science | 2017-01-09 | Paper |
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Lecture Notes in Computer Science | 2016-11-09 | Paper |
On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
An edge variant of the Erdős-Pósa property
Discrete Mathematics | 2016-05-18 | Paper |
An FPT 2-approximation for tree-cut decomposition
Lecture Notes in Computer Science | 2016-02-26 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\)
Approximation and Online Algorithms | 2016-02-26 | Paper |
Explicit linear kernels via dynamic programming
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
Explicit linear kernels via dynamic programming
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Lecture Notes in Computer Science | 2015-10-20 | Paper |
The role of planarity in connectivity problems parameterized by treewidth
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
Parameterized and Exact Computation | 2015-09-15 | Paper |
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms | 2015-08-14 | Paper |
The role of planarity in connectivity problems parameterized by treewidth
Theoretical Computer Science | 2015-01-30 | Paper |
Hitting and harvesting pumpkins
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
On approximating the \(d\)-girth of a graph
Discrete Applied Mathematics | 2014-04-10 | Paper |
Parameterized domination in circle graphs
Theory of Computing Systems | 2014-03-25 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Asymptotic enumeration of non-crossing partitions on surfaces
Discrete Mathematics | 2013-03-04 | Paper |
Fast minor testing in planar graphs
Algorithmica | 2012-11-21 | Paper |
Parameterized Domination in Circle Graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Parameterized Domination in Circle Graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Dynamic Programming for H-minor-free Graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics | 2012-08-14 | Paper |
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science | 2012-08-10 | Paper |
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On self-duality of branchwidth in graphs of bounded genus
Discrete Applied Mathematics | 2012-04-30 | Paper |
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
The recognition of tolerance and bounded tolerance graphs
SIAM Journal on Computing | 2012-02-11 | Paper |
| The recognition of tolerance and bounded tolerance graphs | 2012-01-23 | Paper |
Traffic grooming in bidirectional WDM ring networks
Networks | 2012-01-18 | Paper |
Simpler multicoloring of triangle-free hexagonal graphs
Discrete Mathematics | 2012-01-11 | Paper |
Faster parameterized algorithms for minor containment
Theoretical Computer Science | 2011-12-07 | Paper |
Hitting and harvesting pumpkins
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Drop cost and wavelength optimal two-period grooming with ratio 4
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
On Approximating the d-Girth of a Graph
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
A new intersection model and improved algorithms for tolerance graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Dynamic programming for graphs on surfaces
Automata, Languages and Programming | 2010-09-07 | Paper |
Dynamic programming for graphs on surfaces
Automata, Languages and Programming | 2010-09-07 | Paper |
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
Automata, Languages and Programming | 2010-09-07 | Paper |
Fast minor testing in planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms | 2010-08-18 | Paper |
| An optimal permutation routing algorithm on full-duplex hexagonal networks | 2010-07-27 | Paper |
Faster parameterized algorithms for minor containment
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Traffic Grooming in Star Networks via Matching Techniques
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Designing hypergraph layouts to GMPLS routing strategies
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Traffic Grooming: Combinatorial Results and Practical Resolutions
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Permutation routing and \((\ell , k)\)-routing on plane grids
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Graph partitioning and traffic grooming with bounded degree request graph
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
A new intersection model and improved algorithms for tolerance graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Edge-simple circuits through 10 ordered vertices in square grids
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Hardness and approximation of traffic grooming
Theoretical Computer Science | 2009-09-10 | Paper |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms | 2009-02-12 | Paper |
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
Parameterized and Exact Computation | 2008-06-05 | Paper |
Hardness and Approximation of Traffic Grooming
Algorithms and Computation | 2008-05-27 | Paper |
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
(available as arXiv preprint) | N/A | Paper |
