Cut-equivalent trees are optimal for min-cut queries
- Amir Abboud
- Robert Krauthgamer
- et al.
- 2020
- FOCS 2020
Conference paper
Publications
30 results for Robert Krauthgamer
New algorithms and lower bounds for all-pairs max-flow in undirected graphs
- Amir Abboud
- Robert Krauthgamer
- et al.
- 2020
- SODA 2020
Conference paperFaster algorithms for all-pairs bounded min-cuts
- Amir Abboud
- Loukas Georgiadis
- et al.
- 2019
- ICALP 2019
Conference paperOn sketching quadratic forms
- Alexandr Andoni
- Jiecao Chen
- et al.
- 2016
- ITCS 2016
Conference paperMin-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
PaperMin-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2011
- FOCS 2011
Conference paperImproved lower bounds for embeddings into l 1
- Robert Krauthgamer
- Yuval Rabani
- 2009
- SIAM Journal on Computing
PaperHow hard is it to approximate the best Nash equilibrium?
- Elad Hazan
- Robert Krauthgamer
- 2009
- SODA 2009
Conference paperGreedy list intersection
- Robert Krauthgamer
- Aranyak Mehta
- et al.
- 2008
- ICDE 2008
Conference paperThe intrinsic dimensionality of graphs
- Robert Krauthgamer
- James R. Lee
- 2008
- Combinatorica
Paper