| Publication | Date of Publication | Type |
|---|
Partition of Sparse Graphs into Two Forests with Bounded Degree
(available as arXiv preprint) | N/A | Paper |
Bipartite communities via spectral partitioning
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Positively curved graphs
Journal of Graph Theory | 2022-03-31 | Paper |
Vertex partitions into an independent set and a forest with each component small
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
| Remarks on the Spectral Approach to Finding Short Paths | 2020-11-17 | Paper |
Sparse graphs are near-bipartite
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Regular language distance and entropy
(available as arXiv preprint) | 2020-05-26 | Paper |
Definitions and properties of entropy and distance for regular languages
Dynamical Systems and Random Processes | 2020-01-22 | Paper |
Bipartite communities via spectral partitioning
Combinatorial Optimization and Applications | 2019-10-11 | Paper |
A Brooks-type result for sparse critical graphs
Combinatorica | 2018-09-24 | Paper |
| Probabilistic and Geometrical Applications to Graph Theory | 2017-05-26 | Paper |
| Three Ways to Count Walks in a Digraph | 2016-10-04 | Paper |
Coloring the square of a sparse graph G with almost (G) colors
Discrete Applied Mathematics | 2016-09-30 | Paper |
I,F-partitions of sparse graphs
European Journal of Combinatorics | 2016-06-20 | Paper |
| Negatively Curved Graphs | 2015-12-03 | Paper |
| Bipartite noisy hypercubes have large higher-order Cheeger separation | 2015-04-24 | Paper |
| Bipartite Communities | 2014-12-17 | Paper |
Ore's conjecture on color-critical graphs is almost true
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
Planar 4-critical graphs with four triangles
European Journal of Combinatorics | 2014-09-02 | Paper |
Ore's conjecture for \(k=4\) and Grötzsch's theorem
Combinatorica | 2014-08-14 | Paper |
Short proofs of coloring theorems on planar graphs
European Journal of Combinatorics | 2014-03-25 | Paper |
On 1-improper 2-coloring of sparse graphs
Discrete Mathematics | 2014-01-24 | Paper |
Describing 3-paths in normal plane maps
Discrete Mathematics | 2014-01-24 | Paper |
Extremal graphs with a given number of perfect matchings
Journal of Graph Theory | 2013-07-31 | Paper |
On coloring of sparse graphs
Lecture Notes in Computer Science | 2013-06-14 | Paper |
Large rainbow matchings in edge-coloured graphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
| Large rainbow matchings in large graphs | 2012-04-14 | Paper |
| Counting kings: as easy as _1,_2,_3 | 2007-04-02 | Paper |
| Counting kings: explicit formulas, recurrence relations, and generating functions! Oh my! | 2007-04-02 | Paper |
