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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=113
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Planar graphs with cycles of length neither 4 nor 6 are
(2,0,0)
-colorable
Yingqian Wang
,
Jinghan Xu
Information Processing Letters
113
(18), 2013, pp. 659-663
A concise proof for total coloring subcubic graphs
Yun Feng
,
Wensong Lin
Information Processing Letters
113
(18), 2013, pp. 664-665
A characterization of tree-like Resolution size
Olaf Beyersdorff
,
Nicola Galesi
,
Massimo Lauria
Information Processing Letters
113
(18), 2013, pp. 666-671
Low complexity energy efficient very low bit-rate image compression scheme for wireless sensor network
Asnath Victy Phamila Y
,
R Amutha
Information Processing Letters
113
(18), 2013, pp. 672-676
Routing and wavelength assignment for 3-ary
n
-cube communication patterns in linear array optical networks for
n
communication rounds
Cui Yu
,
Xiaofan Yang
,
Jing Zhang
,
Li He
Information Processing Letters
113
(18), 2013, pp. 677-680
The burst factor and its impact on buffer performance
Bart Steyaert
,
Dieter Claeys
,
Herwig Bruneel
Information Processing Letters
113
(18), 2013, pp. 681-684
Edge-coloring almost bipartite multigraphs
Tomás Feder
,
Carlos Subi
Information Processing Letters
113
(18), 2013, pp. 685-689
A lower-variance randomized algorithm for approximate string matching
Mikhail J. Atallah
,
Elena Grigorescu
,
Yi Wu
Information Processing Letters
113
(18), 2013, pp. 690-692
Approximate pattern matching with
k
-mismatches in packed text
Emanuele Giaquinta
,
Szymon Grabowski
,
Kimmo Fredriksson
Information Processing Letters
113
(19-21), 2013, pp. 693-697
Boolean functions with long prime implicants
Ondȓej C̑epek
,
Petr Kuc̑era
,
Stanislav Kuȓík
Information Processing Letters
113
(19-21), 2013, pp. 698-703
On
s,t
-relaxed
L(2,1)
-labelings of the square lattice
Benqiu Dai
,
Wensong Lin
Information Processing Letters
113
(19-21), 2013, pp. 704-709
Notes on vertex pancyclicity of graphs
Qiaoping Guo
,
Shengjia Li
,
Gaokui Xu
,
Yubao Guo
Information Processing Letters
113
(19-21), 2013, pp. 710-713
Imbalance is fixed parameter tractable
Daniel Lokshtanov
,
Neeldhara Misra
,
Saket Saurabh
Information Processing Letters
113
(19-21), 2013, pp. 714-718
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
Apoloniusz Tyszka
Information Processing Letters
113
(19-21), 2013, pp. 719-722
A dynamic programming solution to a generalized LCS problem
Lei Wang
,
Xiaodong Wang
,
Yingjie Wu
,
Daxin Zhu
Information Processing Letters
113
(19-21), 2013, pp. 723-728
A note on the complexity of matching patterns with variables
Markus L. Schmid
Information Processing Letters
113
(19-21), 2013, pp. 729-733
Computing
K
-terminal reliability of
d
-trapezoid graphs
Min-Sheng Lin
,
Chao-Chun Ting
Information Processing Letters
113
(19-21), 2013, pp. 734-738
A new statistical strategy for pooling: ELI
Ilker Kocabaş
,
Bekir Taner Dinçer
Information Processing Letters
113
(19-21), 2013, pp. 739-746
Improved approximation algorithms for the Min-Max Selecting Items problem
Benjamin Doerr
Information Processing Letters
113
(19-21), 2013, pp. 747-749
Simple FPTAS for the subset-sums ratio problem
Danupon Nanongkai
Information Processing Letters
113
(19-21), 2013, pp. 750-753
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
Enrique Gerstl
,
Gur Mosheiov
Information Processing Letters
113
(19-21), 2013, pp. 754-759
Edge-fault tolerance of hypercube-like networks
Xiang-Jun Li
,
Jun-Ming Xu
Information Processing Letters
113
(19-21), 2013, pp. 760-763
Second order collision for the 42-step reduced DHA-256 hash function
Riham AlTawy
,
Aleksandar Kircanski
,
Amr Youssef
Information Processing Letters
113
(19-21), 2013, pp. 764-770
Self-stabilizing algorithms for efficient sets of graphs and trees
Volker Turau
Information Processing Letters
113
(19-21), 2013, pp. 771-776
Colored top-
K
range-aggregate queries
Biswajit Sanyal
,
Prosenjit Gupta
,
Subhashis Majumder
Information Processing Letters
113
(19-21), 2013, pp. 777-784
Seiten
<
1
2
3
4
5
6
7
8
>