Sophie Spirkl

Celina M. H. de Figueiredo

Eur. J. Comb., 2025

On heroes in digraphs with forbidden induced forests.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

The sandwich problem for odd-hole-free and even-hole-free graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Aristotelis Chaniotis

Discret. Math., 2025

Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets.

[BibT_eX]

[DOI]

Discret. Math., 2025

Tree Independence Number IV. Even-hole-free graphs.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Pure Pairs. VIII. Excluding a Sparse Graph.

[BibT_eX]

[DOI]

Comb., December, 2024

List-k-Coloring H-Free Graphs for All k>4.

[BibT_eX]

[DOI]

Comb., October, 2024

Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.

[BibT_eX]

[DOI]

Comb., October, 2024

Induced subgraphs and tree decompositions V. one neighbor in a hole.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2024

Pure Pairs. IX. Transversal Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Hitting all maximum stable sets in P5-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, March, 2024

Four-Coloring $\boldsymbol{P_6}$-Free Graphs. II. Finding an Excellent Precoloring.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

Bipartite graphs with no K6 minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, January, 2024

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.

[BibT_eX]

[DOI]

Eur. J. Comb., January, 2024

Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture.

[BibT_eX]

[DOI]

Patrick Hompe

Zishen Qu

Discret. Math., January, 2024

Homogeneous sets in graphs and a chromatic multisymmetric function.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2024

2023

Polynomial bounds for chromatic number VII. Disjoint holes.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Strengthening Rödl's theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, November, 2023

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path.

[BibT_eX]

[DOI]

Comb., October, 2023

Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Pure pairs. IV. Trees in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Complexity of Ck-coloring in hereditary classes of graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Pure Pairs. V. Excluding Some Long Subdivision.

[BibT_eX]

[DOI]

Comb., June, 2023

Polynomial bounds for chromatic number VI. Adding a four-vertex path.

[BibT_eX]

[DOI]

Eur. J. Comb., May, 2023

The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size.

[BibT_eX]

[DOI]

Discret. Math., April, 2023

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.

[BibT_eX]

[DOI]

Alexander D. Scott

J. Graph Theory, 2023

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs.

[BibT_eX]

[DOI]

Aristotelis Chaniotis

Zishen Qu

Discret. Math., 2023

Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Pure Pairs VI: Excluding an Ordered Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Polynomial bounds for chromatic number. III. Excluding a double star.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Polynomial bounds for chromatic number II: Excluding a star-forest.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Modular relations of the Tutte symmetric function.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2022

Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture.

[BibT_eX]

[DOI]

Patrick Hompe

Electron. J. Comb., 2022

Plethysms of Chromatic and Tutte Symmetric Functions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Concatenating Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Digraphs with All Induced Directed Cycles of the Same Length are not $\vec{\chi}$-Bounded.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

A Complete Multipartite Basis for the Chromatic Symmetric Function.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Finding Large H-Colorable Subgraphs in Hereditary Graph Classes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2021

A note on simplicial cliques.

[BibT_eX]

[DOI]

Discret. Math., 2021

Finding an induced path that is not a shortest path.

[BibT_eX]

[DOI]

Eli Berger

Discret. Math., 2021

On symmetric intersecting families of vectors.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Pure Pairs. II. Excluding All Subdivisions of A Graph.

[BibT_eX]

[DOI]

Comb., 2021

List 3-Coloring Graphs with No Induced P6+rP3.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

Detecting an Odd Hole.

[BibT_eX]

[DOI]

J. ACM, 2020

A deletion-contraction relation for the chromatic symmetric function.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

Discret. Math., 2020

List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

CoRR, 2020

Short Directed Cycles in Bipartite Digraphs.

[BibT_eX]

[DOI]

Comb., 2020

2019

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Caterpillars in Erdős-Hajnal.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Entropic Matroids and Their Representation.

[BibT_eX]

[DOI]

Emmanuel Abbe

Entropy, 2019

H-colouring Pt-free graphs in subexponential time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Disproportionate division.

[BibT_eX]

[DOI]

Bhargav Narayanan

CoRR, 2019

Towards Erdős-Hajnal for Graphs with No 5-Hole.

[BibT_eX]

[DOI]

Comb., 2019

Approximately Coloring Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

Algorithmica, 2019

Four-coloring P6-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Complexity of Ck-Coloring in Hereditary Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two.

[BibT_eX]

[DOI]

Stephan Held

Celina M. H. de Figueiredo

ACM Trans. Algorithms, 2018

Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Even pairs and prism corners in square-free Berge graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Triangle-free graphs with no six-vertex induced path.

[BibT_eX]

[DOI]

Discret. Math., 2018

Sandwich and probe problems for excluding paths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Four-coloring P6-free graphs. II. Finding an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Four-coloring Ps6-free graphs. I. Extending an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Piercing Axis-Parallel Boxes.

[BibT_eX]

[DOI]

Shira Zerbib

Electron. J. Comb., 2018

The Sandwich Problem for Decompositions and Almost Monotone Properties.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Algorithmica, 2018

2017

Colouring perfect graphs with bounded clique number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Fast Prefix Adders for Non-uniform Input Arrival Times.

[BibT_eX]

[DOI]

Stephan Held

Algorithmica, 2017

2014

A fast algorithm for rectilinear steiner trees with length restrictions on obstacles.

[BibT_eX]

[DOI]

Stephan Held

Proceedings of the International Symposium on Physical Design, 2014

2013

The guillotine approach for TSP with neighborhoods revisited.

[BibT_eX]

[DOI]