Остановите войну!
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 57 matches
- 2017
- Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls Under Uncertainty. Algorithmica 79(2): 340-367 (2017) - Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. Algorithmica 79(2): 598-623 (2017) - Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. Algorithmica 79(2): 568-597 (2017) - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
On Polynomial Kernelization of H-free Edge Deletion. Algorithmica 79(3): 654-666 (2017) - Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79(3): 667-697 (2017) - Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. Algorithmica 79(4): 1052-1101 (2017) - Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. Algorithmica 79(2): 368-386 (2017) - Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized and Approximation Algorithms for the Load Coloring Problem. Algorithmica 79(1): 211-229 (2017) - Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. Algorithmica 79(2): 466-483 (2017) - Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79(2): 444-465 (2017) - Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 (2017) - Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. Algorithmica 79(3): 857-883 (2017) - Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica 79(4): 1102-1160 (2017) - Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79(4): 1014-1051 (2017) - Jaroslaw Blasiok, Marcin Jakub Kaminski:
Chain Minors are FPT. Algorithmica 79(3): 698-707 (2017) - Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas:
Building Efficient and Compact Data Structures for Simplicial Complexes. Algorithmica 79(2): 530-567 (2017) - Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. Algorithmica 79(1): 29-41 (2017) - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - Dan Boneh, Mark Zhandry:
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. Algorithmica 79(4): 1233-1285 (2017) - Karl Bringmann, Konstantinos Panagiotou:
Efficient Sampling Methods for Discrete Distributions. Algorithmica 79(2): 484-508 (2017) - Jannis Bulian, Anuj Dawar:
Fixed-Parameter Tractable Distances to Sparse Graph Classes. Algorithmica 79(1): 139-158 (2017) - Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. Algorithmica 79(3): 708-741 (2017) - Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Algorithmica 79(3): 763-796 (2017) - Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb:
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. Algorithmica 79(3): 925-940 (2017) - Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - Stephen Desalvo:
Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer. Algorithmica 79(3): 742-762 (2017) - Itai Dinur, Gaëtan Leurent:
Improved Generic Attacks Against Hash-Based MACs and HAIFA. Algorithmica 79(4): 1161-1195 (2017) - Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. Algorithmica 79(4): 1196-1232 (2017) - Khaled M. Elbassioni, Kazuhisa Makino:
Guest Editors' Foreword. Algorithmica 79(3): 884-885 (2017)
skipping 27 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-04-23 12:25 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