Остановите войну!
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 34 matches
- 2011
- Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. Algorithmica 59(4): 569-582 (2011) - Marshall W. Bern, Barry Hayes:
Origami Embedding of Piecewise-Linear Two-Manifolds. Algorithmica 59(1): 3-15 (2011) - Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011) - Victor Chepoi, Morgan Seston:
Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. Algorithmica 59(4): 521-568 (2011) - Hervé Daudé, Vlady Ravelomanana:
Random 2 XORSAT Phase Transition. Algorithmica 59(1): 48-65 (2011) - Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley:
Approximation Algorithms for k-hurdle Problems. Algorithmica 59(1): 81-93 (2011) - Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi:
Energy Efficient Monitoring in Sensor Networks. Algorithmica 59(1): 94-114 (2011) - Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011) - Benjamin Doerr, Thomas Jansen:
Theory of Evolutionary Computation. Algorithmica 59(3): 299-300 (2011) - Christoph Dürr, Mathilde Hurand:
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. Algorithmica 59(2): 256-268 (2011) - Hervé Fournier, Olivier Teytaud:
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3): 387-408 (2011) - Anupam Gupta, Kunal Talwar:
Making Doubling Metrics Geodesic. Algorithmica 59(1): 66-80 (2011) - Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) - Viet Tung Hoang, Wing-Kin Sung:
Improved Algorithms for Maximum Agreement and Compatible Supertrees. Algorithmica 59(2): 195-214 (2011) - Yoshifumi Inui, François Le Gall:
Quantum Property Testing of Group Solvability. Algorithmica 59(1): 35-47 (2011) - Jens Jägersküpper:
Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded. Algorithmica 59(3): 409-424 (2011) - Mohamed Jebalia, Anne Auger, Nikolaus Hansen:
Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments. Algorithmica 59(3): 425-460 (2011) - Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59(2): 215-239 (2011) - Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. Algorithmica 59(4): 471-488 (2011) - Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. Algorithmica 59(2): 269-297 (2011) - Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011) - Lukasz Kowalik, Marcin Mucha:
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica 59(2): 240-255 (2011) - Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59(1): 1-2 (2011) - Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59(4): 601-620 (2011) - Igor L. Markov, Yaoyun Shi:
Constant-Degree Graph Expansions that Preserve Treewidth. Algorithmica 59(4): 461-470 (2011) - Frank Neumann, Joachim Reichel, Martin Skutella:
Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica 59(3): 323-342 (2011) - Alfredo García Olaverri, Javier Tejel:
Augmenting the Rigidity of a Graph in R2. Algorithmica 59(2): 145-168 (2011) - Pietro S. Oliveto, Carsten Witt:
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. Algorithmica 59(3): 369-386 (2011) - Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59(1): 16-34 (2011) - Liam Roditty, Michael Segal:
On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011)
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-03-29 10:01 CET 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