Остановите войну!
for scientists:
default search action
René Sitters
- > Home > Persons > René Sitters
Publications
- 2019
- [c26]Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie:
Fixed-Order Scheduling on Parallel Machines. IPCO 2019: 88-100 - 2018
- [c25]Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. WAOA 2018: 310-326 - 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) - 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) - 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) - [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 - [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) - 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) - 2006
- [j6]René A. Sitters, Leen Stougie:
The generalized two-server problem. J. ACM 53(3): 437-458 (2006) - 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
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-05-02 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint