引用次数
引用: 7,596
H-指数: 47
I10-指数 : 111
出版物: 206
Sketching Cuts in Graphs and Hypergraphs
Robert Krauthgamer , Dmitry Kogan
arXiv: Data Structures and Algorithms
88
2014
Fault-Tolerant Spanners: Better and Simpler
Robert Krauthgamer , Michael Dinitz
arXiv: Data Structures and Algorithms
27
2011
Flow-cut gaps and face covers in planar graphs
Robert Krauthgamer , James R. Lee , Havana (Inbal) Rika
symposium on discrete algorithms 525 -534
7
2019
Coresets for Ordered Weighted Clustering
Vladimir Braverman , Robert Krauthgamer , Shaofeng H.-C. Jiang , Xuan Wu
international conference on machine learning 744 -753
4
2019
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order
Vladimir Braverman , Robert Krauthgamer , Stephen R. Chestnut , David P. Woodruff
international conference on machine learning 648 -657
7
2018
Sublinear Algorithms for Gap Edit Distance
Robert Krauthgamer , Elazar Goldenberg , Barna Saha
arXiv: Computational Complexity
24
2019
Sketching Graphs and Combinatorial Optimization (Invited Talk).
Robert Krauthgamer
foundations of software technology and theoretical computer science
2019
New algorithms and lower bounds for all-pairs max-flow in undirected graphs
Robert Krauthgamer , Amir Abboud , Ohad Trabelsi
symposium on discrete algorithms 48 -61
8
2020
Labelings vs. embeddings: on distributed representations of distances
Robert Krauthgamer , Lee-Ad Gottlieb , Arnold Filtser
symposium on discrete algorithms 1063 -1075
1
2020
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension
Vladimir Braverman , Robert Krauthgamer , Aditya Krishnan , Roi Sinoff
international conference on machine learning 1 1100 -1110
1
2020
Coresets for Clustering in Graphs of Bounded Treewidth
Vladimir Braverman , Robert Krauthgamer , Lingxiao Huang , Daniel Baker
international conference on machine learning 1 569 -579
2
2020
Towards Tight Bounds for Spectral Sparsification of Hypergraphs.
Robert Krauthgamer , Yuichi Yoshida , Jakab Tardos , Michael Kapralov
arXiv: Data Structures and Algorithms
21
2020
Approximating the Median under the Ulam Metric
Robert Krauthgamer , Diptarka Chakraborty , Debarati Das
symposium on discrete algorithms 761 -775
2021
Coresets for Clustering in Excluded-minor Graphs and Beyond
Vladimir Braverman , Robert Krauthgamer , Shaofeng H.-C. Jiang , Xuan Wu
symposium on discrete algorithms 2679 -2696
1
2021
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Robert Krauthgamer , Amir Abboud , Ohad Trabelsi
foundations of computer science 105 -118
2
2020
A Nonlinear Approach to Dimension Reduction
Robert Krauthgamer , Lee-Ad Gottlieb
Discrete and Computational Geometry 54 ( 2) 291 -315
6
2015
The Sketching Complexity of Pattern Matching
Ziv Bar-Yossef , T. S. Jayram , Robert Krauthgamer , Ravi Kumar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 261 -272
33
2004
The Black-Box Complexity of Nearest Neighbor Search
Robert Krauthgamer , James R. Lee
Automata, Languages and Programming 858 -869
2004
Metric Decompositions of Path-Separable Graphs
Lior Kamma , Robert Krauthgamer
Algorithmica 79 ( 3) 645 -653
4
2017
Asymmetric k-center is log*n-hard to approximate
Julia Chuzhoy , Sudipto Guha , Eran Halperin , Sanjeev Khanna
Journal of the ACM 52 ( 4) 538 -551
49
2005