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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A result on linear coloring of planar graphs
Chunli Cai
,
Dezheng Xie
,
Wenjuan Yang
Information Processing Letters
112
(22), 2012, pp. 880-884
An efficient IND-CCA2 secure Paillier-based cryptosystem
Angsuman Das
,
Avishek Adhikari
Information Processing Letters
112
(22), 2012, pp. 885-888
Constrained multilinear detection for faster functional motif discovery
Ioannis Koutis
Information Processing Letters
112
(22), 2012, pp. 889-892
A simple reduction from maximum weight matching to maximum cardinality matching
S. Pettie
Information Processing Letters
112
(23), 2012, pp. 893-898
H
-colorings of dense hypergraphs
Edyta Szymańska
Information Processing Letters
112
(23), 2012, pp. 899-902
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
Martin Olsen
,
Lars Bækgaard
,
Torben Tambo
Information Processing Letters
112
(23), 2012, pp. 903-907
An improved approximation algorithm for the clustered Traveling Salesman Problem
Xiaoguang Bao
,
Zhaohui Liu
Information Processing Letters
112
(23), 2012, pp. 908-910
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization
Hiroshi Fujiwara
,
Yoshiyuki Sekiguchi
Information Processing Letters
112
(23), 2012, pp. 911-915
Information measures based on fractional calculus
Shiwei Yu
,
T.-Z. Huang
,
Xiaoyun Liu
,
Wufan Chen
Information Processing Letters
112
(23), 2012, pp. 916-921
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
Apurv Nakade
,
Somenath Biswas
Information Processing Letters
112
(23), 2012, pp. 922-927
Parity games on undirected graphs
Dietmar Berwanger
,
Olivier Serre
Information Processing Letters
112
(23), 2012, pp. 928-932
On multiple-instance learning of halfspaces
D.I. Diochnos
,
R.H. Sloan
,
Gy. Turán
Information Processing Letters
112
(23), 2012, pp. 933-936
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
Jakarin Chawachat
,
Jittat Fakcharoenphol
,
Wattana Jindaluang
Information Processing Letters
112
(24), 2012, pp. 937-941
Non-extendible Latin parallelepipeds
Martin Kochol
Information Processing Letters
112
(24), 2012, pp. 942-943
Eccentric counts, connectivity and chordality
Peter Dankelmann
,
David Erwin
,
Wayne Goddard
,
Simon Mukwembi
,
Henda C. Swart
Information Processing Letters
112
(24), 2012, pp. 944-947
Seiten
<
1
2
3
4
5
6
7
8