Ross J. Kang

Academic Center for Dentistry Amsterdam — Netherlands

Computer Science · Physical Sciences

14h-index730citations128works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(92), Limits and Structures in Graph Theory(87), Graph Labeling and Dimension Problems(34), Advanced Topology and Set Theory(15), Graph theory and applications(14)

Publications128 total

Vu's conjecture holds for claw-free graphs
arXiv (Cornell University)·2025Open Access
On Vizing’s Problem for Triangle-Free Graphs
The Electronic Journal of Combinatorics·2025Open Access
Reconfiguration of Independent Transversals
Random Structures and Algorithms·2025Open Access
The $$\chi $$-Binding Function of d-Directional Segment Graphs
Discrete & Computational Geometry·2025Open Access
Reconfiguration of List Colourings
arXiv (Cornell University)·2025Open Access
Carving Out the Inner Edge of the Period Ratio Distribution through Giant Impacts
The Astrophysical Journal·2025· 1 citedOpen Access
Triangle-free graphs with the fewest independent sets
arXiv (Cornell University)·2025Open Access
Carving Out the Inner Edge of the Period Ratio Distribution through Giant Impacts
arXiv (Cornell University)·2025· 1 citedOpen Access
The hard-core model in graph theory
arXiv (Cornell University)·2025Open Access
Spectral approaches for $d$-improper chromatic number
arXiv (Cornell University)·2024Open Access
List packing number of bounded degree graphs
Combinatorics Probability Computing·2024· 2 cited
Reconfiguration of Independent Transversals
arXiv (Cornell University)·2024Open Access
A Precise Condition for Independent Transversals in Bipartite Covers
SIAM Journal on Discrete Mathematics·2024· 1 citedOpen Access
Cell jamming in a collagen-based interface assay is tuned by collagen density and proteolysis
Journal of Cell Science·2023· 6 citedOpen Access
On Vizing's problem for triangle-free graphs
arXiv (Cornell University)·2023Open Access
The $χ$-binding function of $d$-directional segment graphs
arXiv (Cornell University)·2023Open Access
A precise condition for independent transversals in bipartite covers
arXiv (Cornell University)·2023Open Access
When removing an independent set is optimal for reducing the chromatic number
European Journal of Combinatorics·2023· 4 citedOpen Access
Packing list‐colorings
Random Structures and Algorithms·2023· 5 citedOpen Access
List packing number of bounded degree graphs
arXiv (Cornell University)·2023· 1 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Tobias Müller(9), Rémi de Joannis de Verclos(8), François Pirot(8), Colin McDiarmid(7), Jean‐Sébastien Sereni(7), Ewan Davies(6), Wouter Cames van Batenburg(4), Stijn Cambie(4), Frédéric Havet(3), Louis Esperet(3), Viresh Patel(2), Nikolaos Fountoulakis(2), Eoin Hurley(2), Matthias Mnich(2), Tobias Müller(2), Tom Kelly(2), Louigi Addario‐Berry(2), Douglas B. West(1), Simon Griffiths(1), Roberto I. Oliveira(1)