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=107
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum weight feedback vertex sets in circle graphs
Fanica Gavril
Information Processing Letters
107
(1), 2008, pp. 1-6
A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
Frank Pok Man Chu
Information Processing Letters
107
(1), 2008, pp. 7-12
On the efficient construction of quasi-reversible automata for reversible languages
Pedro García
,
Manuel Vázquez de Parga
,
Damián López
Information Processing Letters
107
(1), 2008, pp. 13-17
The two-equal-disjoint path cover problem of Matching Composition Network
Pao-Lien Lai
,
Hong-Chun Hsu
Information Processing Letters
107
(1), 2008, pp. 18-23
An improved lower bound on approximation algorithms for the Closest Substring problem
Jianxin Wang
,
Jianer Chen
,
Min Huang
Information Processing Letters
107
(1), 2008, pp. 24-28
Fast algorithm for multicast and data gathering in wireless networks
Michael Segal
Information Processing Letters
107
(1), 2008, pp. 29-33
A note on the construction of error detecting/correcting prefix codes
Artur Alves Pessoa
Information Processing Letters
107
(1), 2008, pp. 34-38
Elementary approximation algorithms for prize collecting Steiner tree problems
Shai Gutner
Information Processing Letters
107
(1), 2008, pp. 39-44
The strong distance problem on the Cartesian product of graphs
Justie Su-Tzu Juan
,
Chun-Ming Huang
,
I-fan Sun
Information Processing Letters
107
(2), 2008, pp. 45-51
Description and analysis of a bottom-up DFA minimization algorithm
Jorge Almeida
,
Marc Zeitoun
Information Processing Letters
107
(2), 2008, pp. 52-59
Complexity analysis of a decentralised graph colouring algorithm
K.R. Duffy
,
N. O'Connell
,
A. Sapozhnikov
Information Processing Letters
107
(2), 2008, pp. 60-63
New efficiency results for makespan cost sharing
Yvonne Bleischwitz
,
Florian Schoppmann
Information Processing Letters
107
(2), 2008, pp. 64-70
A 4-states algebraic solution to linear cellular automata synchronization
Jean-Baptiste Yunès
Information Processing Letters
107
(2), 2008, pp. 71-75
Hausdorff approximation of 3D convex polytopes
Mario A. Lopez
,
Shlomo Reisner
Information Processing Letters
107
(2), 2008, pp. 76-82
Rogue-key attacks on the multi-designated verifiers signature scheme
Kyung-Ah Shim
Information Processing Letters
107
(2), 2008, pp. 83-86
An efficient method to generate feasible paths for basis path testing
Jun Yan
,
Jian Zhang
Information Processing Letters
107
(3-4), 2008, pp. 87-92
1,2 conjecture - The multiplicative version
Joanna Skowronek-Kaziów
Information Processing Letters
107
(3-4), 2008, pp. 93-95
Approximating
k
-hop minimum spanning trees in Euclidean metrics
Sören Laue
,
Domagoj Matijević
Information Processing Letters
107
(3-4), 2008, pp. 96-101
On 3-choosability of planar graphs without certain cycles
Haihui Zhang
,
Zhiren Sun
Information Processing Letters
107
(3-4), 2008, pp. 102-106
A relaxation of Havel's 3-color problem
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
,
Yingqian Wang
Information Processing Letters
107
(3-4), 2008, pp. 107-109
Conditional fault Hamiltonicity of the complete graph
Jung-Sheng Fu
Information Processing Letters
107
(3-4), 2008, pp. 110-113
Confusion of memory
Lawrence S. Moss
Information Processing Letters
107
(3-4), 2008, pp. 114-119
Minimum-perimeter enclosures
Joseph S.B. Mitchell
,
Valentin Polishchuk
Information Processing Letters
107
(3-4), 2008, pp. 120-124
A better list heuristic for vertex cover
François Delbot
,
Christian Laforest
Information Processing Letters
107
(3-4), 2008, pp. 125-127
The connection between two ways of reasoning about partial functions
John S. Fitzgerald
,
Cliff B. Jones
Information Processing Letters
107
(3-4), 2008, pp. 128-132
Seiten 1
2
>