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: Series=LNCS AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Line system design and a generalized coloring problem
Mansoor Alicherry
,
Randeep Bhatia
Lecture Notes in Computer Science
2832
, 2003, pp. 19-30
Lagrangian relaxation for the
k
-median problem: New insights and continuity properties
Aaron Archer
,
Ranjithkumar Rajagopalan
,
David B. Shmoys
Lecture Notes in Computer Science
2832
, 2003, pp. 31-42
Scheduling for flow-time with admission control
Nikhil Bansal
,
Avrim Blum
,
Shuchi Chawla
,
Kedar Dhamdhere
Lecture Notes in Computer Science
2832
, 2003, pp. 43-54
On approximating a geometric prize-collecting Traveling Salesman Problem with time windows
Reuven Bar-Yehuda
,
Guy Even
,
Shimon (Moni) Shahar
Lecture Notes in Computer Science
2832
, 2003, pp. 55-66
Semi-clairvoyant scheduling
Luca Becchetti
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Lecture Notes in Computer Science
2832
, 2003, pp. 67-77
Algorithms for graph rigidity and scene analysis
Alex R. Berg
,
Tibor Jordán
Lecture Notes in Computer Science
2832
, 2003, pp. 78-89
Optimal dynamic video-on-demand using adaptive broadcasting
Therese Biedl
,
Erik D. Demaine
,
Alexander Golynski
,
Joseph D. Horton
,
Alejandro López-Ortiz
,
Guillaume Poirier
,
Claude-Guy Quimper
Lecture Notes in Computer Science
2832
, 2003, pp. 90-101
Multi-player and multi-round auctions with severely bounded communication
Liad Blumrosen
,
Noam Nisan
,
Ilya Segal
Lecture Notes in Computer Science
2832
, 2003, pp. 102-113
Network lifetime and power assignment in ad hoc wireless networks
Gruia Calinescu
,
Sanjiv Kapoor
,
Alexander Olshevsky
,
Alexander Zelikovsky
Lecture Notes in Computer Science
2832
, 2003, pp. 114-126
Disjoint unit spheres admit at most two line transversals
Otfried Cheong
,
Xavier Goaoc
,
Hyeon-Suk Na
Lecture Notes in Computer Science
2832
, 2003, pp. 127-135
An optimal algorithm for the maximum-density segment problem
Kai-min Chung
,
Hsueh-I Lu
Lecture Notes in Computer Science
2832
, 2003, pp. 136-147
Estimating dominance norms of multiple data streams
Graham Cormode
,
S. Muthukrishnan
Lecture Notes in Computer Science
2832
, 2003, pp. 148-160
Smoothed motion complexity
Valentina Damerow
,
Friedhelm Meyer auf der Heide
,
Harald Räcke
,
Christian Scheideler
,
Christian Sohler
Lecture Notes in Computer Science
2832
, 2003, pp. 161-171
Deterministic rendezvous in graphs
Anders Dessmark
,
Pierre Fraigniaud
,
Andrzej Pelc
Lecture Notes in Computer Science
2832
, 2003, pp. 184-195
Fast integer programming in fixed dimension
Friedrich Eisenbrand
Lecture Notes in Computer Science
2832
, 2003, pp. 196-207
Correlation clustering - Minimizing disagreements on arbitrary weighted graphs
Dotan Emanuel
,
Amos Fiat
Lecture Notes in Computer Science
2832
, 2003, pp. 208-220
Dominating sets and local treewidth
Fedor V. Fomin
,
Dimtirios M. Thilikos
Lecture Notes in Computer Science
2832
, 2003, pp. 221-229
Approximating energy efficient paths in wireless multi-hop networks
Stefan Funke
,
Domagoj Matijevic
,
Peter Sanders
Lecture Notes in Computer Science
2832
, 2003, pp. 230-241
Streaming geometric optimization using graphics hardware
Pankaj K. Agarwal
,
Shankar Krishnan
,
Nabil H. Mustafa
,
Suresh Venkatasubramanian
Lecture Notes in Computer Science
2832
, 2003, pp. 544-555
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
E. Boros
,
K. Elbassioni
,
V. Gurvich
,
Leonid Khachiyan
Lecture Notes in Computer Science
2832
, 2003, pp. 556-567
Experiments on graph clustering algorithms
Ulrik Brandes
,
Marco Gaertler
,
Dorothea Wagner
Lecture Notes in Computer Science
2832
, 2003, pp. 568-579
More reliable protein NMR peak assignment via improved 2-interval scheduling
Zhi-Zhong Chen
,
Tao Jiang
,
Guohui Lin
,
Romeo Rizzi
,
Jianjun Wen
,
Dong Xu
,
Ying Xu
Lecture Notes in Computer Science
2832
, 2003, pp. 580-592
The minimum shift design problem: Theory and practice
Luca Di Gaspero
,
Johannes Gärtner
,
Guy Kortsarz
,
Nysret Musliu
,
Andrea Schaerf
,
Wolfgang Slany
Lecture Notes in Computer Science
2832
, 2003, pp. 593-604
Loglog counting of large cardinalities
Marianne Durand
,
Philippe Flajolet
Lecture Notes in Computer Science
2832
, 2003, pp. 605-617
Packing a trunk
Friedrich Eisenbrand
,
Stefan Funke
,
Joachim Reichel
,
Elmar Schömer
Lecture Notes in Computer Science
2832
, 2003, pp. 618-629
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>