Balanced metric labeling. - Joseph Naor; Roy Schwartz 002 (STOC, 2005)

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. - Rajsekar Manokaran; Joseph Naor; Prasad Raghavendra; Roy Schwartz 002 (STOC, 2008)

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

The directed circular arrangement problem. - Joseph Naor; Roy Schwartz 002 (ACM Trans. Algorithms, 2010)

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002 (APPROX-RANDOM, 2011)

Improved Approximations for k-Exchange Systems - (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002; Justin Ward (ESA, 2011)

A Unified Continuous Greedy Algorithm for Submodular Maximization. - Moran Feldman; Joseph Naor; Roy Schwartz 002 (FOCS, 2011)

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). - Moran Feldman; Joseph Naor; Roy Schwartz 002 (ICALP (1), 2011)

Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. - Zohar Shay Karnin; Edo Liberty; Shachar Lovett; Roy Schwartz 002; Omri Weinstein (COLT, 2012)

Labelings and partitions of graphs. - Roy Schwartz 002 (2012)

Rank quantization. - Ravi Kumar 001; Ronny Lempel; Roy Schwartz 002; Sergei Vassilvitskii (WSDM, 2013)

On the Approximation of Submodular Functions - Nikhil R. Devanur; Shaddin Dughmi; Roy Schwartz 002; Ankit Sharma 001; Mohit Singh (CoRR, 2013)

Discrepancy Without Partial Colorings. - Nicholas J. A. Harvey; Roy Schwartz 002; Mohit Singh (APPROX-RANDOM, 2014)

Calendaring for wide area networks. - Srikanth Kandula; Ishai Menache; Roy Schwartz 002; Spandana Raj Babbula (SIGCOMM, 2014)

Submodular Maximization with Cardinality Constraints. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SODA, 2014)

Non-Uniform Graph Partitioning. - Robert Krauthgamer; Joseph Naor; Roy Schwartz 002; Kunal Talwar (SODA, 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)

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (SODA, 2015)

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2015)

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. - Ron Adany; Moran Feldman; Elad Haramaty; Rohit Khandekar; Baruch Schieber; Roy Schwartz 002; Hadas Shachnai; Tami Tamir (ACM Trans. Algorithms, 2016)

Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. - Shahar Chen; Dotan Di Castro; Zohar S. Karnin; Liane Lewin-Eytan; Joseph (Seffi) Naor; Roy Schwartz 002 (ICALP, 2017)

Local Guarantees in Graph Cuts and Clustering. - Moses Charikar; Neha Gupta 002; Roy Schwartz 002 (IPCO, 2017)

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (Math. Oper. Res., 2017)

Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. - Harald Räcke; Roy Schwartz 002; Richard Stotz (SPAA, 2018)

Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. - Niv Buchbinder; Joseph (Seffi) Naor; Roy Schwartz 002 (SIAM J. Comput., 2018)

Graph Balancing with Orientation Costs. - Roy Schwartz 002; Ran Yeheskel (ESA, 2019)

Online and Offline Algorithms for Circuit Switch Scheduling. - Roy Schwartz 002; Mohit Singh; Sina Yazdanbod (FSTTCS, 2019)

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. - Eyal Mizrachi; Roy Schwartz 002; Joachim Spoerhase; Sumedha Uniyal (ICALP, 2019)

Online and Offline Greedy Algorithms for Routing with Switching Costs. - Roy Schwartz 002; Mohit Singh; Sina Yazdanbod (CoRR, 2019)

Min-Max Correlation Clustering via MultiCut. - Saba Ahmadi; Sainyam Galhotra; Samir Khuller; Barna Saha; Roy Schwartz 002 (CoRR, 2019)

A simple algorithm for the multiway cut problem. - Niv Buchbinder; Roy Schwartz 002; Baruch Weizman (Oper. Res. Lett., 2019)

Online Submodular Maximization with Preemption. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (ACM Trans. Algorithms, 2019)

Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. - Dor Katzelnick; Roy Schwartz 002 (APPROX-RANDOM, 2020)

Approximating Requirement Cut via a Configuration LP. - Roy Schwartz 002; Yotam Sharoni (APPROX-RANDOM, 2020)

Fair Correlation Clustering. - Saba Ahmadi; Sainyam Galhotra; Barna Saha; Roy Schwartz 002 (CoRR, 2020)

Fault Tolerant Max-Cut. - Keren Censor-Hillel; Noa Marelly; Roy Schwartz 002; Tigran Tonoyan (ICALP, 2021)

The metric relaxation for 0-extension admits an Ω(log2/3k) gap. - Roy Schwartz 002; Nitzan Tur (STOC, 2021)

A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. - Ariel Kulik; Roy Schwartz 002; Hadas Shachnai (CoRR, 2021)

The Metric Relaxation for 0-Extension Admits an Ω(log2/3k) Gap. - Roy Schwartz 002; Nitzan Tur (CoRR, 2021)

Simplex Transformations and the Multiway Cut Problem. - Niv Buchbinder; Roy Schwartz 002; Baruch Weizman (Math. Oper. Res., 2021)

A refined analysis of submodular Greedy. - Ariel Kulik; Roy Schwartz 002; Hadas Shachnai (Oper. Res. Lett., 2021)

Fair Correlation Clustering in General Graphs. - Roy Schwartz 002; Roded Zats (APPROX/RANDOM, 2022)

Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. - Sepehr Abbasi Zadeh; Nikhil Bansal 001; Guru Guruganesh; Aleksandar Nikolov; Roy Schwartz 002; Mohit Singh (ACM Trans. Algorithms, 2022)

A Tight Competitive Ratio for Online Submodular Welfare Maximization. - Amit Ganz; Pranav Nuti; Roy Schwartz 002 (ESA, 2023)

An Improved Approximation Algorithm for the Max-3-Section Problem. - Dor Katzelnick; Aditya Pillai; Roy Schwartz 002; Mohit Singh (ESA, 2023)

A Simple Algorithm for Submodular Minimum Linear Ordering. - Dor Katzelnick; Roy Schwartz 002 (SOSA, 2023)

Almost Logarithmic Approximation for Cutwidth and Pathwidth. - Nikhil Bansal 001; Dor Katzelnick; Roy Schwartz 002 (CoRR, 2023)

On Approximating Cutwidth and Pathwidth. - Nikhil Bansal 001; Dor Katzelnick; Roy Schwartz 002 (FOCS, 2024)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. - Yuval Filmus; Roy Schwartz 002; Alexander V. Smal (IPCO, 2025)