default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnke van Zuylen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]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
- 2019
- [j18]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths through Forests. J. ACM 66(4): 28:1-28:16 (2019) - 2018
- [j17]Anke van Zuylen:
Improved approximations for cubic bipartite and cubic TSP. Math. Program. 172(1-2): 399-413 (2018) - [j16]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46(1): 60-63 (2018) - [i12]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
- [j15]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) - [j14]Matthias Poloczek, Georg Schnitger, David P. Williamson, Anke van Zuylen:
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. SIAM J. Comput. 46(3): 1029-1061 (2017) - [i11]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
- [j13]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) - [c19]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths: A 3/2+1/34 Approximation. FOCS 2016: 118-127 - [c18]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 - [c17]Anke van Zuylen:
Improved Approximations for Cubic Bipartite and Cubic TSP. IPCO 2016: 250-261 - [i10]András Sebö, Anke van Zuylen:
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio. CoRR abs/1604.02486 (2016) - 2015
- [j12]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) - [j11]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) - [i9]Anke van Zuylen:
Improved Approximations for Cubic and Cubic Bipartite TSP. CoRR abs/1507.07121 (2015) - [i8]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
- [j10]Anke van Zuylen, Frans Schalekamp, David P. Williamson:
Popular ranking. Discret. Appl. Math. 165: 312-316 (2014) - [j9]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) - [c16]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 - [c15]Matthias Poloczek, David P. Williamson, Anke van Zuylen:
On Some Recent Approximation Algorithms for MAX SAT. LATIN 2014: 598-609 - [i7]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) - [i6]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
- [j8]Anke van Zuylen:
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. Discret. Appl. Math. 161(13-14): 2142-2157 (2013) - [j7]Frans Schalekamp, Michael Yu, Anke van Zuylen:
Clustering with or without the approximation. J. Comb. Optim. 25(3): 393-429 (2013) - [i5]Philipp Klodt, Anke van Zuylen:
Toward a precise integrality gap for triangle-free 2-matchings. CTW 2013: 151-154 - [i4]Matthias Poloczek, David P. Williamson, Anke van Zuylen:
On Some Recent MAX SAT Approximation Algorithms. CoRR abs/1308.3405 (2013) - 2012
- [j6]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM J. Comput. 41(5): 1110-1121 (2012) - [c14]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 - [c13]Frans Schalekamp, David P. Williamson, Anke van Zuylen:
A proof of the Boyd-Carr conjecture. SODA 2012: 1477-1486 - [c12]Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen:
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS 2012: 501-506 - [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
- [j5]Anke van Zuylen:
Deterministic Sampling Algorithms for Network Design. Algorithmica 60(1): 110-151 (2011) - [j4]Anke van Zuylen:
An improved monotone algorithm for scheduling related machines with precedence constraints. Oper. Res. Lett. 39(6): 423-427 (2011) - [j3]Anke van Zuylen:
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. Theor. Comput. Sci. 412(23): 2556-2561 (2011) - [c11]Anke van Zuylen, Frans Schalekamp, David P. Williamson:
Popular Ranking. CTW 2011: 267-270 - [c10]Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. ESA 2011: 25-36 - [c9]Anke van Zuylen:
Simpler 3/4-Approximation Algorithms for MAX SAT. WAOA 2011: 188-197 - [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
- [c8]Anke van Zuylen:
Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. COCOON 2010: 60-69 - [c7]Frans Schalekamp, Michael Yu, Anke van Zuylen:
Clustering with or without the Approximation. COCOON 2010: 70-79
2000 – 2009
- 2009
- [j2]Anke van Zuylen, David P. Williamson:
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. Math. Oper. Res. 34(3): 594-620 (2009) - [c6]Frans Schalekamp, Anke van Zuylen:
Rank Aggregation: Together We're Strong. ALENEX 2009: 38-51 - [c5]Anke van Zuylen:
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments. TAMC 2009: 370-379 - 2008
- [c4]Anke van Zuylen:
Deterministic Sampling Algorithms for Network Design. ESA 2008: 830-841 - 2007
- [j1]David P. Williamson, Anke van Zuylen:
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Oper. Res. Lett. 35(6): 707-712 (2007) - [c3]Tim Carnes, Chandrashekhar Nagarajan, Stefan M. Wild, Anke van Zuylen:
Maximizing influence in a competitive social network: a follower's perspective. ICEC 2007: 351-360 - [c2]Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson:
Deterministic pivoting algorithms for constrained ranking and clustering problems. SODA 2007: 405-414 - [c1]Anke van Zuylen, David P. Williamson:
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. WAOA 2007: 260-273
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:10 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:
