


default search action
Robert Krauthgamer
Person information
- affiliation: Weizmann Institute of Science, Israel
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j49]Arnold Filtser
, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. Discret. Comput. Geom. 71(3): 849-871 (2024) - [j48]Shaofeng H.-C. Jiang
, Robert Krauthgamer, Jianing Lou, Yubo Zhang:
Coresets for kernel clustering. Mach. Learn. 113(8): 5891-5906 (2024) - [j47]Artur Czumaj
, Shaofeng H.-C. Jiang
, Robert Krauthgamer
, Pavel Veselý
:
Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms 20(4): 28:1-28:38 (2024) - [c109]Chen Amiraz, Robert Krauthgamer, Boaz Nadler:
Recovery Guarantees for Distributed-OMP. AISTATS 2024: 802-810 - [c108]Shaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir
:
Moderate Dimension Reduction for k-Center Clustering. SoCG 2024: 64:1-64:16 - [c107]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP 2024: 50:1-50:20 - [c106]Yotam Kenneth, Robert Krauthgamer:
Cut Sparsification and Succinct Representation of Submodular Hypergraphs. ICALP 2024: 97:1-97:17 - [i86]Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue:
Near-Optimal Dimension Reduction for Facility Location. CoRR abs/2411.05432 (2024) - 2023
- [j46]Robert Krauthgamer, Shay Sapir
:
Comparison of Matrix Norm Sparsification. Algorithmica 85(12): 3957-3972 (2023) - [c105]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir
:
Lower Bounds for Pseudo-Deterministic Counting in a Stream. ICALP 2023: 30:1-30:14 - [c104]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. ITCS 2023: 31:1-31:24 - [c103]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS 2023: 58:1-58:23 - [c102]Robert Krauthgamer, Ron Mosenzon:
Exact Flow Sparsification Requires Unbounded Size. SODA 2023: 2354-2367 - [c101]Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Streaming Euclidean Max-Cut: Dimension vs Data Reduction. STOC 2023: 170-182 - [i85]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Lower Bounds for Pseudo-Deterministic Counting in a Stream. CoRR abs/2303.16287 (2023) - [i84]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR abs/2307.07848 (2023) - [i83]Yotam Kenneth, Robert Krauthgamer:
Cut Sparsification and Succinct Representation of Submodular Hypergraphs. CoRR abs/2307.09110 (2023) - [i82]Shaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir
:
Moderate Dimension Reduction for k-Center Clustering. CoRR abs/2312.01391 (2023) - 2022
- [j45]Robert Krauthgamer, David Reitblat
:
Almost-Smooth Histograms and Sliding-Window Graph Algorithms. Algorithmica 84(10): 2926-2953 (2022) - [j44]Robert Krauthgamer, Shay Sapir
:
Smoothness of Schatten norms and sliding-window matrix streams. Inf. Process. Lett. 177: 106254 (2022) - [j43]Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika
:
Faster algorithms for orienteering and k-TSP. Theor. Comput. Sci. 914: 73-83 (2022) - [j42]Vladimir Braverman, Robert Krauthgamer
, Lin F. Yang:
Universal Streaming of Subset Norms. Adv. Math. Commun. 18: 1-32 (2022) - [c100]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer
, Pavel Veselý
, Mingwei Yang:
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS 2022: 450-461 - [c99]Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer
, Chris Schwiegelshohn, Mads Bech Toftrup
, Xuan Wu:
The Power of Uniform Sampling for Coresets. FOCS 2022: 462-473 - [c98]Elazar Goldenberg, Tomasz Kociumaka
, Robert Krauthgamer
, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS 2022: 674-685 - [c97]Amir Abboud, Robert Krauthgamer
, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
, Ohad Trabelsi:
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS 2022: 884-895 - [c96]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
:
Streaming Algorithms for Geometric Steiner Forest. ICALP 2022: 47:1-47:20 - [c95]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. SODA 2022: 3630-3649 - [c94]Hsien-Chih Chang, Robert Krauthgamer
, Zihan Tan:
Almost-linear ε-emulators for planar graphs. STOC 2022: 1311-1324 - [i81]Robert Krauthgamer, Shay Sapir:
Comparison of Matrix Norm Sparsification. CoRR abs/2201.12874 (2022) - [i80]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
, Mingwei Yang:
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR abs/2204.02095 (2022) - [i79]Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan:
Near-Linear ε-Emulators for Planar Graphs. CoRR abs/2206.10681 (2022) - [i78]Itai Boneh, Robert Krauthgamer:
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. CoRR abs/2207.01459 (2022) - [i77]Robert Krauthgamer, Ron Mosenzon:
Exact Flow Sparsification Requires Unbounded Size. CoRR abs/2207.07363 (2022) - [i76]Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu:
The Power of Uniform Sampling for Coresets. CoRR abs/2209.01901 (2022) - [i75]Chen Amiraz, Robert Krauthgamer, Boaz Nadler
:
Distributed Sparse Linear Regression with Sublinear Communication. CoRR abs/2209.07230 (2022) - [i74]Yu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Streaming Euclidean Max-Cut: Dimension vs Data Reduction. CoRR abs/2211.05293 (2022) - [i73]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR abs/2211.12496 (2022) - [i72]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Clustering Permutations: New Techniques with Streaming Applications. CoRR abs/2212.01821 (2022) - 2021
- [j41]Amir Abboud, Robert Krauthgamer
, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. Adv. Math. Commun. 17: 1-27 (2021) - [c93]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. COLT 2021: 759-773 - [c92]Amir Abboud, Robert Krauthgamer
, Ohad Trabelsi:
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. FOCS 2021: 1135-1146 - [c91]Michael Kapralov
, Robert Krauthgamer
, Jakab Tardos, Yuichi Yoshida:
Spectral Hypergraph Sparsifiers of Nearly Linear Size. FOCS 2021: 1159-1170 - [c90]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (In Average-Case). FSTTCS 2021: 11:1-11:23 - [c89]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering with Missing Values. NeurIPS 2021: 17360-17372 - [c88]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. SODA 2021: 761-775 - [c87]Vladimir Braverman, Shaofeng H.-C. Jiang
, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Excluded-minor Graphs and Beyond. SODA 2021: 2679-2696 - [c86]Michael Kapralov
, Robert Krauthgamer
, Jakab Tardos, Yuichi Yoshida:
Towards tight bounds for spectral sparsification of hypergraphs. STOC 2021: 598-611 - [c85]Amir Abboud, Robert Krauthgamer
, Ohad Trabelsi:
Subcubic algorithms for Gomory-Hu tree in unweighted graphs. STOC 2021: 1725-1737 - [i71]Chen Amiraz, Robert Krauthgamer, Boaz Nadler:
Sparse Normal Means Estimation with Sublinear Communication. CoRR abs/2102.03060 (2021) - [i70]Robert Krauthgamer, Shay Sapir:
Smoothness of Schatten Norms and Sliding-Window Matrix Streams. CoRR abs/2103.08211 (2021) - [i69]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Spectral Hypergraph Sparsifiers of Nearly Linear Size. CoRR abs/2106.02353 (2021) - [i68]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. CoRR abs/2106.02981 (2021) - [i67]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering with Missing Values. CoRR abs/2106.16112 (2021) - [i66]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (in Average-Case). CoRR abs/2107.09497 (2021) - [i65]Shaofeng H.-C. Jiang, Robert Krauthgamer, Jianing Lou, Yubo Zhang:
Coresets for Kernel Clustering. CoRR abs/2110.02898 (2021) - [i64]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. CoRR abs/2110.15891 (2021) - [i63]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
, Ohad Trabelsi:
Gomory-Hu Tree in Subcubic Time. CoRR abs/2111.04958 (2021) - [i62]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR abs/2111.12706 (2021) - [i61]Lior Kalman, Robert Krauthgamer:
Flow Metrics on Graphs. CoRR abs/2112.06916 (2021) - 2020
- [j40]Robert Krauthgamer, Havana Rika
:
Refined Vertex Sparsifiers of Planar Graphs. SIAM J. Discret. Math. 34(1): 101-129 (2020) - [c84]Amir Abboud, Robert Krauthgamer
, Ohad Trabelsi:
Cut-Equivalent Trees are Optimal for Min-Cut Queries. FOCS 2020: 105-118 - [c83]Robert Krauthgamer:
Sketching Graphs and Combinatorial Optimization (Invited Talk). ICALP 2020: 2:1-2:1 - [c82]Daniel N. Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Graphs of Bounded Treewidth. ICML 2020: 569-579 - [c81]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Roi Sinoff:
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension. ICML 2020: 1100-1110 - [c80]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. SODA 2020: 48-61 - [c79]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. SODA 2020: 1063-1075 - [i60]Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika:
Faster Algorithms for Orienteering and k-TSP. CoRR abs/2002.07727 (2020) - [i59]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Excluded-minor Graphs and Beyond. CoRR abs/2004.07718 (2020) - [i58]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
Cut-Equivalent Trees are Optimal for Min-Cut Queries. CoRR abs/2009.06090 (2020) - [i57]Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximating the Median under the Ulam Metric. CoRR abs/2011.00868 (2020) - [i56]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. CoRR abs/2011.01777 (2020) - [i55]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. CoRR abs/2011.04324 (2020) - [i54]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Towards Tight Bounds for Spectral Sparsification of Hypergraphs. CoRR abs/2011.06530 (2020) - [i53]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs. CoRR abs/2012.10281 (2020)
2010 – 2019
- 2019
- [c78]Elazar Goldenberg, Robert Krauthgamer
, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. FOCS 2019: 1101-1120 - [c77]Robert Krauthgamer:
Sketching Graphs and Combinatorial Optimization (Invited Talk). FSTTCS 2019: 2:1-2:1 - [c76]Amir Abboud, Loukas Georgiadis
, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis
, Ohad Trabelsi, Przemyslaw Uznanski
, Daniel Wolleb-Graf:
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019: 7:1-7:15 - [c75]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Ordered Weighted Clustering. ICML 2019: 744-753 - [c74]Alexandr Andoni, Robert Krauthgamer, Yosef Pogrow:
On Solving Linear Systems in Sublinear Time. ITCS 2019: 3:1-3:19 - [c73]Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi:
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. SOSA 2019: 10:1-10:14 - [c72]Robert Krauthgamer, James R. Lee, Havana Rika
:
Flow-Cut Gaps and Face Covers in Planar Graphs. SODA 2019: 525-534 - [c71]Robert Krauthgamer, Ohad Trabelsi:
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. STACS 2019: 45:1-45:15 - [i52]Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. CoRR abs/1901.01412 (2019) - [i51]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Ordered Weighted Clustering. CoRR abs/1903.04351 (2019) - [i50]Robert Krauthgamer, David Reitblat:
Almost-Smooth Histograms and Sliding-Window Graph Algorithms. CoRR abs/1904.07957 (2019) - [i49]Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Graphs of Bounded Treewidth. CoRR abs/1907.04733 (2019) - [i48]Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Roi Sinoff:
Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension. CoRR abs/1907.05457 (2019) - [i47]Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer:
Labelings vs. Embeddings: On Distributed Representations of Distances. CoRR abs/1907.06857 (2019) - [i46]Elazar Goldenberg, Robert Krauthgamer, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. CoRR abs/1910.00901 (2019) - 2018
- [j39]Artur Czumaj, Robert Krauthgamer:
Report on HALG 2018. Bull. EATCS 126 (2018) - [j38]Alexandr Andoni, Robert Krauthgamer
, Ilya P. Razenshteyn:
Sketching and Embedding are Equivalent for Norms. SIAM J. Comput. 47(3): 890-916 (2018) - [j37]Artur Czumaj, Robert Krauthgamer:
3rd Highlights of Algorithms (HALG 2018). SIGACT News 49(3): 74-77 (2018) - [j36]Robert Krauthgamer, Ohad Trabelsi:
Conditional Lower Bounds for All-Pairs Max-Flow. ACM Trans. Algorithms 14(4): 42:1-42:15 (2018) - [c70]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang
:
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. ICML 2018: 648-657 - [i45]Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski:
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR abs/1807.05803 (2018) - [i44]Alexandr Andoni, Lior Kamma, Robert Krauthgamer, Eric Price:
Batch Sparse Recovery, or How to Leverage the Average Sparsity. CoRR abs/1807.08478 (2018) - [i43]Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi:
Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. CoRR abs/1809.00942 (2018) - [i42]Alexandr Andoni, Robert Krauthgamer, Yosef Pogrow:
On Solving Linear Systems in Sublinear Time. CoRR abs/1809.02995 (2018) - [i41]Robert Krauthgamer, James R. Lee, Havana Rika:
Flow-Cut Gaps and Face Covers in Planar Graphs. CoRR abs/1811.02685 (2018) - [i40]Vladimir Braverman, Robert Krauthgamer, Lin F. Yang:
Universal Streaming of Subset Norms. CoRR abs/1812.00241 (2018) - 2017
- [j35]Lior Kamma
, Robert Krauthgamer:
Metric Decompositions of Path-Separable Graphs. Algorithmica 79(3): 645-653 (2017) - [j34]Roee David, Elazar Goldenberg, Robert Krauthgamer
:
Local reconstruction of low-rank matrices and subspaces. Random Struct. Algorithms 51(4): 607-630 (2017) - [j33]Arnold Filtser, Robert Krauthgamer:
Sparsification of Two-Variable Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31(2): 1263-1276 (2017) - [j32]Lee-Ad Gottlieb
, Aryeh Kontorovich
, Robert Krauthgamer:
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. IEEE Trans. Inf. Theory 63(8): 4838-4849 (2017) - [c69]Robert Krauthgamer, Ohad Trabelsi:
Conditional Lower Bounds for All-Pairs Max-Flow. ICALP 2017: 20:1-20:13 - [c68]Jaroslaw Blasiok
, Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer
, Lin F. Yang
:
Streaming symmetric norms via measure concentration. STOC 2017: 716-729 - [i39]Robert Krauthgamer, Ohad Trabelsi:
Conditional Lower Bounds for All-Pairs Max-Flow. CoRR abs/1702.05805 (2017) - [i38]Robert Krauthgamer, Inbal Rika:
Refined Vertex Sparsifiers of Planar Graphs. CoRR abs/1702.05951 (2017) - [i37]Robert Krauthgamer, Ohad Trabelsi:
Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern. CoRR abs/1708.07591 (2017) - [i36]Robert Krauthgamer, Ohad Trabelsi:
Revisiting the Set Cover Conjecture. CoRR abs/1711.08041 (2017) - 2016
- [j31]Yair Bartal, Lee-Ad Gottlieb
, Robert Krauthgamer
:
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. SIAM J. Comput. 45(4): 1563-1581 (2016) - [j30]Robert Krauthgamer, Tal Wagner:
Cheeger-Type Approximation for Sparsest st-Cut. ACM Trans. Algorithms 13(1): 14:1-14:21 (2016) - [j29]Lee-Ad Gottlieb
, Aryeh Kontorovich, Robert Krauthgamer:
Adaptive metric dimensionality reduction. Theor. Comput. Sci. 620: 105-118 (2016) - [c67]Tsvi Kopelowitz, Robert Krauthgamer:
Color-Distance Oracles and Snippets. CPM 2016: 24:1-24:10 - [c66]Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin
, David P. Woodruff, Qin Zhang
:
On Sketching Quadratic Forms. ITCS 2016: 311-319 - [c65]Rajesh Chitnis
, Lior Kamma, Robert Krauthgamer
:
Tight Bounds for Gomory-Hu-like Cut Counting. WG 2016: 133-144 - [e1]Robert Krauthgamer:
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. SIAM 2016, ISBN 978-1-61197-433-1 [contents] - [r2]Robert Krauthgamer:
Minimum Bisection. Encyclopedia of Algorithms 2016: 1294-1297 - [i35]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang:
Sketches for Matrix Norms: Faster, Smaller and More General. CoRR abs/1609.05885 (2016) - 2015
- [j28]Lee-Ad Gottlieb
, Robert Krauthgamer:
A Nonlinear Approach to Dimension Reduction. Discret. Comput. Geom. 54(2): 291-315 (2015) - [j27]Lior Kamma, Robert Krauthgamer
, Huy L. Nguyen:
Cutting Corners Cheaply, or How to Remove Steiner Points. SIAM J. Comput. 44(4): 975-995 (2015) - [c64]Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder:
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM 2015: 20-42 - [c63]