| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6192478 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147374 | 2024-01-15 | 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 |
| 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 |
| https://portal.mardi4nfdi.de/entity/Q5874304 | 2023-02-07 | 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/Q5875537 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875613 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5075760 | 2022-05-11 | Paper |
| Twin-width I: Tractable FO Model Checking | 2022-03-31 | Paper |
| The complexity of mixed-connectivity | 2022-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009479 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009490 | 2021-08-04 | Paper |
| Metric dimension parameterized by treewidth | 2021-07-26 | 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 |
| 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 |
| https://portal.mardi4nfdi.de/entity/Q5111422 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111866 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111867 | 2020-05-27 | Paper |
| Orthogonal Terrain Guarding is NP-complete | 2020-01-13 | 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/Q4580091 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580094 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4606287 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606288 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5363785 | 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 |
| 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 |
