25 citations · 246 across the 55 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Treewidth of graphs with balanced separations
Zdenek Dvorak, Sergey Norin
We prove that if every subgraph of a graph has a balanced separation of order at most then has treewidth at most . This establishes a linear dependence between the…
cs.GT2014★ 2 cited
A Near-Optimal Mechanism for Impartial Selection
Nicolas Bousquet, Sergey Norin, Adrian Vetta
We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently…
math.CO2014★ 6 cited
Non-planar extensions of subdivisions of planar graphs
Sergey Norin, Robin Thomas
Almost -connectivity is a weakening of -connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let be an almost -connect…