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 34 matches
- 2015
- Anna Adamaszek, Alexandru Popa:
Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica 73(2): 371-388 (2015) - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin:
Computing the Greedy Spanner in Linear Space. Algorithmica 73(3): 589-606 (2015) - Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. Algorithmica 73(4): 623-636 (2015) - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. Algorithmica 73(3): 511-546 (2015) - Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. Algorithmica 73(1): 143-165 (2015) - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015) - Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015) - Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano:
Editorial. Algorithmica 73(4): 748-749 (2015) - Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano:
Erratum to: Editorial. Algorithmica 73(4): 750 (2015) - Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. Algorithmica 73(3): 607-619 (2015) - Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015) - Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. Algorithmica 73(2): 261-288 (2015) - Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica 73(1): 42-62 (2015) - Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam:
Guest Editors Foreword. Algorithmica 73(4): 621-622 (2015) - Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set: New Measure and New Structures. Algorithmica 73(1): 63-86 (2015) - Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. Algorithmica 73(4): 673-695 (2015) - Radu Curticapean, Marvin Künnemann:
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. Algorithmica 73(3): 483-510 (2015) - Aparna Das, Claire Mathieu:
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. Algorithmica 73(1): 115-142 (2015) - Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
Maximum Metric Spanning Tree Made Byzantine Tolerant. Algorithmica 73(1): 166-201 (2015) - Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica 73(2): 441-459 (2015) - Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. Algorithmica 73(1): 87-114 (2015) - Martin Farach-Colton, Meng-Tsung Tsai:
Exact Sublinear Binomial Sampling. Algorithmica 73(4): 637-651 (2015) - Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. Algorithmica 73(2): 411-440 (2015) - Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2n. Algorithmica 73(1): 202-216 (2015) - Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Regular Augmentation of Planar Graphs. Algorithmica 73(2): 306-370 (2015) - Kyle Klein, Subhash Suri:
Pursuit Evasion on Polyhedral Surfaces. Algorithmica 73(4): 730-747 (2015) - Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu:
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties. Algorithmica 73(2): 460-482 (2015)
skipping 4 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-10-02 13: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