Andreas S. Schulz

4.3k total citations
61 papers, 1.9k citations indexed

About

Andreas S. Schulz is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Andreas S. Schulz has authored 61 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Industrial and Manufacturing Engineering, 26 papers in Computer Networks and Communications and 19 papers in Computational Theory and Mathematics. Recurrent topics in Andreas S. Schulz's work include Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (20 papers) and Optimization and Packing Problems (16 papers). Andreas S. Schulz is often cited by papers focused on Scheduling and Optimization Algorithms (22 papers), Optimization and Search Problems (20 papers) and Optimization and Packing Problems (16 papers). Andreas S. Schulz collaborates with scholars based in United States, Germany and Chile. Andreas S. Schulz's co-authors include Nicolás E. Stier‐Moses, José Correa, Rolf H. Möhring, David B. Shmoys, Joel Wein, L. A. Hall, Maurice Queyranne, Martin Skutella, Marc Uetz and Frederik Stork and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Management Science and Operations Research.

In The Last Decade

Andreas S. Schulz

59 papers receiving 1.8k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Andreas S. Schulz United States	22	854	808	568	301	260	61	1.9k
Martin Skutella Germany	23	816 1.0×	899 1.1×	267 0.5×	239 0.8×	99 0.4×	94	1.8k
Rolf H. Möhring Germany	25	1.7k 2.0×	521 0.6×	1.6k 2.8×	243 0.8×	85 0.3×	64	3.0k
Arie Tamir Israel	28	1.0k 1.2×	680 0.8×	345 0.6×	171 0.6×	158 0.6×	119	2.7k
Eitan Zemel United States	23	892 1.0×	506 0.6×	730 1.3×	65 0.2×	473 1.8×	47	2.3k
Ulrich Pferschy Austria	25	1.4k 1.6×	1.2k 1.5×	356 0.6×	55 0.2×	103 0.4×	100	2.9k
M. R. Rao United States	27	901 1.1×	306 0.4×	259 0.5×	101 0.3×	142 0.5×	69	2.2k
N.M. van Dijk Netherlands	22	318 0.4×	336 0.4×	393 0.7×	276 0.9×	75 0.3×	124	1.7k
Maria Grazia Scutellà Italy	19	704 0.8×	286 0.4×	266 0.5×	130 0.4×	33 0.1×	74	1.4k
Laura Wynter United States	16	199 0.2×	371 0.5×	276 0.5×	823 2.7×	121 0.5×	68	1.9k
Y.P. Aneja Canada	20	951 1.1×	285 0.4×	168 0.3×	152 0.5×	43 0.2×	97	1.7k

Countries citing papers authored by Andreas S. Schulz

Since Specialization

Citations

This map shows the geographic impact of Andreas S. Schulz'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 Andreas S. Schulz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas S. Schulz more than expected).

Fields of papers citing papers by Andreas S. Schulz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andreas S. Schulz. 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 Andreas S. Schulz. The network helps show where Andreas S. Schulz may publish in the future.

Co-authorship network of co-authors of Andreas S. Schulz

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas S. Schulz. A scholar is included among the top collaborators of Andreas S. Schulz 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 Andreas S. Schulz. Andreas S. Schulz 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

Schulz, Andreas S., et al.. (2022). Integer Factorization: Why Two-Item Joint Replenishment Is Hard. Operations Research. 72(3). 1192–1202. 3 indexed citations

Minner, Stefan, et al.. (2021). The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems. Transportation Science. 55(6). 1232–1259. 8 indexed citations

Schulz, Andreas S., et al.. (2018). An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games. arXiv (Cornell University). 1 indexed citations

Schulz, Andreas S. & Dorothea Wagner. (2014). Algorithms -- ESA 2014 : 22nd annual European Symposium, Wroclaw, Poland, September 8-10, 2014 : proceedings. Springer eBooks.

Schulz, Andreas S. & Nelson A. Uhan. (2013). Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optimization. 10(2). 163–180.

Schulz, Andreas S., et al.. (2012). The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope. Mathematics of Operations Research. 38(1). 63–91. 7 indexed citations

Schulz, Andreas S., et al.. (2011). Approximation algorithms and hardness results for the joint replenishment Problepm with constant demands. 5 indexed citations

Schulz, Andreas S., et al.. (2009). Integer equal flows. Operations Research Letters. 37(4). 245–249. 7 indexed citations

Queyranne, Maurice & Andreas S. Schulz. (2008). Polyhedral Approaches to Machine Scheduling. 108(4). 67 indexed citations

10.

Immorlica, Nicole, Li Li, Vahab Mirrokni, & Andreas S. Schulz. (2008). Coordination mechanisms for selfish scheduling. Theoretical Computer Science. 410(17). 1589–1598. 83 indexed citations

11.

Schulz, Andreas S.. (2005). New Old Algorithms for Stochastic Scheduling. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 5 indexed citations

12.

Correa, José, Andreas S. Schulz, & Nicolás E. Stier‐Moses. (2004). Selfish Routing in Capacitated Networks. RePEc: Research Papers in Economics. 5 indexed citations

13.

Correa, José, Andreas S. Schulz, & Nicolás E. Stier‐Moses. (2004). Selfish Routing in Capacitated Networks. Mathematics of Operations Research. 29(4). 961–976. 250 indexed citations

14.

Orlin, James B., Abraham P. Punnen, & Andreas S. Schulz. (2004). Approximate Local Search in Combinatorial Optimization. SIAM Journal on Computing. 33(5). 1201–1214. 37 indexed citations

15.

Orlin, James B., Abraham P. Punnen, & Andreas S. Schulz. (2003). Approximate Local Search in Combinatorial Optimization. SSRN Electronic Journal. 1 indexed citations

16.

Goemans, Michel X., Maurice Queyranne, Andreas S. Schulz, Martin Skutella, & Yaoguang Wang. (2002). Single Machine Scheduling with Release Dates. SIAM Journal on Discrete Mathematics. 15(2). 165–192. 88 indexed citations

17.

Bockmayr, Alexander, Friedrich Eisenbrand, Mark Hartmann, & Andreas S. Schulz. (1999). On the Chvátal rank of polytopes in the 0/1 cube. Discrete Applied Mathematics. 98(1-2). 21–27. 19 indexed citations

18.

Schräder, Rainer, et al.. (1998). Base polytopes of series—parallel posets: Linear description and optimization. Mathematical Programming. 82(1-2). 159–173. 1 indexed citations

19.

Schulz, Andreas S., et al.. (1997). Facets of the generalized permutahedron of a poset. Discrete Applied Mathematics. 72(1-2). 179–192. 4 indexed citations

20.

Schulz, Andreas S.. (1995). The permutahedron of series-parallel posets. Discrete Applied Mathematics. 57(1). 85–90. 6 indexed citations

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