Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Algorithmica AND Volume=64
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Michael R. Fellows
,
Danny Hermelin
,
Frances A. Rosamond
Algorithmica
64
(1), 2012, pp. 3-18
Algorithmic meta-theorems for restrictions of treewidth
Michael Lampis
Algorithmica
64
(1), 2012, pp. 19-37
Parameterized modal satisfiability
Antonis Achilleos
,
Michael Lampis
,
Valia Mitsou
Algorithmica
64
(1), 2012, pp. 38-55
A new lower bound on the maximum number of satisfied clauses in MAX-SAT and its algorithmic applications
Robert Crowston
,
Gregory Gutin
,
Mark Jones
,
Anders Yeo
Algorithmica
64
(1), 2012, pp. 56-68
Fast minor testing in planar graphs
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Algorithmica
64
(1), 2012, pp. 69-84
Parameterized complexity of the spanning tree congestion problem
Hans L. Bodlaender
,
Fedor V. Fomin
,
Petr A. Golovach
,
Yota Otachi
,
Erik Jan van Leewen
Algorithmica
64
(1), 2012, pp. 85-111
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
Gregory Gutin
,
Eun Jung Kim
,
Arezou Soleimanfallah
,
Stefan Szeider
,
Anders Yeo
Algorithmica
64
(1), 2012, pp. 112-125
Multivariate complexity analysis of
Swap Bribery
Britta Dorn
,
Ildikó Schlotter
Algorithmica
64
(1), 2012, pp. 126-151
Cluster editing: Kernelization based on edge cuts
Yixin Cao
,
Jianer Chen
Algorithmica
64
(1), 2012, pp. 152-169
An improved FPT algorithm and a quadratic kernel for
Pathwidth One Vertex Deletion
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Algorithmica
64
(1), 2012, pp. 170-188
Parameterized Measure & Conquer for problems with no small kernels
Daniel Binkele-Raible
,
Henning Fernau
Algorithmica
64
(1), 2012, pp. 189-212
Shorthand universal cycles for permutations
Alexander E. Holroyd
,
Frank Ruskey
,
Aaron Williams
Algorithmica
64
(2), 2012, pp. 215-245
Zero-knowledge argument for simultaneous discrete logarithms
Sherman S.M. Chow
,
Changshe Ma
,
Jian Weng
Algorithmica
64
(2), 2012, pp. 246-266
Tile-packing tomography is NP-hard
Marek Chrobak
,
Christoph Dürr
,
Flavio Guíñez
,
Antoni Lozano
,
Nguyen Kim Thang
Algorithmica
64
(2), 2012, pp. 267-278
Counting paths in VPA is complete for \#NC
^1
Andreas Krebs
,
Nutan Limaye
,
Meena Mahajan
Algorithmica
64
(2), 2012, pp. 279-294
Exact and approximation algorithms for geometric and capacitated set cover problems
Piotr Berman
,
Marek Karpinski
,
Andrzej Lingas
Algorithmica
64
(2), 2012, pp. 295-310
Finding maximum edge bicliques in convex bipartite graphs
Doron Nussbaum
,
Shuye Pu
,
Jörg-Rüdiger Sack
,
Takeaki Uno
,
Hamid Zarrabi-Zadeh
Algorithmica
64
(2), 2012, pp. 311-325
Beyond good partition shapes: An analysis of diffusive graph partitioning
Henning Meyerhenke
,
Thomas Sauerwald
Algorithmica
64
(3), 2012, pp. 329-361
Improved algorithms for even factors and square-free simple
b
-matchings
Maxim A. Babenko
Algorithmica
64
(3), 2012, pp. 362-383
3-colouring AT-free graphs in polynomial time
Juraj Stacho
Algorithmica
64
(3), 2012, pp. 384-399
Minimum cost partitions of trees with supply and demand
Takehiro Ito
,
Takuya Hara
,
Xiao Zhou
,
Takao Nishizeki
Algorithmica
64
(3), 2012, pp. 400-415
Improved bounds on the planar branchwidth with respect to the largest grid minor size
Qian-Ping Gu
,
Hisao Tamaki
Algorithmica
64
(3), 2012, pp. 416-453
Computing sparse multiples of polynomials
Mark Giesbrecht
,
Daniel S. Roche
,
Hrushikesh Tilak
Algorithmica
64
(3), 2012, pp. 454-480
Identifying shapes using self-assembly
Matthew J. Patitz
,
Scott M. Summers
Algorithmica
64
(3), 2012, pp. 481-510
From Holant to \#CSP and back: Dichotomy for Holant
^c
problems
Jin-Yi Cai
,
Sangxia Huang
,
Pinyan Lu
Algorithmica
64
(3), 2012, pp. 511-533
Seiten 1
2
>