Остановите войну!
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
- 2014
- Claudio Angione, Annalisa Occhipinti, Giuseppe Nicosia:
Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions. ACM J. Exp. Algorithmics 19(1) (2014) - B. O. Fagginger Auer, Rob H. Bisseling:
Efficient Matching for Column Intersection Graphs. ACM J. Exp. Algorithmics 19(1) (2014) - David A. Bader, Petra Mutzel:
Introduction to Special Issue ALENEX'12. ACM J. Exp. Algorithmics 19(1) (2014) - Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multimodal Route Planning. ACM J. Exp. Algorithmics 19(1) (2014) - Benjamin Doerr, Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics 19(1) (2014) - Asaf Frieder, Liam Roditty:
An Experimental Study on Approximating k Shortest Simple Paths. ACM J. Exp. Algorithmics 19(1) (2014) - Gustavo Rodrigues Galvão, Zanoni Dias:
An Audit Tool for Genome Rearrangement Algorithms. ACM J. Exp. Algorithmics 19(1) (2014) - Rodrigo González, Gonzalo Navarro, Héctor Ferrada:
Locally Compressed Suffix Arrays. ACM J. Exp. Algorithmics 19(1) (2014) - Robert Görke, Andrea Kappes, Dorothea Wagner:
Experiments on Density-Constrained Graph Clustering. ACM J. Exp. Algorithmics 19(1) (2014) - Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions. ACM J. Exp. Algorithmics 19(1) (2014) - Tomasz Jurkiewicz, Kurt Mehlhorn:
On a Model of Virtual Address Translation. ACM J. Exp. Algorithmics 19(1) (2014) - Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. ACM J. Exp. Algorithmics 19(1) (2014) - Ralf Klasing:
Editorial. ACM J. Exp. Algorithmics 19(1) (2014) - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks. ACM J. Exp. Algorithmics 19(1) (2014) - David F. Manlove, Gregg O'Malley:
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. ACM J. Exp. Algorithmics 19(1) (2014) - Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. ACM J. Exp. Algorithmics 19(1) (2014) - Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela:
General Document Retrieval in Compact Space. ACM J. Exp. Algorithmics 19(1) (2014) - Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. ACM J. Exp. Algorithmics 19(1) (2014)
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-04-23 05:01 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