| Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm engineering, 19-80, 2016 | 446 | 2016 |
| Customizable route planning D Delling, AV Goldberg, T Pajor, RF Werneck International Symposium on Experimental Algorithms, 376-387, 2011 | 179 | 2011 |
| 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 | 168 | 2014 |
| Round-based public transit routing D Delling, T Pajor, RF Werneck Transportation Science 49 (3), 591-604, 2014 | 148 | 2014 |
| Intriguingly simple and fast transit routing J Dibbelt, T Pajor, B Strasser, D Wagner International Symposium on Experimental Algorithms, 43-54, 2013 | 104 | 2013 |
| Customizable route planning in road networks D Delling, AV Goldberg, T Pajor, RF Werneck Transportation Science 51 (2), 566-591, 2015 | 93 | 2015 |
| Multi-modal route planning T Pajor Universität Karlsruhe, 2009 | 75 | 2009 |
| User-constrained multimodal route planning J Dibbelt, T Pajor, D Wagner Journal of Experimental Algorithmics (JEA) 19, 3.2, 2015 | 71 | 2015 |
| Energy-optimal routes for electric vehicles M Baum, J Dibbelt, T Pajor, D Wagner Proceedings of the 21st ACM SIGSPATIAL international conference on advances …, 2013 | 69 | 2013 |
| Accelerating multi-modal route planning by access-nodes D Delling, T Pajor, D Wagner European Symposium on Algorithms, 587-598, 2009 | 58 | 2009 |
| Computing multimodal journeys in practice D Delling, J Dibbelt, T Pajor, D Wagner, RF Werneck International Symposium on Experimental Algorithms, 260-271, 2013 | 57 | 2013 |
| Engineering time-expanded graphs for faster timetable information D Delling, T Pajor, D Wagner Robust and Online Large-Scale Optimization, 182-206, 2009 | 48 | 2009 |
| Robust distance queries on massive networks D Delling, AV Goldberg, T Pajor, RF Werneck European Symposium on Algorithms, 321-333, 2014 | 46 | 2014 |
| Parallel computation of best connections in public transportation networks D Delling, B Katz, T Pajor Journal of Experimental Algorithmics (JEA) 17, 4.4, 2012 | 42 | 2012 |
| 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 | 41 | 2014 |
| Speed-consumption tradeoff for electric vehicle route planning M Baum, J Dibbelt, L Hübschle-Schneider, T Pajor, D Wagner 14Th workshop on algorithmic approaches for transportation modelling …, 2014 | 29 | 2014 |
| Public transit labeling D Delling, J Dibbelt, T Pajor, RF Werneck International Symposium on Experimental Algorithms, 273-285, 2015 | 25 | 2015 |
| Dynamic time-dependent route planning in road networks with user preferences M Baum, J Dibbelt, T Pajor, D Wagner International Symposium on Experimental Algorithms, 33-49, 2016 | 22 | 2016 |
| Journey planning in public transportation networks D Delling, AV Goldberg, T Pajor, RF Werneck US Patent 8,494,771, 2013 | 22 | 2013 |
| Connection scan algorithm J Dibbelt, T Pajor, B Strasser, D Wagner Journal of Experimental Algorithmics (JEA) 23 (1), 1.7, 2018 | 20 | 2018 |
Daniel DellingAppleEmail verificata su apple.com
