Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Roy Schwartz
2010 – today
- 2013
[c15]Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir: All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24- [c14]Niv Buchbinder, Joseph Naor, Roy Schwartz: Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544
- [c13]
- [i2]Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh: On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013)
- 2012
- [c12]Roy Schwartz, Omri Abend, Ari Rappoport: Learnability-Based Syntactic Annotation Design. COLING 2012: 2405-2422
- [c11]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658
- 2011
- [c10]Roy Schwartz, Omri Abend, Roi Reichart, Ari Rappoport: Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation. ACL 2011: 663-672
- [c9]Moran Feldman, Joseph Naor, Roy Schwartz: Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229
- [c8]Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward: Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798
- [c7]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26
- [c6]Moran Feldman, Joseph Naor, Roy Schwartz: A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579
- [c5]Moran Feldman, Joseph Naor, Roy Schwartz: 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 Transactions on Algorithms 6(3) (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]
- 2004
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:25 CEST by the dblp team