default search action
Frans Schalekamp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]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) - 2022
- [i10]Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson:
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR abs/2210.15655 (2022)
2010 – 2019
- 2018
- [j10]Frans Schalekamp, András Sebö, Vera Traub
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46(1): 60-63 (2018) - [i9]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
- [j9]Esteban Feuerstein, Alberto Marchetti-Spaccamela
Minimizing worst-case and average-case makespan over scenarios. J. Sched. 20(6): 545-555 (2017) - [i8]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and Matroids for the Traveling Salesman's Paths. CoRR abs/1703.07170 (2017) - 2016
- [j8]Khaled Almiani
Flow-based scheme for time-constrained data gathering in wireless sensor networks. Int. J. Wirel. Mob. Comput. 10(1): 1-12 (2016) - [j7]Anke van Zuylen, James C. Bieron, Frans Schalekamp, Gexin Yu:
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Inf. Process. Lett. 116(11): 718-722 (2016) - [c9]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 - [c8]Igor Labutov, Frans Schalekamp, Kelvin Luu, Hod Lipson
Optimally Discriminative Choice Sets in Discrete Choice Models: Application to Data-Driven Test Design. KDD 2016: 1665-1674 - 2015
- [j6]Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen:
On the integrality gap of the subtour LP for the 1, 2-TSP. Math. Program. 150(1): 131-151 (2015) - [j5]Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo
Split scheduling with uniform setup times. J. Sched. 18(2): 119-129 (2015) - [i7]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
- [j4]Anke van Zuylen, Frans Schalekamp, David P. Williamson:
Popular ranking. Discret. Appl. Math. 165: 312-316 (2014) - [j3]Frans Schalekamp, David P. Williamson, Anke van Zuylen:
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. Math. Oper. Res. 39(2): 403-417 (2014) - [c7]Esteban Feuerstein, Alberto Marchetti-Spaccamela
Scheduling over Scenarios on Two Machines. COCOON 2014: 559-571 - [i6]Anke van Zuylen, James C. Bieron, Frans Schalekamp, Gexin Yu:
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. CoRR abs/1402.4867 (2014) - [i5]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
- [j2]Frans Schalekamp, Michael Yu, Anke van Zuylen:
Clustering with or without the approximation. J. Comb. Optim. 25(3): 393-429 (2013) - 2012
- [c6]Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen:
On the Integrality Gap of the Subtour LP for the 1, 2-TSP. LATIN 2012: 606-617 - [c5]Frans Schalekamp, David P. Williamson, Anke van Zuylen:
A proof of the Boyd-Carr conjecture. SODA 2012: 1477-1486 - [c4]Henry Lin, Frans Schalekamp:
Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane. SPAA 2012: 80-81 - [i4]Henry Lin, Frans Schalekamp:
On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane. CoRR abs/1203.2725 (2012) - [i3]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]Anke van Zuylen, Frans Schalekamp, David P. Williamson:
Popular Ranking. CTW 2011: 267-270 - [i2]Frans Schalekamp, David P. Williamson, Anke van Zuylen:
A Proof of the Boyd-Carr Conjecture. CoRR abs/1107.1628 (2011) - [i1]Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen:
On the Integrality Gap of the Subtour LP for the 1,2-TSP. CoRR abs/1107.1630 (2011) - 2010
- [c2]Frans Schalekamp, Michael Yu, Anke van Zuylen:
Clustering with or without the Approximation. COCOON 2010: 70-79
2000 – 2009
- 2009
- [c1]Frans Schalekamp, Anke van Zuylen:
Rank Aggregation: Together We're Strong. ALENEX 2009: 38-51 - 2008
- [j1]Frans Schalekamp, David B. Shmoys
Algorithms for the universal and a priori TSP. Oper. Res. Lett. 36(1): 1-3 (2008)
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:20 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: