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 YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
Wenjie Li
,
Zhenkun Zhang
,
Hailing Liu
,
Jinjiang Yuan
Information Processing Letters
112
(12), 2012, pp. 503-508
Embedding of hypercubes into necklace, windmill and snake graphs
Indra Rajasingh
,
Bharati Rajan
,
R. Sundara Rajan
Information Processing Letters
112
(12), 2012, pp. 509-515
Efficient algorithms for local ranking
Chia-Jung Chang
,
Kun-Mao Chao
Information Processing Letters
112
(13), 2012, pp. 517-522
Erratum to ``Minimum cost flows with minimum quantities''
Sven O. Krumke
,
Clemens Thielen
Information Processing Letters
112
(13), 2012, pp. 523-524
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Zhengnan Shi
Information Processing Letters
112
(13), 2012, pp. 525-531
Computing generalized ham-sandwich cuts
Sergey Bereg
Information Processing Letters
112
(13), 2012, pp. 532-534
An exact exponential time algorithm for counting bipartite cliques
Konstantin Kutzkov
Information Processing Letters
112
(13), 2012, pp. 535-539
List update with probabilistic locality of reference
Reza Dorrigiv
,
Alejandro López-Ortiz
Information Processing Letters
112
(13), 2012, pp. 540-543
A
K
-trivial set which is not jump traceable at certain orders
Daniel Turetsky
Information Processing Letters
112
(13), 2012, pp. 544-547
Optimal randomized algorithm for a generalized ski-rental with interest rate
Xingyu Yang
,
Weiguo Zhang
,
Yong Zhang
,
Weijun Xu
Information Processing Letters
112
(13), 2012, pp. 548-551
L(2, 1)
-labeling of dually chordal graphs and strongly orderable graphs
B.S. Panda
,
Preeti Goel
Information Processing Letters
112
(13), 2012, pp. 552-556
Acyclic chromatic indices of fully subdivided graphs
Anna Fiedorowicz
,
Mariusz Haƚuszczak
Information Processing Letters
112
(13), 2012, pp. 557-561
Doubly-constrained LCS and hybrid-constrained LCS problems revisited
Effat Farhana
,
M. Sohel Rahman
Information Processing Letters
112
(13), 2012, pp. 562-565
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
Petra S̑parl
,
Rafaƚ Witkowski
,
Janez Z̑erovnik
Information Processing Letters
112
(14-15), 2012, pp. 567-571
On multi-head automata with restricted nondeterminism
Daniel Reidenbach
,
Markus L. Schmid
Information Processing Letters
112
(14-15), 2012, pp. 572-577
Efficient inclusion testing for simple classes of unambiguous
\omega
-automata
Dimitri Isaak
,
Christof Löding
Information Processing Letters
112
(14-15), 2012, pp. 578-582
Minimum wirelength of hypercubes into
n
-dimensional grid networks
Indra Rajasingh
,
Micheal Arockiaraj
,
Bharati Rajan
,
Paul Manuel
Information Processing Letters
112
(14-15), 2012, pp. 583-586
One-round identity-based key exchange with Perfect Forward Security
Min Xie
,
Libin Wang
Information Processing Letters
112
(14-15), 2012, pp. 587-591
Regular set of representatives for time-constrained MSC graphs
S. Akshay
,
Blaise Genest
,
Loïc Hélouët
,
Shaofa Yang
Information Processing Letters
112
(14-15), 2012, pp. 592-598
Embedding a mesh of trees in the crossed cube
Qiang Dong
,
Junlin Zhou
,
Yan Fu
,
Xiaofan Yang
Information Processing Letters
112
(14-15), 2012, pp. 599-603
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
Xiaoni Du
,
Zhixiong Chen
,
Lei Hu
Information Processing Letters
112
(14-15), 2012, pp. 604-609
A lower bound on the size of resolution proofs of the Ramsey theorem
Pavel Pudlák
Information Processing Letters
112
(14-15), 2012, pp. 610-611
An alternate proof of Statman's finite completeness theorem
B. Srivathsan
,
Igor Walukiewicz
Information Processing Letters
112
(14-15), 2012, pp. 612-616
Some characterizations of
\gamma
and
\beta
-acyclicity of hypergraphs
David Duris
Information Processing Letters
112
(16), 2012, pp. 617-620
A self-stabilizing algorithm for optimally efficient sets in graphs
Sandra M. Hedetniemi
,
Stephen T. Hedetniemi
,
Hao Jiang
,
K.E. Kennedy
,
Alice A. McRae
Information Processing Letters
112
(16), 2012, pp. 621-623
Seiten
<
1
2
3
4
5
6
7
8
>