default search action
Roy Schwartz 0002
Person information
- affiliation: Technion, Haifa, Israel
- affiliation (former): Microsoft Research, Redmond, WA, USA
- affiliation (PhD 2012): Technion, Haifa, Israel
Other persons with the same name
- Roy Schwartz 0001
— Hebrew University of Jerusalem, Israel
- Roy Schwartz 0004 — University College London, Institute of Health Informatics, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c37]Nikhil Bansal, Dor Katzelnick, Roy Schwartz:
On Approximating Cutwidth and Pathwidth. FOCS 2024: 713-729 - 2023
- [c36]Amit Ganz, Pranav Nuti, Roy Schwartz:
A Tight Competitive Ratio for Online Submodular Welfare Maximization. ESA 2023: 52:1-52:17 - [c35]Dor Katzelnick, Aditya Pillai
An Improved Approximation Algorithm for the Max-3-Section Problem. ESA 2023: 69:1-69:17 - [c34]Dor Katzelnick, Roy Schwartz:
A Simple Algorithm for Submodular Minimum Linear Ordering. SOSA 2023: 28-35 - [i17]Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh:
An Improved Approximation Algorithm for the Max-3-Section Problem. CoRR abs/2308.03516 (2023) - [i16]Amit Ganz, Pranav Nuti, Roy Schwartz:
A Tight Competitive Ratio for Online Submodular Welfare Maximization. CoRR abs/2308.07746 (2023) - [i15]Nikhil Bansal, Dor Katzelnick, Roy Schwartz:
Almost Logarithmic Approximation for Cutwidth and Pathwidth. CoRR abs/2311.15639 (2023) - 2022
- [j11]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18(4): 33:1-33:50 (2022) - [c33]Roy Schwartz, Roded Zats:
Fair Correlation Clustering in General Graphs. APPROX/RANDOM 2022: 37:1-37:19 - 2021
- [j10]Niv Buchbinder
Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. 46(2): 757-771 (2021) - [j9]Ariel Kulik
A refined analysis of submodular Greedy. Oper. Res. Lett. 49(4): 507-514 (2021) - [c32]Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan:
Fault Tolerant Max-Cut. ICALP 2021: 46:1-46:20 - [c31]Roy Schwartz, Nitzan Tur:
The metric relaxation for 0-extension admits an Ω(log2/3k) gap. STOC 2021: 1601-1614 - [i14]Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2102.12879 (2021) - [i13]Roy Schwartz, Nitzan Tur:
The Metric Relaxation for 0-Extension Admits an Ω(log2/3k) Gap. CoRR abs/2104.11670 (2021) - [i12]Keren Censor-Hillel, Noa Marelly, Roy Schwartz, Tigran Tonoyan:
Fault Tolerant Max-Cut. CoRR abs/2105.01138 (2021) - [i11]Roy Schwartz, Ran Yeheskel:
Graph Balancing with Orientation Costs. CoRR abs/2106.05939 (2021) - 2020
- [c30]Dor Katzelnick, Roy Schwartz:
Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. APPROX-RANDOM 2020: 49:1-49:18 - [c29]Roy Schwartz, Yotam Sharoni:
Approximating Requirement Cut via a Configuration LP. APPROX-RANDOM 2020: 53:1-53:16 - [c28]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA 2020: 854-873 - [i10]Saba Ahmadi, Sainyam Galhotra, Barna Saha, Roy Schwartz:
Fair Correlation Clustering. CoRR abs/2002.03508 (2020)
2010 – 2019
- 2019
- [j8]Niv Buchbinder, Roy Schwartz, Baruch Weizman:
A simple algorithm for the multiway cut problem. Oper. Res. Lett. 47(6): 587-593 (2019) - [j7]Niv Buchbinder, Moran Feldman
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15(3): 30:1-30:31 (2019) - [c27]Roy Schwartz, Ran Yeheskel:
Graph Balancing with Orientation Costs. ESA 2019: 82:1-82:15 - [c26]Roy Schwartz, Mohit Singh, Sina Yazdanbod:
Online and Offline Algorithms for Circuit Switch Scheduling. FSTTCS 2019: 27:1-27:14 - [c25]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. ICALP 2019: 85:1-85:15 - [i9]Roy Schwartz, Mohit Singh, Sina Yazdanbod:
Online and Offline Greedy Algorithms for Routing with Switching Costs. CoRR abs/1905.02800 (2019) - [i8]Saba Ahmadi, Sainyam Galhotra, Samir Khuller, Barna Saha, Roy Schwartz:
Min-Max Correlation Clustering via MultiCut. CoRR abs/1907.00117 (2019) - 2018
- [j6]Niv Buchbinder
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47(4): 1463-1482 (2018) - [c24]Harald Räcke, Roy Schwartz, Richard Stotz:
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. SPAA 2018: 23-32 - [i7]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal:
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. CoRR abs/1804.10947 (2018) - [i6]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR abs/1812.07769 (2018) - 2017
- [j5]Niv Buchbinder
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42(2): 308-329 (2017) - [c23]Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz:
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP 2017: 34:1-34:15 - [c22]Moses Charikar
Local Guarantees in Graph Cuts and Clustering. IPCO 2017: 136-147 - [c21]Niv Buchbinder
Simplex Transformations and the Multiway Cut Problem. SODA 2017: 2400-2410 - [i5]Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. CoRR abs/1704.00355 (2017) - 2016
- [j4]Ron Adany, Moran Feldman
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12(3): 38:1-38:25 (2016) - 2015
- [j3]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [c20]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA 2015: 1149-1168 - [c19]Niv Buchbinder
Online Submodular Maximization with Preemption. SODA 2015: 1202-1216 - [i4]Niv Buchbinder
Online Submodular Maximization with Preemption. CoRR abs/1501.05801 (2015) - 2014
- [j2]Nikhil Bansal, Uriel Feige, Robert Krauthgamer
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [c18]Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh:
Discrepancy Without Partial Colorings. APPROX-RANDOM 2014: 258-273 - [c17]Srikanth Kandula, Ishai Menache, Roy Schwartz, Spandana Raj Babbula:
Calendaring for wide area networks. SIGCOMM 2014: 515-526 - [c16]Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar:
Non-Uniform Graph Partitioning. SODA 2014: 1229-1243 - [c15]Niv Buchbinder
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [i3]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR abs/1410.0773 (2014) - 2013
- [c14]Ron Adany, Moran Feldman
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24 - [c13]Niv Buchbinder
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - [c12]Ravi Kumar, Ronny Lempel, Roy Schwartz, Sergei Vassilvitskii:
Rank quantization. WSDM 2013: 153-162 - [i2]Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh:
On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013) - 2012
- [b1]Roy Schwartz:
Labelings and partitions of graphs. Technion - Israel Institute of Technology, Israel, 2012 - [c11]Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein:
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. COLT 2012: 2.1-2.17 - [c10]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - 2011
- [c9]Moran Feldman
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - [c8]Moran Feldman
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [c7]Nikhil Bansal, Uriel Feige, Robert Krauthgamer
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c6]Moran Feldman
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579 - [c5]Moran Feldman
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) 2011: 342-353 - [i1]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j1]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. ACM Trans. Algorithms 6(3): 47:1-47:22 (2010)
2000 – 2009
- 2009
- [c4]Robert Krauthgamer, Joseph Naor, Roy Schwartz:
Partitioning graphs into balanced components. SODA 2009: 942-949 - 2008
- [c3]Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20 - 2005
- [c2]Joseph Naor, Roy Schwartz:
Balanced metric labeling. STOC 2005: 582-591 - 2004
- [c1]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. SODA 2004: 86-95
Coauthor Index
aka: Joseph (Seffi) Naor
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: