Sophie Spirkl
Sophie Spirkl
Verified email at uwaterloo.ca - Homepage
Title
Cited by
Cited by
Year
Pure pairs. I. Trees and linear anticomplete pairs
M Chudnovsky, A Scott, P Seymour, S Spirkl
Advances in Mathematics, 107396, 2020
162020
H-colouring Pt-free graphs in subexponential time
C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl
Discrete Applied Mathematics 267, 184-189, 2019
162019
Caterpillars in Erdős–Hajnal
A Liebenau, M Pilipczuk, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 136, 33-43, 2019
132019
Four-coloring P 6-free graphs
M Chudnovsky, S Spirkl, M Zhong
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
122019
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
M Chudnovsky, A Scott, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 140, 84-97, 2020
112020
Four-coloring -free graphs. I. Extending an excellent precoloring
M Chudnovsky, S Spirkl, M Zhong
arXiv preprint arXiv:1802.02282, 2018
11*2018
Four-coloring -free graphs. II. Finding an excellent precoloring
M Chudnovsky, S Spirkl, M Zhong
arXiv preprint arXiv:1802.02283, 2018
112018
Detecting an odd hole
M Chudnovsky, A Scott, P Seymour, S Spirkl
arXiv preprint arXiv:1903.00208, 2019
82019
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles
S Held, ST Spirkl
Proceedings of the 2014 on International symposium on physical design, 37-44, 2014
82014
Pure pairs. II. Excluding all subdivisions of a graph
M Chudnovsky, A Scott, P Seymour, S Spirkl
8*
Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable
M Chudnovsky, CH Liu, O Schaudt, S Spirkl, N Trotignon, K Vušković
Journal of Graph Theory 92 (2), 67-95, 2019
72019
Proof of the Kalai-Meshulam conjecture
M Chudnovsky, A Scott, P Seymour, S Spirkl
Israel Journal of Mathematics, 1-23, 2020
62020
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
S Held, ST Spirkl
ACM Transactions on Algorithms (TALG) 14 (1), 4, 2018
62018
Colouring perfect graphs with bounded clique number
M Chudnovsky, A Lagoutte, P Seymour, S Spirkl
Journal of Combinatorial Theory, Series B 122, 757-775, 2017
5*2017
Fast Prefix Adders for Non-Uniform Input Arrival Times
S Held, S Spirkl
Algorithmica 77 (1), 287-308, 2017
52017
Pure pairs. VII. Excluding an ordered tree
A Scott, P Seymour, S Spirkl
5*
Towards Erdős-Hajnal for Graphs with No 5-Hole
M Chudnovsky, J Fox, A Scott, P Seymour, S Spirkl
Combinatorica 39 (5), 983-991, 2019
42019
Triangle-free graphs with no six-vertex induced path
M Chudnovsky, P Seymour, S Spirkl, M Zhong
Discrete Mathematics 341 (8), 2179-2196, 2018
42018
Piercing axis-parallel boxes
M Chudnovsky, S Spirkl, S Zerbib
arXiv preprint arXiv:1705.00089, 2017
42017
The guillotine approach for TSP with neighborhoods revisited
S Spirkl
arXiv preprint arXiv:1312.0378, 2013
4*2013
The system can't perform the operation now. Try again later.
Articles 1–20