Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Thomas Pajor

Thomas Pajor
POST DOC RESEARCHER
.

Microsoft Research
641 Avenue of the Americas
New York, NY 10011
Mail: tpajor [at] microsoft [dot] com

I joined Microsoft Research as a postdoc in September 2013. My research interests include combinatorial optimization, graph algorithms, and algorithm engineering.

My work focuses on developing and prototyping efficient, practical algorithms with theoretical guarantees. Some examples of my work include:

  • The SKIM algorithm solves the problem of influence maximization in network with billions of edges in minutes to hours with theoretical guarantees (with Edith Cohen, Daniel Delling, and Renato Werneck).
    Publications: arXiv, CIKM’14

  • The Customizable Route Planning algorithm for computing personalized driving directions in road networks. This algorithm is now in use by Bing Maps (with Daniel Delling, Andrew Goldberg, and Renato Werneck).
    Publications: SEA’11, journal preprint

  • The RAPTOR algorithm for computing public transit journeys optimizing multiple criteria (with Daniel Delling and Renato Werneck).
    Publications: ALENEX’12, Transportation Science

  • The RXL algorithm for very fast exact distance computation on a wide range of graph classes of massive scale (with Daniel Delling, Andrew Goldberg and Renato Werneck).
    Publications: TRESA’14

My previous website at the Karlsruhe Institute of Technology (KIT) can be found here.

News

2014-12-01:
I have transfered to Microsoft Research New York City for the remainder of my postdoc.

2014-10-01:
Our paper “Computing Classic Closeness Centrality, at Scale” won the best paper award at COSN’14.

Activities

PC member of ESA 2015, ATMOS 2015, ALENEX 2015.

Selected Publications

Edith Cohen, Daniel Delling, Thomas Pajor, and Renato Werneck, Sketch-based Influence Maximization and Computation: Scaling up with Guarantees, in Proceedings of the 23rd International Conference on Information and Knowledge Management, ACM – Association for Computing Machinery, November 2014

Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck, Computing Classic Closeness Centrality, at Scale, in Proceedings of the Second ACM Conference on Online Social Networks (COSN’14), ACM – Association for Computing Machinery, October 2014

Daniel Delling, Andrew Goldberg, Thomas Pajor, and Renato Werneck, Robust Distance Queries on Massive Networks, in Proceedings of the 22nd European Symposium on Algorithms, Springer, September 2014

Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck, Computing Classic Closeness Centrality, at Scale, no. MSR-TR-2014-71, 29 August 2014

Edith Cohen, Daniel Delling, Thomas Pajor, and Renato Werneck, Sketch-based Influence Maximization and Computation: Scaling up with Guarantees, no. MSR-TR-2014-110, August 2014

Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck, Robust Exact Distance Queries on Massive Networks, no. MSR-TR-2014-12, July 2014

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato Werneck, Route Planning in Transportation Networks, no. MSR-TR-2014-4, January 2014

Moritz Baum, Julian Dibbelt, Thomas Pajor, and Dorothea Wagner, Energy-Optimal Routes for Electric Vehicles, in Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM Press, November 2013

Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, and Renato F. Werneck, Computing Multimodal Journeys in Practice, in Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Springer, June 2013

Julian Dibbelt, Thomas Pajor, Ben Strasser, and Dorothea Wagner, Intriguingly Simple and Fast Transit Routing, in Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Springer, 2013

Andreas Gemsa, Thomas Pajor, Dorothea Wagner, and Tobias Zündorf, Efficient Computation of Jogging Routes, in Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Springer, 2013

Daniel Delling, Andrew Goldberg, Thomas Pajor, and Renato Werneck, Customizable Route Planning in Road Networks, 2013

Daniel Delling, Bastian Katz, and Thomas Pajor, Parallel Computation of Best Connections in Public Transportation Networks, in Journal of Experimental Algorithmics, vol. 17, no. 4, pp. 4.1–4.26, ACM, July 2012

Daniel Delling, Thomas Pajor, and Renato F. Werneck, Round-Based Public Transit Routing, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), Society for Industrial and Applied Mathematics, 2012

Julian Dibbelt, Thomas Pajor, and Dorothea Wagner, User-Constrained Multi-Modal Route Planning, in Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), SIAM, 2012

Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck, Customizable Route Planning, in Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), Springer Verlag, May 2011

Dominik Kirchler, Leo Liberti, Thomas Pajor, and Roberto Wolfler Calvo, UniALT for Regular Language Constraint Shortest Paths on a Multi-Modal Transportation Network, in Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11), 2011

Daniel Delling, Thomas Pajor, and Dorothea Wagner, Accelerating Multi-Modal Route Planning by Access-Nodes, in Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), Springer Verlag, September 2009

Thomas Pajor, Multi-Modal Route Planning, University of Karlsruhe, University of Karlsruhe, March 2009

Daniel Delling, Thomas Pajor, and Dorothea Wagner, Engineering Time-Expanded Graphs for Faster Timetable Information, in Robust and Online Large-Scale Optimization, vol. 5868, pp. 182–206, Springer, 2009

A complete list of publications can be found here.