2024
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations.
J. Comb. Theory, Ser. B, January, 2024
Forcing generalised quasirandom graphs efficiently.
Comb. Probab. Comput., January, 2024
Branch-depth is minor closure of contraction-deletion-depth.
CoRR, 2024
2023
Quasirandom-Forcing Orientations of Cycles.
SIAM J. Discret. Math., December, 2023
Toward characterizing locally common graphs.
Random Struct. Algorithms, 2023
Cycles of a given length in tournaments.
J. Comb. Theory, Ser. B, 2023
No additional tournaments are quasirandom-forcing.
Eur. J. Comb., 2023
Closure property of contraction-depth of matroids.
CoRR, 2023
Twin-width of graphs on surfaces.
CoRR, 2023
2022
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming.
SIAM J. Comput., 2022
Quasirandom Latin squares.
Random Struct. Algorithms, 2022
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm.
J. Comb. Theory, Ser. B, 2022
Packing and covering directed triangles asymptotically.
Eur. J. Comb., 2022
Planar graph with twin-width seven.
CoRR, 2022
Density Maximizers of Layered Permutations.
Electron. J. Comb., 2022
Non-Bipartite K-Common Graphs.
Comb., 2022
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs.
J. Comb. Theory, Ser. B, 2021
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies.
J. Comb. Theory, Ser. B, 2021
Cyclic coloring of plane graphs with maximum face size 16 and 17.
Eur. J. Comb., 2021
Coloring graphs by translates in the circle.
Eur. J. Comb., 2021
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391).
Dagstuhl Reports, 2021
2020
Permutations with fixed pattern densities.
Random Struct. Algorithms, 2020
Characterization of quasirandom permutations by a pattern sum.
Random Struct. Algorithms, 2020
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five.
J. Comb. Theory, Ser. B, 2020
Cycles of length three and four in tournaments.
J. Comb. Theory, Ser. A, 2020
2019
A bound on the inducibility of cycles.
J. Comb. Theory, Ser. A, 2019
The step Sidorenko property and non-norming edge-transitive graphs.
J. Comb. Theory, Ser. A, 2019
Decomposing Graphs into Edges and Triangles.
Comb. Probab. Comput., 2019
A row-invariant parameterized algorithm for integer programming.
CoRR, 2019
Analytic representations of large graphs.
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019
2018
Optimal-size clique transversals in chordal graphs.
J. Graph Theory, 2018
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk.
J. Comb. Theory, Ser. B, 2018
Recovering Sparse Graphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Augmenting Clinical Performance in Combat Casualty Care: Telemedicine to Automation.
Proceedings of the Augmented Cognition: Users and Contexts, 2018
2017
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms, 2017
Steinberg's Conjecture is false.
J. Comb. Theory, Ser. B, 2017
Extremal graph theory and finite forcibility.
Electron. Notes Discret. Math., 2017
First order convergence of matroids.
Eur. J. Comb., 2017
Densities in large permutations and parameter testing.
Eur. J. Comb., 2017
Deobfuscating sparse graphs.
CoRR, 2017
Graphic TSP in Cubic Graphs.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
2016
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle.
J. Comb. Theory, Ser. B, 2016
Packing six T-joins in plane graphs.
J. Comb. Theory, Ser. B, 2016
First-Order Convergence and Roots.
Comb. Probab. Comput., 2016
2015
Finitely forcible graphons and permutons.
J. Comb. Theory, Ser. B, 2015
Third case of the Cyclic Coloring Conjecture.
Electron. Notes Discret. Math., 2015
Weak regularity and finitely forcible graph limits.
Electron. Notes Discret. Math., 2015
FO Model Checking of Interval Graphs
Log. Methods Comput. Sci., 2015
2014
Extensions of Fractional Precolorings Show Discontinuous Behavior.
J. Graph Theory, 2014
The fractional chromatic number of triangle-free subcubic graphs.
Eur. J. Comb., 2014
Infinite dimensional finitely forcible graphon.
CoRR, 2014
Large permutations and parameter testing.
CoRR, 2014
Hereditary properties of permutations are strongly testable.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
Rank of divisors on tropical curves.
J. Comb. Theory, Ser. A, 2013
On the number of pentagons in triangle-free graphs.
J. Comb. Theory, Ser. A, 2013
Monochromatic triangles in three-coloured graphs.
J. Comb. Theory, Ser. B, 2013
Testing first-order properties for subclasses of sparse graphs.
J. ACM, 2013
An application of flag algebras to a problem of Erdős and Sós.
Electron. Notes Discret. Math., 2013
On the removal lemma for linear systems over Abelian groups.
Eur. J. Comb., 2013
A New Bound for the 2/3 Conjecture.
Comb. Probab. Comput., 2013
Packing directed cycles through a specified vertex set.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
Min-Max Relations for Odd Cycles in Planar Graphs.
SIAM J. Discret. Math., 2012
Extending Fractional Precolorings.
SIAM J. Discret. Math., 2012
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.
Random Struct. Algorithms, 2012
Domination number of cubic graphs with large girth.
J. Graph Theory, 2012
Coloring Eulerian Triangulations of the Klein Bottle.
Graphs Comb., 2012
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.
Eur. J. Comb., 2012
Classes of graphs with small rank decompositions are X-bounded.
Eur. J. Comb., 2012
Cyclic colorings of plane graphs with independent faces.
Eur. J. Comb., 2012
A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points.
Discret. Comput. Geom., 2012
Decomposition width of matroids.
Discret. Appl. Math., 2012
Non-Three-Colourable Common Graphs Exist.
Comb. Probab. Comput., 2012
Deciding First Order Properties of Matroids.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Fractional colorings of cubic graphs with large girth.
SIAM J. Discret. Math., 2011
Limit Behavior of Locally Consistent Constraint Satisfaction Problems.
SIAM J. Discret. Math., 2011
Triangles in arrangements of points and lines in the plane.
J. Comb. Theory, Ser. A, 2011
Fractional total colourings of graphs of high girth.
J. Comb. Theory, Ser. B, 2011
Deciding first order logic properties of matroids
CoRR, 2011
2010
The Last Fraction of a Fractional Conjecture.
SIAM J. Discret. Math., 2010
Short Cycle Covers of Graphs with Minimum Degree Three.
SIAM J. Discret. Math., 2010
Coloring plane graphs with independent crossings.
J. Graph Theory, 2010
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs.
J. Graph Theory, 2010
Markov bases of binary graph models of K<sub>4</sub>-minor free graphs.
J. Comb. Theory, Ser. A, 2010
Graphs with bounded tree-width and large odd-girth are almost bipartite.
J. Comb. Theory, Ser. B, 2010
Facial colorings using Hall's Theorem.
Eur. J. Comb., 2010
An improved linear bound on the number of perfect matchings in cubic graphs.
Eur. J. Comb., 2010
A note on antisymmetric flows in graphs.
Eur. J. Comb., 2010
Brooks' Theorem via the Alon-Tarsi Theorem.
Discret. Math., 2010
Toughness threshold for the existence of 2-walks in K<sub>4</sub>-minor-free graphs.
Discret. Math., 2010
Deciding First-Order Properties for Sparse Graphs.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.
SIAM J. Discret. Math., 2009
6-Critical Graphs on the Klein Bottle.
SIAM J. Discret. Math., 2009
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs.
SIAM J. Discret. Math., 2009
Matchings and Nonrainbow Colorings.
SIAM J. Discret. Math., 2009
Polynomial-Size Binary Decision Diagrams for the Exactly Half-<i>d</i>-Hyperclique Problem Reading Each Input Bit Twice.
Theory Comput. Syst., 2009
A combinatorial proof of the Removal Lemma for Groups.
J. Comb. Theory, Ser. A, 2009
Circular edge-colorings of cubic graphs with girth six.
Electron. Notes Discret. Math., 2009
Counting flags in triangle-free digraphs.
Electron. Notes Discret. Math., 2009
Cubic bridgeless graphs have more than a linear number of perfect matchings.
Electron. Notes Discret. Math., 2009
Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb., 2009
Graph labellings with variable weights, a survey.
Discret. Appl. Math., 2009
Distance constrained labelings of planar graphs with no short cycles.
Discret. Appl. Math., 2009
Decomposition width - a new width parameter for matroids
CoRR, 2009
Chromatic Number for a Generalization of Cartesian Product Graphs.
Electron. J. Comb., 2009
A Note on Edge-Colourings Avoiding Rainbow K<sub>4</sub> and Monochromatic K<sub>m</sub>.
Electron. J. Comb., 2009
Algorithms for Classes of Graphs with Bounded Expansion.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
2008
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice.
SIAM J. Discret. Math., 2008
Coloring of Triangle-Free Graphs on the Double Torus.
SIAM J. Discret. Math., 2008
Hamiltonian threshold for strong products of graphs.
J. Graph Theory, 2008
List colorings with measurable sets.
J. Graph Theory, 2008
Six-Critical Graphs on the Klein Bottle.
Electron. Notes Discret. Math., 2008
Coloring squares of planar graphs with girth six.
Eur. J. Comb., 2008
Randomized strategies for the plurality problem.
Discret. Appl. Math., 2008
Coloring even-faced graphs in the torus and the Klein bottle.
Comb., 2008
2007
Labelings of Graphs with Fixed and Variable Edge-Weights.
SIAM J. Discret. Math., 2007
Probabilistic strategies for the partition and plurality problems.
Random Struct. Algorithms, 2007
Closure for the property of having a hamiltonian prism.
J. Graph Theory, 2007
Hamilton cycles in prisms.
J. Graph Theory, 2007
The circular chromatic index of graphs of high girth.
J. Comb. Theory, Ser. B, 2007
Distance Constrained Labelings of K<sub>4</sub>-minor Free Graphs.
Electron. Notes Discret. Math., 2007
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electron. Notes Discret. Math., 2007
Characterization of affine Steiner triple systems and Hall triple systems.
Electron. Notes Discret. Math., 2007
Cyclic, diagonal and facial colorings - a missing case.
Eur. J. Comb., 2007
Labeling planar graphs with a condition at distance two.
Eur. J. Comb., 2007
Mixed hypergraphs and other coloring problems.
Discret. Math., 2007
Computing Representations of Matroids of Bounded Branch-Width.
Proceedings of the STACS 2007, 2007
Coloring Triangle-Free Graphs on Surfaces.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings.
SIAM J. Discret. Math., 2006
The Channel Assignment Problem with Variable Weights.
SIAM J. Discret. Math., 2006
The last excluded case of Dirac's map-color theorem for choosability.
J. Graph Theory, 2006
Extending partial 5-colorings and 6-colorings in planar graphs.
J. Comb. Theory, Ser. B, 2006
Eulerian colorings and the bipartizing matchings conjecture of Fleischner.
Eur. J. Comb., 2006
List coloring of Cartesian products of graphs.
Discret. Math., 2006
Coloring mixed hypertrees.
Discret. Appl. Math., 2006
The Circular Chromatic Index of Flower Snarks.
Electron. J. Comb., 2006
Colorings Of Plane Graphs With No Rainbow Faces.
Comb., 2006
Free binary decision diagrams for the computation of EAR<sub><i>n</i></sub>.
Comput. Complex., 2006
Upper hamiltonian numbers and hamiltonian spectra of graphs.
Australas. J Comb., 2006
2005
Group coloring is π<sub>2</sub><sup>P</sup>-complete.
Theor. Comput. Sci., 2005
Locally consistent constraint satisfaction problems.
Theor. Comput. Sci., 2005
A Brooks-Type Theorem for the Generalized List T-Coloring.
SIAM J. Discret. Math., 2005
Coloring graphs from lists with bounded size of their union.
J. Graph Theory, 2005
A note on group colorings.
J. Graph Theory, 2005
Hamilton cycles in strong products of graphs.
J. Graph Theory, 2005
Unions of perfect matchings in cubic graphs.
Electron. Notes Discret. Math., 2005
Cyclic, diagonal and facial colorings.
Eur. J. Comb., 2005
Coloring face hypergraphs on surfaces.
Eur. J. Comb., 2005
An exact algorithm for the channel assignment problem.
Discret. Appl. Math., 2005
Locally Consistent Constraint Satisfaction Problems with Binary Constraints.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Three Optimal Algorithms for Balls of Three Colors.
Proceedings of the STACS 2005, 2005
Two algorithms for general list matrix partitions.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
2004
It is tough to be a plumber.
Theor. Comput. Sci., 2004
Coloring Powers of Chordal Graphs.
SIAM J. Discret. Math., 2004
Edge-disjoint odd cycles in planar graphs.
J. Comb. Theory, Ser. B, 2004
A revival of the girth conjecture.
J. Comb. Theory, Ser. B, 2004
Pancyclicity of Strong Products of Graphs.
Graphs Comb., 2004
Borodin's conjecture on diagonal coloring is false.
Eur. J. Comb., 2004
On maximum face-constrained coloring of plane graphs with no short face cycles.
Discret. Math., 2004
Hajós' theorem for list coloring.
Discret. Math., 2004
On Feasible Sets of Mixed Hypergraphs.
Electron. J. Comb., 2004
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
Proceedings of the Algorithm Theory, 2004
Group Coloring and List Group Coloring Are Pi<sub>2</sub>P-Complete (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs.
Theor. Comput. Sci., 2003
A Theorem about the Channel Assignment Problem.
SIAM J. Discret. Math., 2003
Free Binary Decision Diagrams for Computation of EAR<sub>n</sub>
Electron. Colloquium Comput. Complex., 2003
Locally satisfiable formulas
Electron. Colloquium Comput. Complex., 2003
Minimum Degree and the Number of Chords.
Ars Comb., 2003
A counter-example to Voloshin's hypergraph co-perfectness conjecture.
Australas. J Comb., 2003
2002
Complexity of Pattern Coloring of Cycle Systems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Optimal Free Binary Decision Diagrams for Computation of EAR<sub>n</sub>.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
2001
On Planar Mixed Hypergraphs.
Electron. J. Comb., 2001
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
Complexity Note on Mixed Hypergraphs.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001
On Intersection Graphs of Segments with Prescribed Slopes.
Proceedings of the Graph Drawing, 9th International Symposium, 2001
On Complexity of Colouring Mixed Hypertrees.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001
2000
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization
Electron. Colloquium Comput. Complex., 2000
