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=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weighted matching in the semi-streaming model
Mariano Zelke
Algorithmica
62
(1-2), 2012, pp. 1-20
Biased range trees
Vida Dujmović
,
John Howat
,
Pat Morin
Algorithmica
62
(1-2), 2012, pp. 21-37
Complexity of finding graph roots with girth conditions
Babak Farzad
,
Lap Chi Lau
,
Van Bang Le
,
Nguyen Ngoc Tuy
Algorithmica
62
(1-2), 2012, pp. 38-53
Stronger Lempel-Ziv based compressed text indexing
Diego Arroyuelo
,
Gonzalo Navarro
,
Kunihiko Sadakane
Algorithmica
62
(1-2), 2012, pp. 54-101
Approximation schemes for packing splittable items with cardinality constraints
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Algorithmica
62
(1-2), 2012, pp. 102-129
A linear algorithm for the random sampling from regular languages
Olivier Bernardi
,
Omer Giménez
Algorithmica
62
(1-2), 2012, pp. 130-145
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
Victor Chepoi
,
Tristan Fevat
,
Emmanuel Godard
,
Yann Vax`es
Algorithmica
62
(1-2), 2012, pp. 146-168
Faster swap edge computation in minimum diameter spanning trees
Beat Gfeller
Algorithmica
62
(1-2), 2012, pp. 169-191
Construction sequences and certifying 3-connectivity
Jens M. Schmidt
Algorithmica
62
(1-2), 2012, pp. 192-208
Fast arc-annotated subsequence matching in linear space
Philip Bille
,
Inge Li Grtz
Algorithmica
62
(1-2), 2012, pp. 209-223
Succinct representation of labeled graphs
Jérémy Barbay
,
Luca Castelli Aleardi
,
Meng He
,
J. Ian Munro
Algorithmica
62
(1-2), 2012, pp. 224-257
Mapping filtering streaming applications
Kunal Agrawal
,
Anne Benoit
,
Fanny Dufossé
,
Yves Robert
Algorithmica
62
(1-2), 2012, pp. 258-308
Drawing (complete) binary tanglegrams hardness, approximation, fixed-parameter tractability
Kevin Buchin
,
Maike Buchin
,
Jaroslaw Byrka
,
Martin Nöllenburg
,
Yoshio Okamoto
,
Rodrigo I. Silveira
,
Alexander Wolff
Algorithmica
62
(1-2), 2012, pp. 309-332
Competitive weighted matching in transversal matroids
Nedialko B. Dimitrov
,
C. Greg Plaxton
Algorithmica
62
(1-2), 2012, pp. 333-348
A scheme for computing minimum covers within simple regions
Matthew J. Katz
,
Gila Morgenstern
Algorithmica
62
(1-2), 2012, pp. 349-360
Many distances in planar graphs
Sergio Cabello
Algorithmica
62
(1-2), 2012, pp. 361-381
Fast algorithms for
max independent set
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis T. Paschos
,
Johan M.M. van Rooij
Algorithmica
62
(1-2), 2012, pp. 382-415
Shortest paths in time-dependent FIFO networks
Frank Dehne
,
Masoud T. Omran
,
Jörg-Rüdiger Sack
Algorithmica
62
(1-2), 2012, pp. 416-435
Pruning 2-connected graphs
Chandra Chekuri
,
Nitish Korula
Algorithmica
62
(1-2), 2012, pp. 436-463
Aligning two convex figures to minimize area or perimeter
Hee-Kap Ahn
,
Otfried Cheong
Algorithmica
62
(1-2), 2012, pp. 464-479
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Gábor Ivanyos
,
Luc Sanselme
,
Miklos Santha
Algorithmica
62
(1-2), 2012, pp. 480-498
The
k
-in-a-path problem for claw-free graphs
Jiȓí Fiala
,
Marcin Kamiński
,
Bernard Lidický
,
Daniël Paulusma
Algorithmica
62
(1-2), 2012, pp. 499-519
Approximability of the firefighter problem - Computing cuts over time
Elliot Anshelevich
,
Deeparnab Chakrabarty
,
Ameya Hate
,
Chaitanya Swamy
Algorithmica
62
(1-2), 2012, pp. 520-536
Finding induced paths of given parity in claw-free graphs
Pim van 't Hof
,
Marcin Kamiński
,
Daniël Paulusma
Algorithmica
62
(1-2), 2012, pp. 537-563
The parameterized complexity of stabbing rectangles
Michael Dom
,
Michael R. Fellows
,
Frances A. Rosamond
,
Somnath Sikdar
Algorithmica
62
(1-2), 2012, pp. 564-594
Seiten 1
2
3
>