| Publication | Date of Publication | Type |
|---|
| Maximum independent set when excluding an induced minor: \(K_1+tK_2\) and \(tC_3\uplus C_4\) | 2025-01-06 | Paper |
| Model checking on interpretations of classes of bounded local cliquewidth | 2024-12-06 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-28 | Paper |
| Factoring pattern-free permutations into separable ones | 2024-11-28 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-01 | Paper |
| Twin-width. III: Max independent set, min dominating set, and coloring | 2024-11-01 | Paper |
| Approximating highly inapproximable problems on graphs of bounded twin-width | 2024-10-08 | Paper |
| Twin-width V: linear minors, modular counting, and matrix multiplication | 2024-10-08 | Paper |
| Twin-width and permutations | 2024-09-04 | Paper |
| Cutting Barnette graphs perfectly is hard | 2024-08-20 | Paper |
| Twin-width. VI: The lens of contraction sequences | 2024-07-19 | Paper |
| Deciding twin-width at most 4 is NP-complete | 2024-06-24 | Paper |
| Sparse graphs with bounded induced cycle packing number have logarithmic treewidth | 2024-05-14 | Paper |
| Sparse graphs with bounded induced cycle packing number have logarithmic treewidth | 2024-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192478 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147374 | 2024-01-15 | Paper |
| Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor | 2023-12-13 | Paper |
| Twin-width IV: ordered graphs and matrices | 2023-12-08 | Paper |
| 4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/3 | 2023-10-31 | Paper |
| Neighbourhood complexity of graphs of bounded twin-width | 2023-10-25 | Paper |
| Maximum matchings in geometric intersection graphs | 2023-10-12 | Paper |
| Factoring Pattern-Free Permutations into Separable ones | 2023-08-05 | Paper |
| Stretch-width | 2023-05-19 | Paper |
| Twin-width can be exponential in treewidth | 2023-05-02 | Paper |
| Parameterized Hardness of Art Gallery Problems | 2023-04-26 | Paper |
| Grundy Coloring and friends, half-graphs, bicliques | 2023-04-21 | Paper |
| A tamed family of triangle-free graphs with unbounded chromatic number | 2023-04-09 | Paper |
| Cutting Barnette graphs perfectly is hard | 2023-02-22 | Paper |
| Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$ | 2023-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874335 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874491 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874304 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875613 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875537 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Parameterized Intractability of Even Set and Shortest Vector Problem | 2022-12-08 | Paper |
| EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs | 2022-12-08 | Paper |
| Twin-width II: small classes | 2022-11-23 | Paper |
| Twin-width and polynomial kernels | 2022-10-27 | Paper |
| Twin-width V: linear minors, modular counting, and matrix multiplication | 2022-09-24 | Paper |
| Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width | 2022-07-15 | Paper |
| Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP | 2022-05-11 | Paper |
| Twin-width VII: groups | 2022-04-26 | Paper |
| Twin-width VIII: delineation and win-wins | 2022-04-01 | Paper |
| Twin-width I: Tractable FO Model Checking | 2022-03-31 | Paper |
| Model Checking on Interpretations of Classes of Bounded Local Cliquewidth | 2022-02-25 | Paper |
| Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond) | 2022-02-23 | Paper |
| The complexity of mixed-connectivity | 2022-01-24 | Paper |
| Deciding twin-width at most 4 is NP-complete | 2021-12-16 | Paper |
| Twin-width VI: the lens of contraction sequences | 2021-10-30 | Paper |
| Parameterized Complexity of Independent Set in H-Free Graphs. | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009490 | 2021-08-04 | Paper |
| Metric dimension parameterized by treewidth | 2021-07-26 | Paper |
| Twin-width and polynomial kernels | 2021-07-06 | Paper |
| The inverse Voronoi problem in graphs. II: Trees | 2021-04-19 | Paper |
| The inverse Voronoi problem in graphs. I: Hardness | 2020-10-12 | Paper |
| Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115778 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115779 | 2020-08-18 | Paper |
| Parameterized complexity of independent set in H-free graphs | 2020-08-12 | Paper |
| Twin-width III: Max Independent Set, Min Dominating Set, and Coloring | 2020-07-28 | Paper |
| The Parameterized Complexity of Positional Games | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111866 | 2020-05-27 | Paper |
| On the Parameterized Complexity of Red-Blue Points Separation | 2020-05-27 | Paper |
| Orthogonal Terrain Guarding is NP-complete | 2020-01-13 | Paper |
| Grundy Coloring & friends, Half-Graphs, Bicliques | 2020-01-11 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224479 | 2019-07-23 | Paper |
| Optimality program in segment and string graphs | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626304 | 2019-02-27 | Paper |
| Optimality program in segment and string graphs | 2018-11-22 | Paper |
| Parameterized (in)approximability of subset problems | 2018-09-28 | Paper |
| Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs | 2018-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580094 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580091 | 2018-08-13 | Paper |
| Complexity of token swapping and its variants | 2018-07-26 | Paper |
| Complexity of Grundy coloring and its variants | 2018-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636614 | 2018-04-19 | Paper |
| Fixed-parameter Approximability of Boolean MinCSPs | 2018-03-02 | Paper |
| Parameterized Hardness of Art Gallery Problems | 2018-03-02 | Paper |
| Sparsification and subexponential approximation | 2018-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601874 | 2018-01-24 | Paper |
| Time-approximation trade-offs for inapproximable problems | 2017-11-14 | Paper |
| Designing RNA Secondary Structures is Hard | 2017-10-31 | Paper |
| The Graph Motif Problem Parameterized by the Structure of the Input Graph | 2017-09-29 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2017-09-28 | Paper |
| The graph motif problem parameterized by the structure of the input graph | 2017-09-12 | Paper |
| Dual parameterization and parameterized approximability of subset graph problems | 2017-03-24 | Paper |
| Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems | 2017-01-19 | Paper |
| Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property | 2016-12-22 | Paper |
| A Note on Edge Isoperimetric Numbers and Regular Graphs | 2016-12-14 | Paper |
| On the complexity of connection games | 2016-09-05 | Paper |
| A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs | 2016-05-03 | Paper |
| Flip Distance to a Non-crossing Perfect Matching | 2016-01-22 | Paper |
| Complexity of Grundy coloring and its variants | 2015-10-29 | Paper |
| Havannah and TwixT are PSPACE-complete | 2015-09-29 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2015-09-15 | Paper |
| On subexponential and FPT-time inapproximability | 2015-05-04 | Paper |
| Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization | 2015-05-04 | Paper |
| On subexponential and FPT-time inapproximability | 2013-12-10 | Paper |
| Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization | 2013-12-10 | Paper |
| Twin-width and permutations | N/A | Paper |
| Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes | N/A | Paper |
| Tight bounds on adjacency labels for monotone graph classes | N/A | Paper |
| Graphs without a 3-connected subgraph are 4-colorable | N/A | Paper |
