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 YEAR=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithm for the widest empty 1-corner corridor
Gautam K. Das
,
Debapriyay Mukhopadhyay
,
Subhas C. Nandy
Information Processing Letters
109
(18), 2009, pp. 1060-1065
Finding the longest common nonsuperstring in linear time
Joong Chae Na
,
Dong Kyue Kim
,
Jeong Seop Sim
Information Processing Letters
109
(18), 2009, pp. 1066-1070
The complexity of propositional implication
Olaf Beyersdorff
,
Arne Meier
,
Michael Thomas
,
Heribert Vollmer
Information Processing Letters
109
(18), 2009, pp. 1071-1077
Lucky labelings of graphs
Sebastian Czerwiński
,
Jarosƚaw Grytczuk
,
Wiktor Żelazny
Information Processing Letters
109
(18), 2009, pp. 1078-1081
Computing the subset partial order for dense families of sets
Amr Elmasry
Information Processing Letters
109
(18), 2009, pp. 1082-1086
Binary trees with choosable edge lengths
Jens Maßberg
,
Dieter Rautenbach
Information Processing Letters
109
(18), 2009, pp. 1087-1092
Improved efficiency of Kiltz07-KEM
Xianhui Lu
,
Xuejia Lai
,
Dake He
Information Processing Letters
109
(18), 2009, pp. 1093-1096
A closed-form solution to video matting of natural snow
Hai Liu
,
Lizhuang Ma
,
Xuan Cai
,
Zhihua Chen
,
Yang Shen
Information Processing Letters
109
(18), 2009, pp. 1097-1104
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Louis Ibarra
Information Processing Letters
109
(18), 2009, pp. 1105-1108
New instability results for high-dimensional nearest neighbor search
Chris Giannella
Information Processing Letters
109
(19), 2009, pp. 1109-1113
A note on Rooted Survivable Networks
Zeev Nutov
Information Processing Letters
109
(19), 2009, pp. 1114-1119
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
Bin Ma
,
Hongyi Yao
Information Processing Letters
109
(19), 2009, pp. 1120-1124
Optimal online-list batch scheduling
Jacob Jan Paulus
,
Deshi Ye
,
Guochuan Zhang
Information Processing Letters
109
(19), 2009, pp. 1125-1128
A note on path bipancyclicity of hypercubes
Chia-Jui Lai
Information Processing Letters
109
(19), 2009, pp. 1129-1130
Structural properties of oracle classes
Stanislav Z̑ivný
Information Processing Letters
109
(19), 2009, pp. 1131-1135
Wireless network design via 3-decompositions
Zeev Nutov
,
Ariel Yaroshevitch
Information Processing Letters
109
(19), 2009, pp. 1136-1140
On the intrinsic complexity of point finding in real singular hypersurfaces
Bernd Bank
,
Marc Giusti
,
Joos Heintz
,
Luis Miguel Pardo
Information Processing Letters
109
(19), 2009, pp. 1141-1144
Hashiwokakero is
NP
-complete
Daniel Andersson
Information Processing Letters
109
(19), 2009, pp. 1145-1146
Security of self-certified signatures
Zuhua Shao
Information Processing Letters
109
(20), 2009, pp. 1147-1150
Vertex fault tolerance of optimal-
\kappa
graphs and super-
\kappa
graphs
Yanmei Hong
,
Zhao Zhang
Information Processing Letters
109
(20), 2009, pp. 1151-1155
A clique-covering sufficient condition for Hamiltonicity of graphs
Alain Bretto
,
Thierry Vallée
Information Processing Letters
109
(20), 2009, pp. 1156-1160
Constant ratio fixed-parameter approximation of the edge multicut problem
Dániel Marx
,
Igor Razgon
Information Processing Letters
109
(20), 2009, pp. 1161-1166
Farthest segments and extremal triangles spanned by points in
{\mathbb{R}}^3
Steven Bitner
,
Ovidiu Daescu
Information Processing Letters
109
(20), 2009, pp. 1167-1171
Incremental deployment of network monitors based on Group Betweenness Centrality
Shlomi Dolev
,
Yuval Elovici
,
Rami Puzis
,
Polina Zilberman
Information Processing Letters
109
(20), 2009, pp. 1172-1176
On the complexity of signed and minus total domination in graphs
Chuan-Min Lee
Information Processing Letters
109
(20), 2009, pp. 1177-1181
Seiten
<
1
2
3
4
5
6
7
8
9
10
>