![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 32 matches
- 2009
- Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon
, Bettina Speckmann
:
Kinetic Collision Detection for Convex Fat Objects. Algorithmica 53(4): 457-473 (2009) - Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. Algorithmica 53(4): 474-487 (2009) - Christoph Ambühl, Monaldo Mastrolilli
:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica 53(4): 488-503 (2009) - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) - Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009) - Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009) - Yossi Azar
, Thomas Erlebach
:
Foreword. Algorithmica 53(4): 455-456 (2009) - Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009) - Piotr Berman, Jieun K. Jeong:
Consistent Sets of Secondary Structures in Proteins. Algorithmica 53(1): 16-34 (2009) - Joseph Wun-Tat Chan, Prudence W. H. Wong
, Fencol C. C. Yung:
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. Algorithmica 53(2): 172-206 (2009) - Xujin Chen, Bo Chen
:
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. Algorithmica 53(3): 263-297 (2009) - Xi Chen
, Xiaotie Deng
:
A Simplicial Approach for Discrete Fixed Point Theorems. Algorithmica 53(2): 250-262 (2009) - Danny Z. Chen, D. T. Lee:
Guest Editors' Forward. Algorithmica 53(2): 155-156 (2009) - Reuven Cohen
, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) - Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. Algorithmica 53(4): 504-522 (2009) - Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu:
Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009) - Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. Algorithmica 53(4): 523-548 (2009) - Leah Epstein, Thomas Erlebach
, Asaf Levin
:
Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009) - Fedor V. Fomin
, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009) - Sumit Ganguly, Lakshminath Bhuvanagiri:
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams. Algorithmica 53(4): 549-582 (2009) - Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) - Martin Hoefer:
Non-Cooperative Tree Creation. Algorithmica 53(1): 104-131 (2009) - George Karakostas
, Stavros G. Kolliopoulos:
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica 53(1): 132-153 (2009) - George Karakostas
, Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica 53(2): 225-249 (2009) - D. T. Lee, Tien-Ching Lin, Hsueh-I Lu:
Fast Algorithms for the Density Finding Problem. Algorithmica 53(3): 298-313 (2009) - Pangfeng Liu
, May-Chen Kuo, Da-Wei Wang:
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments. Algorithmica 53(3): 425-453 (2009) - Bodo Manthey, L. Shankar Ram:
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Algorithmica 53(1): 69-88 (2009) - Hiroshi Nagamochi:
A Detachment Algorithm for Inferring a Graph from Path Frequency. Algorithmica 53(2): 207-224 (2009) - Umberto Ferraro Petrillo, Irene Finocchi
, Giuseppe F. Italiano
:
The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica 53(4): 597-620 (2009) - Romeo Rizzi
:
Minimum Weakly Fundamental Cycle Bases Are Hard To Find. Algorithmica 53(3): 402-424 (2009)
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-09-11 15:04 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