Остановите войну!
for scientists:
default search action
Hannah Bast
- > Home > Persons > Hannah Bast
Publications
- 2023
- [c61]Hannah Bast, Matthias Hertel, Sebastian Walter:
Fast Whitespace Correction with Encoder-Only Transformers. ACL (demo) 2023: 389-399 - [c59]Hannah Bast, Matthias Hertel, Natalie Prange:
A Fair and In-Depth Evaluation of Existing End-to-End Entity Linking Systems. EMNLP 2023: 6659-6672 - [c58]Hannah Bast, Patrick Brosi, Johannes Kalmbach, Axel Lehmann:
Efficient Interactive Visualization of Large Geospatial Query Results. SIGSPATIAL/GIS 2023: 51:1-51:4 - [i10]Hannah Bast, Matthias Hertel, Natalie Prange:
A Fair and In-Depth Evaluation of Existing End-to-End Entity Linking Systems. CoRR abs/2305.14937 (2023) - 2022
- [c56]Hannah Bast, Johannes Kalmbach, Theresa Klumpp, Florian Kramer, Niklas Schnelle:
Efficient and Effective SPARQL Autocompletion on Very Large Knowledge Graphs. CIKM 2022: 2893-2902 - [c55]Hannah Bast, Matthias Hertel, Natalie Prange:
ELEVANT: A Fully Automatic Fine-Grained Entity Linking Evaluation and Analysis Tool. EMNLP (Demos) 2022: 72-79 - [e2]Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck:
Algorithms for Big Data - DFG Priority Program 1736. Lecture Notes in Computer Science 13201, Springer 2022, ISBN 978-3-031-21533-9 [contents] - [i9]Hannah Bast, Matthias Hertel, Natalie Prange:
ELEVANT: A Fully Automatic Fine-Grained Entity Linking Evaluation and Analysis Tool. CoRR abs/2208.07193 (2022) - 2021
- [c54]Hannah Bast, Matthias Hertel, Mostafa M. Mohamed:
Tokenization Repair in the Presence of Spelling Errors. CoNLL 2021: 279-289 - [c53]Hannah Bast, Patrick Brosi, Johannes Kalmbach, Axel Lehmann:
An Efficient RDF Converter and SPARQL Endpoint for the Complete OpenStreetMap Data. SIGSPATIAL/GIS 2021: 536-539 - [c52]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Flexible Base Grids. SSTD 2021: 12-22 - [i8]Hannah Bast, Johannes Kalmbach, Theresa Klumpp, Florian Kramer, Niklas Schnelle:
Efficient SPARQL Autocompletion via SPARQL. CoRR abs/2104.14595 (2021) - 2020
- [j15]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Octilinear Grid Graphs. Comput. Graph. Forum 39(3): 357-367 (2020) - [c51]Hannah Bast, Patrick Brosi, Markus Näther:
staty: Quality Assurance for Public Transit Stations in OpenStreetMap. SIGSPATIAL/GIS 2020: 207-210 - [i7]Hannah Bast, Matthias Hertel, Mostafa M. Mohamed:
Tokenization Repair in the Presence of Spelling Errors. CoRR abs/2010.07878 (2020) - [i6]Hannah Bast, Patrick Brosi, Markus Näther:
Similarity Classification of Public Transit Stations. CoRR abs/2012.15267 (2020) - 2019
- [j14]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. ACM Trans. Spatial Algorithms Syst. 5(4): 25:1-25:36 (2019) - 2018
- [c50]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient generation of geographically accurate transit maps. SIGSPATIAL/GIS 2018: 13-22 - [c49]Hannah Bast, Patrick Brosi:
Sparse map-matching in public transit networks with turn restrictions. SIGSPATIAL/GIS 2018: 480-483 - [c48]Hannah Bast, Niklas Schnelle:
Efficient and Convenient SPARQL+Text Search: A Quick Survey. Reasoning Web 2018: 26-34 - [e1]Yossi Azar, Hannah Bast, Grzegorz Herman:
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland. LIPIcs 112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-081-1 [contents] - 2017
- [c46]Hannah Bast, Claudius Korzen:
A Benchmark and Evaluation for Text Extraction from PDF. JCDL 2017: 99-108 - [i5]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. CoRR abs/1710.02226 (2017) - 2016
- [c44]Hannah Bast, Matthias Hertel, Sabine Storandt:
Scalable Transfer Patterns. ALENEX 2016: 15-29 - [p1]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 - 2015
- [c42]Hannah Bast, Sabine Storandt, Simon Weidner:
Fine-grained population estimation. SIGSPATIAL/GIS 2015: 17:1-17:10 - [i2]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) - 2014
- [c40]Hannah Bast, Sabine Storandt:
Flow-Based Guidebook Routing. ALENEX 2014: 155-165 - [c38]Hannah Bast, Sabine Storandt:
Frequency-based search for public transit. SIGSPATIAL/GIS 2014: 13-22 - [c37]Hannah Bast, Patrick Brosi, Sabine Storandt:
Real-time movement visualization of public transit data. SIGSPATIAL/GIS 2014: 331-340 - [c36]Hannah Bast, Patrick Brosi, Sabine Storandt:
TRAVIC: a visualization client for public transit data. SIGSPATIAL/GIS 2014: 561-564 - [c34]Hannah Bast, Jonas Sternisko, Sabine Storandt:
ForestMaps: A Computational Model and Visualization for Forest Utilization. W2GIS 2014: 115-133 - 2013
- [c32]Hannah Bast, Jonas Sternisko, Sabine Storandt:
Delay-Robustness of Transfer Patterns in Public Transportation Route Planning. ATMOS 2013: 42-54 - [c31]Hannah Bast, Mirko Brodesser, Sabine Storandt:
Result Diversity for Multi-Modal Route Planning. ATMOS 2013: 123-136 - [c28]Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). SOCS 2013: 205-206 - [c27]Hannah Bast, Claudius Korzen:
The Icecite Research Paper Management System. WISE (2) 2013: 396-409 - 2010
- [c26]Remco C. Veltkamp, Geert-Jan Giezeman, Hannah Bast, Thomas Baumbach, Takahiko Furuya, Joachim Giesen, Afzal Godil, Zhouhui Lian, Ryutarou Ohbuchi, Waqar Saleem:
SHREC'10 Track: Large Scale Retrieval. 3DOR@Eurographics 2010: 63-69 - [c25]Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger:
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. ESA (1) 2010: 290-301 - 2007
- [c19]Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007 - 2006
- [j4]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - [c15]Hannah Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 2006: 175-192 - 2004
- [c6]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - 2003
- [j3]Hannah Bast, Kurt Mehlhorn, Guido Schäfer:
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003) - 2000
- [c4]Hannah Bast, Susan Hert:
The Area Partitioning Problem. CCCG 2000 - 1995
- [j1]Hannah Bast, Torben Hagerup:
Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995) - 1992
- [c2]Hannah Bast, Martin Dietzfelbinger, Torben Hagerup:
A Perfect Parallel Dictionary. MFCS 1992: 133-141 - 1991
- [c1]Hannah Bast, Torben Hagerup:
Fast and Reliable Parallel Hashing. SPAA 1991: 50-61
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-01-01 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint