Anke van Zuylen

975 total citations
23 papers, 341 citations indexed

About

Anke van Zuylen is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Anke van Zuylen has authored 23 papers receiving a total of 341 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 8 papers in Industrial and Manufacturing Engineering. Recurrent topics in Anke van Zuylen's work include Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (10 papers) and Game Theory and Voting Systems (6 papers). Anke van Zuylen is often cited by papers focused on Optimization and Search Problems (10 papers), Complexity and Algorithms in Graphs (10 papers) and Game Theory and Voting Systems (6 papers). Anke van Zuylen collaborates with scholars based in United States, Germany and Netherlands. Anke van Zuylen's co-authors include David P. Williamson, Chandrashekhar Nagarajan, Tim Carnes, Stefan M. Wild, Edo Liberty, Matthias Poloczek, Nir Ailon, Georg Schnitger, Kamal Jain and Suzanne van der Ster and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Anke van Zuylen

22 papers receiving 321 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Anke van Zuylen United States 8 156 111 85 71 70 23 341
André Nichterlein Germany 12 72 0.5× 162 1.5× 68 0.8× 47 0.7× 84 1.2× 39 325
Stefano Leucci Italy 8 75 0.5× 66 0.6× 99 1.2× 25 0.4× 44 0.6× 36 230
Alessandro Provetti Italy 11 187 1.2× 21 0.2× 247 2.9× 39 0.5× 98 1.4× 36 456
Chavdar Dangalchev Bulgaria 6 140 0.9× 64 0.6× 26 0.3× 13 0.2× 88 1.3× 12 278
Naoto Ohsaka Japan 6 225 1.4× 42 0.4× 98 1.2× 27 0.4× 102 1.5× 21 301
Marc Maier United States 9 108 0.7× 14 0.1× 117 1.4× 17 0.2× 52 0.7× 15 264
Giridhar Maji India 10 257 1.6× 17 0.2× 82 1.0× 106 1.5× 69 1.0× 29 479
Serge Gaspers Australia 14 17 0.1× 396 3.6× 110 1.3× 140 2.0× 166 2.4× 70 620
Chandrashekhar Nagarajan United States 6 142 0.9× 26 0.2× 26 0.3× 71 1.0× 68 1.0× 7 236
Valeria Fionda Italy 11 66 0.4× 33 0.3× 178 2.1× 30 0.4× 87 1.2× 37 277

Countries citing papers authored by Anke van Zuylen

Since Specialization
Citations

This map shows the geographic impact of Anke van Zuylen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anke van Zuylen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anke van Zuylen more than expected).

Fields of papers citing papers by Anke van Zuylen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anke van Zuylen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anke van Zuylen. The network helps show where Anke van Zuylen may publish in the future.

Co-authorship network of co-authors of Anke van Zuylen

This figure shows the co-authorship network connecting the top 25 collaborators of Anke van Zuylen. A scholar is included among the top collaborators of Anke van Zuylen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anke van Zuylen. Anke van Zuylen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Olver, Neil, et al.. (2022). A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming. 198(1). 811–853. 2 indexed citations
2.
Zuylen, Anke van, et al.. (2019). The Salesman’s Improved Paths through Forests. Journal of the ACM. 66(4). 1–16. 6 indexed citations
3.
Zuylen, Anke van, et al.. (2017). Layers and matroids for the traveling salesman’s paths. Operations Research Letters. 46(1). 60–63. 3 indexed citations
4.
Poloczek, Matthias, Georg Schnitger, David P. Williamson, & Anke van Zuylen. (2017). Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. SIAM Journal on Computing. 46(3). 1029–1061. 20 indexed citations
5.
Feuerstein, Esteban, Alberto Marchetti-Spaccamela, René Sitters, et al.. (2016). Minimizing worst-case and average-case makespan over scenarios. Journal of Scheduling. 20(6). 545–555. 5 indexed citations
6.
Zuylen, Anke van, et al.. (2016). A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Information Processing Letters. 116(11). 718–722. 1 indexed citations
7.
Sitters, René, et al.. (2014). Split scheduling with uniform setup times. Journal of Scheduling. 18(2). 119–129. 7 indexed citations
8.
Williamson, David P., et al.. (2014). On the integrality gap of the subtour LP for the 1,2-TSP. Mathematical Programming. 150(1). 131–151. 5 indexed citations
9.
Zuylen, Anke van. (2013). Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. Discrete Applied Mathematics. 161(13-14). 2142–2157. 4 indexed citations
10.
Williamson, David P., et al.. (2013). 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. Mathematics of Operations Research. 39(2). 403–417. 9 indexed citations
11.
Zuylen, Anke van, et al.. (2012). Popular ranking. Discrete Applied Mathematics. 165. 312–316. 5 indexed citations
12.
Ailon, Nir, et al.. (2012). Improved Approximation Algorithms for Bipartite Correlation Clustering. SIAM Journal on Computing. 41(5). 1110–1121. 18 indexed citations
13.
Zuylen, Anke van. (2011). An improved monotone algorithm for scheduling related machines with precedence constraints. Operations Research Letters. 39(6). 423–427. 1 indexed citations
14.
Zuylen, Anke van. (2010). Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. Theoretical Computer Science. 412(23). 2556–2561. 7 indexed citations
15.
Zuylen, Anke van & David P. Williamson. (2009). Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. Mathematics of Operations Research. 34(3). 594–620. 42 indexed citations
16.
Zuylen, Anke van. (2009). Deterministic Sampling Algorithms for Network Design. Algorithmica. 60(1). 110–151. 7 indexed citations
17.
Zuylen, Anke van, et al.. (2007). Deterministic pivoting algorithms for constrained ranking and clustering problems. Symposium on Discrete Algorithms. 405–414. 17 indexed citations
18.
Williamson, David P. & Anke van Zuylen. (2007). A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Operations Research Letters. 35(6). 707–712. 17 indexed citations
19.
Zuylen, Anke van. (2005). Deterministic Approximation Algorithms for Ranking and Clustering Problems. eCommons (Cornell University). 5 indexed citations
20.
Zuylen, Anke van, et al.. (2004). THE ACHILLES' HEEL OF THE GSR SHUFFLE: A NOTE ON NEW AGE SOLITAIRE. Probability in the Engineering and Informational Sciences. 18(3). 315–328. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026