Dmitry N. Kozlov

Statistics

Publications

Citations

745

H-Index

Active since

1997

Affiliations

KTH Royal Institute of Technology(Current)

ETH Zurich

Board of the Swiss Federal Institutes of Technology

University of Washington

University of Bremen

Dmitry N. Kozlov is an author at KTH Royal Institute of Technology specializing in graph theory, discrete mathematics, and combinatorial optimization.

ORCID

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationGeometryDiscrete GeometryPhysicsLanguageEducationMorphologyEngineering

Publications per year

1997–2012

Publications

Complexes of Directed Trees

Dmitry N. Kozlov · Journal of Combinatorial Theory Series A · 1999 · 134 citations

Directed Trees, Tree Language, Directed Graph +2

Complexes of graph homomorphisms

Eric Babson, Dmitry N. Kozlov · Israel Journal of Mathematics · 2006 · 131 citations

Graph Theory, Algebraic Graph Theory, Graph Homomorphisms +3

Proof of the Lovász conjecture

Eric Babson, Dmitry N. Kozlov · Annals of Mathematics · 2007 · 96 citations · Full text

Incidence combinatorics of resolutions

Eva-Maria Feichtner, Dmitry N. Kozlov · Selecta Mathematica · 2004 · 62 citations · Full text

Incidence Combinatorics, Combinatorial Design, Enumerative Combinatorics +3

A simple proof for folds on both sides in complexes of graph homomorphisms

Dmitry N. Kozlov · Proceedings of the American Mathematical Society · 2005 · 49 citations · Full text

Topological Properties, Math Xmlns, Geometric Graph Theory +10

Rows per page

1–5 of 17