default search action
Ruben van der Zwaan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
- [j7]Nikhil Bansal, Tim Oosterwijk
, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76(4): 1077-1096 (2016) - [j6]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ACM Trans. Algorithms 13(1): 13:1-13:28 (2016) - 2015
- [j5]André Berger
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185: 8-17 (2015) - 2014
- [j4]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and non-preemptive generalized min sum set cover. Math. Program. 145(1-2): 377-401 (2014) - [j3]André Berger, Alexander Grigoriev
Complexity and approximability of the k-way vertex cut. Networks 63(2): 170-178 (2014) - [j2]André Berger, Alexander Grigoriev
Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42(2): 166-172 (2014) - 2012
- [j1]Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev
Dynamic pricing problems with elastic demand. Oper. Res. Lett. 40(3): 175-179 (2012)
Conference and Workshop Papers
- 2014
- [c9]Martijn van Brink, Ruben van der Zwaan:
A Branch and Price Procedure for the Container Premarshalling Problem. ESA 2014: 798-809 - [c8]Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. LATIN 2014: 47-59 - [c7]Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Real-Time Scheduling on Identical Machines. LATIN 2014: 550-561 - 2012
- [c6]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ICALP (1) 2012: 485-497 - [c5]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. MFCS 2012: 718-727 - [c4]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS 2012: 465-476 - 2011
- [c3]Ruben van der Zwaan, André Berger
How to Cut a Graph into Many Pieces. TAMC 2011: 184-194 - [c2]André Berger
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53 - 2010
- [c1]Ruben van der Zwaan:
Vertex Ranking with Capacity. SOFSEM 2010: 767-778
Informal and Other Publications
- 2014
- [i2]Martijn van Brink, Ruben van der Zwaan:
A branch and price procedure for the container premarshalling problem. CoRR abs/1406.7107 (2014) - 2012
- [i1]Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. CoRR abs/1208.4225 (2012)
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-04-25 05:54 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: