Остановите войну!
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 37 matches
- 2012
- Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. Algorithmica 64(1): 38-55 (2012) - Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012) - Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Theoretical Foundation for CMA-ES from Information Geometry Perspective. Algorithmica 64(4): 698-716 (2012) - Anne Auger, Carsten Witt:
Theory of Randomized Search Heuristics. Algorithmica 64(4): 621-622 (2012) - Maxim A. Babenko:
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings. Algorithmica 64(3): 362-383 (2012) - Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012) - Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - Daniel Binkele-Raible, Henning Fernau:
Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica 64(1): 189-212 (2012) - Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - Carlos Fisch Brito, Elias Koutsoupias, Shailesh Vaya:
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? Algorithmica 64(4): 584-605 (2012) - Jin-Yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012) - Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64(1): 152-169 (2012) - Sherman S. M. Chow, Changshe Ma, Jian Weng:
Zero-Knowledge Argument for Simultaneous Discrete Logarithms. Algorithmica 64(2): 246-266 (2012) - Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is NP-hard. Algorithmica 64(2): 267-278 (2012) - Kyung-Yong Chwa, Kunsoo Park:
Guest Editorial: Special Issue on Algorithms and Computation. Algorithmica 64(3): 327-328 (2012) - Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica 64(1): 56-68 (2012) - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica 64(1): 170-188 (2012) - Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. Algorithmica 64(4): 673-697 (2012) - Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. Algorithmica 64(1): 126-151 (2012) - Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012) - Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing Sparse Multiples of Polynomials. Algorithmica 64(3): 454-480 (2012) - Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. Algorithmica 64(3): 416-453 (2012) - Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) - Alexander E. Holroyd, Frank Ruskey, Aaron Williams:
Shorthand Universal Cycles for Permutations. Algorithmica 64(2): 215-245 (2012) - Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012) - Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1. Algorithmica 64(2): 279-294 (2012) - Michael Lampis:
Algorithmic Meta-theorems for Restrictions of Treewidth. Algorithmica 64(1): 19-37 (2012) - Per Kristian Lehre, Carsten Witt:
Black-Box Search by Unbiased Variation. Algorithmica 64(4): 623-642 (2012) - Henning Meyerhenke, Thomas Sauerwald:
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. Algorithmica 64(3): 329-361 (2012) - Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012)
skipping 7 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-05-02 18:38 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