default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Sitters
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c27]Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese:
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS 2023: 86:1-86:15- 2021
- [j26]René Sitters
:
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems. SIAM J. Comput. 50(5): 1580-1602 (2021) - 2020
- [j25]Martijn van Ee, René Sitters:
The Chinese deliveryman problem. 4OR 18(3): 341-356 (2020)
2010 – 2019
- 2019
- [c26]Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie:
Fixed-Order Scheduling on Parallel Machines. IPCO 2019: 88-100 - 2018
- [j24]Martijn van Ee, René Sitters:
The A Priori Traveling Repairman Problem. Algorithmica 80(10): 2818-2833 (2018) - [j23]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the scenario model. Discret. Appl. Math. 250: 331-341 (2018) - [j22]René Sitters, Liya Yang:
A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. Oper. Res. Lett. 46(4): 438-442 (2018) - [j21]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. J. Sched. 21(3): 305-312 (2018) - [j20]Martijn van Ee, René Sitters:
Approximation and complexity of multi-target graph search and the Canadian traveler problem. Theor. Comput. Sci. 732: 14-25 (2018) - [c25]Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. WAOA 2018: 310-326 - 2017
- [j19]René Sitters:
Approximability of average completion time scheduling on unrelated machines. Math. Program. 161(1-2): 135-158 (2017) - [j18]Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
Minimizing worst-case and average-case makespan over scenarios. J. Sched. 20(6): 545-555 (2017) - [i9]René Sitters, Liya Yang:
A $(2 + ε)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. CoRR abs/1706.07604 (2017) - 2016
- [j17]Chao Wang, René Sitters:
On some special cases of the restricted assignment problem. Inf. Process. Lett. 116(11): 723-728 (2016) - [c24]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the Scenario Model. WAOA 2016: 183-196 - [r2]René A. Sitters:
Generalized Two-Server Problem. Encyclopedia of Algorithms 2016: 819-821 - [i8]Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger:
The triangle scheduling problem. CoRR abs/1602.04365 (2016) - 2015
- [j16]Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen:
Split scheduling with uniform setup times. J. Sched. 18(2): 119-129 (2015) - [c23]Martijn van Ee, René Sitters:
On the Complexity of Master Problems. MFCS (2) 2015: 567-576 - 2014
- [j15]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
The traveling salesman problem on cubic and subcubic graphs. Math. Program. 144(1-2): 227-245 (2014) - [j14]René Sitters:
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem. SIAM J. Comput. 43(1): 96-125 (2014) - [c22]Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
Scheduling over Scenarios on Two Machines. COCOON 2014: 559-571 - [c21]René Sitters:
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. SODA 2014: 604-616 - [c20]Martijn van Ee, René Sitters:
Routing Under Uncertainty: The a priori Traveling Repairman Problem. WAOA 2014: 248-259 - [i7]Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
Scheduling over Scenarios on Two Machines. CoRR abs/1404.4766 (2014) - 2013
- [i6]René Sitters:
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. CoRR abs/1307.4289 (2013) - 2012
- [j13]Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee:
A note on sorting buffers offline. Theor. Comput. Sci. 423: 11-18 (2012) - [j12]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On the complexity of the highway problem. Theor. Comput. Sci. 460: 70-77 (2012) - [i5]Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Victor Verdugo, Anke van Zuylen:
Split Scheduling with Uniform Setup Times. CoRR abs/1212.1754 (2012) - 2011
- [c19]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
TSP on Cubic and Subcubic Graphs. IPCO 2011: 65-77 - [i4]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
The traveling salesman problem on cubic and subcubic graphs. CoRR abs/1107.1052 (2011) - [i3]René Sitters:
The generalized work function algorithm is competitive for the generalized 2-server problem. CoRR abs/1110.6600 (2011) - 2010
- [j11]René Sitters:
Competitive analysis of preemptive single-machine scheduling. Oper. Res. Lett. 38(6): 585-588 (2010) - [c18]René Sitters:
Efficient Algorithms for Average Completion Time Scheduling. IPCO 2010: 411-423 - [c17]Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg:
The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250 - [i2]Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff:
The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010) - [i1]Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters:
The Sorting Buffer Problem is NP-hard. CoRR abs/1009.4355 (2010)
2000 – 2009
- 2009
- [j10]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42(9): 939-951 (2009) - [j9]Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters:
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geom. Appl. 19(2): 173-193 (2009) - [j8]Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
Optimal pricing of capacitated networks. Networks 53(1): 79-87 (2009) - [c16]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286 - [c15]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219 - [c14]Alexander Grigoriev, René Sitters:
Connected Feedback Vertex Set in Planar Graphs. WG 2009: 143-153 - 2008
- [c13]René A. Sitters:
Approximability of Average Completion Time Scheduling on Unrelated Machines. ESA 2008: 768-779 - [c12]René A. Sitters:
Minimizing Average Flow Time on Unrelated Machines. WAOA 2008: 67-77 - [r1]René A. Sitters:
Generalized Two-Server Problem. Encyclopedia of Algorithms 2008 - 2007
- [c11]Khaled M. Elbassioni, René Sitters, Yan Zhang:
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA 2007: 451-462 - 2006
- [j7]Corinne Feremans, Alexander Grigoriev, René Sitters:
The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4): 319-329 (2006) - [j6]René A. Sitters, Leen Stougie:
The generalized two-server problem. J. ACM 53(3): 437-458 (2006) - [c10]Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters:
On the Value of Preemption in Scheduling. APPROX-RANDOM 2006: 39-48 - [c9]Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters:
On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222 - [c8]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA 2006: 69-82 - [c7]Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
How to Sell a Graph: Guidelines for Graph Retailers. WG 2006: 125-136 - 2005
- [j5]René Sitters:
Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms 57(1): 37-48 (2005) - [c6]Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA 2005: 580-591 - [c5]Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters:
Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 - 2004
- [j4]Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie:
On-Line Dial-a-Ride Problems Under a Restricted Information Model. Algorithmica 40(4): 319-329 (2004) - [j3]Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie:
Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS J. Comput. 16(2): 120-132 (2004) - 2003
- [j2]Xiwen Lu, René Sitters, Leen Stougie:
A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31(3): 232-236 (2003) - [c4]René Sitters, Leen Stougie, Willem de Paepe:
A Competitive Algorithm for the General 2-Server Problem. ICALP 2003: 624-636 - 2002
- [c3]Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie:
On-Line Dial-a-Ride Problems under a Restricted Information Model. ESA 2002: 674-685 - [c2]René Sitters:
The Minimum Latency Problem Is NP-Hard for Weighted Trees. IPCO 2002: 230-239 - 2001
- [c1]René Sitters:
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. IPCO 2001: 396-405
1990 – 1999
- 1999
- [j1]René Sitters:
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. Discret. Appl. Math. 92(2-3): 243-246 (1999)
Coauthor Index
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-08-05 21:11 CEST 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:
