| 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 | 2024-09-16 | Paper |
| Faster parameterized algorithms for modification problems to minor-closed classes | 2024-09-10 | Paper |
| Redicolouring digraphs: directed treewidth and cycle-degeneracy | 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 | 2024-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6152160 | 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 | 2023-11-15 | Paper |
| k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms | 2023-10-31 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm | 2023-08-10 | Paper |
| Target set selection with maximum activation time | 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 | 2023-06-12 | Paper |
| \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions | 2023-05-02 | Paper |
| Parameterized complexity of computing maximum minimal blocking and hitting sets | 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 | 2022-12-21 | Paper |
| Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel | 2022-11-15 | Paper |
| Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds | 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5089236 | 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 | 2021-12-01 | Paper |
| Hitting forbidden induced subgraphs on bounded treewidth graphs | 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 | 2021-07-26 | Paper |
| Reducing graph transversals via edge contractions | 2021-06-30 | Paper |
| Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization | 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 | 2021-02-02 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds | 2020-10-28 | Paper |
| Maximum cuts in edge-colored graphs | 2020-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111863 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111862 | 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 | 2020-04-17 | Paper |
| Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms | 2020-03-12 | Paper |
| Hitting minors on bounded treewidth graphs. III. Lower bounds | 2020-02-24 | Paper |
| A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps | 2019-09-30 | Paper |
| How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? | 2019-09-10 | Paper |
| Approximating maximum uniquely restricted matchings in bipartite graphs | 2019-09-05 | Paper |
| Upper bounds on the uniquely restricted chromatic index | 2019-08-15 | Paper |
| Counting Gallai 3-colorings of complete graphs | 2019-07-18 | Paper |
| Explicit linear kernels for packing problems | 2019-04-25 | Paper |
| Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem | 2019-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560237 | 2018-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4558957 | 2018-11-30 | Paper |
| Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions | 2018-10-30 | Paper |
| On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph | 2018-09-27 | Paper |
| A Tight Erdös--Pósa Function for Wheel Minors | 2018-09-14 | Paper |
| Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem | 2018-06-15 | Paper |
| An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) | 2018-05-23 | Paper |
| On the number of labeled graphs of bounded treewidth | 2018-05-18 | Paper |
| Ruling out FPT algorithms for weighted coloring on forests | 2018-05-17 | Paper |
| Ruling out FPT algorithms for weighted coloring on forests | 2018-04-09 | Paper |
| Maximum cuts in edge-colored graphs | 2018-04-09 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2018-02-28 | Paper |
| Uniquely restricted matchings and edge colorings | 2018-01-04 | Paper |
| On the number of labeled graphs of bounded treewidth | 2018-01-04 | Paper |
| Improved FPT algorithms for weighted independent set in bull-free graphs | 2017-12-20 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2017-10-20 | Paper |
| Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} | 2017-10-12 | Paper |
| Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism | 2017-09-29 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2017-09-07 | Paper |
| Minors in graphs of large \(\theta_r\)-girth | 2017-08-31 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2017-08-24 | Paper |
| Parameterized algorithms for min-max multiway cut and list digraph homomorphism | 2017-05-26 | Paper |
| A linear kernel for planar red-blue dominating set | 2017-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965494 | 2017-03-03 | Paper |
| On the parameterized complexity of the edge monitoring problem | 2017-02-21 | Paper |
| On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs | 2017-02-01 | Paper |
| On the complexity of computing the \(k\)-restricted edge-connectivity of a graph | 2017-01-09 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2016-12-22 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2016-11-09 | Paper |
| On the Complexity of Computing the k-restricted Edge-connectivity of a Graph | 2016-10-21 | Paper |
| An edge variant of the Erdős-Pósa property | 2016-05-18 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2016-02-26 | Paper |
| An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r | 2016-02-26 | Paper |
| Explicit Linear Kernels via Dynamic Programming | 2015-10-21 | Paper |
| A Polynomial-Time Algorithm for Outerplanar Diameter Improvement | 2015-10-20 | Paper |
| Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs | 2015-09-15 | Paper |
| The role of planarity in connectivity problems parameterized by treewidth | 2015-09-15 | Paper |
| Dynamic programming for graphs on surfaces | 2015-08-14 | Paper |
| The role of planarity in connectivity problems parameterized by treewidth | 2015-01-30 | Paper |
| Hitting and Harvesting Pumpkins | 2014-12-22 | Paper |
| On approximating the \(d\)-girth of a graph | 2014-04-10 | Paper |
| Parameterized domination in circle graphs | 2014-03-25 | Paper |
| Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions | 2013-08-06 | Paper |
| Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs | 2013-07-04 | Paper |
| Asymptotic enumeration of non-crossing partitions on surfaces | 2013-03-04 | Paper |
| Fast minor testing in planar graphs | 2012-11-21 | Paper |
| Parameterized Domination in Circle Graphs | 2012-11-06 | Paper |
| Dynamic Programming for H-minor-free Graphs | 2012-09-25 | Paper |
| On the approximability of some degree-constrained subgraph problems | 2012-08-14 | Paper |
| GMPLS label space minimization through hypergraph layouts | 2012-08-10 | Paper |
| Parameterized complexity of finding small degree-constrained subgraphs | 2012-05-11 | Paper |
| On self-duality of branchwidth in graphs of bounded genus | 2012-04-30 | Paper |
| Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs | 2012-03-15 | Paper |
| The Recognition of Tolerance and Bounded Tolerance Graphs | 2012-02-11 | Paper |
| The recognition of tolerance and bounded tolerance graphs. | 2012-01-23 | Paper |
| Traffic grooming in bidirectional WDM ring networks | 2012-01-18 | Paper |
| Simpler multicoloring of triangle-free hexagonal graphs | 2012-01-11 | Paper |
| Faster parameterized algorithms for minor containment | 2011-12-07 | Paper |
| Hitting and Harvesting Pumpkins | 2011-09-16 | Paper |
| Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4 | 2011-04-15 | Paper |
| On Approximating the d-Girth of a Graph | 2011-02-15 | Paper |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-12-03 | Paper |
| Dynamic Programming for Graphs on Surfaces | 2010-09-07 | Paper |
| Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests | 2010-09-07 | Paper |
| Fast Minor Testing in Planar Graphs | 2010-09-06 | Paper |
| Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs | 2010-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575430 | 2010-07-27 | Paper |
| Faster Parameterized Algorithms for Minor Containment | 2010-06-22 | Paper |
| Traffic Grooming in Star Networks via Matching Techniques | 2010-06-17 | Paper |
| Designing Hypergraph Layouts to GMPLS Routing Strategies | 2010-02-24 | Paper |
| Traffic Grooming: Combinatorial Results and Practical Resolutions | 2010-02-09 | Paper |
| Permutation Routing and (ℓ, k)-Routing on Plane Grids | 2010-02-09 | Paper |
| Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph | 2010-01-21 | Paper |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs | 2010-01-21 | Paper |
| Edge-Simple Circuits through 10 Ordered Vertices in Square Grids | 2009-12-11 | Paper |
| Hardness and approximation of traffic grooming | 2009-09-10 | Paper |
| Degree-Constrained Subgraph Problems: Hardness and Approximation Results | 2009-02-12 | Paper |
| Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph | 2009-01-20 | Paper |
| Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem | 2008-06-05 | Paper |
| Hardness and Approximation of Traffic Grooming | 2008-05-27 | Paper |
| Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations | N/A | Paper |
