![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 36 matches
- 2013
- Surender Baswana, Neelesh Khanna:
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. Algorithmica 66(1): 18-50 (2013) - Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao:
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Algorithmica 66(2): 397-418 (2013) - Kevin Buchin
, Maike Buchin
, Marc J. van Kreveld
, Maarten Löffler, Rodrigo I. Silveira
, Carola Wenk
, Lionov Wiratma:
Median Trajectories. Algorithmica 66(3): 595-614 (2013) - Ioannis Caragiannis
:
Efficient Coordination Mechanisms for Unrelated Machine Scheduling. Algorithmica 66(3): 512-540 (2013) - Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:
Tile Complexity of Approximate Squares. Algorithmica 66(1): 1-17 (2013) - Lijun Chang, Jeffrey Xu Yu, Lu Qin
:
Fast Maximal Cliques Enumeration in Sparse Graphs. Algorithmica 66(1): 173-186 (2013) - Danny Z. Chen, Haitao Wang:
Approximating Points by a Piecewise Linear Function. Algorithmica 66(3): 682-713 (2013) - Serafino Cicerone
, Gianlorenzo D'Angelo
, Gabriele Di Stefano, Daniele Frigioni
, Vinicio Maurizio:
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013) - David Doty
, Lila Kari, Benoît Masson:
Negative Interactions in Irreversible Self-assembly. Algorithmica 66(1): 153-172 (2013) - Feodor F. Dragan, Yang Xiang:
How to Use Spanning Trees to Navigate in Graphs. Algorithmica 66(3): 479-511 (2013) - Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. Algorithmica 66(4): 741-761 (2013) - Adrian Dumitrescu, Minghui Jiang:
On the Largest Empty Axis-Parallel Box Amidst n Points. Algorithmica 66(2): 225-248 (2013) - Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
:
List Factoring and Relative Worst Order Analysis. Algorithmica 66(2): 287-309 (2013) - Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation: A Framework for Analyzing and Designing Heuristics. Algorithmica 66(2): 450-478 (2013) - Longkun Guo, Hong Shen:
On Finding Min-Min Disjoint Paths. Algorithmica 66(3): 641-653 (2013) - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono
, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013) - Ahmed Helmi
, Alois Panholzer:
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. Algorithmica 66(4): 762-803 (2013) - Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. Algorithmica 66(1): 187-210 (2013) - Katharina T. Huber, Vincent Moulton
:
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. Algorithmica 66(3): 714-738 (2013) - Hsien-Kuei Hwang
, Conrado Martínez
, Robert Sedgewick:
Guest Editorial. Algorithmica 66(4): 739-740 (2013) - Satoru Iwata, Mizuyo Takamatsu:
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. Algorithmica 66(2): 346-368 (2013) - Jesper Jansson
, Wing-Kin Sung
:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. Algorithmica 66(2): 329-345 (2013) - Minghui Jiang:
Recognizing d-Interval Graphs and d-Track Interval Graphs. Algorithmica 66(3): 541-563 (2013) - Alexis C. Kaporis, Christos Makris
, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Improved Bounds for Finger Search on a RAM. Algorithmica 66(2): 249-286 (2013) - Christos Koufogiannakis, Neal E. Young
:
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Algorithmica 66(1): 113-152 (2013) - Elias Koutsoupias, Angelina Vidali
:
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica 66(1): 211-223 (2013) - Erik Krohn, Bengt J. Nilsson:
Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66(3): 564-594 (2013) - Avivit Lazar, Arie Tamir:
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Algorithmica 66(3): 615-640 (2013) - Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang
:
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. Algorithmica 66(2): 369-396 (2013) - Radu Mihaescu, Cameron Hill, Satish Rao:
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. Algorithmica 66(2): 419-449 (2013)
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-21 02:26 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