Остановите войну!
for scientists:
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 18 matches
- 2016
- Peter Sanders, Norbert Zeh:
Introduction to Special Issue ALENEX 2013. ACM J. Exp. Algorithmics 21(1): 2.1:1-2.1:2 (2016) - Martin Bergner, Marco E. Lübbecke, Jonas T. Witt:
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. ACM J. Exp. Algorithmics 21(1): 1.2:1-1.2:16 (2016) - Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and LCP Arrays in External Memory. ACM J. Exp. Algorithmics 21(1): 2.3:1-2.3:27 (2016) - David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM J. Exp. Algorithmics 21(1): 1.3:1-1.3:23 (2016) - Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 21(1): 1.5:1-1.5:49 (2016) - Alexandros Efentakis, Dieter Pfoser:
ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks. ACM J. Exp. Algorithmics 21(1): 1.13:1-1.13:35 (2016) - Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer:
Short and Simple Cycle Separators in Planar Graphs. ACM J. Exp. Algorithmics 21(1): 2.2:1-2.2:24 (2016) - Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. ACM J. Exp. Algorithmics 21(1): 1.4:1-1.4:21 (2016) - Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. ACM J. Exp. Algorithmics 21(1): 1.6:1-1.6:20 (2016) - Joachim Gudmundsson, Jyrki Katajainen:
Editorial, SEA 2014 Special Issue. ACM J. Exp. Algorithmics 21(1): 1.1:1 (2016) - Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. ACM J. Exp. Algorithmics 21(1): 1.7:1-1.7:22 (2016) - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lazy Lempel-Ziv Factorization Algorithms. ACM J. Exp. Algorithmics 21(1): 2.4:1-2.4:19 (2016) - Martin Marinov, Nicholas Nash, David Gregg:
Practical Algorithms for Finding Extremal Sets. ACM J. Exp. Algorithmics 21(1): 1.9:1-1.9:21 (2016) - Catherine C. McGeoch:
In Memoriam: David S. Johnson. ACM J. Exp. Algorithmics 21(1): 1.1e:1 (2016) - Gonzalo Navarro, Alberto Ordóñez Pereira:
Faster Compressed Suffix Trees for Repetitive Collections. ACM J. Exp. Algorithmics 21(1): 1.8:1-1.8:38 (2016) - Jiju Peethambaran, Amal Dev Parakkat, Ramanathan Muthuganapathy:
An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets. ACM J. Exp. Algorithmics 21(1): 1.10:1-1.10:24 (2016) - Conrad W. Rosenbrock, Wiley S. Morgan, Gus L. W. Hart, Stefano Curtarolo, Rodney W. Forcade:
Numerical Algorithm for Pólya Enumeration Theorem. ACM J. Exp. Algorithmics 21(1): 1.11:1-1.11:17 (2016) - Takahisa Toda, Takehide Soh:
Implementing Efficient All Solutions SAT Solvers. ACM J. Exp. Algorithmics 21(1): 1.12:1-1.12:44 (2016)
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-09-08 18:09 CEST 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