default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2021
- Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - Diptendu Chatterjee
, Bimal Kumar Roy:
An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two. ATMOS 2021: 16:1-16:15 - Daniel Chen, Christian Sommer, Daniel Wolleb:
Fast Map Matching with Vertex-Monotone Fréchet Distance. ATMOS 2021: 10:1-10:20 - Elia Costa, Francesco Silvestri:
On the Bike Spreading Problem. ATMOS 2021: 5:1-5:16 - Peter Damaschke:
Distance-Based Solution of Patrolling Problems with Individual Waiting Times. ATMOS 2021: 14:1-14:14 - Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, Thomas G. Yeung:
A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper). ATMOS 2021: 19:1-19:6 - Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr:
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. ATMOS 2021: 8:1-8:16 - Marc Goerigk, Anita Schöbel, Felix Spühler:
A Phase I Simplex Method for Finding Feasible Periodic Timetables. ATMOS 2021: 6:1-6:13 - Natividad González-Blanco, Antonio J. Lozano, Vladimir Marianov, Juan A. Mesa:
An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). ATMOS 2021: 18:1-18:6 - Vera Grafe, Anita Schöbel:
Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks. ATMOS 2021: 9:1-9:16 - Syu-Ning Johnn, Yiran Zhu, Andrés Miniguano-Trujillo, Akshay Gupte:
Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties. ATMOS 2021: 4:1-4:21 - Vassilissa Lehoux-Lebacque, Christelle Loiodice:
Transfer Customization with the Trip-Based Public Transit Routing Algorithm. ATMOS 2021: 15:1-15:17 - Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe:
Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. ATMOS 2021: 7:1-7:15 - Niels Lindner, Christian Liebchen, Berenike Masing:
Forward Cycle Bases and Periodic Timetabling. ATMOS 2021: 2:1-2:14 - Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. ATMOS 2021: 3:1-3:20 - Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling:
Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. ATMOS 2021: 11:1-11:18 - Güvenç Sahin, Amin Ahmadi Digehsara, Ralf Borndörfer:
Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper). ATMOS 2021: 17:1-17:6 - Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes. ATMOS 2021: 1:1-1:15 - Marco Silva, João Pedro Pedroso, Ana Viana, Xenia Klimentova:
A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals. ATMOS 2021: 12:1-12:20 - Matthias Müller-Hannemann, Federico Perea:
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference). OASIcs 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-213-6 [contents]
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-11-26 17:39 CET from data curated 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:
