Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Igor Gorodezky

dblp:60/3298 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Combinatorics and discrete mathematics · 77% Graph algorithms and graph theory · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › statistical physics models
sandpile models		 0.112007
Sandpile transience on the grid is polynomially bounded · SODA 2007
Graph algorithms and graph theory › planar graphs
grid graphs		 0.012007
Sandpile transience on the grid is polynomially bounded · SODA 2007

Methods — techniques the papers use, named apart from their topics

potential theory · 0.1combinatorics · 0.1
YearPublicationVenuePosition
2010 Improved Lower Bounds for the Universal and a priori TSP
Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer
 APPROX-RANDOM1
2007 Sandpile transience on the grid is polynomially bounded
László Babai, Igor Gorodezky
 SODA2