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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Single machine scheduling with batch-dependent setup times
Gur Mosheiov
,
Daniel Oron
Information Processing Letters
98
(2), 2006, pp. 73-78
The diameter of Hanoi graphs
Daniel Berend
,
Amir Sapir
Information Processing Letters
98
(2), 2006, pp. 79-85
The pair completion algorithm for the homogeneous set sandwich problem
Claudson Bornstein
,
Celina M.H. de Figueiredo
,
Vinícius G.P. de Sá
Information Processing Letters
98
(3), 2006, pp. 87-91
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
98
(3), 2006, pp. 92-95
Vertex rankings of chordal graphs and weighted trees
Dariusz Dereniowski
,
Adam Nadolski
Information Processing Letters
98
(3), 2006, pp. 96-100
\Delta
-list vertex coloring in linear time
San Skulrattanakulchai
Information Processing Letters
98
(3), 2006, pp. 101-106
Adaptive general perfectly periodic scheduling
Shailesh Patil
,
Vijay K. Garg
Information Processing Letters
98
(3), 2006, pp. 107-114
Depth of nodes in random recursive
k
-ary trees
Mehri Javanian
,
Mohammad Q. Vahidi-Asl
Information Processing Letters
98
(3), 2006, pp. 115-118
QoS based resource scheduling by computational economy in computational grid
Li Chunlin
,
Li Layuan
Information Processing Letters
98
(3), 2006, pp. 119-126
Smaller superconcentrators of density 28
Uwe Schöning
Information Processing Letters
98
(4), 2006, pp. 127-129
Improved algorithm for the symmetry number problem on trees
Yijie Han
Information Processing Letters
98
(4), 2006, pp. 130-132
Structure and linear time recognition of 3-leaf powers
Andreas Brandstädt
,
Van Bang Le
Information Processing Letters
98
(4), 2006, pp. 133-138
Finding routes in anonymous sensor networks
Renato C. Dutra
,
Valmir C. Barbosa
Information Processing Letters
98
(4), 2006, pp. 139-144
Parameterized power domination complexity
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Information Processing Letters
98
(4), 2006, pp. 145-149
Optimal register allocation for SSA-form programs in polynomial time
Sebastian Hack
,
Gerhard Goos
Information Processing Letters
98
(4), 2006, pp. 150-155
Termination of
{aa \rightarrow bc,bb \rightarrow ac,cc \rightarrow ab}
Dieter Hofbauer
,
Johannes Waldmann
Information Processing Letters
98
(4), 2006, pp. 156-158
A new sufficient condition for Hamiltonicity of graphs
Rao Li
Information Processing Letters
98
(4), 2006, pp. 159-161
The number of guillotine partitions in
d
dimensions
Eyal Ackerman
,
Gill Barequet
,
Ron Y. Pinter
,
Dan Romik
Information Processing Letters
98
(4), 2006, pp. 162-167
L(p,q)
-labelling of
K_4
-minor free graphs
Wang Weifan
,
Wang Yiqiao
Information Processing Letters
98
(5), 2006, pp. 169-173
A note on alternating one-pebble Turing machines with sublogarithmic space
Andrzej Szepietowski
Information Processing Letters
98
(5), 2006, pp. 174-176
Overcoming observability problems in distributed test architectures
J. Chen
,
R.M. Hierons
,
H. Ural
Information Processing Letters
98
(5), 2006, pp. 177-182
Computational complexity of queries based on itemsets
Nikolaj Tatti
Information Processing Letters
98
(5), 2006, pp. 183-187
Improved undecidability results on weighted timed automata
Patricia Bouyer
,
Thomas Brihaye
,
Nicolas Markey
Information Processing Letters
98
(5), 2006, pp. 188-194
Knuth-Bendix completion of theories of commuting group endomorphisms
Aaron Stump
,
Bernd Löchner
Information Processing Letters
98
(5), 2006, pp. 195-198
On finding a widest empty 1-corner corridor
J.M. Díaz-Báñez
,
M.A. López
,
J.A. Sellarès
Information Processing Letters
98
(5), 2006, pp. 199-205
Seiten
<
1
2
3
4
5
6
7
8
>