| 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 |
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-28 | Paper |
Small but unwieldy: a lower bound on adjacency labels for small classes
SIAM Journal on Computing | 2024-11-01 | Paper |
Twin-width. III: Max independent set, min dominating set, and coloring
SIAM Journal on Computing | 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
Logical Methods in Computer Science | 2024-09-04 | Paper |
Cutting Barnette graphs perfectly is hard
Theoretical Computer Science | 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
Journal of Combinatorial Theory. Series B | 2024-05-10 | Paper |
Twin-width and polynomial kernels
| 2024-02-12 | Paper |
Twin-width. II: Small classes
| 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
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/3
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Neighbourhood complexity of graphs of bounded twin-width
European Journal of Combinatorics | 2023-10-25 | Paper |
Maximum matchings in geometric intersection graphs
Discrete \& Computational Geometry | 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
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Parameterized Hardness of Art Gallery Problems
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Grundy Coloring and friends, half-graphs, bicliques
Algorithmica | 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 |
scientific article; zbMATH DE number 7650943 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651162 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650916 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650282 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650213 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650305 (Why is no real title available?)
| 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
Journal of the ACM | 2022-12-08 | Paper |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Journal of the ACM | 2022-12-08 | Paper |
Twin-width II: small classes
Combinatorial Theory | 2022-11-23 | Paper |
Twin-width and polynomial kernels
Algorithmica | 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
Journal of the ACM | 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
Annals of Operations Research | 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 |
The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
| 2021-08-04 | Paper |
Metric dimension parameterized by treewidth
Algorithmica | 2021-07-26 | Paper |
Twin-width and polynomial kernels
| 2021-07-06 | Paper |
The inverse Voronoi problem in graphs. II: Trees
Algorithmica | 2021-04-19 | Paper |
The inverse Voronoi problem in graphs. I: Hardness
Algorithmica | 2020-10-12 | Paper |
Inapproximability of Diameter in super-linear time: Beyond the 5/3 ratio
| 2020-08-25 | Paper |
scientific article; zbMATH DE number 7236415 (Why is no real title available?)
| 2020-08-18 | Paper |
QPTAS and subexponential algorithm for maximum clique on disk graphs
| 2020-08-18 | Paper |
Parameterized complexity of independent set in H-free graphs
Algorithmica | 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 |
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
| 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
Algorithmica | 2019-09-10 | Paper |
On the parameterized complexity of red-blue points separation
| 2019-07-23 | Paper |
Optimality program in segment and string graphs
Algorithmica | 2019-05-21 | Paper |
Fine-grained complexity of coloring unit disks and balls
| 2019-02-27 | Paper |
Optimality program in segment and string graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Parameterized (in)approximability of subset problems
Operations Research Letters | 2018-09-28 | Paper |
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
Discrete Optimization | 2018-08-17 | Paper |
An approximation algorithm for the art gallery problem
| 2018-08-13 | Paper |
Fine-grained complexity of coloring unit disks and balls
| 2018-08-13 | Paper |
Complexity of token swapping and its variants
Algorithmica | 2018-07-26 | Paper |
Complexity of Grundy coloring and its variants
Discrete Applied Mathematics | 2018-05-24 | Paper |
Complexity of token swapping and its variants
| 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
Acta Informatica | 2018-02-28 | Paper |
Time-approximation trade-offs for inapproximable problems
| 2018-01-24 | Paper |
Time-approximation trade-offs for inapproximable problems
Journal of Computer and System Sciences | 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
Theoretical Computer Science | 2017-09-28 | Paper |
The graph motif problem parameterized by the structure of the input graph
Discrete Applied Mathematics | 2017-09-12 | Paper |
Dual parameterization and parameterized approximability of subset graph problems
RAIRO - Operations Research | 2017-03-24 | Paper |
Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems
RAIRO - Theoretical Informatics and Applications | 2017-01-19 | Paper |
Parameterized vertex deletion problems for hereditary graph classes with a block property
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
A note on edge isoperimetric numbers and regular graphs
International Journal of Foundations of Computer Science | 2016-12-14 | Paper |
On the complexity of connection games
Theoretical Computer Science | 2016-09-05 | Paper |
A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Flip Distance to a Non-crossing Perfect Matching
| 2016-01-22 | Paper |
Complexity of Grundy coloring and its variants
Lecture Notes in Computer Science | 2015-10-29 | Paper |
\textsc{Havannah} and \textsc{TwixT} are PSPACE-complete
Computers and Games | 2015-09-29 | Paper |
On the complexity of various parameterizations of common induced subgraph isomorphism
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On subexponential and FPT-time inapproximability
Algorithmica | 2015-05-04 | Paper |
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
Algorithmica | 2015-05-04 | Paper |
On subexponential and FPT-time inapproximability
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
Parameterized and Exact Computation | 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 |
