Publications

The following is a list of my academic publications. Journal articles, book chapters, and conference publications have all been peer-reviewed.

Journal Articles and Book Chapters

  1. Route Planning in Transportation Networks. By Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck. In: Algorithm Engineering: Selected Results and Surveys. Springer International Publishing, Cham, pp. 19–80, 2016.
    [abstract] [publisher] [bibtex]
  2. Round-Based Public Transit Routing. By Daniel Delling, Thomas Pajor, Renato F. Werneck. Transportation Science, vol. 49(3), pp. 591–604, 2014.
    [abstract] [publisher] [bibtex]
  3. User-Constrained Multimodal Route Planning. By Julian Dibbelt, Thomas Pajor, Dorothea Wagner. Journal of Experimental Algorithmics, vol. 19, pp. 3.2:1.1–3.2:1.19, 2015.
    [abstract] [publisher] [bibtex]
  4. Customizable Route Planning in Road Networks. By Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck. Transportation Science, 2015.
    [abstract] [publisher] [bibtex]
  5. On D-regular Schematization of Embedded Paths. By Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter. Computational Geometry: Theory and Applications, vol. 47(3), pp. 381–406, 2014.
    [abstract] [publisher] [bibtex]
  6. Parallel Computation of Best Connections in Public Transportation Networks. By Daniel Delling, Bastian Katz, Thomas Pajor. Journal of Experimental Algorithmics, vol. 17, pp. 4.4:4.1–4.4:4.26, 2012.
    [abstract] [publisher] [bibtex]
  7. Engineering Time-Expanded Graphs for Faster Timetable Information. By Daniel Delling, Thomas Pajor, Dorothea Wagner. In: Robust and Online Large-Scale Optimization. Springer Berlin Heidelberg, pp. 182–206, 2009.
    [abstract] [publisher] [bibtex]

In Conference Proceedings

  1. Faster Transit Routing by Hyper Partitioning. By Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf. In: Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS’17). pp. 8:1–8:14, 2017.
    [abstract] [pdf] [publisher] [bibtex]
  2. Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. By Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner. In: Proceedings of the 15th International Symposium on Experimental Algorithms (SEA’16). Springer, pp. 33–49, 2016.
    [abstract] [publisher] [bibtex]
  3. Public Transit Labeling. By Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck. In: Proceedings of the 14th International Symposium on Experimental Algorithms (SEA’15). Springer International Publishing, pp. 273–285, 2015.
    [pdf] [publisher] [bibtex]
  4. Towards Realistic Pedestrian Route Planning. By Simeon Danailov Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner. In: 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’15). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015.
    [pdf] [bibtex]
  5. Sketch-based Influence Maximization and Computation: Scaling Up with Guarantees. By Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management. ACM, New York, NY, USA, pp. 629–638, 2014.
    [pdf] [publisher] [bibtex]
  6. Better Transit Routing by Exploiting Vehicle GPS Data. By Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni. In: Proceedings of the 7th ACM SIGSPATIAL International Workshop on Computational Transportation Science. ACM, New York, NY, USA, pp. 31–40, 2014.
    [pdf] [publisher] [bibtex]
  7. Speed-Consumption Tradeoff for Electric Vehicle Route Planning. By Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, Dorothea Wagner. In: Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS’14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 138–151, 2014.
    [abstract] [pdf] [publisher] [bibtex]
  8. Robust Distance Queries on Massive Networks. By Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck. In: Proceedings of the 22nd Annual European Symposium on Algorithms (ESA’14). Springer Berlin Heidelberg, pp. 321–333, 2014.
    [pdf] [publisher] [bibtex]
  9. Computing Classic Closeness Centrality, at Scale. By Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck. In: Proceedings of the Second ACM Conference on Online Social Networks. ACM, New York, NY, USA, pp. 37–50, 2014.
    [pdf] [publisher] [bibtex]
  10. Energy-optimal Routes for Electric Vehicles. By Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, New York, NY, USA, pp. 54–63, 2013.
    [pdf] [publisher] [bibtex]
  11. Computing Multimodal Journeys in Practice. By Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA’13). Springer, pp. 260–271, 2013.
    [pdf] [bibtex]
  12. Efficient Computation of Jogging Routes. By Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA’13). Springer Berlin Heidelberg, pp. 272–283, 2013.
    [pdf] [publisher] [bibtex]
  13. Intriguingly Simple and Fast Transit Routing. By Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA’13). Springer Berlin Heidelberg, pp. 43–54, 2013.
    [pdf] [publisher] [bibtex]
  14. Round-Based Public Transit Routing. By Daniel Delling, Thomas Pajor, Renato F. Werneck. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX’12). SIAM, pp. 130–140, 2012.
    [pdf] [bibtex]
  15. User-Constrained Multi-Modal Route Planning. By Julian Dibbelt, Thomas Pajor, Dorothea Wagner. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX’12). SIAM, pp. 118–129, 2012.
    [pdf] [bibtex]
  16. UniALT for regular language contrained shortest paths on a multi-modal transportation network. By Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo. In: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’11). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 64–75, 2011.
    [pdf] [publisher] [bibtex]
  17. Automatic Generation of Route Sketches. By Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter. In: Proceedings of the 18th International Symposium on Graph Drawing (GD’10). Springer Berlin Heidelberg, pp. 391–392, 2011.
    [pdf] [publisher] [bibtex]
  18. On d-Regular Schematization of Embedded Paths. By Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter. In: SOFSEM 2011: Theory and Practice of Computer Science. Springer Berlin Heidelberg, pp. 260–271, 2011.
    [pdf] [publisher] [bibtex]
  19. Customizable Route Planning. By Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck. In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA’11). Springer Berlin Heidelberg, pp. 376–387, 2011.
    [pdf] [publisher] [bibtex]
  20. Path Schematization for Route Sketches. By Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor. In: Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT’10). Springer Berlin Heidelberg, pp. 285–296, 2010.
    [pdf] [publisher] [bibtex]
  21. Parallel Computation of Best Connections in Public Transportation Networks. By Daniel Delling, Bastian Katz, Thomas Pajor. In: 24th International Parallel and Distributed Processing Symposium (IPDPS’10). IEEE Computer Society, pp. 1–12, 2010.
    [pdf] [bibtex]
  22. Accelerating Multi-modal Route Planning by Access-Nodes. By Daniel Delling, Thomas Pajor, Dorothea Wagner. In: Proceedings of the 17th Annual European Symposium on Algorithms (ESA’09). Springer Berlin Heidelberg, pp. 587–598, 2009.
    [pdf] [publisher] [bibtex]
  23. Efficient Route Planning in Flight Networks. By Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos Zaroliagis. In: 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS’09). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2009.
    [pdf] [publisher] [bibtex]
  24. Engineering Time-Expanded Graphs for Faster Timetable Information. By Daniel Delling, Thomas Pajor, Dorothea Wagner. In: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS’08). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2008.
    [pdf] [publisher] [bibtex]

Technical Reports

  1. Route Planning in Transportation Networks. By Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller–Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck. Technical report abs/1504.05140, arXiv e-prints, 2015.
    [pdf] [publisher] [bibtex]
  2. A Robust and Scalable Algorithm for the Steiner Problem in Graphs. By Thomas Pajor, Eduardo Uchoa, Renato F. Werneck. Technical report abs/1412.2787, arXiv e-prints, 2014.
    [pdf] [publisher] [bibtex]
  3. Timed Influence: Computation and Maximization. By Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck. Technical report abs/1410.6976, arXiv e-prints, 2014.
    [pdf] [publisher] [bibtex]

Theses

  1. Algorithm Engineering for Realistic Journey Planning in Transportation Networks. By Thomas Pajor. PhD thesis, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2013.
    [pdf] [publisher] [bibtex]
  2. Multi-Modal Route Planning. By Thomas Pajor. Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH), 2009.
    [pdf] [bibtex]
  3. Goal Directed Speed-Up Techniques for Shortest Path Queries in Timetable Networks. By Thomas Pajor. Student Research Project, Fakultät für Informatik, Universität Karlsruhe (TH), 2008.
    [pdf] [bibtex]