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
[1]
Hilfe
Suche: Series=LNCS AND Volume=4112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconciling gene trees with apparent polytomies
Wen-Chieh Chang
,
Oliver Eulenstein
Lecture Notes in Computer Science
4112
, 2006, pp. 235-244
Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes
Zhixiang Chen
,
Richard H. Fowler
,
Bin Fu
,
Binhai Zhu
Lecture Notes in Computer Science
4112
, 2006, pp. 245-254
Computing maximum-scoring segments in almost linear time
Fredrik Bengtsson
,
Jingsen Chen
Lecture Notes in Computer Science
4112
, 2006, pp. 255-264
Enumerate and expand: New runtime bounds for vertex cover variants
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
4112
, 2006, pp. 265-273
A detachment algorithm for inferring a graph from path frequency
Hiroshi Nagamochi
Lecture Notes in Computer Science
4112
, 2006, pp. 274-283
The
d
-identifying codes problem for vertex identification in graphs: Probabilistic analysis and an approximation algorithm
Ying Xiao
,
Christoforos Hadjicostis
,
Krishnaiyan Thulasiraman
Lecture Notes in Computer Science
4112
, 2006, pp. 284-298
Reconstructing evolution of natural languages: Complexity and parameterized algorithms
Iyad A. Kanj
,
Luay Nakhleh
,
Ge Xia
Lecture Notes in Computer Science
4112
, 2006, pp. 299-308
On dynamic bin packing: An improved lower bound and resource augmentation analysis
Wun-Tat Chan
,
Prudence W.H. Wong
,
Fencol C.C. Yung
Lecture Notes in Computer Science
4112
, 2006, pp. 309-319
Improved on-line broadcast scheduling with deadlines
Feifeng Zheng
,
Stanley P.Y. Fung
,
Wun-Tat Chan
,
Francis Y.L. Chin
,
Chung Keung Poon
,
Prudence W.H. Wong
Lecture Notes in Computer Science
4112
, 2006, pp. 320-329
A tight analysis of most-requested-first for on-demand data broadcast
Regant Y.S. Hung
,
H.F. Ting
Lecture Notes in Computer Science
4112
, 2006, pp. 330-339
On lazy bin covering and packing problems
Mingen Lin
,
Yang Yang
,
Jinhui Xu
Lecture Notes in Computer Science
4112
, 2006, pp. 340-349
Creation and growth of components in a random hypergraph process
Vlady Ravelomanana
,
Alphonse Laza Rijamamy
Lecture Notes in Computer Science
4112
, 2006, pp. 350-359
Optimal acyclic edge colouring of grid like graphs
Rahul Muthu
,
N. Narayanan
,
C.R. Subramanian
Lecture Notes in Computer Science
4112
, 2006, pp. 360-367
An edge ordering problem of regular hypergraphs
Hongbing Fan
,
Robert Kalbfleisch
Lecture Notes in Computer Science
4112
, 2006, pp. 368-377
Efficient partially blind signature scheme with provable security
Zheng Gong
,
Xiangxue Li
,
Kefei Chen
Lecture Notes in Computer Science
4112
, 2006, pp. 378-386
A rigorous analysis for set-up time models - A metric perspective
Eitan Bachmat
,
Tao Kai Lam
,
Avner Magen
Lecture Notes in Computer Science
4112
, 2006, pp. 387-397
Geometric representation of graphs in low dimension
L. Sunil Chandran
,
Naveen Sivadasan
Lecture Notes in Computer Science
4112
, 2006, pp. 398-407
The on-line Heilbronn's triangle problem in
d
dimensions
Gill Barequet
,
Alina Shaikhet
Lecture Notes in Computer Science
4112
, 2006, pp. 408-417
Counting
d
-dimensional polycubes and nonrectangular planar polyominoes
Gadi Aleksandrowicz
,
Gill Barequet
Lecture Notes in Computer Science
4112
, 2006, pp. 418-427
Approximating min-max (regret) versions of some polynomial problems
Hassene Aissi
,
Cristina Bazgan
,
Daniel Vanderpooten
Lecture Notes in Computer Science
4112
, 2006, pp. 428-438
The class constrained bin packing problem with applications to video-on-demand
E.C. Xavier
,
F.K. Miyazawa
Lecture Notes in Computer Science
4112
, 2006, pp. 439-448
MAX-SNP hardness and approximation of selected-internal Steiner trees
Sun-Yuan Hsieh
,
Shih-Cheng Yang
Lecture Notes in Computer Science
4112
, 2006, pp. 449-458
Minimum clique partition problem with constrained weight for interval graphs
Jianbo Li
,
Mingxia Chen
,
Jianping Li
,
Weidong Li
Lecture Notes in Computer Science
4112
, 2006, pp. 459-468
Overlap-free regular languages
Yo-Sub Han
,
Derick Wood
Lecture Notes in Computer Science
4112
, 2006, pp. 469-478
On the combinatorial representation of information
Joel Ratsaby
Lecture Notes in Computer Science
4112
, 2006, pp. 479-488
Seiten
<
1
2
3
>