![](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 33 matches
- 2014
- George Christodoulou
, Katrina Ligett
, Evangelia Pyrga:
Contention Resolution under Selfishness. Algorithmica 70(4): 675-693 (2014) - Hee-Kap Ahn
, Sang Won Bae
, Otfried Cheong
, Joachim Gudmundsson
, Takeshi Tokuyama
, Antoine Vigneron
:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - Oswin Aichholzer
, Matias Korman, Alexander Pilz
, Birgit Vogtenhuber:
Geodesic Order Types. Algorithmica 70(1): 112-128 (2014) - Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. Algorithmica 70(4): 718-731 (2014) - Martin Aumüller, Martin Dietzfelbinger
, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. Algorithmica 70(3): 428-456 (2014) - Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70(4): 595-647 (2014) - René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. Algorithmica 70(1): 129-147 (2014) - Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70(1): 2-21 (2014) - Maria Paola Bianchi, Hans-Joachim Böckenhauer
, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70(1): 92-111 (2014) - Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Algorithmica 70(3): 406-427 (2014) - Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. Algorithmica 70(2): 171-194 (2014) - Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. Algorithmica 70(3): 368-405 (2014) - Kun-Mao Chao
, Tsan-sheng Hsu, D. T. Lee:
Preface Algorithms and Computation (ISAAC 2012). Algorithmica 70(4): 694-695 (2014) - Krishnendu Chatterjee, Monika Henzinger
, Sebastian Krinninger
, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - Panagiotis Cheilaris, Luisa Gargano
, Adele A. Rescigno
, Shakhar Smorodinsky
:
Strong Conflict-Free Coloring for Intervals. Algorithmica 70(4): 732-749 (2014) - Ruiwen Chen, Valentine Kabanets, Jeff Kinne
:
Lower Bounds Against Weakly-Uniform Threshold Circuits. Algorithmica 70(1): 47-75 (2014) - Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica 70(2): 195-207 (2014) - Daniel Dadush
:
A Randomized Sieving Algorithm for Approximate Integer Programming. Algorithmica 70(2): 208-244 (2014) - Leah Epstein, Paolo Ferragina
:
Guest Editorial: Selected Papers of European Symposium of Algorithms. Algorithmica 70(3): 365-367 (2014) - David Fernández-Baca:
Editorial. Algorithmica 70(2): 149-151 (2014) - Joachim Gudmundsson
, Julián Mestre, Taso Viglas:
Editorial: COCOON 2012 Special Issue. Algorithmica 70(1): 1 (2014) - Michel Habib
, Antoine Mamcarz, Fabien de Montgolfier:
Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica 70(2): 245-266 (2014) - Xin Han, Yasushi Kawase
, Kazuhisa Makino:
Online Unweighted Knapsack Problem with Removal Cost. Algorithmica 70(1): 76-91 (2014) - Tobias Harks, Britta Peis:
Resource Buying Games. Algorithmica 70(3): 493-512 (2014) - Meng He
, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Algorithmica 70(4): 696-717 (2014) - Ahmed Helmi
, Conrado Martínez
, Alois Panholzer:
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Algorithmica 70(2): 267-300 (2014) - Danny Hermelin
, Matthias Mnich
, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70(3): 513-560 (2014) - Ragesh Jaiswal, Amit Kumar
, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica 70(1): 22-46 (2014) - Christos Koufogiannakis, Neal E. Young
:
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs. Algorithmica 70(4): 648-674 (2014) - Bundit Laekhanukit
, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. Algorithmica 70(3): 561-593 (2014)
skipping 3 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-07-18 07:09 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