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 YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
M. Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Andreas Gerasch
,
Michael Kaufmann
,
Stephen G. Kobourov
Algorithmica
67
(1), 2013, pp. 3-22
External-memory multimaps
Elaine Angelino
,
Michael T. Goodrich
,
Michael Mitzenmacher
,
Justin Thaler
Algorithmica
67
(1), 2013, pp. 23-48
The school bus problem on trees
Adrian Bock
,
Elyot Grant
,
Jochen Könemann
,
Laura Sanità
Algorithmica
67
(1), 2013, pp. 49-64
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Tobias Friedrich
,
Thomas Sauerwald
,
Alexandre Stauffer
Algorithmica
67
(1), 2013, pp. 65-88
The parameterized complexity of local search for TSP, more refined
Jiong Guo
,
Sepp Hartung
,
Rolf Niedermeier
,
Ondȓej Suchý
Algorithmica
67
(1), 2013, pp. 89-110
Derandomizing the HSSW algorithm for 3-SAT
Kazuhisa Makino
,
Suguru Tamaki
,
Masaki Yamamoto
Algorithmica
67
(2), 2013, pp. 112-124
Compressed directed acyclic word graph with application in local alignment
Huy Hoang Do
,
Wing Kin Sung
Algorithmica
67
(2), 2013, pp. 125-141
FlipCut supertrees: Towards matrix representation accuracy in polynomial time
Malte Brinkmeyer
,
Thasso Griebel
,
Sebastian Böcker
Algorithmica
67
(2), 2013, pp. 142-160
On the rainbow connectivity of graphs: Complexity and FPT algorithms
Kei Uchizawa
,
Takanori Aoki
,
Takehiro Ito
,
Akira Suzuki
,
Xiao Zhou
Algorithmica
67
(2), 2013, pp. 161-179
Algorithms for partition of some class of graphs under compaction and vertex-compaction
Narayan Vikas
Algorithmica
67
(2), 2013, pp. 180-206
Self-assembling rulers for approximating generalized Sierpinski carpets
Steven M. Kautz
,
Brad Shutters
Algorithmica
67
(2), 2013, pp. 207-233
Approximately uniform online checkpointing with bounded memory
Lauri Ahlroth
,
Olli Pottonen
,
André Schumacher
Algorithmica
67
(2), 2013, pp. 234-246
The parallel complexity of graph canonization under Abelian group action
V. Arvind
,
Johannes Köbler
Algorithmica
67
(2), 2013, pp. 247-276
On total unimodularity of edge-edge adjacency matrices
Yusuke Matsumoto
,
Naoyuki Kamiyama
,
Keiko Imai
Algorithmica
67
(2), 2013, pp. 277-292
Unbounded contention resolution in multiple-access channels
Antonio Fernández Anta
,
Miguel A. Mosteiro
,
Jorge Ramón Muñoz
Algorithmica
67
(3), 2013, pp. 295-314
Rounds in combinatorial search
Gábor Wiener
Algorithmica
67
(3), 2013, pp. 315-323
Two new perspectives on multi-stage group testing
Peter Damaschke
,
Azam Sheikh Muhammad
,
Eberhard Triesch
Algorithmica
67
(3), 2013, pp. 324-354
Efficient two-stage group testing algorithms for genetic screening
Michael Huber
Algorithmica
67
(3), 2013, pp. 355-367
Synthetic sequence design for signal location search
Yaw-Ling Lin
,
Charles Ward
,
Steven Skiena
Algorithmica
67
(3), 2013, pp. 368-383
Improved constructions for non-adaptive threshold group testing
Mahdi Cheraghchi
Algorithmica
67
(3), 2013, pp. 384-417
Black-box Trace&Revoke codes
Hung Q. Ngo
,
Duong Hieu Phan
,
David Pointcheval
Algorithmica
67
(3), 2013, pp. 418-448
Deterministic discrepancy minimization
Nikhil Bansal
,
Joel Spencer
Algorithmica
67
(4), 2013, pp. 451-471
On variants of the matroid secretary problem
Shayan Oveis Gharan
,
Jan Vondrák
Algorithmica
67
(4), 2013, pp. 472-497
A universal randomized packet scheduling algorithm
Łukasz Jeż
Algorithmica
67
(4), 2013, pp. 498-515
Preprocess, set, query!
Ely Porat
,
Liam Roditty
Algorithmica
67
(4), 2013, pp. 516-528
Seiten 1
2
3
4
5
>