Остановите войну!
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 42 matches
- 2014
- Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. Algorithmica 69(1): 184-215 (2014) - Xavier Allamigeon:
On the Complexity of Strongly Connected Components in Directed Hypergraphs. Algorithmica 69(2): 335-369 (2014) - Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh:
Better Size Estimation for Sparse Matrix Products. Algorithmica 69(3): 741-757 (2014) - Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Efficient Fully-Compressed Sequence Representations. Algorithmica 69(1): 232-268 (2014) - Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3): 501-521 (2014) - Anne Benoit, Matthieu Gallet, Bruno Gaujal, Yves Robert:
Computing the Throughput of Probabilistic and Replicated Streaming Applications. Algorithmica 69(4): 925-957 (2014) - Philip Bille, Inge Li Gørtz:
Substring Range Reporting. Algorithmica 69(2): 384-396 (2014) - Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014) - David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian:
Necklaces, Convolutions, and X+Y. Algorithmica 69(2): 294-314 (2014) - Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor. Algorithmica 69(3): 658-684 (2014) - T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function. Algorithmica 69(3): 605-618 (2014) - Zhi-Zhong Chen, Wenji Ma, Lusheng Wang:
The Parameterized Complexity of the Shared Center Problem. Algorithmica 69(2): 269-293 (2014) - Danny Z. Chen, Haitao Wang:
New Algorithms for Facility Location Problems on the Real Line. Algorithmica 69(2): 370-383 (2014) - Danny Z. Chen, Haitao Wang:
Outlier Respecting Points Approximation. Algorithmica 69(2): 410-430 (2014) - Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. Algorithmica 69(3): 619-640 (2014) - Keren Cohen, Raphael Yuster:
On Minimum Witnesses for Boolean Matrix Multiplication. Algorithmica 69(2): 431-442 (2014) - Atlas F. Cook IV, Carola Wenk:
Shortest Path Problems on a Polyhedral Surface. Algorithmica 69(1): 58-77 (2014) - Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - Feodor F. Dragan, Ekkehard Köhler:
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica 69(4): 884-905 (2014) - Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. Algorithmica 69(2): 315-334 (2014) - Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. Algorithmica 69(1): 26-57 (2014) - Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Algorithmica 69(1): 92-116 (2014) - Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - Leonor Frias, Salvador Roura:
Multikey Quickselect. Algorithmica 69(4): 958-973 (2014) - Hiroshi Fujiwara, Tobias Jacobs:
On the Huffman and Alphabetic Tree Problem with General Cost Functions. Algorithmica 69(3): 582-604 (2014) - Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Circle Graph Recognition. Algorithmica 69(4): 759-788 (2014) - Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica 69(4): 789-843 (2014) - Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69(4): 906-924 (2014) - Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. Algorithmica 69(1): 130-147 (2014) - Stasys Jukna:
Limitations of Incremental Dynamic Programming. Algorithmica 69(2): 461-492 (2014)
skipping 12 more matches
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-06-06 07:07 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