![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/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 44 matches
- 2012
- Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani:
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Algorithmica 63(1-2): 425-456 (2012) - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012) - Elliot Anshelevich
, Martin Hoefer:
Contribution Games in Networks. Algorithmica 63(1-2): 51-90 (2012) - Lars Arge, Gerth Stølting Brodal
, S. Srinivasa Rao:
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63(1-2): 457-475 (2012) - Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012) - Frédérique Bassino
, Julien David, Cyril Nicaud:
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63(1-2): 509-531 (2012) - Mark de Berg:
Guest Editorial. Algorithmica 63(4): 731-732 (2012) - Daniel Binkele-Raible, Henning Fernau
:
An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63(1-2): 323-346 (2012) - Vincenzo Bonifaci
, Alberto Marchetti-Spaccamela
:
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. Algorithmica 63(4): 763-780 (2012) - Paul S. Bonsma, Felix Breuer:
Counting Hexagonal Patches and Independent Sets in Circle Graphs. Algorithmica 63(3): 645-671 (2012) - Prosenjit Bose
, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. Algorithmica 63(1-2): 476-489 (2012) - Gerth Stølting Brodal
, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63(4): 815-830 (2012) - Gruia Calinescu, Cristina G. Fernandes
, Hemanshu Kaul, Alexander Zelikovsky
:
Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012) - Nicolas Catusse, Victor Chepoi
, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) - Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012) - Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012) - Christine Chung
, Katrina Ligett
, Kirk Pruhs, Aaron Roth
:
The Power of Fair Pricing Mechanisms. Algorithmica 63(3): 634-644 (2012) - David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica 63(1-2): 158-190 (2012) - Gianlorenzo D'Angelo
, Gabriele Di Stefano, Alfredo Navarra
:
Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63(1-2): 274-295 (2012) - Craig Dillabaugh, Meng He
, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012) - Donglei Du
, Ruixing Lu, Dachuan Xu
:
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties. Algorithmica 63(1-2): 191-200 (2012) - Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. Algorithmica 63(3): 602-615 (2012) - Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
:
Optimal Polygonal Representation of Planar Graphs. Algorithmica 63(3): 672-691 (2012) - Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav:
Bipartite Matching in the Semi-streaming Model. Algorithmica 63(1-2): 490-508 (2012) - Leah Epstein, Asaf Levin
:
On Equilibria for ADM Minimization Games. Algorithmica 63(1-2): 246-273 (2012) - Paolo Ferragina
, Travis Gagie
, Giovanni Manzini
:
Lightweight Data Indexing and Compression in External Memory. Algorithmica 63(3): 707-730 (2012) - Fedor V. Fomin
, Fabrizio Grandoni
, Daniel Lokshtanov, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012) - Joachim von zur Gathen, Daniel Panario
, L. Bruce Richmond:
Interval Partitions and Polynomial Factorization. Algorithmica 63(1-2): 363-397 (2012) - Qi Ge, Daniel Stefankovic
:
The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63(3): 588-601 (2012) - Viliam Geffert, Giovanni Pighizzini
:
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Algorithmica 63(3): 571-587 (2012)
skipping 14 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/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-08-25 15:50 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