| Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm engineering: Selected results and surveys, 19-80, 2016 | 1005 | 2016 |
| Robust branch-and-cut-and-price for the capacitated vehicle routing problem R Fukasawa, H Longo, J Lysgaard, MP Aragão, M Reis, E Uchoa, ... Mathematical programming 106, 491-511, 2006 | 780 | 2006 |
| A hybrid heuristic for the p-median problem MGC Resende, RF Werneck Journal of heuristics 10 (1), 59-88, 2004 | 480 | 2004 |
| Reach for A*: Efficient Point-to-Point Shortest Path Algorithms AV Goldberg, H Kaplan, RF Werneck 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and …, 2006 | 418 | 2006 |
| A hub-based labeling algorithm for shortest paths in road networks I Abraham, D Delling, AV Goldberg, RF Werneck Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari …, 2011 | 385 | 2011 |
| Round-based public transit routing D Delling, T Pajor, RF Werneck ALENEX 2012, 2013 | 342 | 2013 |
| Highway dimension, shortest paths, and provably efficient algorithms I Abraham, A Fiat, AV Goldberg, RF Werneck Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 314 | 2010 |
| Sketch-based influence maximization and computation: Scaling up with guarantees E Cohen, D Delling, T Pajor, RF Werneck Proceedings of the 23rd ACM international conference on conference on …, 2014 | 308 | 2014 |
| Computing point-to-point shortest paths from external memory AV Goldberg, RF Werneck Proceedings of the 7th Workshop on Algorithm Engineering and Experiments …, 2005 | 298 | 2005 |
| Hierarchical hub labelings for shortest paths I Abraham, D Delling, AV Goldberg, RF Werneck European Symposium on Algorithms, 24-35, 2012 | 293 | 2012 |
| Customizable route planning D Delling, AV Goldberg, T Pajor, RF Werneck Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari …, 2011 | 260 | 2011 |
| A hybrid GRASP with perturbations for the Steiner problem in graphs CC Ribeiro, E Uchoa, RF Werneck INFORMS Journal on Computing 14 (3), 228-246, 2002 | 250 | 2002 |
| PHAST: Hardware-accelerated shortest path trees D Delling, AV Goldberg, A Nowatzyk, RF Werneck Journal of Parallel and Distributed Computing 73 (7), 940-952, 2013 | 227 | 2013 |
| Customizable route planning in road networks D Delling, AV Goldberg, T Pajor, RF Werneck Transportation Science 51 (2), 566-591, 2017 | 216 | 2017 |
| Alternative routes in road networks I Abraham, D Delling, AV Goldberg, RF Werneck Journal of Experimental Algorithmics (JEA) 18, 1.1-1.17, 2013 | 184 | 2013 |
| Fast local search for the maximum independent set problem DV Andrade, MGC Resende, RF Werneck Journal of Heuristics 18, 525-547, 2012 | 178 | 2012 |
| A hybrid multistart heuristic for the uncapacitated facility location problem MGC Resende, RF Werneck European Journal of Operational Research 174 (1), 54-68, 2006 | 178 | 2006 |
| Graph partitioning with natural cuts D Delling, AV Goldberg, I Razenshteyn, RF Werneck 2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011 | 176 | 2011 |
| Better landmarks within reach AV Goldberg, H Kaplan, RF Werneck International Workshop on Experimental and Efficient Algorithms, 38-51, 2007 | 135 | 2007 |
| Computing classic closeness centrality, at scale E Cohen, D Delling, T Pajor, RF Werneck Proceedings of the second ACM conference on Online social networks, 37-50, 2014 | 127 | 2014 |
Daniel DellingGooglegoogle.com의 이메일 확인됨
