| Publication | Date of Publication | Type |
|---|
| Space-efficient parameterized algorithms on graphs of low shrubdepth | 2025-01-06 | Paper |
| Treelike decompositions for transductions of sparse graphs | 2024-12-06 | Paper |
| Stable graphs of bounded twin-width | 2024-12-06 | Paper |
| Sparse induced subgraphs in \(P_6\)-free graphs | 2024-11-28 | Paper |
| Fully dynamic approximation schemes on planar and apex-minor-free graphs | 2024-11-28 | Paper |
| A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph | 2024-11-28 | Paper |
| Parameterized algorithms for block-structured integer programs with large entries | 2024-11-28 | Paper |
| Cliquewidth and dimension | 2024-11-28 | Paper |
| Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters | 2024-11-14 | Paper |
| Flipper games for monadically stable graph classes | 2024-11-14 | Paper |
| Canonical decompositions in monadically stable and bounded shrubdepth graph classes | 2024-11-14 | Paper |
| On rational recursive sequences | 2024-10-08 | Paper |
| Maintaining CMSO\(_2\) properties on dynamic structures with bounded feedback vertex number | 2024-10-08 | Paper |
| Dynamic data structures for parameterized string problems | 2024-10-08 | Paper |
| Transducing paths in graph classes with unbounded shrubdepth | 2024-10-07 | Paper |
| On polynomial recursive sequences | 2024-10-07 | Paper |
| Algorithms and data structures for first-order logic with connectivity under vertex failures | 2024-06-24 | Paper |
| Twin-width and types | 2024-06-24 | Paper |
| Simple and tight complexity lower bounds for solving Rabin games | 2024-05-29 | Paper |
| Detecting points in integer cones of polytopes is double-exponentially hard | 2024-05-29 | Paper |
| Quasi-polynomial-time algorithm for independent set in \(P_t\)-free graphs via shrinking the space of induced paths | 2024-05-14 | Paper |
| Compact representation for matrices of bounded twin-width | 2024-04-23 | Paper |
| Isolation schemes for problems on decomposable graphs | 2024-04-23 | Paper |
| Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs | 2024-02-28 | Paper |
| Bounding generalized coloring numbers of planar graphs using coin models | 2024-02-23 | Paper |
| On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph | 2024-02-23 | Paper |
| Dynamic data structures for timed automata acceptance | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147300 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147376 | 2024-01-15 | Paper |
| Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor | 2023-12-08 | Paper |
| First-Order Model Checking on Monadically Stable Graph Classes | 2023-11-30 | Paper |
| Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time | 2023-11-14 | Paper |
| Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs | 2023-10-31 | Paper |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 2023-10-31 | Paper |
| Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams | 2023-10-31 | Paper |
| Partitioning edges of a planar graph into linear forests and a matching | 2023-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6057540 | 2023-10-05 | Paper |
| Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity | 2023-09-20 | Paper |
| Cliquewidth and dimension | 2023-08-23 | Paper |
| Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space | 2023-08-10 | Paper |
| Prime and polynomial distances in colourings of the plane | 2023-08-04 | Paper |
| Sparse induced subgraphs in P_6-free graphs | 2023-07-14 | Paper |
| On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments | 2023-05-30 | Paper |
| Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded | 2023-05-02 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874504 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875557 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875390 | 2023-02-03 | Paper |
| Flipper games for monadically stable graph classes | 2023-01-31 | Paper |
| Simpler and faster algorithms for detours in planar digraphs | 2023-01-06 | Paper |
| Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space | 2022-12-21 | Paper |
| Tight complexity lower bounds for integer linear programming with few constraints | 2022-12-05 | Paper |
| On digraphs without onion star immersions | 2022-11-28 | Paper |
| Dynamic data structures for timed automata acceptance | 2022-10-27 | Paper |
| Highly unbreakable graph with a fixed excluded minor are almost rigid | 2022-10-26 | Paper |
| Computing Tree Decompositions | 2022-10-19 | Paper |
| On objects dual to tree-cut decompositions | 2022-09-23 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2022-09-21 | Paper |
| Progressive algorithms for domination and independence | 2022-07-18 | Paper |
| Tight complexity lower bounds for integer linear programming with few constraints | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089253 | 2022-07-18 | Paper |
| Twin-width and types | 2022-06-16 | Paper |
| Efficient approximation schemes for uniform-cost clustering problems in planar graphs | 2022-05-11 | Paper |
| On Geometric Set Cover for Orthants | 2022-05-11 | Paper |
| A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs | 2022-04-20 | Paper |
| Transducing paths in graph classes with unbounded shrubdepth | 2022-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028484 | 2022-02-09 | Paper |
| Randomized Contractions Meet Lean Decompositions | 2022-02-08 | Paper |
| Treelike decompositions for transductions of sparse graphs | 2022-01-26 | Paper |
| Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs | 2021-11-17 | Paper |
| Algorithms and data structures for first-order logic with connectivity under vertex failures | 2021-11-05 | Paper |
| Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes | 2021-11-04 | Paper |
| Jones' conjecture in subcubic graphs | 2021-10-26 | Paper |
| Polynomial bounds for centered colorings on proper minor-closed graph classes | 2021-09-16 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2021-08-04 | Paper |
| First-order interpretations of bounded expansion classes | 2021-07-28 | Paper |
| Subexponential-time algorithms for finding large induced sparse subgraphs | 2021-07-26 | Paper |
| Stable graphs of bounded twin-width | 2021-07-08 | Paper |
| Enumerating minimal dominating sets in \(K_t\)-free graphs and variants | 2021-05-03 | Paper |
| Lower bounds for the parameterized complexity of minimum fill-in and other completion problems | 2021-05-03 | Paper |
| Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs | 2021-04-14 | Paper |
| Erdös-Hajnal properties for powers of sparse graphs | 2021-03-30 | Paper |
| Definable decompositions for graphs of bounded linear cliquewidth | 2021-03-26 | Paper |
| On the maximum weight independent set problem in graphs without induced cycles of length at least five | 2021-03-12 | Paper |
| Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs | 2021-02-16 | Paper |
| Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes | 2021-02-15 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2021-02-02 | Paper |
| Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs | 2021-02-02 | Paper |
| On the number of types in sparse graphs | 2021-01-20 | Paper |
| Parameterized circuit complexity of model-checking on sparse structures | 2021-01-20 | Paper |
| Definable decompositions for graphs of bounded linear cliquewidth | 2021-01-20 | Paper |
| An exponential time parameterized algorithm for planar disjoint paths | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144662 | 2021-01-19 | Paper |
| Clustering powers of sparse graphs | 2020-11-05 | Paper |
| First-order interpretations of bounded expansion classes | 2020-09-11 | Paper |
| Model-checking on ordered structures | 2020-09-11 | Paper |
| Neighborhood complexity and kernelization for nowhere dense classes of graphs | 2020-05-27 | Paper |
| Tight lower bounds for the complexity of multicoloring | 2020-05-27 | Paper |
| Exploring the complexity of layout parameters in tournaments and semi-complete digraphs | 2020-05-27 | Paper |
| Linear kernels for edge deletion problems to immersion-closed graph classes | 2020-05-27 | Paper |
| Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking | 2020-05-26 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2020-04-14 | Paper |
| Integer programming and incidence treedepth | 2020-02-06 | Paper |
| Tight lower bounds for the complexity of multicoloring | 2019-12-16 | Paper |
| Hardness of approximation for strip packing | 2019-12-06 | Paper |
| On space efficiency of algorithms working on structural decompositions of graphs | 2019-12-06 | Paper |
| Hardness of approximation for \(H\)-free edge modification problems | 2019-12-06 | Paper |
| On low rank-width colorings | 2019-11-28 | Paper |
| Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs | 2019-10-15 | Paper |
| Polynomial bounds for centered colorings on proper minor-closed graph classes | 2019-10-15 | Paper |
| On width measures and topological problems on semi-complete digraphs | 2019-07-17 | Paper |
| Jungles, bundles, and fixed-parameter tractability | 2019-05-15 | Paper |
| Known algorithms for edge clique cover are probably optimal | 2019-05-15 | Paper |
| Minimum Bisection Is Fixed-Parameter Tractable | 2019-05-07 | Paper |
| Strong immersion is a well‐quasi‐ordering for semicomplete digraphs | 2019-04-25 | Paper |
| Network sparsification for Steiner problems on planar and bounded-genus graphs | 2019-03-28 | Paper |
| Shortest paths in one-counter systems | 2019-03-18 | Paper |
| Edge bipartization faster than \(2^k\) | 2019-03-11 | Paper |
| Planar Digraphs | 2019-03-04 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2019-02-14 | Paper |
| On directed feedback vertex set parameterized by treewidth | 2018-11-22 | Paper |
| Progressive Algorithms for Domination and Independence | 2018-11-16 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-11-13 | Paper |
| Subexponential parameterized algorithm for {\textsc{Interval Completion}} | 2018-11-13 | Paper |
| Exploring the complexity of layout parameters in tournaments and semicomplete digraphs | 2018-11-13 | Paper |
| A polynomial kernel for trivially perfect editing | 2018-10-18 | Paper |
| Below all subsets for minimal connected dominating set | 2018-09-26 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-07-16 | Paper |
| Subexponential parameterized algorithm for interval completion | 2018-07-16 | Paper |
| Lower bounds for the parameterized complexity of minimum fill-in and other completion problems | 2018-07-16 | Paper |
| Definability equals recognizability for graphs of bounded treewidth | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636613 | 2018-04-19 | Paper |
| Hardness of approximation for \(H\)-free edge modification problems | 2018-04-19 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2018-04-10 | Paper |
| Edge Bipartization Faster Than 2^k | 2018-04-10 | Paper |
| The generalised colouring numbers on classes of bounded expansion | 2018-03-21 | Paper |
| On space efficiency of algorithms working on structural decompositions of graphs | 2018-01-24 | Paper |
| On low rank-width colorings | 2018-01-04 | Paper |
| Lower bounds for approximation schemes for Closest String | 2017-10-17 | Paper |
| Linear kernels for outbranching problems in sparse digraphs | 2017-10-10 | Paper |
| The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn List partition problem | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363775 | 2017-09-29 | Paper |
| Hitting forbidden subgraphs in graphs of bounded treewidth | 2017-09-28 | Paper |
| Polynomial kernelization for removing induced claws and diamonds | 2017-08-15 | Paper |
| Scheduling partially ordered jobs faster than \(2^n\) | 2017-05-17 | Paper |
| Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth | 2017-03-10 | Paper |
| Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) | 2017-03-03 | Paper |
| Exploring subexponential parameterized complexity of completion problems | 2017-03-03 | Paper |
| Subexponential-time parameterized algorithm for Steiner tree on planar graphs | 2017-01-30 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
| Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings | 2017-01-30 | Paper |
| Exploring the subexponential complexity of completion problems | 2016-10-24 | Paper |
| Largest chordal and interval subgraphs faster than \(2^n\) | 2016-10-21 | Paper |
| Polynomial kernelization for removing induced claws and diamonds | 2016-10-21 | Paper |
| Designing FPT algorithms for cut problems using randomized contractions | 2016-08-16 | Paper |
| Shortest paths in one-counter systems | 2016-06-10 | Paper |
| On ultralimits of sparse graph classes | 2016-05-20 | Paper |
| A \(c^k n\) 5-approximation algorithm for treewidth | 2016-04-11 | Paper |
| On group feedback vertex set parameterized by the size of the cutset | 2016-03-29 | Paper |
| Known algorithms for edge clique cover are probably optimal | 2016-01-20 | Paper |
| How to hunt an invisible rabbit on a graph | 2015-12-11 | Paper |
| Fixed-parameter tractability of multicut in directed acyclic graphs | 2015-11-27 | Paper |
| Fast algorithms for parameterized problems with relaxed disjointness constraints | 2015-11-19 | Paper |
| Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams | 2015-11-19 | Paper |
| A polynomial kernel for trivially perfect editing | 2015-11-19 | Paper |
| A Subexponential Parameterized Algorithm for Proper Interval Completion | 2015-10-30 | Paper |
| On multiway cut parameterized above lower bounds | 2015-09-24 | Paper |
| Minimizing Rosenthal potential in multicast games | 2015-09-04 | Paper |
| Clique Cover and Graph Separation | 2015-09-03 | Paper |
| Computing tree-depth faster than \(2^n\) | 2015-09-03 | Paper |
| Parameterized algorithms | 2015-08-17 | Paper |
| Minimum bisection is fixed parameter tractable | 2015-06-26 | Paper |
| Sitting closer to friends than enemies, revisited | 2015-05-29 | Paper |
| Modifying a graph using vertex elimination | 2015-05-21 | Paper |
| Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) | 2015-01-19 | Paper |
| On cutwidth parameterized by vertex cover | 2014-12-02 | Paper |
| Hitting forbidden subgraphs in graphs of bounded treewidth | 2014-10-14 | Paper |
| A subexponential parameterized algorithm for proper interval completion | 2014-10-08 | Paper |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 2014-07-30 | Paper |
| Tight bounds for parameterized complexity of cluster editing with a small number of clusters | 2014-06-10 | Paper |
| On the hardness of losing width | 2014-03-25 | Paper |
| Parameterized complexity of Eulerian deletion problems | 2014-03-25 | Paper |
| Preprocessing subgraph and minor problems: when does a small vertex cover help? | 2013-12-13 | Paper |
| Computing Tree-Depth Faster Than 2 n | 2013-12-10 | Paper |
| On the inequality between radius and Randić index for graphs | 2013-10-30 | Paper |
| Largest Chordal and Interval Subgraphs Faster Than 2 n | 2013-09-17 | Paper |
| Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph | 2013-09-17 | Paper |
| Clique cover and graph separation: new incompressibility results | 2013-08-12 | Paper |
| Fixed-parameter tractability of multicut in directed acyclic graphs | 2013-08-12 | Paper |
| Subset feedback vertex set is fixed-parameter tractable | 2013-06-27 | Paper |
| The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable | 2013-04-15 | Paper |
| Relation between Randić index and average distance of trees | 2013-01-21 | Paper |
| Finding a maximum induced degenerate subgraph faster than \(2^{n}\) | 2013-01-07 | Paper |
| Preprocessing subgraph and minor problems: When does a small vertex cover help? | 2013-01-07 | Paper |
| A polynomial algorithm for 3-compatible coloring and the stubborn list partition problem (the stubborn problem is stubborn no more) | 2012-11-29 | Paper |
| An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion | 2012-11-21 | Paper |
| How to eliminate a graph | 2012-11-06 | Paper |
| On group feedback vertex set parameterized by the size of the cutset | 2012-11-06 | Paper |
| Minimizing Rosenthal potential in multicast games | 2012-11-01 | Paper |
| Kernelization hardness of connectivity problems in \(d\)-degenerate graphs | 2012-10-26 | Paper |
| Some results on Vizing's conjecture and related problems | 2012-10-19 | Paper |
| Sitting closer to friends than enemies, revisited | 2012-09-25 | Paper |
| Solving the 2-disjoint connected subgraphs problem faster than \(2^{n }\) | 2012-06-29 | Paper |
| On cutwidth parameterized by vertex cover | 2012-06-15 | Paper |
| On the hardness of losing width | 2012-06-15 | Paper |
| On multiway cut parameterized above lower bounds | 2012-06-15 | Paper |
| Parameterized complexity of Eulerian deletion problems | 2011-12-16 | Paper |
| Dominating set is fixed parameter tractable in claw-free graphs | 2011-12-07 | Paper |
| Scheduling partially ordered jobs faster than \(2^{n }\) | 2011-09-16 | Paper |
| Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach | 2011-08-17 | Paper |
| Subset feedback vertex set is fixed-parameter tractable | 2011-07-06 | Paper |
| An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion | 2010-12-07 | Paper |
| Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs | 2010-11-16 | Paper |
| Elementary first-order model checking for sparse graphs | N/A | Paper |
| Minor Containment and Disjoint Paths in almost-linear time | N/A | Paper |
