Roy Schwartz

1.8k total citations
31 papers, 775 citations indexed

About

Roy Schwartz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Roy Schwartz has authored 31 papers receiving a total of 775 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Roy Schwartz's work include Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (10 papers). Roy Schwartz is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (10 papers). Roy Schwartz collaborates with scholars based in Israel, United States and United Kingdom. Roy Schwartz's co-authors include Joseph Naor, Moran Feldman, Niv Buchbinder, Ishai Menache, Srikanth Kandula, Robert Krauthgamer, Prasad Raghavendra, Nikhil Bansal, Mohit Singh and Viswanath Nagarajan and has published in prestigious journals such as ACM SIGCOMM Computer Communication Review, SIAM Journal on Computing and Mathematics of Operations Research.

In The Last Decade

Roy Schwartz

29 papers receiving 747 citations

Peers

Roy Schwartz

CNC

CTM

AI

IS

EEE

Giorgio Gambosi Italy

Debmalya Panigrahi United States

Jittat Fakcharoenphol Thailand

Harald Räcke United States

Hadas Shachnai Israel

Jeffery Westbrook United States

Kazuhisa Makino Japan

Fabrizio Grandoni Switzerland

Ola Svensson Switzerland

Boaz Patt-Shamir Israel

Giorgio Gambosi Italy

Roy Schwartz

362 ×0.9

CNC

322 ×1.0

CTM

226 ×0.9

AI

115 ×0.9

IS

71 ×0.6

EEE

Citations per year, relative to Roy Schwartz Roy Schwartz (= 1×) peers Giorgio Gambosi

Countries citing papers authored by Roy Schwartz

Since Specialization

Citations

This map shows the geographic impact of Roy Schwartz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Roy Schwartz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roy Schwartz more than expected).

Fields of papers citing papers by Roy Schwartz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Roy Schwartz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Roy Schwartz. The network helps show where Roy Schwartz may publish in the future.

Co-authorship network of co-authors of Roy Schwartz

This figure shows the co-authorship network connecting the top 25 collaborators of Roy Schwartz. A scholar is included among the top collaborators of Roy Schwartz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Roy Schwartz. Roy Schwartz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Bansal, Nikhil, et al.. (2022). Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Transactions on Algorithms. 18(4). 1–50. 1 indexed citations

2.

Buchbinder, Niv, Moran Feldman, & Roy Schwartz. (2019). Online Submodular Maximization with Preemption. ACM Transactions on Algorithms. 15(3). 1–31. 6 indexed citations

3.

Buchbinder, Niv, et al.. (2017). Simplex transformations and the multiway cut problem. Symposium on Discrete Algorithms. 2400–2410. 4 indexed citations

4.

Feldman, Moran, Rohit Khandekar, Baruch Schieber, et al.. (2016). All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Transactions on Algorithms. 12(3). 1–25. 4 indexed citations

5.

Buchbinder, Niv, Moran Feldman, & Roy Schwartz. (2015). Comparing apples and oranges: query tradeoff in submodular maximization. Symposium on Discrete Algorithms. 1149–1168. 5 indexed citations

6.

Krauthgamer, Robert, Joseph Naor, Roy Schwartz, & Kunal Talwar. (2014). Non-uniform graph partitioning. Symposium on Discrete Algorithms. 1229–1243. 3 indexed citations

7.

Kandula, Srikanth, et al.. (2014). Calendaring for wide area networks. 515–526. 118 indexed citations

8.

Bansal, Nikhil, Uriel Feige, Robert Krauthgamer, et al.. (2014). Min-Max Graph Partitioning and Small Set Expansion. SIAM Journal on Computing. 43(2). 872–904. 12 indexed citations

9.

Kandula, Srikanth, et al.. (2014). Calendaring for wide area networks. ACM SIGCOMM Computer Communication Review. 44(4). 515–526. 34 indexed citations

10.

Buchbinder, Niv, Moran Feldman, Joseph Naor, & Roy Schwartz. (2013). Submodular Maximization with Cardinality Constraints. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1433–1452. 64 indexed citations

11.

Buchbinder, Niv, Joseph Naor, & Roy Schwartz. (2013). Simplex partitioning via exponential clocks and the multiway cut problem. 535–544. 12 indexed citations

12.

Karnin, Zohar, Edo Liberty, Shachar Lovett, Roy Schwartz, & Omri Weinstein. (2012). Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. Conference on Learning Theory. 5 indexed citations

13.

Feldman, Moran, Joseph Naor, Roy Schwartz, & Justin Ward. (2012). Improved Approximations for k-Exchange Systems (Extended Abstract). 3 indexed citations

14.

Feldman, Moran, Joseph Naor, & Roy Schwartz. (2011). Improved competitive ratios for submodular secretary problems. 218–229. 13 indexed citations

15.

Feldman, Moran, Joseph Naor, & Roy Schwartz. (2011). Nonmonotone submodular maximization via a structural continuous greedy algorithm (Extended Abstract). 4 indexed citations

16.

Krauthgamer, Robert, Joseph Naor, & Roy Schwartz. (2009). Partitioning Graphs into Balanced Components. 942–949. 33 indexed citations

17.

Krauthgamer, Robert, Joseph Naor, & Roy Schwartz. (2009). Partitioning graphs into balanced components. Symposium on Discrete Algorithms. 942–949. 42 indexed citations

18.

Naor, Joseph & Roy Schwartz. (2005). Balanced metric labeling. 582–591. 6 indexed citations

19.

Naor, Joseph & Roy Schwartz. (2004). The directed circular arrangement problem. Symposium on Discrete Algorithms. 86–95. 1 indexed citations

20.

Tenorio, M.F., et al.. (1990). Adaptive Networks as a Model for Human Speech Development-Cluster Plots. Purdue e-Pubs (Purdue University System).

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact