Остановите войну!
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 45 matches
- 2010
- Nir Ailon:
Aggregation of Partial Rankings, p-Ratings and Top-m Lists. Algorithmica 57(2): 284-300 (2010) - Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Approximating Tree Edit Distance through String Edit Distance. Algorithmica 57(2): 325-348 (2010) - Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. Algorithmica 57(4): 725-746 (2010) - Eric Anderson, Joseph Hall, Jason D. Hartline, M. Hobbes, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes:
Algorithms for Data Migration. Algorithmica 57(2): 349-380 (2010) - Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010) - Anne Auger, Olivier Teytaud:
Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms. Algorithmica 57(1): 121-146 (2010) - Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Algorithmica 57(3): 517-537 (2010) - Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
Computing median and antimedian sets in median graphs. Algorithmica 57(2): 207-216 (2010) - Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) - Anne Benoit, Yves Robert:
Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows. Algorithmica 57(4): 689-724 (2010) - Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) - Henrik Blunck, Jan Vahrenhold:
In-Place Algorithms for Computing (Layers of) Maxima. Algorithmica 57(1): 1-21 (2010) - Joan Boyar, Lene M. Favrholdt:
Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010) - Liming Cai, Xiuzhen Huang:
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. Algorithmica 57(2): 398-412 (2010) - Sung-woo Cho, Ashish Goel:
Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives. Algorithmica 57(4): 873-892 (2010) - Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno:
Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010) - Peter Damaschke:
Homogeneous String Segmentation using Trees and Weighted Independent Sets. Algorithmica 57(4): 621-640 (2010) - Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
Kinetic Facility Location. Algorithmica 57(3): 562-584 (2010) - Erik D. Demaine, Stefan Langerman, Eric Price:
Confluently Persistent Tries for Efficient Version Control. Algorithmica 57(3): 462-483 (2010) - Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index. Algorithmica 57(4): 668-688 (2010) - Benjamin Doerr, Frank Neumann, Ingo Wegener:
Editorial. Algorithmica 57(1): 119-120 (2010) - Feodor F. Dragan, Chenyu Yan:
Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica 57(1): 22-43 (2010) - Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the Convergence of Multicast Games in Directed Networks. Algorithmica 57(2): 301-324 (2010) - Henning Fernau:
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set. Algorithmica 57(1): 97-118 (2010) - Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. Algorithmica 57(4): 796-818 (2010) - Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. Algorithmica 57(3): 484-498 (2010) - Joachim Gudmundsson:
Editorial, SWAT 2008 Special Issue. Algorithmica 57(3): 435 (2010) - Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010) - Regant Y. S. Hung, Hing-Fung Ting:
Design and Analysis of Online Batching Systems. Algorithmica 57(2): 217-231 (2010) - N. Innami, B. H. Kim, Y. Mashiko, K. Shiohama:
The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open. Algorithmica 57(4): 869-872 (2010)
skipping 15 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-09-03 16:22 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