Ross J. Kang - RankMe

87 papers A* 1A 1B 1C 1Journal 79Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On Vizing's Problem for Triangle-Free Graphs. Electron. J. Comb. Ross J. Kang, Matthieu Rosenfeld
2025	J	`jnl`	Reconfiguration of List Colourings. CoRR Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston, Jan van den Heuvel, Ross J. Kang
2025	J	`jnl`	The hard-core model in graph theory. CoRR Ewan Davies, Ross J. Kang
2025	J	`jnl`	The χ-Binding Function of d-Directional Segment Graphs. Discret. Comput. Geom. Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald
2025	J	`jnl`	Triangle-free graphs with the fewest independent sets. CoRR Pjotr Buys, Jan van den Heuvel, Ross J. Kang
2024	J	`jnl`	A Precise Condition for Independent Transversals in Bipartite Covers. SIAM J. Discret. Math. Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski
2024	J	`jnl`	Largest component in Boolean sublattices. CoRR Julian Galliano, Ross J. Kang
2024	J	`jnl`	List packing number of bounded degree graphs. Comb. Probab. Comput. Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang
2024	J	`jnl`	Packing list-colorings. Random Struct. Algorithms Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang
2024	J	`jnl`	Reconfiguration of Independent Transversals. CoRR Pjotr Buys, Ross J. Kang, Kenta Ozeki
2024	J	`jnl`	When removing an independent set is optimal for reducing the chromatic number. Eur. J. Comb. Stijn Cambie, John Haslegrave, Ross J. Kang
2023	J	`jnl`	A precise condition for independent transversals in bipartite covers. CoRR Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski
2023	J	`jnl`	Regular Turán numbers and some Gan-Loh-Sudakov-type problems. J. Graph Theory Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang
2023	J	`jnl`	The χ-binding function of d-directional segment graphs. CoRR Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald
2022	J	`jnl`	Colorings, transversals, and local sparsity. Random Struct. Algorithms Ross J. Kang, Tom Kelly
2022	J	`jnl`	Maximizing Line Subgraphs of Diameter at Most t. SIAM J. Discret. Math. Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang
2022	J	`jnl`	Strong chromatic index and Hadwiger number. J. Graph Theory Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2021	A*	`conf`	An improved procedure for colouring graphs of bounded local density. SODA Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang
2021	J	`jnl`	Occupancy fraction, fractional colouring, and triangle fraction. J. Graph Theory Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2021	J	`jnl`	Packing list-colourings. CoRR Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang
2021	J	`jnl`	Single-conflict colouring. J. Graph Theory Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2021	J	`jnl`	Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
2020	J	`jnl`	An algorithmic framework for colouring locally sparse graphs. CoRR Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni
2020	J	`jnl`	An improved procedure for colouring graphs of bounded local density. CoRR Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang
2020	J	`jnl`	Bipartite Induced Density in Triangle-Free Graphs. Electron. J. Comb. Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2020	J	`jnl`	Coloring triangle-free graphs with local list sizes. Random Struct. Algorithms Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2019	J	`jnl`	A precolouring extension of Vizing's theorem. J. Graph Theory António Girão, Ross J. Kang
2019	B	`conf`	Approximate Strong Edge-Colouring of Unit Disk Graphs. WAOA Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2019	J	`jnl`	Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. Louis Esperet, Ross J. Kang, Stéphan Thomassé
2019	J	`jnl`	Strong chromatic index and Hadwiger number. CoRR Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2019	J	`jnl`	Structure and colour in triangle-free graphs. CoRR N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
2019	J	`jnl`	Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth. Electron. J. Comb. Ross J. Kang, Willem van Loon
2019	J	`jnl`	VC Dimension and a Union Theorem for Set Systems. Electron. J. Comb. Stijn Cambie, António Girão, Ross J. Kang
2018	J	`jnl`	Bipartite induced density in triangle-free graphs. CoRR Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2018	J	`jnl`	Colouring triangle-free graphs with local list sizes. CoRR Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2018	J	`jnl`	Distance Colouring Without One Cycle Length. Comb. Probab. Comput. Ross J. Kang, François Pirot
2018	J	`jnl`	Extension from Precoloured Sets of Edges. Electron. J. Comb. Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni
2018	J	`jnl`	Least conflict choosability. CoRR Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2018	J	`jnl`	Occupancy fraction, fractional colouring, and triangle fraction. CoRR Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot
2018	J	`jnl`	Packing Graphs of Bounded Codegree. Comb. Probab. Comput. Wouter Cames van Batenburg, Ross J. Kang
2018	J	`jnl`	Separation choosability and dense bipartite induced subgraphs. CoRR Louis Esperet, Ross J. Kang, Stéphan Thomassé
2018	J	`jnl`	Tree-like distance colouring for planar graphs of sufficient girth. CoRR Ross J. Kang, Willem van Loon
2017	J	`jnl`	Colouring squares of claw-free graphs. Electron. Notes Discret. Math. Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor
2017	J	`jnl`	Distance colouring without one cycle length. Electron. Notes Discret. Math. Ross J. Kang, François Pirot
2017	J	`jnl`	List Coloring with a Bounded Palette. J. Graph Theory Marthe Bonamy, Ross J. Kang
2017	J	`jnl`	Packing two graphs of even girth 10. Electron. Notes Discret. Math. Wouter Cames van Batenburg, Ross J. Kang
2016	J	`jnl`	Coloring Powers and Girth. SIAM J. Discret. Math. Ross J. Kang, François Pirot
2016	J	`jnl`	Colouring squares of claw-free graphs. CoRR Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor
2016	J	`jnl`	Squared chromatic and stability numbers without claws or large cliques. CoRR Wouter Cames van Batenburg, Ross J. Kang
2015	J	`jnl`	A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. Ross J. Kang, János Pach, Viresh Patel, Guus Regts
2015	J	`jnl`	Decomposition of bounded degree graphs into C Eur. J. Comb. Ross J. Kang, Guillem Perarnau
2015	J	`jnl`	On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. Ross J. Kang, Viresh Patel, Guus Regts
2015	J	`jnl`	On r-dynamic coloring of grids. Discret. Appl. Math. Ross J. Kang, Tobias Müller, Douglas B. West
2014	J	`jnl`	Arrangements of Pseudocircles and Circles. Discret. Comput. Geom. Ross J. Kang, Tobias Müller
2014	J	`jnl`	For most graphs Random Struct. Algorithms Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
2014	J	`jnl`	Largest sparse subgraphs of random graphs. Eur. J. Comb. Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2014	J	`jnl`	On r-dynamic Coloring of Grids. CoRR Ross J. Kang, Tobias Müller, Douglas B. West
2014	J	`jnl`	Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. Electron. J. Comb. Magnus Bordewich, Ross J. Kang
2014	J	`jnl`	Supersaturation in the Boolean Lattice. Integers Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni
2014	J	`jnl`	The Distance- Comb. Probab. Comput. Tomás Kaiser, Ross J. Kang
2013	J	`jnl`	Improper Choosability and Property B. J. Graph Theory Ross J. Kang
2013	J	`jnl`	Supersaturation in the Boolean lattice CoRR Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni
2012	J	`jnl`	Distance edge-colourings and matchings. Discret. Appl. Math. Ross J. Kang, Putra Manggala
2012	J	`jnl`	Induced Matchings in Subcubic Planar Graphs. SIAM J. Discret. Math. Ross J. Kang, Matthias Mnich, Tobias Müller
2012	J	`jnl`	Sphere and Dot Product Representations of Graphs. Discret. Comput. Geom. Ross J. Kang, Tobias Müller
2011	J	`jnl`	Dot Product Representations of Planar Graphs. Electron. J. Comb. Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman
2011	J	`jnl`	Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. SIAM J. Discret. Math. Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík
2011	J	`jnl`	Frugal, acyclic and star colourings of graphs. Discret. Appl. Math. Ross J. Kang, Tobias Müller
2011	J	`jnl`	Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2011	—	`conf`	Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. ICALP (1) Magnus Bordewich, Ross J. Kang
2011	J	`jnl`	Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width CoRR Magnus Bordewich, Ross J. Kang
2011	—	`conf`	Sphere and dot product representations of graphs. SCG Ross J. Kang, Tobias Müller
2010	J	`jnl`	Acyclic dominating partitions. J. Graph Theory Louigi Addario-Berry, Ross J. Kang, Tobias Müller
2010	J	`jnl`	Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
2010	A	`conf`	Dot Product Representations of Planar Graphs. GD Ross J. Kang, Tobias Müller
2010	—	`conf`	Induced Matchings in Subcubic Planar Graphs. ESA (2) Ross J. Kang, Matthias Mnich, Tobias Müller
2010	J	`jnl`	The Comb. Probab. Comput. Ross J. Kang, Colin McDiarmid
2010	J	`jnl`	The t-Stability Number of a Random Graph. Electron. J. Comb. Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2009	C	`conf`	Acyclic and Frugal Colourings of Graphs. CTW Ross J. Kang, Tobias Müller
2009	J	`jnl`	Circular choosability. J. Graph Theory Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
2009	J	`jnl`	Improper coloring of unit disk graphs. Networks Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni
2009	J	`jnl`	On distance edge-colourings and matchings. Electron. Notes Discret. Math. Ross J. Kang, Putra Manggala
2008	J	`jnl`	Improper colouring of (random) unit disk graphs. Discret. Math. Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
2008	—	`—`	Improper colourings of graphs. Ross J. Kang
2007	J	`jnl`	Acyclic dominating partitions. Electron. Notes Discret. Math. Louigi Addario-Berry, Ross J. Kang
2007	J	`jnl`	The t-improper chromatic number of random graphs. Electron. Notes Discret. Math. Ross J. Kang, Colin J. H. McDiarmid
2005	J	`jnl`	Improper Colourings of Unit Disk Graphs. Electron. Notes Discret. Math. Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni