| Rank aggregation: Together we're strong F Schalekamp, A Zuylen 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009 | 150 | 2009 |
| Algorithms for the universal and a priori TSP F Schalekamp, DB Shmoys Operations Research Letters 36 (1), 1-3, 2008 | 43 | 2008 |
| 2-matchings, the traveling salesman problem, and the subtour LP: A proof of the Boyd-Carr conjecture F Schalekamp, DP Williamson, A van Zuylen Mathematics of Operations Research 39 (2), 403-417, 2014 | 21 | 2014 |
| A proof of the Boyd-Carr conjecture F Schalekamp, DP Williamson, A Van Zuylen Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 21 | 2012 |
| Split scheduling with uniform setup times F Schalekamp, R Sitters, S Van Der Ster, L Stougie, V Verdugo, ... Journal of scheduling 18, 119-129, 2015 | 17 | 2015 |
| Popular ranking A Van Zuylen, F Schalekamp, DP Williamson Discrete Applied Mathematics 165, 312-316, 2014 | 15 | 2014 |
| Clustering with or without the Approximation F Schalekamp, M Yu, A van Zuylen Computing and Combinatorics, 70-79, 2010 | 12 | 2010 |
| Scheduling over scenarios on two machines E Feuerstein, A Marchetti-Spaccamela, F Schalekamp, R Sitters, ... Computing and Combinatorics: 20th International Conference, COCOON 2014 …, 2014 | 10 | 2014 |
| Layers and matroids for the traveling salesman’s paths F Schalekamp, A Sebő, V Traub, A Van Zuylen Operations Research Letters 46 (1), 60-63, 2018 | 9 | 2018 |
| A duality based 2-approximation algorithm for maximum agreement forest F Schalekamp, A van Zuylen, S van der Ster arXiv preprint arXiv:1511.06000, 2015 | 9 | 2015 |
| On the integrality gap of the subtour LP for the 1, 2-TSP J Qian, F Schalekamp, DP Williamson, A Van Zuylen Mathematical Programming 150, 131-151, 2015 | 8 | 2015 |
| On the integrality gap of the subtour LP for the 1, 2-TSP J Qian, F Schalekamp, DP Williamson, A Van Zuylen LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012 | 8 | 2012 |
| The Achilles' Heel of the GSR Shuffle: A Note on New Age Solitaire A van Zuylen, F Schalekamp Probability in the Engineering and Informational Sciences 18 (03), 315-328, 2004 | 8 | 2004 |
| Minimizing worst-case and average-case makespan over scenarios E Feuerstein, A Marchetti-Spaccamela, F Schalekamp, R Sitters, ... Journal of Scheduling 20, 545-555, 2017 | 5 | 2017 |
| An upper bound on the number of circular transpositions to sort a permutation A van Zuylen, J Bieron, F Schalekamp, G Yu arXiv preprint arXiv:1402.4867, 2014 | 5 | 2014 |
| On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane H Lin, F Schalekamp | 5 | 2012 |
| A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation A van Zuylen, J Bieron, F Schalekamp, G Yu Information Processing Letters 116 (11), 718-722, 2016 | 4 | 2016 |
| Optimally Discriminative Choice Sets in Discrete Choice Models: Application to Data-Driven Test Design I Labutov, F Schalekamp, K Luu, H Lipson, C Studer Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016 | 3 | 2016 |
| Flow-based scheme for time-constrained data gathering in wireless sensor networks K Almi'ani, A Viglas, F Schalekamp, R Abrishambaf International Journal of Wireless and Mobile Computing 10 (1), 1-12, 2016 | 2 | 2016 |
| A duality based 2-approximation algorithm for maximum agreement forest N Olver, F Schalekamp, S van Der Ster, L Stougie, A van Zuylen Mathematical Programming, 1-43, 2022 | 1 | 2022 |
Anke van ZuylenCornell UniversityVerified email at cornell.edu
