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=99
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On simultaneous straight-line grid embedding of a planar graph and its dual
Huaming Zhang
,
Xin He
Information Processing Letters
99
(1), 2006, pp. 1-6
Acyclic colorings of products of trees
Robert E. Jamison
,
Gretchen L. Matthews
,
John Villalpando
Information Processing Letters
99
(1), 2006, pp. 7-12
Complexity aspects of generalized Helly hypergraphs
Mitre C. Dourado
,
Fábio Protti
,
Jayme L. Szwarcfiter
Information Processing Letters
99
(1), 2006, pp. 13-18
On the cost of searching signature trees
Yangjun Chen
Information Processing Letters
99
(1), 2006, pp. 19-26
Separability of rational relations in
A^* \times N^m
by recognizable relations is decidable
Christian Choffrut
,
Serge Grigorieff
Information Processing Letters
99
(1), 2006, pp. 27-32
Complementing deterministic tree-walking automata
Anca Muscholl
,
Mathias Samuelides
,
Luc Segoufin
Information Processing Letters
99
(1), 2006, pp. 33-39
Lower bounds on the vertex-connectivity of digraphs and graphs
Angelika Hellwig
,
Lutz Volkmann
Information Processing Letters
99
(2), 2006, pp. 41-46
The 2-dipath chromatic number of Halin graphs
Chen Min
,
Wang Weifan
Information Processing Letters
99
(2), 2006, pp. 47-53
Approximate maximum weight branchings
Amitabha Bagchi
,
Ankur Bhargava
,
Torsten Suel
Information Processing Letters
99
(2), 2006, pp. 54-58
On the structure of certain intersection graphs
Kathie Cameron
,
Chính T. Hoàng
Information Processing Letters
99
(2), 2006, pp. 59-63
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Chung-Ming Lin
,
Yin Te Tsai
,
Chuan Yi Tang
Information Processing Letters
99
(2), 2006, pp. 64-67
A note on the not 3-choosability of some families of planar graphs
Mickaël Montassier
Information Processing Letters
99
(2), 2006, pp. 68-71
Simulation of simultaneous safe recursion over an arbitrary structure
Olga Xirotiri
Information Processing Letters
99
(2), 2006, pp. 72-81
Optimal priority assignment in the presence of blocking
Konstantinos Bletsas
,
Neil Audsley
Information Processing Letters
99
(3), 2006, pp. 83-86
A note on unique games
Adi Avidor
,
Ricky Rosen
Information Processing Letters
99
(3), 2006, pp. 87-91
An improvement of the tree code construction
Marcin Peczarski
Information Processing Letters
99
(3), 2006, pp. 92-95
Fair service for mice in the presence of elephants
Seth Voorhies
,
Hyunyoung Lee
,
Andreas Klappenecker
Information Processing Letters
99
(3), 2006, pp. 96-101
A new algorithm for online uniform-machine scheduling to minimize the makespan
T.C.E. Cheng
,
C.T. Ng
,
Vladimir Kotov
Information Processing Letters
99
(3), 2006, pp. 102-105
Retrieving reusable components with variation points from software product lines
Shih-Chien Chou
,
Yuan-Chien Chen
Information Processing Letters
99
(3), 2006, pp. 106-110
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Sándor Vágvölgyi
Information Processing Letters
99
(3), 2006, pp. 111-118
Approximating weighted matchings in parallel
Stefan Hougardy
,
Doratha E. Vinkemeier
Information Processing Letters
99
(3), 2006, pp. 119-123
A new approximation algorithm for labeling points with circle pairs
Minghui Jiang
Information Processing Letters
99
(4), 2006, pp. 125-129
Finding and counting cliques and independent sets in
r
-uniform hypergraphs
Raphael Yuster
Information Processing Letters
99
(4), 2006, pp. 130-134
Analysis of improved signcryption scheme with key privacy
Chik How Tan
Information Processing Letters
99
(4), 2006, pp. 135-138
Acyclic domination on bipartite permutation graphs
Guangjun Xu
,
Liying Kang
,
Erfang Shan
Information Processing Letters
99
(4), 2006, pp. 139-144
Seiten 1
2
>