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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
External-memory algorithms for processing line segments in geographic information systems
Lars Arge
,
Darren Erik Vengroff
,
Jeffrey Scott Vitter
Algorithmica
47
(1), 2007, pp. 1-25
Tree spanners for bipartite graphs and probe interval graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoang-Oanh Le
,
Van Bang Le
,
Ryuhei Uehara
Algorithmica
47
(1), 2007, pp. 27-51
Approximation algorithms for the unsplittable flow problem
Amit Chakrabarti
,
Chandra Chekuri
,
Anupam Gupta
,
Amit Kumar
Algorithmica
47
(1), 2007, pp. 53-78
Selfish load balancing and atomic congestion games
Subhash Suri
,
Csaba D. Tóth
,
Yunhong Zhou
Algorithmica
47
(1), 2007, pp. 79-96
Deterministic communication in radio networks with large labels
Leszek Ga̧sieniec
,
Aris Pagourtzis
,
Igor Potapov
,
Tomasz Radzik
Algorithmica
47
(1), 2007, pp. 97-117
Detecting holes and antiholes in graphs
Stavros D. Nikolopoulos
,
Leonidas Palios
Algorithmica
47
(2), 2007, pp. 119-138
Safe reduction rules for weighted treewidth
Frank van den Eijkhof
,
Hans L. Bodlaender
,
M.C.A. Koster
Algorithmica
47
(2), 2007, pp. 139-158
Motorcycle graphs and straight skeletons
Siu-Wing Cheng
,
Antoine Vigneron
Algorithmica
47
(2), 2007, pp. 159-182
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Algorithmica
47
(2), 2007, pp. 183-201
R-Kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
Paolo D'Alberto
,
Alexandru Nicolau
Algorithmica
47
(2), 2007, pp. 203-213
Call control in rings
Udo Adamy
,
Christoph Ambühl
,
R. Sai Anand
,
Thomas Erlebach
Algorithmica
47
(3), 2007, pp. 217-238
A study of integrated document and connection caching in the WWW
Susanne Albers
,
Rob van Stee
Algorithmica
47
(3), 2007, pp. 239-252
Minimizing total flow time and total completion time with immediate dispatching
Nir Avrahami
,
Yossi Azar
Algorithmica
47
(3), 2007, pp. 253-268
An algorithmic view on OVSF code assignment
Thomas Erlebach
,
Riko Jacob
,
Matús̑ Mihalák
,
Marc Nunkesser
,
Gábor Szabó
,
Peter Widmayer
Algorithmica
47
(3), 2007, pp. 269-298
An FPTAS for quickest multicommodity flows with inflow-dependent transit times
Alex Hall
,
Katharina Langkau
,
Martin Skutella
Algorithmica
47
(3), 2007, pp. 299-321
Maximizing the total profit of rectangles packed into a rectangle
Klaus Jansen
,
Guochuan Zhang
Algorithmica
47
(3), 2007, pp. 323-342
Real-time scheduling with a budget
Joseph (Seffi) Naor
,
Hadas Shachnai
,
Tami Tamir
Algorithmica
47
(3), 2007, pp. 343-364
Reconfiguring triangulations with edge flips and point moves
Greg Aloupis
,
Prosenjit Bose
,
Pat Morin
Algorithmica
47
(4), 2007, pp. 367-378
Drawing power law graphs using a local/global decomposition
Reid Andersen
,
Fan Chung
,
Linyuan Lu
Algorithmica
47
(4), 2007, pp. 379-397
Convex drawings of 3-connected plane graphs
Nicolas Bonichon
,
Stefan Felsner
,
Mohamed Mosbah
Algorithmica
47
(4), 2007, pp. 399-420
Random geometric graph diameter in the unit ball
Robert B. Ellis
,
Jeremy L. Martin
,
Catherine Yan
Algorithmica
47
(4), 2007, pp. 421-438
Confluent layered drawings
David Eppstein
,
Michael T. Goodrich
,
Jeremy Yu Meng
Algorithmica
47
(4), 2007, pp. 439-452
Representations by contact and intersection of segments
Hubert de Fraysseix
,
Patrice Ossona de Mendez
Algorithmica
47
(4), 2007, pp. 453-463
Train tracks and confluent drawings
Peter Hui
,
Michael J. Pelsmajer
,
Marcus Schaefer
,
Daniel S̑tefankovic̑
Algorithmica
47
(4), 2007, pp. 465-479
No-three-in-line-in-3D
Attila Pór
,
David R. Wood
Algorithmica
47
(4), 2007, pp. 481-488