Остановите войну!
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 49 matches
- 2011
- Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu:
Out-of-Order Event Processing in Kinetic Data Structures. Algorithmica 60(2): 250-273 (2011) - Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. Algorithmica 60(4): 890-937 (2011) - Michael Arnold, Enno Ohlebusch:
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica 60(4): 806-818 (2011) - Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) - Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs:
Average Rate Speed Scaling. Algorithmica 60(4): 877-889 (2011) - Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang:
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60(2): 421-450 (2011) - Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture, Evangelos Kranakis:
Location-Oblivious Distributed Unit Disk Graph Coloring. Algorithmica 60(2): 236-249 (2011) - Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011) - Andreas Bley:
An Integer Programming Algorithm for Routing Optimization in IP Networks. Algorithmica 60(1): 21-45 (2011) - Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau:
Exact Algorithms for Cluster Editing: Evaluation and Experiments. Algorithmica 60(2): 316-334 (2011) - Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo:
A Stronger Model of Dynamic Programming Algorithms. Algorithmica 60(4): 938-968 (2011) - Sergio Cabello, Bojan Mohar:
Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) - Danny Z. Chen, Shuang Luan, Chao Wang:
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy. Algorithmica 60(1): 152-174 (2011) - Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica 60(4): 969-986 (2011) - Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011) - Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable. Algorithmica 60(4): 819-828 (2011) - Daniel Delling:
Time-Dependent SHARC-Routing. Algorithmica 60(1): 60-94 (2011) - Srikrishnan Divakaran, Michael E. Saks:
An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times. Algorithmica 60(2): 301-315 (2011) - Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. Algorithmica 60(4): 829-852 (2011) - Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. Algorithmica 60(3): 703-717 (2011) - Adrian Dumitrescu, Csaba D. Tóth:
Minimum Weight Convex Steiner Partitions. Algorithmica 60(3): 627-652 (2011) - Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011) - Leah Epstein, Elena Kleiman:
Selfish Bin Packing. Algorithmica 60(2): 368-394 (2011) - Eldar Fischer, Orly Yahalom:
Testing Convexity Properties of Tree Colorings. Algorithmica 60(4): 766-805 (2011) - Hervé Fournier, Antoine Vigneron:
Fitting a Step Function to a Point Set. Algorithmica 60(1): 95-109 (2011) - Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. Algorithmica 60(2): 395-400 (2011) - Emanuele G. Fusco, Andrzej Pelc:
Trade-offs Between the Size of Advice and Broadcasting Time in Trees. Algorithmica 60(4): 719-734 (2011) - Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011) - Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica 60(3): 505-552 (2011)
skipping 19 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-06-27 02:44 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