default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuzanne van der Ster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Neil Olver
, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. 198(1): 811-853 (2023)
2010 – 2019
- 2018
- [i5]Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR abs/1811.05916 (2018) - 2017
- [j6]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) - 2016
- [c8]Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. ICALP 2016: 70:1-70:14 - 2015
- [j5]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. J. ACM 62(2): 14:1-14:33 (2015) - [j4]Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese:
Assigning sporadic tasks to unrelated machines. Math. Program. 152(1-2): 247-274 (2015) - [j3]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) - [i4]Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR abs/1511.06000 (2015) - 2014
- [j2]Lanah Evers, Kristiaan Glorie, Suzanne van der Ster, Ana Isabel Barros, Herman Monsuur:
A two-stage approach to the orienteering problem with stochastic weights. Comput. Oper. Res. 43: 248-260 (2014) - [j1]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) - [c7]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 - [c6]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 - [i3]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
- [c5]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. ECRTS 2012: 145-154 - [c4]Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese:
Assigning Sporadic Tasks to Unrelated Parallel Machines. ICALP (1) 2012: 665-676 - [i2]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
- [c3]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
Mixed-Criticality Scheduling of Sporadic Task Systems. ESA 2011: 555-566 - [c2]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
TSP on Cubic and Subcubic Graphs. IPCO 2011: 65-77 - [i1]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) - 2010
- [c1]Rein Nobel, Suzanne van der Ster:
A discrete-time queueing model with abandonments. QTNA 2010: 29-34
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:23 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:
