Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 64
Volume 64, Number 1, September 2012
- Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. 1-2 - Michael R. Fellows
, Danny Hermelin, Frances A. Rosamond:
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. 3-18 - Michael Lampis:
Algorithmic Meta-theorems for Restrictions of Treewidth. 19-37 - Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. 38-55 - 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. 56-68 - Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. 69-84 - Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. 85-111 - 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. 112-125 - Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. 126-151 - Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. 152-169 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. 170-188 - Daniel Binkele-Raible, Henning Fernau:
Parameterized Measure & Conquer for Problems with No Small Kernels. 189-212
Volume 64, Number 2, October 2012
- My T. Thai:
Guest Editorial: Computing and Combinatorics. 213-214 - Alexander E. Holroyd, Frank Ruskey, Aaron Williams:
Shorthand Universal Cycles for Permutations. 215-245 - Sherman S. M. Chow, Changshe Ma, Jian Weng:
Zero-Knowledge Argument for Simultaneous Discrete Logarithms. 246-266 - Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is NP-hard. 267-278 - Andreas Krebs, Nutan Limaye, Meena Mahajan:
Counting Paths in VPA Is Complete for #NC 1. 279-294 - Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. 295-310 - Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. 311-325
Volume 64, Number 3, November 2012
- Kyung-Yong Chwa, Kunsoo Park:
Guest Editorial: Special Issue on Algorithms and Computation. 327-328 - Henning Meyerhenke, Thomas Sauerwald:
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. 329-361 - Maxim A. Babenko:
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings. 362-383 - Juraj Stacho:
3-Colouring AT-Free Graphs in Polynomial Time. 384-399 - Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. 400-415 - Qian-Ping Gu, Hisao Tamaki:
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. 416-453 - Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing Sparse Multiples of Polynomials. 454-480 - Matthew J. Patitz, Scott M. Summers:
Identifying Shapes Using Self-assembly. 481-510 - Jin-Yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holant c Problems. 511-533
Volume 64, Number 4, December 2012
- Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. 535-563 - Petra Sparl, Rafal Witkowski, Janez Zerovnik:
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. 564-583 - Carlos Fisch Brito, Elias Koutsoupias, Shailesh Vaya:
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? 584-605 - Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. 606-620 - Anne Auger, Carsten Witt:
Theory of Randomized Search Heuristics. 621-622 - Per Kristian Lehre, Carsten Witt:
Black-Box Search by Unbiased Variation. 623-642 - Dirk Sudholt, Christian Thyssen:
A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems. 643-672 - Benjamin Doerr, Daniel Johannsen, Carola Winzen:
Multiplicative Drift Analysis. 673-697 - Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Theoretical Foundation for CMA-ES from Information Geometry Perspective. 698-716
a service of 
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.
last updated on 2024-04-18 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
