Maximizing influence in a competitive social network: a follower's perspective. - Tim Carnes; Chandrashekhar Nagarajan; Stefan M. Wild; Anke van Zuylen (ICEC, 2007)

Deterministic pivoting algorithms for constrained ranking and clustering problems. - Anke van Zuylen; Rajneesh Hegde; Kamal Jain; David P. Williamson (SODA, 2007)

Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. - Anke van Zuylen; David P. Williamson (WAOA, 2007)

A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. - David P. Williamson; Anke van Zuylen (Oper. Res. Lett., 2007)

Rank Aggregation: Together We're Strong. - Frans Schalekamp; Anke van Zuylen (ALENEX, 2009)

Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. - Anke van Zuylen; David P. Williamson (Math. Oper. Res., 2009)

Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. - Anke van Zuylen (COCOON, 2010)

Simpler 3/4-Approximation Algorithms for MAX SAT. - Anke van Zuylen (WAOA, 2011)

Deterministic Sampling Algorithms for Network Design. - Anke van Zuylen (Algorithmica, 2011)

On the Integrality Gap of the Subtour LP for the 1,2-TSP - Jiawei Qian; Frans Schalekamp; David P. Williamson; Anke van Zuylen (CoRR, 2011)

An improved monotone algorithm for scheduling related machines with precedence constraints. - Anke van Zuylen (Oper. Res. Lett., 2011)

Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. - Anke van Zuylen (Theor. Comput. Sci., 2011)

A proof of the Boyd-Carr conjecture. - Frans Schalekamp; David P. Williamson; Anke van Zuylen (SODA, 2012)

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. - Katarzyna E. Paluch 001; Khaled M. Elbassioni; Anke van Zuylen (STACS, 2012)

Improved Approximation Algorithms for Bipartite Correlation Clustering. - Nir Ailon; Noa Avigdor-Elgrabli; Edo Liberty; Anke van Zuylen (SIAM J. Comput., 2012)

Toward a precise integrality gap for triangle-free 2-matchings. - Philipp Klodt; Anke van Zuylen (CTW, 2013)

On Some Recent MAX SAT Approximation Algorithms. - Matthias Poloczek; David P. Williamson; Anke van Zuylen (CoRR, 2013)

Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. - Anke van Zuylen (Discret. Appl. Math., 2013)

Clustering with or without the approximation. - Frans Schalekamp; Michael Yu; Anke van Zuylen (J. Comb. Optim., 2013)

Scheduling over Scenarios on Two Machines. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (COCOON, 2014)

On Some Recent Approximation Algorithms for MAX SAT. - Matthias Poloczek; David P. Williamson; Anke van Zuylen (LATIN, 2014)

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (CoRR, 2014)

Popular ranking. - Anke van Zuylen; Frans Schalekamp; David P. Williamson (Discret. Appl. Math., 2014)

2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. - Frans Schalekamp; David P. Williamson; Anke van Zuylen (Math. Oper. Res., 2014)

Improved Approximations for Cubic and Cubic Bipartite TSP. - Anke van Zuylen (CoRR, 2015)

On the integrality gap of the subtour LP for the 1, 2-TSP. - Jiawei Qian; Frans Schalekamp; David P. Williamson; Anke van Zuylen (Math. Program., 2015)

Split scheduling with uniform setup times. - Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Víctor Verdugo; Anke van Zuylen (J. Sched., 2015)

The Salesman's Improved Paths: A 3/2+1/34 Approximation. - András Sebö; Anke van Zuylen (FOCS, 2016)

A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. - Frans Schalekamp; Anke van Zuylen; Suzanne van der Ster (ICALP, 2016)

The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio. - András Sebö; Anke van Zuylen (CoRR, 2016)

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (Inf. Process. Lett., 2016)

Minimizing worst-case and average-case makespan over scenarios. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (J. Sched., 2017)

Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. - Matthias Poloczek; Georg Schnitger; David P. Williamson; Anke van Zuylen (SIAM J. Comput., 2017)

Improved approximations for cubic bipartite and cubic TSP. - Anke van Zuylen (Math. Program., 2018)

Layers and matroids for the traveling salesman's paths. - Frans Schalekamp; András Sebö; Vera Traub; Anke van Zuylen (Oper. Res. Lett., 2018)

The Salesman's Improved Paths through Forests. - András Sebö; Anke van Zuylen (J. ACM, 2019)

A duality based 2-approximation algorithm for maximum agreement forest. - Neil Olver; Frans Schalekamp; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (Math. Program., 2023)