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=Inf.~Process.~Lett. AND Volume=104
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dicing on the Streett
Florian Horn
Information Processing Letters
104
(1), 2007, pp. 1-9
A note on the Hadwiger number of circular arc graphs
N.S. Narayanaswamy
,
N. Belkale
,
L.S. Chandran
,
N. Sivadasan
Information Processing Letters
104
(1), 2007, pp. 10-13
Genome rearrangements: A correct algorithm for optimal capping
Géraldine Jean
,
Macha Nikolski
Information Processing Letters
104
(1), 2007, pp. 14-20
The finite horizon investor problem with a budget constraint
Asaf Levin
Information Processing Letters
104
(1), 2007, pp. 21-28
Descriptional complexity of semi-conditional grammars
Tomás̑ Masopust
,
Alexander Meduna
Information Processing Letters
104
(1), 2007, pp. 29-31
The impact of overload conditions on computer network reliability
Saulius Minkevic̑ius
Information Processing Letters
104
(1), 2007, pp. 32-35
Another proof of Wright's inequalities
Vlady Ravelomanana
Information Processing Letters
104
(1), 2007, pp. 36-39
An improved upper bound on the queuenumber of the hypercube
Toru Hasunuma
,
Misa Hirota
Information Processing Letters
104
(2), 2007, pp. 41-44
Scheduling imprecise computation tasks on uniform processors
Guohua Wan
,
Joseph Y.-T. Leung
,
Michael L. Pinedo
Information Processing Letters
104
(2), 2007, pp. 45-52
A
2^{(O(k)}
poly
(n)
algorithm for the parameterized Convex Recoloring problem
Igor Razgon
Information Processing Letters
104
(2), 2007, pp. 53-58
On planar path transformation
Selim G. Akl
,
Md. Kamrul Islam
,
Henk Meijer
Information Processing Letters
104
(2), 2007, pp. 59-64
Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG
Venkatesh Raman
,
Saket Saurabh
Information Processing Letters
104
(2), 2007, pp. 65-72
Eigen-distribution on random assignments for game trees
ChenGuang Liu
,
Kazuyuki Tanaka
Information Processing Letters
104
(2), 2007, pp. 73-77
Parameterized complexity of the induced subgraph problem in directed graphs
Venkatesh Raman
,
Somnath Sikdar
Information Processing Letters
104
(3), 2007, pp. 79-85
On the
k
-tuple domination of de Bruijn and Kautz digraphs
Toru Araki
Information Processing Letters
104
(3), 2007, pp. 86-90
A new algorithm for testing if a regular language is locally threshold testable
Mikoƚaj Bojańczyk
Information Processing Letters
104
(3), 2007, pp. 91-94
On the lexicographical generation of compressed codes
Markus E. Nebel
Information Processing Letters
104
(3), 2007, pp. 95-100
Improving the arithmetic of elliptic curves in the Jacobi tmodel
Sylvain Duquesne
Information Processing Letters
104
(3), 2007, pp. 101-105
Optimal per-edge processing times in the semi-streaming model
Mariano Zelke
Information Processing Letters
104
(3), 2007, pp. 106-112
Spanning trees with minimum weighted degrees
Mohammad Ghodsi
,
Hamid Mahini
,
Kian Mirjalali
,
Shayan Oveis Gharan
,
Amin S. Sayedi R.
,
Morteza Zadimoghaddam
Information Processing Letters
104
(3), 2007, pp. 113-116
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
Yuren Zhou
,
Jun He
Information Processing Letters
104
(4), 2007, pp. 117-122
Uniform metrical task systems with a limited number of states
Wolfgang Bein
,
Lawrence L. Larmore
,
John Noga
Information Processing Letters
104
(4), 2007, pp. 123-128
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Thomas Chatain
,
Victor Khomenko
Information Processing Letters
104
(4), 2007, pp. 129-136
On constructing an optimal consensus clustering from multiple clusterings
Piotr Berman
,
Bhaskar DasGupta
,
Ming-Yang Kao
,
Jie Wang
Information Processing Letters
104
(4), 2007, pp. 137-145
A sufficient condition for a planar graph to be 3-choosable
Liang Shen
,
Yingqian Wang
Information Processing Letters
104
(4), 2007, pp. 146-151
Seiten 1
2
>