default search action
Search 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 16 matches
- 2015
- Deepak Ajwani, Ulrich Meyer, David Veith:
An I/O-efficient Distance Oracle for Evolving Real-World Graphs. ALENEX 2015: 159-172 - Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. ALENEX 2015: 33-43 - Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. ALENEX 2015: 70-81 - Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. ALENEX 2015: 133-146 - Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. ALENEX 2015: 44-54 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri:
Engineering Motif Search for Large Graphs. ALENEX 2015: 104-118 - Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira:
Region-based Approximation Algorithms for Visibility between Imprecise Locations. ALENEX 2015: 94-103 - Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. ALENEX 2015: 119-132 - Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing MaxMin Edge Length Triangulations. ALENEX 2015: 55-69 - Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
Cache Replacement with Memory Allocation. ALENEX 2015: 1-9 - Simon Gog, Gonzalo Navarro:
Improved Single-Term Top-k Document Retrieval. ALENEX 2015: 24-32 - Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu:
A Data-Aware FM-index. ALENEX 2015: 10-23 - Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. ALENEX 2015: 147-158 - William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - Yuzuru Okajima, Kouichi Maruyama:
Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions. ALENEX 2015: 82-93 - Ulrik Brandes, David Eppstein:
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. SIAM 2015, ISBN 978-1-61197-375-4 [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-25 12:06 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