Hannah Bast
H. Bast
Person information
- affiliation: University of Freiburg, Germany
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
- [j13]Hannah Bast, Björn Buchhold, Elmar Haussmann:
A Quality Evaluation of Combined Search on a Knowledge Base and Text. KI 32(1): 19-26 (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 fuer Informatik 2018, ISBN 978-3-95977-081-1 [contents] - 2017
- [c47]Hannah Bast, Björn Buchhold:
QLever: A Query Engine for Efficient SPARQL+Text Search. CIKM 2017: 647-656 - [c46]Hannah Bast, Claudius Korzen:
A Benchmark and Evaluation for Text Extraction from PDF. JCDL 2017: 99-108 - [c45]Stefan Heindorf, Martin Potthast, Hannah Bast, Björn Buchhold, Elmar Haussmann:
WSDM Cup 2017: Vandalism Detection and Triple Scoring. WSDM 2017: 827-828 - [i5]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. CoRR abs/1710.02226 (2017) - [i4]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Overview of the Triple Scoring Task at the WSDM Cup 2017. CoRR abs/1712.08081 (2017) - [i3]Martin Potthast, Stefan Heindorf, Hannah Bast:
Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring. CoRR abs/1712.09528 (2017) - 2016
- [j12]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Semantic Search on Text and Knowledge Bases. Foundations and Trends in Information Retrieval 10(2-3): 119-271 (2016) - [c44]
- [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
- [c43]
- [c42]Hannah Bast, Sabine Storandt, Simon Weidner:
Fine-grained population estimation. SIGSPATIAL/GIS 2015: 17:1-17:10 - [c41]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Relevance Scores for Triples from Type-Like Relations. SIGIR 2015: 243-252 - [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
- [j11]Hannah Bast, Marjan Celikik:
Efficient Index-Based Snippet Generation. ACM Trans. Inf. Syst. 32(2): 6:1-6:24 (2014) - [c40]
- [c39]Hannah Bast, Elmar Haussmann:
More Informative Open Information Extraction via Simple Inference. ECIR 2014: 585-590 - [c38]
- [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 - [c35]Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haußmann:
Semantic full-text search with broccoli. SIGIR 2014: 1265-1266 - [c34]Hannah Bast, Jonas Sternisko, Sabine Storandt:
ForestMaps: A Computational Model and Visualization for Forest Utilization. W2GIS 2014: 115-133 - [c33]Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haußmann:
Easy access to the freebase dataset. WWW (Companion Volume) 2014: 95-98 - 2013
- [j10]
- [j9]Hannah Bast, Marjan Celikik:
Efficient fuzzy search in large text collections. ACM Trans. Inf. Syst. 31(2): 10 (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 - [c30]
- [c29]Hannah Bast, Elmar Haussmann:
Open Information Extraction via Contextual Sentence Decomposition. ICSC 2013: 154-159 - [c28]Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). SOCS 2013 - [c27]
- 2012
- [i1]Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haussmann:
Broccoli: Semantic Full-Text Search at your Fingertips. CoRR abs/1207.2615 (2012) - 2011
- [j8]Hannah Bast, Marjan Celikik:
Fast construction of the HYB index. ACM Trans. Inf. Syst. 29(3): 16:1-16:33 (2011) - 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 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 - [c24]
2000 – 2009
- 2009
- [c23]
- [c22]
- [c21]Marjan Celikik, Hannah Bast:
Fast Single-Pass Construction of a Half-Inverted Index. SPIRE 2009: 194-205 - 2008
- [j7]H. Bast, Christian Worm Mortensen, Ingmar Weber:
Output-sensitive autocompletion search. Inf. Retr. 11(4): 269-286 (2008) - [j6]
- [j5]Martin Theobald, H. Bast, Debapriyo Majumdar, Ralf Schenkel, Gerhard Weikum:
TopX: efficient and versatile top- k query processing for semistructured data. VLDB J. 17(1): 81-115 (2008) - [c20]H. Bast, Fabian M. Suchanek, Ingmar Weber:
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. ICDM Workshops 2008: 959-962 - 2007
- [c19]H. Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007 - [c18]H. Bast, Ingmar Weber:
The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. CIDR 2007: 88-95 - [c17]H. Bast, Debapriyo Majumdar, Ingmar Weber:
Efficient interactive query expansion with complete search. CIKM 2007: 857-860 - [c16]H. Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber:
ESTER: efficient search on text, entities, and relations. SIGIR 2007: 671-678 - 2006
- [j4]H. 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]H. Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 2006: 175-192 - [c14]H. Bast, Ingmar Weber:
Type less, find more: fast autocompletion search with a succinct index. SIGIR 2006: 364-371 - [c13]H. Bast, Christian Worm Mortensen, Ingmar Weber:
Output-Sensitive Autocompletion Search. SPIRE 2006: 150-162 - [c12]H. Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum:
IO-Top-k at TREC 2006: Terabyte Track. TREC 2006 - [c11]H. Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum:
IO-Top-k: Index-access Optimized Top-k Query Processing. VLDB 2006: 475-486 - 2005
- [c10]H. Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski:
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. EWMF/KDO 2005: 103-120 - [c9]
- [c8]
- [c7]H. Bast, Ingmar Weber:
Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005: 232-239 - 2004
- [c6]H. Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - 2003
- [j3]H. 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) - 2002
- [c5]
- 2000
- [b1]Hannah Bast:
Provably optimal scheduling of similar tasks. Saarland University, Saarbrücken, Germany 2000, pp. 1-135 - [j2]
- [c4]
1990 – 1999
- 1998
- [c3]
- 1995
- [j1]Hannah Bast, Torben Hagerup:
Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995) - 1992
- [c2]
- 1991
- [c1]
Coauthor Index
last updated on 2019-01-11 22:20 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint