T
Thomas Pajor
Researcher at Microsoft
Publications - 52
Citations - 2941
Thomas Pajor is an academic researcher from Microsoft. The author has contributed to research in topics: Dijkstra's algorithm & Heuristics. The author has an hindex of 24, co-authored 52 publications receiving 2615 citations. Previous affiliations of Thomas Pajor include Karlsruhe Institute of Technology.
Papers
More filters
Book ChapterDOI
Route Planning in Transportation Networks
Hannah Bast,Daniel Delling,Andrew V. Goldberg,Matthias Müller-Hannemann,Thomas Pajor,Peter Sanders,Dorothea Wagner,Renato F. Werneck +7 more
TL;DR: In this article, the authors survey recent advances in algorithms for route planning in transportation networks, and show that one can compute driving directions in milliseconds or less even at continental scale for road networks, while others can deal efficiently with real-time traffic.
Book ChapterDOI
Customizable route planning
TL;DR: An algorithm to compute shortest paths on continental road networks with arbitrary metrics (cost functions) that supports turn costs, enables real-time queries, and can incorporate a new metric in a few seconds--fast enough to support real- time traffic updates and personalized optimization functions.
Proceedings ArticleDOI
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
TL;DR: The sketch-based influence maximization (SKIM) algorithm as discussed by the authors is a greedy algorithm that scales to graphs with billions of edges, with one to two orders of magnitude speedup over the best greedy methods.
Proceedings ArticleDOI
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
TL;DR: This work develops a novel sketch-based design for influence computation, called SKIM, which scales to graphs with billions of edges, with one to two orders of magnitude speedup over the best greedy methods.
Journal ArticleDOI
Round-Based Public Transit Routing
TL;DR: This work introduces RAPTOR, a novel round-based public transit router that computes all Pareto-optimal journeys between two random locations an order of magnitude faster than previous approaches, which easily enables interactive applications.