default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Pajor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Thomas Pajor:
Algorithm Engineering for Realistic Journey Planning in Transportation Networks. Karlsruhe Institute of Technology, 2013
Journal Articles
- 2020
- [j8]Moritz Baum
, Julian Dibbelt, Thomas Pajor, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Energy-Optimal Routes for Battery Electric Vehicles. Algorithmica 82(5): 1490-1546 (2020) - 2018
- [j7]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. ACM J. Exp. Algorithmics 23 (2018) - [j6]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1): 69-118 (2018) - 2017
- [j5]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - 2015
- [j4]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing. Transp. Sci. 49(3): 591-604 (2015) - 2014
- [j3]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-regular schematization of embedded paths. Comput. Geom. 47(3): 381-406 (2014) - [j2]Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multimodal Route Planning. ACM J. Exp. Algorithmics 19(1) (2014) - 2012
- [j1]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. ACM J. Exp. Algorithmics 17(1) (2012)
Conference and Workshop Papers
- 2019
- [c27]Daniel Delling, Julian Dibbelt, Thomas Pajor:
Fast and Exact Public Transit Routing with Restricted Pareto Sets. ALENEX 2019: 54-65 - 2017
- [c26]Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf:
Faster Transit Routing by Hyper Partitioning. ATMOS 2017: 8:1-8:14 - 2016
- [c25]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. SEA 2016: 33-49 - 2015
- [c24]Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner:
Towards Realistic Pedestrian Route Planning. ATMOS 2015: 1-15 - [c23]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. SEA 2015: 273-285 - 2014
- [c22]Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, Dorothea Wagner:
Speed-Consumption Tradeoff for Electric Vehicle Route Planning. ATMOS 2014: 138-151 - [c21]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM 2014: 629-638 - [c20]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing classic closeness centrality, at scale. COSN 2014: 37-50 - [c19]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [c18]Daniel Delling, Giuseppe F. Italiano, Thomas Pajor, Federico Santaroni:
Better transit routing by exploiting vehicle GPS data. IWCTS@SIGSPATIAL 2014: 31-40 - 2013
- [c17]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Energy-optimal routes for electric vehicles. SIGSPATIAL/GIS 2013: 54-63 - [c16]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - [c15]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). SOCS 2013: 213 - [c14]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Intriguingly Simple and Fast Transit Routing. SEA 2013: 43-54 - [c13]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck:
Computing Multimodal Journeys in Practice. SEA 2013: 260-271 - [c12]Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf:
Efficient Computation of Jogging Routes. SEA 2013: 272-283 - 2012
- [c11]Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multi-Modal Route Planning. ALENEX 2012: 118-129 - [c10]Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck:
Round-Based Public Transit Routing. ALENEX 2012: 130-140 - 2011
- [c9]Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo:
UniALT for regular language contrained shortest paths on a multi-modal transportation network. ATMOS 2011: 64-75 - [c8]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-Regular Schematization of Embedded Paths. SOFSEM 2011: 260-271 - [c7]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387 - 2010
- [c6]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
Automatic Generation of Route Sketches. GD 2010: 391-392 - [c5]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. IPDPS 2010: 1-12 - [c4]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor:
Path Schematization for Route Sketches. SWAT 2010: 285-296 - 2009
- [c3]Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis:
Efficient Route Planning in Flight Networks. ATMOS 2009 - [c2]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598 - 2008
- [c1]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008
Parts in Books or Collections
- 2016
- [p2]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - 2009
- [p1]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206
Informal and Other Publications
- 2017
- [i8]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. CoRR abs/1703.05997 (2017) - 2015
- [i7]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - [i6]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. CoRR abs/1505.01446 (2015) - [i5]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. CoRR abs/1512.09132 (2015) - 2014
- [i4]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR abs/1408.6282 (2014) - [i3]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing Classic Closeness Centrality, at Scale. CoRR abs/1409.0035 (2014) - [i2]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Timed Influence: Computation and Maximization. CoRR abs/1410.6976 (2014) - [i1]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A Robust and Scalable Algorithm for the Steiner Problem in Graphs. CoRR abs/1412.2787 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
