Approximating survivable networks with minimum number of steiner points. - Lior Kamma; Zeev Nutov (Networks, 2012)

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

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

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

Fully Understanding The Hashing Trick. - Lior Kamma; Casper Benjamin Freksen; Kasper Green Larsen (NeurIPS, 2018)

Tight cell probe bounds for succinct Boolean matrix-vector multiplication. - Diptarka Chakraborty; Lior Kamma; Kasper Green Larsen (STOC, 2018)

Nearly Optimal Time Bounds for kPath in Hypergraphs. - Lior Kamma; Ohad Trabelsi (CoRR, 2018)

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

Lower Bounds for Multiplication via Network Coding. - Peyman Afshani; Casper Benjamin Freksen; Lior Kamma; Kasper Green Larsen (ICALP, 2019)

Margin-Based Generalization Lower Bounds for Boosted Classifiers. - Allan Grønlund; Lior Kamma; Kasper Green Larsen; Alexander Mathiasen; Jelani Nelson (NeurIPS, 2019)

Near-Tight Margin-Based Generalization Bounds for Support Vector Machines. - Allan Grønlund; Lior Kamma; Kasper Green Larsen (ICML, 2020)

Margins are Insufficient for Explaining Gradient Boosting. - Allan Grønlund; Lior Kamma; Kasper Green Larsen (NeurIPS, 2020)

Sparse Dimensionality Reduction Revisited. - Mikael Møller Høgsgaard; Lior Kamma; Kasper Green Larsen; Jelani Nelson; Chris Schwiegelshohn (ICML, 2024)

A Contraction Tree SAT Encoding for Computing Twin-Width. - Yinon Horev; Shiraz Shay; Sarel Cohen; Tobias Friedrich 001; Davis Issac; Lior Kamma; Aikaterini Niklanovits; Kirill Simonov (PAKDD (2), 2024)

A New Approach for Approximating Directed Rooted Networks. - Sarel Cohen; Lior Kamma; Aikaterini Niklanovits (WG, 2024)