Остановите войну!
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 28 matches
- 2007
- Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. Algorithmica 47(3): 217-238 (2007) - Susanne Albers, Rob van Stee:
A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007) - Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. Algorithmica 47(4): 367-378 (2007) - Reid Andersen, Fan R. K. Chung, Linyuan Lu:
No-Three-in-Line-in-3D. Algorithmica 47(4): 379-397 (2007) - Reid Andersen, Fan R. K. Chung, Linyuan Lu:
Drawing Power Law Graphs Using a Local/Global Decomposition. Algorithmica 47(4): 397 (2007) - Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47(1): 1-25 (2007) - Nir Avrahami, Yossi Azar:
Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. Algorithmica 47(3): 253-268 (2007) - Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. Algorithmica 47(4): 399-420 (2007) - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007) - Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007) - Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007) - Siu-Wing Cheng, Antoine Vigneron:
Motorcycle Graphs and Straight Skeletons. Algorithmica 47(2): 159-182 (2007) - Paolo D'Alberto, Alexandru Nicolau:
R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks. Algorithmica 47(2): 203-213 (2007) - Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007) - Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
Random Geometric Graph Diameter in the Unit Ball. Algorithmica 47(4): 421-438 (2007) - David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007) - Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - Hubert de Fraysseix, Patrice Ossona de Mendez:
Representations by Contact and Intersection of Segments. Algorithmica 47(4): 453-463 (2007) - Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007) - Alexander Hall, Katharina Langkau, Martin Skutella:
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007) - Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007) - Klaus Jansen, Guochuan Zhang:
Maximizing the Total Profit of Rectangles Packed into a Rectangle. Algorithmica 47(3): 323-342 (2007) - Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007) - Stavros D. Nikolopoulos, Leonidas Palios:
Detecting Holes and Antiholes in Graphs. Algorithmica 47(2): 119-138 (2007) - János Pach, Farhad Shahrokhi:
Guest Editors' Foreword. Algorithmica 47(4): 365 (2007) - Alessandro Panconesi:
Foreword. Algorithmica 47(3): 215 (2007) - Attila Pór, David R. Wood:
No-Three-in-Line-in-3D. Algorithmica 47(4): 481-488 (2007) - Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1): 79-96 (2007)
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-05-29 18:37 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