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 Volume=4288
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Inverse HAMILTONIAN CYCLE and inverse 3-D MATCHING are coNP-complete
Michael Krüger
,
Harald Hempel
Lecture Notes in Computer Science
4288
, 2006, pp. 243-252
Parameterized problems on coincidence graphs
Sylvain Guillemot
Lecture Notes in Computer Science
4288
, 2006, pp. 253-266
On 2-query codeword testing with near-perfect completeness
Venkatesan Guruswami
Lecture Notes in Computer Science
4288
, 2006, pp. 267-276
Poketree: A dynamically competitive data structure with good worst-case performance
Jussi Kujala
,
Tapio Elomaa
Lecture Notes in Computer Science
4288
, 2006, pp. 277-288
Efficient algorithms for the optimal-ratio region detection problems in discrete geometry with applications
Xiaodong Wu
Lecture Notes in Computer Science
4288
, 2006, pp. 289-299
On locating disjoint segments with maximum sum of densities
Hsiao-Fei Liu
,
Kun-Mao Chao
Lecture Notes in Computer Science
4288
, 2006, pp. 300-307
Two-tier relaxed heaps
Amr Elmasry
,
Claus Jensen
,
Jyrki Katajainen
Lecture Notes in Computer Science
4288
, 2006, pp. 308-317
The interval liar game
Benjamin Doerr
,
Johannes Lengler
,
David Steurer
Lecture Notes in Computer Science
4288
, 2006, pp. 318-327
How much independent should individual contacts be to form a small-world?
Gennaro Cordasco
,
Luisa Gargano
Lecture Notes in Computer Science
4288
, 2006, pp. 328-338
Faster centralized communication in radio networks
Ferdinando Cicalese
,
Fredrik Manne
,
Qin Xin
Lecture Notes in Computer Science
4288
, 2006, pp. 339-348
On the runtime and robustness of randomized broadcasting
Robert Elsässer
,
Thomas Sauerwald
Lecture Notes in Computer Science
4288
, 2006, pp. 349-358
Local search in evolutionary algorithms: The impact of the local search frequency
Dirk Sudholt
Lecture Notes in Computer Science
4288
, 2006, pp. 359-368
Non-cooperative facility location and covering games
Martin Hoefer
Lecture Notes in Computer Science
4288
, 2006, pp. 369-378
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Yuzhuang Hu
,
Qiaosheng Shi
,
Arie Tamir
Lecture Notes in Computer Science
4288
, 2006, pp. 379-388
Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications
George Tsaggouris
,
Christos Zaroliagis
Lecture Notes in Computer Science
4288
, 2006, pp. 389-398
Algorithms for computing variants of the longest common subsequence problem
M. Sohel Rahman
,
Costas S. Iliopoulos
Lecture Notes in Computer Science
4288
, 2006, pp. 399-408
Constructing labeling schemes through universal matrices
Amos Korman
,
David Peleg
,
Yoav Rodeh
Lecture Notes in Computer Science
4288
, 2006, pp. 409-418
Making arbitrary graphs transitively orientable: Minimal comparability completions
Pinar Heggernes
,
Federico Mancini
,
Charis Papadopoulos
Lecture Notes in Computer Science
4288
, 2006, pp. 419-428
Analyzing disturbed diffusion on networks
Henning Meyerhenke
,
Thomas Sauerwald
Lecture Notes in Computer Science
4288
, 2006, pp. 429-438
Exact algorithms for finding the minimum independent dominating set in graphs
Chunmei Liu
,
Yinglei Song
Lecture Notes in Computer Science
4288
, 2006, pp. 439-448
On isomorphism and canonization of tournaments and hypertournaments
V. Arvind
,
Bireswar Das
,
Partha Mukhopadhyay
Lecture Notes in Computer Science
4288
, 2006, pp. 449-459
Efficient algorithms for the sum selection problem and
k
maximum sums problem
Tien-Ching Lin
,
D.T. Lee
Lecture Notes in Computer Science
4288
, 2006, pp. 460-473
Deterministic random walks on the two-dimensional grid
Benjamin Doerr
,
Tobias Friedrich
Lecture Notes in Computer Science
4288
, 2006, pp. 474-483
Improving time and space complexity for compressed pattern matching
Shirou Maruyama
,
Hiromitsu Miyagawa
,
Hiroshi Sakamoto
Lecture Notes in Computer Science
4288
, 2006, pp. 484-493
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
Yunhong Zhou
Lecture Notes in Computer Science
4288
, 2006, pp. 494-506
Seiten
<
1
2
3
>