Roy Schwartz - RankMe

68 papers A* 21A 6B 4Journal 29Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. IPCO Yuval Filmus, Roy Schwartz, Alexander V. Smal
2024	A*	`conf`	On Approximating Cutwidth and Pathwidth. FOCS Nikhil Bansal, Dor Katzelnick, Roy Schwartz
2024	J	`jnl`	Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. CoRR Yuval Filmus, Roy Schwartz, Alexander V. Smal
2023	—	`conf`	A Simple Algorithm for Submodular Minimum Linear Ordering. SOSA Dor Katzelnick, Roy Schwartz
2023	A	`conf`	A Tight Competitive Ratio for Online Submodular Welfare Maximization. ESA Amit Ganz, Pranav Nuti, Roy Schwartz
2023	J	`jnl`	A Tight Competitive Ratio for Online Submodular Welfare Maximization. CoRR Amit Ganz, Pranav Nuti, Roy Schwartz
2023	J	`jnl`	Almost Logarithmic Approximation for Cutwidth and Pathwidth. CoRR Nikhil Bansal, Dor Katzelnick, Roy Schwartz
2023	A	`conf`	An Improved Approximation Algorithm for the Max-3-Section Problem. ESA Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh
2023	J	`jnl`	An Improved Approximation Algorithm for the Max-3-Section Problem. CoRR Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh
2022	A	`conf`	Fair Correlation Clustering in General Graphs. APPROX/RANDOM Roy Schwartz, Roded Zats
2022	J	`jnl`	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
2021	J	`jnl`	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	J	`jnl`	A refined analysis of submodular Greedy. Oper. Res. Lett. Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	A*	`conf`	Fault Tolerant Max-Cut. ICALP Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
2021	J	`jnl`	Fault Tolerant Max-Cut. CoRR Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan
2021	J	`jnl`	Graph Balancing with Orientation Costs. CoRR Roy Schwartz, Ran Yeheskel
2021	J	`jnl`	Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. Niv Buchbinder, Roy Schwartz, Baruch Weizman
2021	J	`jnl`	The Metric Relaxation for 0-Extension Admits an Ω(log CoRR Roy Schwartz, Nitzan Tur
2021	A*	`conf`	The metric relaxation for STOC Roy Schwartz, Nitzan Tur
2020	—	`conf`	Approximating Requirement Cut via a Configuration LP. APPROX-RANDOM Roy Schwartz, Yotam Sharoni
2020	J	`jnl`	Fair Correlation Clustering. CoRR Saba Ahmadi, Sainyam Galhotra, Barna Saha, Roy Schwartz
2020	—	`conf`	Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. APPROX-RANDOM Dor Katzelnick, Roy Schwartz
2020	A*	`conf`	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
2019	A*	`conf`	A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. ICALP Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
2019	J	`jnl`	A simple algorithm for the multiway cut problem. Oper. Res. Lett. Niv Buchbinder, Roy Schwartz, Baruch Weizman
2019	A	`conf`	Graph Balancing with Orientation Costs. ESA Roy Schwartz, Ran Yeheskel
2019	J	`jnl`	Min-Max Correlation Clustering via MultiCut. CoRR Saba Ahmadi, Sainyam Galhotra, Samir Khuller, Barna Saha, Roy Schwartz
2019	J	`jnl`	Online Submodular Maximization with Preemption. ACM Trans. Algorithms Niv Buchbinder, Moran Feldman, Roy Schwartz
2019	—	`conf`	Online and Offline Algorithms for Circuit Switch Scheduling. FSTTCS Roy Schwartz, Mohit Singh, Sina Yazdanbod
2019	J	`jnl`	Online and Offline Greedy Algorithms for Routing with Switching Costs. CoRR Roy Schwartz, Mohit Singh, Sina Yazdanbod
2018	J	`jnl`	A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. CoRR Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
2018	J	`jnl`	Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz
2018	J	`jnl`	Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh
2018	B	`conf`	Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. SPAA Harald Räcke, Roy Schwartz, Richard Stotz
2017	J	`jnl`	Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. Niv Buchbinder, Moran Feldman, Roy Schwartz
2017	A*	`conf`	Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz
2017	B	`conf`	Local Guarantees in Graph Cuts and Clustering. IPCO Moses Charikar, Neha Gupta, Roy Schwartz
2017	J	`jnl`	Local Guarantees in Graph Cuts and Clustering. CoRR Moses Charikar, Neha Gupta, Roy Schwartz
2017	A*	`conf`	Simplex Transformations and the Multiway Cut Problem. SODA Niv Buchbinder, Roy Schwartz, Baruch Weizman
2016	J	`jnl`	All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2015	J	`jnl`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2015	A*	`conf`	Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA Niv Buchbinder, Moran Feldman, Roy Schwartz
2015	A*	`conf`	Online Submodular Maximization with Preemption. SODA Niv Buchbinder, Moran Feldman, Roy Schwartz
2015	J	`jnl`	Online Submodular Maximization with Preemption. CoRR Niv Buchbinder, Moran Feldman, Roy Schwartz
2014	A*	`conf`	Calendaring for wide area networks. SIGCOMM Srikanth Kandula, Ishai Menache, Roy Schwartz, Spandana Raj Babbula
2014	J	`jnl`	Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR Niv Buchbinder, Moran Feldman, Roy Schwartz
2014	—	`conf`	Discrepancy Without Partial Colorings. APPROX-RANDOM Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh
2014	J	`jnl`	Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2014	A*	`conf`	Non-Uniform Graph Partitioning. SODA Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar
2014	A*	`conf`	Submodular Maximization with Cardinality Constraints. SODA Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2013	B	`conf`	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2013	J	`jnl`	On the Approximation of Submodular Functions CoRR Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh
2013	A	`conf`	Rank quantization. WSDM Ravi Kumar, Ronny Lempel, Roy Schwartz, Sergei Vassilvitskii
2013	A*	`conf`	Simplex partitioning via exponential clocks and the multiway cut problem. STOC Niv Buchbinder, Joseph Naor, Roy Schwartz
2012	A*	`conf`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2012	—	`—`	Labelings and partitions of graphs. Roy Schwartz
2012	A*	`conf`	Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. COLT Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein
2011	A*	`conf`	A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS Moran Feldman, Joseph Naor, Roy Schwartz
2011	A	`conf`	Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward
2011	—	`conf`	Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM Moran Feldman, Joseph Naor, Roy Schwartz
2011	J	`jnl`	Min-Max Graph Partitioning and Small Set Expansion CoRR Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2011	A*	`conf`	Min-max Graph Partitioning and Small Set Expansion. FOCS Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2011	—	`conf`	Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) Moran Feldman, Joseph Naor, Roy Schwartz
2010	J	`jnl`	The directed circular arrangement problem. ACM Trans. Algorithms Joseph Naor, Roy Schwartz
2009	A*	`conf`	Partitioning graphs into balanced components. SODA Robert Krauthgamer, Joseph Naor, Roy Schwartz
2008	A*	`conf`	Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz
2005	A*	`conf`	Balanced metric labeling. STOC Joseph Naor, Roy Schwartz
2004	A*	`conf`	The directed circular arrangement problem. SODA Joseph Naor, Roy Schwartz