Stereoscopic families of permutations, and their applications. - Uriel Feige; Robert Krauthgamer (ISTCS, 1997)

Improved classification via connectivity information. - Andrei Z. Broder; Robert Krauthgamer; Michael Mitzenmacher (SODA, 2000)

Approximating the minimum bisection size (extended abstract). - Uriel Feige; Robert Krauthgamer; Kobbi Nissim (STOC, 2000)

Networks on Which Hot-Potato Routing Does Not Livelock. - Uriel Feige; Robert Krauthgamer (Distributed Comput., 2000)

Finding and certifying a large hidden clique in a semirandom graph. - Uriel Feige; Robert Krauthgamer (Random Struct. Algorithms, 2000)

Private approximation of NP-hard functions. - Shai Halevi; Robert Krauthgamer; Eyal Kushilevitz; Kobbi Nissim (STOC, 2001)

Online server allocation in a server farm via benefit task systems. - T. S. Jayram; Tracy Kimbrel; Robert Krauthgamer; Baruch Schieber; Maxim Sviridenko (STOC, 2001)

On Approximating the Achromatic Number. - Guy Kortsarz; Robert Krauthgamer (SIAM J. Discret. Math., 2001)

A Polylogarithmic Approximation of the Minimum Bisection. - Uriel Feige; Robert Krauthgamer (SIAM J. Comput., 2002)

Bounded Geometries, Fractals, and Low-Distortion Embeddings. - Anupam Gupta 001; Robert Krauthgamer; James R. Lee (FOCS, 2003)

Detecting protein sequence conservation via metric embeddings. - Eran Halperin; Jeremy Buhler; Richard M. Karp; Robert Krauthgamer; Ben Westover (ISMB (Supplement of Bioinformatics), 2003)

Property testing of data dimensionality. - Robert Krauthgamer; Ori Sasson (SODA, 2003)

Constant factor approximation of vertex-cuts in planar graphs. - Eyal Amir; Robert Krauthgamer; Satish Rao (STOC, 2003)

Polylogarithmic inapproximability. - Eran Halperin; Robert Krauthgamer (STOC, 2003)

On Cutting a Few Vertices from a Graph. - Uriel Feige; Robert Krauthgamer; Kobbi Nissim (Discret. Appl. Math., 2003)

Tight lower bounds for the asymmetric k-center problem - Eran Halperin; Guy Kortsarz; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2003)

The Probable Value of the Lovász–Schrijver Relaxations for Maximum Independent Set. - Uriel Feige; Robert Krauthgamer (SIAM J. Comput., 2003)

The Sketching Complexity of Pattern Matching. - Ziv Bar-Yossef; T. S. Jayram; Robert Krauthgamer; Ravi Kumar 001 (APPROX-RANDOM, 2004)

Approximating Edit Distance Efficiently. - Ziv Bar-Yossef; T. S. Jayram; Robert Krauthgamer; Ravi Kumar 001 (FOCS, 2004)

Measured Descent: A New Embedding Method for Finite Metrics. - Robert Krauthgamer; James R. Lee; Manor Mendel; Assaf Naor (FOCS, 2004)

Approximate classification via earthmover metrics. - Aaron Archer; Jittat Fakcharoenphol; Chris Harrelson; Robert Krauthgamer; Kunal Talwar; Éva Tardos (SODA, 2004)

Navigating nets: simple algorithms for proximity search. - Robert Krauthgamer; James R. Lee (SODA, 2004)

Object location in realistic networks. - Kirsten Hildrum; Robert Krauthgamer; John Kubiatowicz (SPAA, 2004)

Metric Embeddings–Beyond One-Dimensional Distortion. - Robert Krauthgamer; Nathan Linial; Avner Magen (Discret. Comput. Geom., 2004)

Hardness of Approximation for Vertex-Connectivity Network Design Problems. - Guy Kortsarz; Robert Krauthgamer; James R. Lee (SIAM J. Comput., 2004)

Asymmetric k-center is log* n-hard to approximate. - Julia Chuzhoy; Sudipto Guha; Eran Halperin; Sanjeev Khanna; Guy Kortsarz; Robert Krauthgamer; Joseph Naor (J. ACM, 2005)

The black-box complexity of nearest-neighbor search. - Robert Krauthgamer; James R. Lee (Theor. Comput. Sci., 2005)

Algorithms on negatively curved spaces. - Robert Krauthgamer; James R. Lee (FOCS, 2006)

Improved lower bounds for embeddings into L1. - Robert Krauthgamer; Yuval Rabani (SODA, 2006)

On the Hardness of Approximating Multicut and Sparsest-Cut. - Shuchi Chawla 001; Robert Krauthgamer; Ravi Kumar 001; Yuval Rabani; D. Sivakumar 001 (Comput. Complex., 2006)

Embedding the Ulam metric into l1. - Moses Charikar; Robert Krauthgamer (Theory Comput., 2006)

The Computational Hardness of Estimating Edit Distance [Extended Abstract]. - Alexandr Andoni; Robert Krauthgamer (FOCS, 2007)

Estimating the sortedness of a data stream. - Parikshit Gopalan; T. S. Jayram; Robert Krauthgamer; Ravi Kumar 001 (SODA, 2007)

On triangulation of simple networks. - Robert Krauthgamer (SPAA, 2007)

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. - Robert Krauthgamer; Aranyak Mehta; Atri Rudra (WAOA, 2007)

The intrinsic dimensionality of graphs. - Robert Krauthgamer; James R. Lee (Comb., 2007)

Earth Mover Distance over High-Dimensional Spaces. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2007)

Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. - Eran Halperin; Guy Kortsarz; Robert Krauthgamer; Aravind Srinivasan; Nan Wang 001 (SIAM J. Comput., 2007)

Greedy List Intersection. - Robert Krauthgamer; Aranyak Mehta; Vijayshankar Raman; Atri Rudra (ICDE, 2008)

Minimum Bisection. - Robert Krauthgamer (Encyclopedia of Algorithms, 2008)

Overcoming the l1 non-embeddability barrier: algorithms for product metrics. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer (SODA, 2009)

Approximate line nearest neighbor in high dimensions. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer; Huy L. Nguyen (SODA, 2009)

Partitioning graphs into balanced components. - Robert Krauthgamer; Joseph Naor; Roy Schwartz 002 (SODA, 2009)

Improved Lower Bounds for Embeddings intoL1$. - Robert Krauthgamer; Yuval Rabani (SIAM J. Comput., 2009)

Approximating Sparsest Cut in Graphs of Bounded Treewidth. - Eden Chlamtac; Robert Krauthgamer; Prasad Raghavendra (APPROX-RANDOM, 2010)

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. - Alexandr Andoni; Robert Krauthgamer; Krzysztof Onak (FOCS, 2010)

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. - Alexandr Andoni; Robert Krauthgamer; Krzysztof Onak (Property Testing, 2010)

Streaming Algorithms from Precision Sampling - Alexandr Andoni; Robert Krauthgamer; Krzysztof Onak (CoRR, 2010)

The Computational Hardness of Estimating Edit Distance. - Alexandr Andoni; Robert Krauthgamer (SIAM J. Comput., 2010)

Streaming Algorithms via Precision Sampling. - Alexandr Andoni; Robert Krauthgamer; Krzysztof Onak (FOCS, 2011)

Fault-tolerant spanners: better and simpler. - Michael Dinitz; Robert Krauthgamer (PODC, 2011)

Directed spanners via flow-based linear programs. - Michael Dinitz; Robert Krauthgamer (STOC, 2011)

How Hard Is It to Approximate the Best Nash Equilibrium? - Elad Hazan; Robert Krauthgamer (SIAM J. Comput., 2011)

Pricing commodities. - Robert Krauthgamer; Aranyak Mehta; Atri Rudra (Theor. Comput. Sci., 2011)

Metric Clustering via Consistent Labeling. - Robert Krauthgamer; Tim Roughgarden (Theory Comput., 2011)

Everywhere-Sparse Spanners via Dense Subgraphs. - Eden Chlamtac; Michael Dinitz; Robert Krauthgamer (FOCS, 2012)

Preserving Terminal Distances Using Minors. - Robert Krauthgamer; Tamar Zondiner (ICALP (1), 2012)

Faster Clustering via Preprocessing - Tsvi Kopelowitz; Robert Krauthgamer (CoRR, 2012)

The smoothed complexity of edit distance. - Alexandr Andoni; Robert Krauthgamer (ACM Trans. Algorithms, 2012)

Mimicking Networks and Succinct Representations of Terminal Cuts. - Robert Krauthgamer; Inbal Rika (SODA, 2013)

Efficient Approximation of Edit Distance. - Robert Krauthgamer (SPIRE, 2013)

Towards (1+ε)-Approximate Flow Sparsifiers. - Alexandr Andoni; Anupam Gupta 001; Robert Krauthgamer (CoRR, 2013)

Proximity Algorithms for Nearly Doubling Spaces. - Lee-Ad Gottlieb; Robert Krauthgamer (SIAM J. Discret. Math., 2013)

Spectral Approaches to Nearest Neighbor Search. - Amirali Abdullah; Alexandr Andoni; Ravindran Kannan; Robert Krauthgamer (FOCS, 2014)

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. - Tsvi Kopelowitz; Robert Krauthgamer; Ely Porat; Shay Solomon (ICALP (2), 2014)

Multiply Balanced k -Partitioning. - Amihood Amir; Jessica Ficler; Robert Krauthgamer; Liam Roditty; Oren Sar Shalom (LATIN, 2014)

Towards (1 + ∊)-Approximate Flow Sparsifiers. - Alexandr Andoni; Anupam Gupta 001; Robert Krauthgamer (SODA, 2014)

Non-Uniform Graph Partitioning. - Robert Krauthgamer; Joseph Naor; Roy Schwartz 002; Kunal Talwar (SODA, 2014)

The Sketching Complexity of Graph Cuts. - Alexandr Andoni; Robert Krauthgamer; David P. Woodruff (CoRR, 2014)

Cheeger-type approximation for sparsest $st$-cut. - Robert Krauthgamer; Tal Wagner (CoRR, 2014)

Min-Max Graph Partitioning and Small Set Expansion. - Nikhil Bansal 001; Uriel Feige; Robert Krauthgamer; Konstantin Makarychev; Viswanath Nagarajan; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2014)

Vertex Sparsifiers: New Results from Old Techniques. - Matthias Englert; Anupam Gupta 001; Robert Krauthgamer; Harald Räcke; Inbal Talgam-Cohen; Kunal Talwar (SIAM J. Comput., 2014)

Preserving Terminal Distances Using Minors. - Robert Krauthgamer; Huy L. Nguyen; Tamar Zondiner (SIAM J. Discret. Math., 2014)

Efficient Classification for Metric Data. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (IEEE Trans. Inf. Theory, 2014)

Approximate Nearest Neighbor Search in Metrics of Planar Graphs. - Ittai Abraham; Shiri Chechik; Robert Krauthgamer; Udi Wieder (APPROX-RANDOM, 2015)

Towards Resistance Sparsifiers. - Michael Dinitz; Robert Krauthgamer; Tal Wagner (APPROX-RANDOM, 2015)

Sketching Cuts in Graphs and Hypergraphs. - Dmitry Kogan; Robert Krauthgamer (ITCS, 2015)

Streaming Symmetric Norms via Measure Concentration. - Vladimir Braverman; Stephen R. Chestnut; Robert Krauthgamer; Lin F. Yang (CoRR, 2015)

Sparsification of Two-Variable Valued CSPs. - Arnold Filtser; Robert Krauthgamer (CoRR, 2015)

A Nonlinear Approach to Dimension Reduction. - Lee-Ad Gottlieb; Robert Krauthgamer (Discret. Comput. Geom., 2015)

Local Reconstruction of Low-Rank Matrices and Subspaces. - Roee David; Elazar Goldenberg; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2015)

Cutting Corners Cheaply, or How to Remove Steiner Points. - Lior Kamma; Robert Krauthgamer; Huy L. Nguyen (SIAM J. Comput., 2015)

Color-Distance Oracles and Snippets. - Tsvi Kopelowitz; Robert Krauthgamer (CPM, 2016)

On Sketching Quadratic Forms. - Alexandr Andoni; Jiecao Chen; Robert Krauthgamer; Bo Qin; David P. Woodruff; Qin Zhang 001 (ITCS, 2016)

Tight Bounds for Gomory-Hu-like Cut Counting. - Rajesh Chitnis; Lior Kamma; Robert Krauthgamer (WG, 2016)

Sketches for Matrix Norms: Faster, Smaller and More General. - Vladimir Braverman; Stephen R. Chestnut; Robert Krauthgamer; Lin F. Yang (CoRR, 2016)

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. - Yair Bartal; Lee-Ad Gottlieb; Robert Krauthgamer (SIAM J. Comput., 2016)

Cheeger-Type Approximation for Sparsest st-Cut. - Robert Krauthgamer; Tal Wagner (ACM Trans. Algorithms, 2016)

Adaptive metric dimensionality reduction. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (Theor. Comput. Sci., 2016)

Minimum Bisection. - Robert Krauthgamer (Encyclopedia of Algorithms, 2016)

Streaming symmetric norms via measure concentration. - Jaroslaw Blasiok; Vladimir Braverman; Stephen R. Chestnut; Robert Krauthgamer; Lin F. Yang (STOC, 2017)

Metric Decompositions of Path-Separable Graphs. - Lior Kamma; Robert Krauthgamer (Algorithmica, 2017)

Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern. - Robert Krauthgamer; Ohad Trabelsi (CoRR, 2017)

Revisiting the Set Cover Conjecture. - Robert Krauthgamer; Ohad Trabelsi (CoRR, 2017)

Sparsification of Two-Variable Valued Constraint Satisfaction Problems. - Arnold Filtser; Robert Krauthgamer (SIAM J. Discret. Math., 2017)

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension. - Lee-Ad Gottlieb; Aryeh Kontorovich; Robert Krauthgamer (IEEE Trans. Inf. Theory, 2017)

Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. - Vladimir Braverman; Stephen R. Chestnut; Robert Krauthgamer; Yi Li 002; David P. Woodruff; Lin F. Yang (ICML, 2018)

Batch Sparse Recovery, or How to Leverage the Average Sparsity. - Alexandr Andoni; Lior Kamma; Robert Krauthgamer; Eric Price 001 (CoRR, 2018)

Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (CoRR, 2018)

Report on HALG 2018. - Artur Czumaj; Robert Krauthgamer (Bull. EATCS, 2018)

Sketching and Embedding are Equivalent for Norms. - Alexandr Andoni; Robert Krauthgamer; Ilya P. Razenshteyn (SIAM J. Comput., 2018)

3rd Highlights of Algorithms (HALG 2018). - Artur Czumaj; Robert Krauthgamer (SIGACT News, 2018)

Conditional Lower Bounds for All-Pairs Max-Flow. - Robert Krauthgamer; Ohad Trabelsi (ACM Trans. Algorithms, 2018)

Sublinear Algorithms for Gap Edit Distance. - Elazar Goldenberg; Robert Krauthgamer; Barna Saha (FOCS, 2019)

Faster Algorithms for All-Pairs Bounded Min-Cuts. - Amir Abboud; Loukas Georgiadis; Giuseppe F. Italiano; Robert Krauthgamer; Nikos Parotsidis; Ohad Trabelsi; Przemyslaw Uznanski; Daniel Wolleb-Graf (ICALP, 2019)

Coresets for Ordered Weighted Clustering. - Vladimir Braverman; Shaofeng H.-C. Jiang; Robert Krauthgamer; Xuan Wu 002 (ICML, 2019)

On Solving Linear Systems in Sublinear Time. - Alexandr Andoni; Robert Krauthgamer; Yosef Pogrow (ITCS, 2019)

Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (SOSA, 2019)

Flow-Cut Gaps and Face Covers in Planar Graphs. - Robert Krauthgamer; James R. Lee; Havana Rika (SODA, 2019)

The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. - Robert Krauthgamer; Ohad Trabelsi (STACS, 2019)

Coresets for Clustering in Graphs of Bounded Treewidth. - Vladimir Braverman; Lingxiao Huang; Shaofeng H.-C. Jiang; Robert Krauthgamer; Xuan Wu 002 (CoRR, 2019)

Cut-Equivalent Trees are Optimal for Min-Cut Queries. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (FOCS, 2020)

Sketching Graphs and Combinatorial Optimization (Invited Talk). - Robert Krauthgamer (ICALP, 2020)

Coresets for Clustering in Graphs of Bounded Treewidth. - Daniel N. Baker; Vladimir Braverman; Lingxiao Huang; Shaofeng H.-C. Jiang; Robert Krauthgamer; Xuan Wu 002 (ICML, 2020)

Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension. - Vladimir Braverman; Robert Krauthgamer; Aditya Krishnan 001; Roi Sinoff (ICML, 2020)

Labelings vs. Embeddings: On Distributed Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (SODA, 2020)

Faster Algorithms for Orienteering and k-TSP. - Lee-Ad Gottlieb; Robert Krauthgamer; Havana Rika (CoRR, 2020)

Refined Vertex Sparsifiers of Planar Graphs. - Robert Krauthgamer; Havana Rika (SIAM J. Discret. Math., 2020)

Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. - Vladimir Braverman; Robert Krauthgamer; Aditya Krishnan 001; Shay Sapir (COLT, 2021)

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (FOCS, 2021)

Spectral Hypergraph Sparsifiers of Nearly Linear Size. - Michael Kapralov; Robert Krauthgamer; Jakab Tardos; Yuichi Yoshida (FOCS, 2021)

Approximate Trace Reconstruction via Median String (In Average-Case). - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (FSTTCS, 2021)

Coresets for Clustering with Missing Values. - Vladimir Braverman; Shaofeng H.-C. Jiang; Robert Krauthgamer; Xuan Wu 002 (NeurIPS, 2021)

Coresets for Clustering in Excluded-minor Graphs and Beyond. - Vladimir Braverman; Shaofeng H.-C. Jiang; Robert Krauthgamer; Xuan Wu 002 (SODA, 2021)

Approximating the Median under the Ulam Metric. - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (SODA, 2021)

Subcubic algorithms for Gomory-Hu tree in unweighted graphs. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (STOC, 2021)

Towards tight bounds for spectral sparsification of hypergraphs. - Michael Kapralov; Robert Krauthgamer; Jakab Tardos; Yuichi Yoshida (STOC, 2021)

Sparse Normal Means Estimation with Sublinear Communication. - Chen Amiraz; Robert Krauthgamer; Boaz Nadler (CoRR, 2021)

Gomory-Hu Tree in Subcubic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (CoRR, 2021)

Flow Metrics on Graphs. - Lior Kalman; Robert Krauthgamer (CoRR, 2021)

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (Adv. Math. Commun., 2021)

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (FOCS, 2022)

The Power of Uniform Sampling for Coresets. - Vladimir Braverman; Vincent Cohen-Addad; Shaofeng H.-C. Jiang; Robert Krauthgamer; Chris Schwiegelshohn; Mads Bech Toftrup; Xuan Wu 002 (FOCS, 2022)

Streaming Facility Location in High Dimension via Geometric Hashing. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001; Mingwei Yang 002 (FOCS, 2022)

Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (FOCS, 2022)

Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (SODA, 2022)

Almost-linear ε-emulators for planar graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (STOC, 2022)

Almost-Smooth Histograms and Sliding-Window Graph Algorithms. - Robert Krauthgamer; David Reitblat (Algorithmica, 2022)

Streaming Facility Location in High Dimension via New Geometric Hashing. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001; Mingwei Yang 002 (CoRR, 2022)

Near-Linear ε-Emulators for Planar Graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (CoRR, 2022)

Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. - Itai Boneh; Robert Krauthgamer (CoRR, 2022)

Distributed Sparse Linear Regression with Sublinear Communication. - Chen Amiraz; Robert Krauthgamer; Boaz Nadler (CoRR, 2022)

Smoothness of Schatten norms and sliding-window matrix streams. - Robert Krauthgamer; Shay Sapir (Inf. Process. Lett., 2022)

Faster algorithms for orienteering and k-TSP. - Lee-Ad Gottlieb; Robert Krauthgamer; Havana Rika (Theor. Comput. Sci., 2022)

Universal Streaming of Subset Norms. - Vladimir Braverman; Robert Krauthgamer; Lin F. Yang (Adv. Math. Commun., 2022)

Lower Bounds for Pseudo-Deterministic Counting in a Stream. - Vladimir Braverman; Robert Krauthgamer; Aditya Krishnan 001; Shay Sapir (ICALP, 2023)

Clustering Permutations: New Techniques with Streaming Applications. - Diptarka Chakraborty; Debarati Das 001; Robert Krauthgamer (ITCS, 2023)

An Algorithmic Bridge Between Hamming and Levenshtein Distances. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (ITCS, 2023)

Exact Flow Sparsification Requires Unbounded Size. - Robert Krauthgamer; Ron Mosenzon (SODA, 2023)

Streaming Euclidean Max-Cut: Dimension vs Data Reduction. - Xiaoyu Chen; Shaofeng H.-C. Jiang; Robert Krauthgamer (STOC, 2023)

Comparison of Matrix Norm Sparsification. - Robert Krauthgamer; Shay Sapir (Algorithmica, 2023)

Recovery Guarantees for Distributed-OMP. - Chen Amiraz; Robert Krauthgamer; Boaz Nadler (AISTATS, 2024)

Moderate Dimension Reduction for k-Center Clustering. - Shaofeng H.-C. Jiang; Robert Krauthgamer; Shay Sapir (SoCG, 2024)

Fully-Scalable MPC Algorithms for Clustering in High Dimension. - Artur Czumaj; Guichen Gao; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001 (ICALP, 2024)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs. - Yotam Kenneth; Robert Krauthgamer (ICALP, 2024)

Labelings vs. Embeddings: On Distributed and Prioritized Representations of Distances. - Arnold Filtser; Lee-Ad Gottlieb; Robert Krauthgamer (Discret. Comput. Geom., 2024)

Coresets for kernel clustering. - Shaofeng H.-C. Jiang; Robert Krauthgamer; Jianing Lou; Yubo Zhang (Mach. Learn., 2024)

Streaming Algorithms for Geometric Steiner Forest. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

Lipschitz Decompositions of Finite 𝓁p Metrics. - Robert Krauthgamer; Nir Petruschka (SoCG, 2025)

Coresets for 1-Center in 𝓁₁ Metrics. - Amir Carmel; Chengzhi Guo; Shaofeng H.-C. Jiang; Robert Krauthgamer (ITCS, 2025)

Near-Optimal Dimension Reduction for Facility Location. - Lingxiao Huang; Shaofeng H.-C. Jiang; Robert Krauthgamer; Di Yue (STOC, 2025)

The Power of Recursive Embeddings for ℓp Metrics. - Robert Krauthgamer; Nir Petruschka; Shay Sapir (CoRR, 2025)

Cut-Query Algorithms with Few Rounds. - Yotam Kenneth-Mordoch; Robert Krauthgamer (CoRR, 2025)

Simple Algorithms for Fully Dynamic Edge Connectivity. - Yotam Kenneth-Mordoch; Robert Krauthgamer (CoRR, 2025)