| Publication | Date of Publication | Type |
|---|
\((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
First-order logic and twin-width in tournaments
| 2025-01-06 | Paper |
Maximum independent set when excluding an induced minor: \(K_1+tK_2\) and \(tC_3\uplus C_4\)
| 2025-01-06 | Paper |
Lossy kernelization for (implicit) hitting set problems
| 2025-01-06 | Paper |
Factoring pattern-free permutations into separable ones
| 2024-11-28 | Paper |
Twin-width. III: Max independent set, min dominating set, and coloring
SIAM Journal on Computing | 2024-11-01 | Paper |
Twin-width V: linear minors, modular counting, and matrix multiplication
| 2024-10-08 | Paper |
A quasi-quadratic vertex-kernel for cograph edge editing
Discrete Applied Mathematics | 2024-09-26 | Paper |
Twin-width and permutations
Logical Methods in Computer Science | 2024-09-04 | Paper |
Twin-width. VI: The lens of contraction sequences
| 2024-07-19 | Paper |
A brief tour in twin-width (invited talk)
| 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 |
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
SIAM Journal on Computing | 2024-02-28 | Paper |
Twin-width and polynomial kernels
| 2024-02-12 | Paper |
Twin-width. II: Small classes
| 2024-01-15 | Paper |
Twin-width IV: ordered graphs and matrices
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
Journal of Graph Theory | 2023-10-04 | Paper |
Edge‐decomposing graphs into coprime forests
Journal of Graph Theory | 2023-09-29 | Paper |
Extremal independent set reconfiguration
The Electronic Journal of Combinatorics | 2023-08-18 | Paper |
Factoring Pattern-Free Permutations into Separable ones
| 2023-08-05 | Paper |
A tamed family of triangle-free graphs with unbounded chromatic number
| 2023-04-09 | Paper |
Bounded twin-width graphs are polynomially $\chi$-bounded
| 2023-03-20 | 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 7651162 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650229 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650282 (Why is no real title available?)
| 2023-02-03 | Paper |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Journal of the ACM | 2022-12-08 | Paper |
(P6, triangle)-free digraphs have bounded dichromatic number
| 2022-12-05 | 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 |
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
| 2022-07-15 | Paper |
Edge-partitioning 3-edge-connected graphs into paths
Journal of Combinatorial Theory. Series B | 2022-06-10 | 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 |
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Graphs with polynomially many minimal separators
Journal of Combinatorial Theory. Series B | 2021-11-17 | 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 |
Twin-width and polynomial kernels
| 2021-07-06 | Paper |
Convexly independent subsets of Minkowski sums of convex polygons
Discrete Mathematics | 2021-06-14 | Paper |
On the maximum weight independent set problem in graphs without induced cycles of length at least five
SIAM Journal on Discrete Mathematics | 2021-03-12 | Paper |
Disproving the normal graph conjecture
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | 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 |
Separation choosability and dense bipartite induced subgraphs
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Coloring dense digraphs
Combinatorica | 2020-01-17 | Paper |
Maximum independent sets in (pyramid, even hole)-free graphs
| 2019-12-24 | Paper |
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
Combinatorica | 2019-09-04 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
A proof of the Erdös-Sands-Sauer-Woodrow conjecture
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Coloring tournaments: from local to global
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
The independent set problem is FPT for even-hole-free graphs
| 2019-07-01 | Paper |
A quadratic kernel for feedback vertex set
| 2019-05-06 | Paper |
Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Realization of aperiodic subshifts and uniform densities in groups
Groups, Geometry, and Dynamics | 2019-03-21 | Paper |
A proof of the Barát-Thomassen conjecture
Journal of Combinatorial Theory. Series B | 2018-10-29 | Paper |
Domination and fractional domination in digraphs
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
On the complexity of partial derivatives
| 2018-04-19 | Paper |
Domination in tournaments
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
Subquadratic kernels for implicit 3-hitting set and 3-set packing problems
| 2018-03-15 | Paper |
Additive bases and flows in graphs
SIAM Journal on Discrete Mathematics | 2018-02-22 | Paper |
Multicut Is FPT
SIAM Journal on Computing | 2018-02-22 | Paper |
Decomposing graphs into paths and trees
| 2018-01-18 | Paper |
Coloring dense digraphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Additive bases and flows in graphs
| 2018-01-18 | Paper |
A polynomial Turing-kernel for weighted independent set in bull-free graphs
Algorithmica | 2017-04-12 | Paper |
Excluding clocks
| 2016-10-17 | Paper |
The Erdős-Hajnal conjecture for long holes and antiholes
SIAM Journal on Discrete Mathematics | 2016-06-23 | Paper |
Isolating highly connected induced subgraphs
SIAM Journal on Discrete Mathematics | 2016-04-07 | Paper |
Perfect graphs of arbitrarily large clique-chromatic number
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Identifying codes in hereditary classes of graphs and VC-dimension
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
A polynomial Turing-kernel for weighted independent set in bull-free graphs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
VC-dimension and Erdős-Pósa property
Discrete Mathematics | 2015-08-05 | Paper |
The Erdős-Hajnal conjecture for paths and antipaths
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
A \(\tau \)-conjecture for Newton polygons
Foundations of Computational Mathematics | 2015-04-20 | Paper |
Hitting and harvesting pumpkins
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
A \(4k^2\) kernel for feedback vertex set
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A note on the minimum distance of quantum LDPC codes
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Clique versus independent set
European Journal of Combinatorics | 2014-08-28 | Paper |
Graphs with large chromatic number induce $3k$-cycles
| 2014-08-09 | Paper |
\textsc{Multicut} is FPT
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A counterexample to a conjecture of Schwartz
Social Choice and Welfare | 2014-05-30 | Paper |
Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
Journal of Graph Theory | 2014-05-22 | Paper |
Parameterized domination in circle graphs
Theory of Computing Systems | 2014-03-25 | Paper |
Symmetric determinantal representations in characteristic 2
Linear Algebra and its Applications | 2014-02-19 | Paper |
Complements of nearly perfect graphs
Journal of Combinatorics | 2013-11-05 | Paper |
Spanning galaxies in digraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Oriented trees in digraphs
Discrete Mathematics | 2013-04-15 | Paper |
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Tournaments and colouring
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
Packing and covering triangles in \(K_{4}\)-free planar graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Parameterized Domination in Circle Graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Kernels for feedback arc set in tournaments
| 2012-10-24 | Paper |
Scott's induced subdivision conjecture for maximal triangle-free graphs
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average
| 2012-08-31 | Paper |
Cyclic orderings and cyclic arboricity of matroids
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
On spanning galaxies in digraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
A stability theorem on fractional covering of triangles by edges
European Journal of Combinatorics | 2012-05-04 | Paper |
A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
| 2012-04-24 | Paper |
The domination number of grids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Hitting and harvesting pumpkins
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science | 2011-09-12 | Paper |
Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Almost all \(H\)-free graphs have the Erdős-Hajnal property
| 2011-02-18 | Paper |
Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
Discrete Applied Mathematics | 2011-01-14 | Paper |
Well-quasi-order of relabel functions
Order | 2010-11-08 | Paper |
Edge Growth in Graph Cubes
| 2010-09-02 | Paper |
Coloring dense graphs via VC-dimension
| 2010-07-09 | Paper |
Complexity of (p,1)-total labelling
Discrete Applied Mathematics | 2010-04-28 | Paper |
Partitions versus sets: a case of duality
European Journal of Combinatorics | 2010-04-27 | Paper |
WDM and directed star arboricity
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
On finding directed trees with many leaves
Parameterized and Exact Computation | 2010-01-14 | Paper |
A linear vertex kernel for Maximum Internal Spanning Tree
Algorithms and Computation | 2009-12-17 | Paper |
Submodular partition functions
Discrete Mathematics | 2009-12-15 | Paper |
Kernel Bounds for Disjoint Cycles and Disjoint Paths
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Total domination of graphs and small transversals of hypergraphs
Combinatorica | 2008-10-21 | Paper |
Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
Combinatorica | 2008-10-21 | Paper |
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Hoàng-Reed conjecture holds for tournaments
Discrete Mathematics | 2008-07-11 | Paper |
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity | 2008-03-26 | Paper |
Graphs with Large Girth Not Embeddable in the Sphere
Combinatorics, Probability and Computing | 2007-11-22 | Paper |
Branchwidth of graphic matroids
| 2007-10-24 | Paper |
Paths with two blocks in \(n\)-chromatic digraphs
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
Partitions and orientations of the Rado graph
Transactions of the American Mathematical Society | 2007-02-01 | Paper |
Density conditions for triangles in multipartite graphs
Combinatorica | 2007-01-08 | Paper |
The categorical product of two 5-chromatic digraphs can be 3-chromatic
Discrete Mathematics | 2006-01-10 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
scientific article; zbMATH DE number 2147493 (Why is no real title available?)
| 2005-03-21 | Paper |
The \(C_{3}\)-structure of the tournaments.
Discrete Mathematics | 2004-03-14 | Paper |
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
Discrete Applied Mathematics | 2003-10-14 | Paper |
Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Small degree out‐branchings
Journal of Graph Theory | 2003-05-11 | Paper |
Generalized pigeonhole properties of graphs and oriented graphs
European Journal of Combinatorics | 2003-01-05 | Paper |
Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Countable \(\alpha\)-extendable graphs
Discrete Mathematics | 2002-04-16 | Paper |
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
| 2001-09-30 | Paper |
Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
On Better-Quasi-Ordering Countable Series-Parallel Orders
Transactions of the American Mathematical Society | 2000-05-22 | Paper |
2-partition-transitive tournaments
Journal of Combinatorial Theory. Series B | 1999-02-11 | Paper |
Relations infinies indécomposables critiques
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 1997-10-08 | Paper |
Indivisibility and alpha-morphisms
European Journal of Combinatorics | 1997-07-27 | Paper |
scientific article; zbMATH DE number 559140 (Why is no real title available?)
| 1994-05-19 | Paper |
scientific article; zbMATH DE number 458918 (Why is no real title available?)
| 1994-02-23 | Paper |
Twin-width and permutations
| N/A | Paper |
Temporalizing digraphs via linear-size balanced bi-trees
| N/A | Paper |
Dichromatic Number and Cycle Inversions
| N/A | Paper |
Graphs without a 3-connected subgraph are 4-colorable
| N/A | Paper |
