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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Backtracking games and inflationary fixed points
Anuj Dawar
,
Erich Grädel
,
Stephan Kreutzer
Lecture Notes in Computer Science
3142
, 2004, pp. 420-432
A PTAS for embedding hypergraph in a cycle
Xiaotie Deng
,
Guojun Li
Lecture Notes in Computer Science
3142
, 2004, pp. 433-444
Towards an algebraic theory of typed mobile processes
Yuxin Deng
,
Davide Sangiorgi
Lecture Notes in Computer Science
3142
, 2004, pp. 445-456
Cache-oblivious algorithms and data structures
Gerth Stlting Brodal
Lecture Notes in Computer Science
3111
, 2004, pp. 3-13
Auctions with budget constraints
Nir Andelman
,
Yishay Mansour
Lecture Notes in Computer Science
3111
, 2004, pp. 26-38
Tight approximability results for test set problems in bioinformatics
Piotr Berman
,
Bhaskar DasGupta
,
Ming-Yang Kao
Lecture Notes in Computer Science
3111
, 2004, pp. 39-50
Collective tree spanners of graphs
Feodor F. Dragan
,
Chenyu Yan
,
Irina Lomonosov
Lecture Notes in Computer Science
3111
, 2004, pp. 64-76
Optimally competitive list batching
Wolfgang W. Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Lecture Notes in Computer Science
3111
, 2004, pp. 77-89
The relative worst order ratio applied to seat reservation
Joan Boyar
,
Paul Medvedev
Lecture Notes in Computer Science
3111
, 2004, pp. 90-101
Independent set of intersection graphs of convex objects in 2D
Pankaj K. Agarwal
,
Nabil H. Mustafa
Lecture Notes in Computer Science
3111
, 2004, pp. 127-137
Construction of the nearest neighbor embracing graph of a point set
M.Y. Chan
,
Danny Chen
,
Francis Y.L. Chin
,
Cao An Wang
Lecture Notes in Computer Science
3111
, 2004, pp. 150-160
Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexity
Miroslav Chlebík
,
Janka Chlebíková
Lecture Notes in Computer Science
3111
, 2004, pp. 174-186
Subexponential-time framework for optimal embeddings of graphs in integer lattices
Anders Dessmark
,
Andrzej Lingas
,
Eva-Marta Lundell
Lecture Notes in Computer Science
3111
, 2004, pp. 248-259
The multi-multiway cut problem
Adi Avidor
,
Michael Langberg
Lecture Notes in Computer Science
3111
, 2004, pp. 273-284
All-norm approximation for scheduling on identical machines
Yossi Azar
,
Shai Taub
Lecture Notes in Computer Science
3111
, 2004, pp. 298-310
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
3111
, 2004, pp. 431-441
On geometric structure of global roundings for graphs and range spaces
Tetsuo Asano
,
Naoki Katoh
,
Hisao Tamaki
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3111
, 2004, pp. 455-467
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Ulrich Meyer
,
Norbert Zeh
Lecture Notes in Computer Science
3111
, 2004, pp. 480-492
Simplified external memory algorithms for planar DAGs
Lars Arge
,
Laura Toma
Lecture Notes in Computer Science
3111
, 2004, pp. 493-503
Computational problems in perfect phylogeny haplotyping: Xor-genotypes and tag SNPs
Tamar Barzuza
,
Jacques S. Beckmann
,
Ron Shamir
,
Itsik Pe'er
Lecture Notes in Computer Science
3109
, 2004, pp. 14-31
A trie-based approach for compacting automata
Maxime Crochemore
,
Chiara Epifanio
,
Roberto Grossi
,
Filippo Mignosi
Lecture Notes in Computer Science
3109
, 2004, pp. 145-158
Efficient algorithms for finding submasses in weighted strings
Nikhil Bansal
,
Mark Cieliebak
,
Zsuzsanna Lipták
Lecture Notes in Computer Science
3109
, 2004, pp. 194-204
Maximum agreement and compatible supertrees
Vincent Berry
,
François Nicolas
Lecture Notes in Computer Science
3109
, 2004, pp. 205-219
Polynomial-time algorithms for the ordered maximum agreement subtree problem
Anders Dessmark
,
Jesper Jansson
,
Andrzej Lingas
,
Eva-Marta Lundell
Lecture Notes in Computer Science
3109
, 2004, pp. 220-229
The protein sequence design problem in canonical model on 2D and 3D lattices
Piotr Berman
,
Bhaskar DasGupta
,
Dhruv Mubayi
,
Robert Sloan
,
György Turán
,
Yi Zhang
Lecture Notes in Computer Science
3109
, 2004, pp. 244-253
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>