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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum matchings in planar graphs via Gaussian elimination
Marcin Mucha
,
Piotr Sankowski
Algorithmica
45
(1), 2006, pp. 3-20
Hardness and approximation results for packing Steiner trees
Joseph Cheriyan
,
Mohammad R. Salavatipour
Algorithmica
45
(1), 2006, pp. 21-43
Direct routing: Algorithms and complexity
Costas Busch
,
Malik Magdon-Ismail
,
Marios Mavronicolas
,
Paul Spirakis
Algorithmica
45
(1), 2006, pp. 45-68
Maximizing throughput in multi-queue switches
Yossi Azar
,
Arik Litichevskey
Algorithmica
45
(1), 2006, pp. 69-90
Approximate unions of lines and Minkowski sums
Marc van Kreveld
,
A. Frank van der Stappen
Algorithmica
45
(1), 2006, pp. 91-107
Swap and mismatch edit distance
Amihood Amir
,
Estrella Eisenberg
,
Ely Porat
Algorithmica
45
(1), 2006, pp. 109-120
An experimental study of random knapsack problems
Rene Beier
,
Berthold Vöcking
Algorithmica
45
(1), 2006, pp. 121-136
Data migration on parallel disks: Algorithms and evaluation
Leana Golubchik
,
Samir Khuller
,
Yoo-Ah Kim
,
Svetlana Shargorodskaya
,
Yung-Chun (Justin) Wan
Algorithmica
45
(1), 2006, pp. 137-158
A fixed-parameter approach to 2-layer planarization
Vida Dujmović
,
Michael Fellows
,
Michael Hallett
,
Matthew Kitching
,
Giuseppe Liotta
,
Catherine McCartin
,
Naomi Nishimura
,
Prabhakar Ragde
,
Fran Rosamond
,
Matthew Suderman
,
Sue Whitesides
,
David R. Wood
Algorithmica
45
(2), 2006, pp. 159-182
General perfectly periodic scheduling
Zvika Brakerski
,
Aviv Nisgav
,
Boaz Patt-Shamir
Algorithmica
45
(2), 2006, pp. 183-208
Mixed covering of trees and the augmentation problem with odd diameter constraints
Victor Chepoi
,
Bertrand Estellon
,
Karim Nouioua
,
Yann Vaxès
Algorithmica
45
(2), 2006, pp. 209-226
Recognizing hole-free 4-map graphs in cubic time
Zhi-Zhong Chen
,
Michelangelo Grigni
,
Christos H. Papadimitriou
Algorithmica
45
(2), 2006, pp. 227-262
Scalable parallel algorithms for FPT problems
Faisal N. Abu-Khzam
,
Michael A. Langston
,
Pushkar Shanbhag
,
Christopher T. Symons
Algorithmica
45
(3), 2006, pp. 269-284
Building large phylogenetic trees on coarse-grained parallel machines
Thomas M. Keane
,
Andrew J. Page
,
Thomas J. Naughton
,
Simon A.A. Travers
,
James O. McInerney
Algorithmica
45
(3), 2006, pp. 285-300
A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
Carlos E.R. Alves
,
Edson N. Cáceres
,
Siang Wun Song
Algorithmica
45
(3), 2006, pp. 301-335
FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
Adrian Driga
,
Paul Lu
,
Jonathan Schaeffer
,
Duane Szafron
,
Kevin Charter
,
Ian Parsons
Algorithmica
45
(3), 2006, pp. 337-375
CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
Jie Chi
,
Mehmet Koyutürk
,
Ananth Grama
Algorithmica
45
(3), 2006, pp. 377-401
Parallel computation of high-dimensional robust correlation and covariance matrices
James Chilson
,
Raymond Ng
,
Alan Wagner
,
Ruben Zamar
Algorithmica
45
(3), 2006, pp. 403-431
Parallelizing feature selection
Jerffeson Teixeira de Souza
,
Stan Matwin
,
Nathalie Japkowicz
Algorithmica
45
(3), 2006, pp. 433-456
MOVE: A distributed framework for materialized ontology view extraction
Mehul Bhatt
,
Andrew Flahive
,
Carlo Wouters
,
Wenny Rahayu
,
David Taniar
Algorithmica
45
(3), 2006, pp. 457-481
Slabpose columnsort: A new oblivious algorithm for out-of-core sorting on distributed-memory clusters
Geeta Chaudhry
,
Thomas H. Cormen
Algorithmica
45
(3), 2006, pp. 483-508
Design and performance of a heterogeneous grid partitioner
Daniel J. Harvey
,
Sajal K. Das
,
Rupak Biswas
Algorithmica
45
(3), 2006, pp. 509-530
Book embeddability of series-parallel digraphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Stephen K. Wismath
Algorithmica
45
(4), 2006, pp. 531-547
Online maintenance of
k
-medians and
k
-covers on a line
Rudolf Fleischer
,
Mordecai J. Golin
,
Yan Zhang
Algorithmica
45
(4), 2006, pp. 549-567
An approximation algorithm for the directed telephone multicast problem
Michael Elkin
,
Guy Kortsarz
Algorithmica
45
(4), 2006, pp. 569-583
Seiten 1
2
>