| Maximizing influence in a competitive social network: a follower's perspective T Carnes, C Nagarajan, SM Wild, A van Zuylen Proceedings of the ninth international conference on Electronic commerce …, 2007 | 345 | 2007 |
| Rank aggregation: Together we're strong F Schalekamp, A Zuylen 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009 | 161 | 2009 |
| Deterministic pivoting algorithms for constrained ranking and clustering problems A Van Zuylen, DP Williamson Mathematics of Operations Research 34 (3), 594-620, 2009 | 151 | 2009 |
| Deterministic algorithms for rank aggregation and other ranking and clustering problems A Van Zuylen, DP Williamson Approximation and Online Algorithms: 5th International Workshop, WAOA 2007 …, 2008 | 89 | 2008 |
| Improved approximation algorithms for bipartite correlation clustering N Ailon, N Avigdor-Elgrabli, E Liberty, A Van Zuylen SIAM Journal on Computing 41 (5), 1110-1121, 2012 | 65 | 2012 |
| Greedy algorithms for the maximum satisfiability problem: Simple algorithms and inapproximability bounds M Poloczek, G Schnitger, DP Williamson, A Van Zuylen SIAM Journal on Computing 46 (3), 1029-1061, 2017 | 41 | 2017 |
| The salesman's improved paths: A 3/2+ 1/34 approximation A Sebo, A Van Zuylen 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 35 | 2016 |
| Simpler approximation of the maximum asymmetric traveling salesman problem K Paluch, K Elbassioni, A Van Zuylen STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 501-506, 2012 | 29 | 2012 |
| A simpler and better derandomization of an approximation algorithm for single source rent-or-buy DP Williamson, A Van Zuylen Operations Research Letters 35 (6), 707-712, 2007 | 28 | 2007 |
| 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 | 23 | 2014 |
| Deterministic sampling algorithms for network design A Van Zuylen Algorithmica 60 (1), 110-151, 2011 | 23 | 2011 |
| 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 | 22 | 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 | 21 | 2015 |
| Linear programming based approximation algorithms for feedback set problems in bipartite tournaments A van Zuylen Theoretical computer science 412 (23), 2556-2561, 2011 | 20 | 2011 |
| The salesman’s improved paths through forests A Sebő, AV Zuylen Journal of the ACM (JACM) 66 (4), 1-16, 2019 | 18 | 2019 |
| Improved approximations for cubic bipartite and cubic TSP A van Zuylen Mathematical Programming 172, 399-413, 2018 | 16 | 2018 |
| Popular ranking A Van Zuylen, F Schalekamp, DP Williamson Discrete Applied Mathematics 165, 312-316, 2014 | 16 | 2014 |
| Deterministic approximation algorithms for ranking and clusterings A van Zuylen Technical Report 1431, Cornell ORIE, 2005 | 16 | 2005 |
| Scheduling over scenarios on two machines E Feuerstein, A Marchetti-Spaccamela, F Schalekamp, R Sitters, ... Computing and Combinatorics: 20th International Conference, COCOON 2014 …, 2014 | 12 | 2014 |
| Clustering with or without the Approximation F Schalekamp, M Yu, A Van Zuylen Journal of Combinatorial Optimization 25, 393-429, 2013 | 12 | 2013 |
Frans SchalekampCornell University在 cornell.edu 的电子邮件经过验证
