René Sitters

976 total citations
38 papers, 294 citations indexed

About

René Sitters is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, René Sitters has authored 38 papers receiving a total of 294 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computer Networks and Communications, 22 papers in Industrial and Manufacturing Engineering and 10 papers in Computational Theory and Mathematics. Recurrent topics in René Sitters's work include Optimization and Search Problems (24 papers), Scheduling and Optimization Algorithms (15 papers) and Optimization and Packing Problems (10 papers). René Sitters is often cited by papers focused on Optimization and Search Problems (24 papers), Scheduling and Optimization Algorithms (15 papers) and Optimization and Packing Problems (10 papers). René Sitters collaborates with scholars based in Netherlands, Germany and China. René Sitters's co-authors include Leen Stougie, Khaled Elbassioni, Aleksei V. Fishkin, Jan Karel Lenstra, Alexander Grigoriev, Nabil H. Mustafa, Jiřı́ Sgall, Suzanne van der Ster, Sylvia Boyd and Rajiv Raman and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

René Sitters

32 papers receiving 270 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
René Sitters Netherlands	9	176	145	61	40	35	38	294
Catherine Roucairol France	10	231 1.3×	90 0.6×	28 0.5×	18 0.5×	36 1.0×	21	301
Serafino Cicerone Italy	14	80 0.5×	262 1.8×	133 2.2×	14 0.3×	41 1.2×	60	433
Koji Nonobe Japan	8	363 2.1×	122 0.8×	40 0.7×	22 0.6×	73 2.1×	13	479
Matúš Mihaľák Switzerland	9	66 0.4×	60 0.4×	40 0.7×	31 0.8×	21 0.6×	37	220
Zhaohui Liu China	15	499 2.8×	288 2.0×	32 0.5×	12 0.3×	7 0.2×	52	545
Gianpaolo Oriolo Italy	14	115 0.7×	147 1.0×	193 3.2×	5 0.1×	18 0.5×	34	418
Evangelia Pyrga Germany	6	37 0.2×	57 0.4×	32 0.5×	29 0.7×	39 1.1×	9	228
Irith Ben‐Arroyo Hartman Israel	9	38 0.2×	45 0.3×	128 2.1×	13 0.3×	38 1.1×	23	265
Simone L. Martins Brazil	9	167 0.9×	46 0.3×	47 0.8×	14 0.3×	9 0.3×	14	255
Marc Demange France	12	133 0.8×	124 0.9×	238 3.9×	12 0.3×	54 1.5×	58	403

Countries citing papers authored by René Sitters

Since Specialization

Citations

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

Fields of papers citing papers by René Sitters

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of René Sitters

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

Sitters, René, et al.. (2019). The Chinese deliveryman problem. 4OR. 18(3). 341–356.

Iersel, Leo van, et al.. (2018). A priori TSP in the scenario model. Discrete Applied Mathematics. 250. 331–341. 2 indexed citations

Sitters, René, et al.. (2018). Approximation and complexity of multi-target graph search and the Canadian traveler problem. Theoretical Computer Science. 732. 14–25. 3 indexed citations

Sitters, René. (2016). Approximability of average completion time scheduling on unrelated machines. Mathematical Programming. 161(1-2). 135–158. 7 indexed citations

Elbassioni, Khaled, Rajiv Raman, Saurabh Ray, & René Sitters. (2012). On the complexity of the highway problem. Theoretical Computer Science. 460. 70–77.

Chan, Ho-Leung, Nicole Megow, René Sitters, & Rob van Stee. (2012). A note on sorting buffers offline. Theoretical Computer Science. 423. 11–18. 8 indexed citations

Sitters, René, et al.. (2010). Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. Automation and Remote Control. 71(10). 2093–2101. 2 indexed citations

Elbassioni, Khaled, Rajiv Raman, Saurabh Ray, & René Sitters. (2009). On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. Symposium on Discrete Algorithms. 1210–1219. 7 indexed citations

Sitters, René. (2009). Efficient algorithms for average completion time scheduling. research memorandum. 1 indexed citations

10.

Bodlaender, Hans L., et al.. (2009). On the minimum corridor connection problem and other generalized geometric problems. Computational Geometry. 42(9). 939–951. 15 indexed citations

11.

Elbassioni, Khaled, Rajiv Raman, Saurabh Ray, & René Sitters. (2009). On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. TU/e Research Portal. 1210–1219. 5 indexed citations

12.

Grigoriev, Alexander, et al.. (2008). Optimal pricing of capacitated networks. Networks. 53(1). 79–87. 2 indexed citations

13.

Bartal, Yair, Stefano Leonardi, René Sitters, et al.. (2006). On the value of preemption in scheduling. TU/e Research Portal (Eindhoven University of Technology). 39–48. 6 indexed citations

14.

Bodlaender, Hans L., Alexander Grigoriev, Eelko Penninkx, et al.. (2006). On the minimum corridor connection and other generalized geometric problems. TU/e Research Portal. 135(8). 69–82. 2 indexed citations

15.

Grigoriev, Alexander, et al.. (2006). How to Sell a Graph: Guidelines for Graph Retailers. Lecture notes in computer science. 6001(1). 125–136.

16.

Sitters, René. (2005). Complexity of preemptive minsum scheduling on unrelated parallel machines. Journal of Algorithms. 57(1). 37–48. 7 indexed citations

17.

Elbassioni, Khaled, Aleksei V. Fishkin, Nabil H. Mustafa, & René Sitters. (2005). Approximation Algorithms for Euclidean Group TSP. Lecture notes in computer science. 180(2). 1115–1126. 27 indexed citations

18.

Sitters, René & Leen Stougie. (2003). The general two-server problem. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 200323(1). 65–6. 1 indexed citations

19.

Lenstra, Jan Karel, et al.. (2003). Computer-aided complexity classification of dial-a-ride problems. 200307.

20.

Lu, Xingjian, et al.. (2002). On-line dial-a-ride problems under a restricted information model. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 200207. 1 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