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=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Coloring chip configurations on graphs and digraphs
Mieczysƚaw Borowiecki
,
Jarosƚaw Grytczuk
,
Monika Pilśniak
Information Processing Letters
112
(1-2), 2012, pp. 1-4
An FPT algorithm for edge subset feedback edge set
Mingyu Xiao
,
Hiroshi Nagamochi
Information Processing Letters
112
(1-2), 2012, pp. 5-9
A note on the Kenyon-Remila strip-packing algorithm
Maxim Sviridenko
Information Processing Letters
112
(1-2), 2012, pp. 10-12
A correspondence between type checking via reduction and type checking via evaluation
Ilya Sergey
,
Dave Clarke
Information Processing Letters
112
(1-2), 2012, pp. 13-20
Online call control in cellular networks revisited
Yong Zhang
,
Francis Y.L. Chin
,
Hing-Fung Ting
,
Joseph Wun-Tat Chan
,
Xin Han
,
Ka-Cheong Lam
Information Processing Letters
112
(1-2), 2012, pp. 21-25
Max-optimal and sum-optimal labelings of graphs
Robert E. Jamison
,
Darren A. Narayan
Information Processing Letters
112
(1-2), 2012, pp. 26-31
Memory-restricted black-box complexity of OneMax
Benjamin Doerr
,
Carola Winzen
Information Processing Letters
112
(1-2), 2012, pp. 32-34
Singleton and 2-periodic attractors of sign-definite Boolean networks
Tatsuya Akutsu
,
Avraham A. Melkman
,
Takeyuki Tamura
Information Processing Letters
112
(1-2), 2012, pp. 35-38
A note on labeling schemes for graph connectivity
Rani Izsak
,
Zeev Nutov
Information Processing Letters
112
(1-2), 2012, pp. 39-43
Havel-Hakimi residues of unigraphs
Michael D. Barrus
Information Processing Letters
112
(1-2), 2012, pp. 44-48
Center-based clustering under perturbation stability
Pranjal Awasthi
,
Avrim Blum
,
Or Sheffet
Information Processing Letters
112
(1-2), 2012, pp. 49-54
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
Sheng Yu
,
Prudence W.H. Wong
Information Processing Letters
112
(1-2), 2012, pp. 55-58
A comment on pure-strategy Nash equilibria in competitive diffusion games
Reiko Takehara
,
Masahiro Hachimori
,
Maiko Shigeno
Information Processing Letters
112
(3), 2012, pp. 59-60
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Xie-Bin Chen
Information Processing Letters
112
(3), 2012, pp. 61-66
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Andreas Brandstädt
,
Vassilis Giakoumakis
Information Processing Letters
112
(3), 2012, pp. 67-71
A note on a single machine scheduling problem with generalized total tardiness objective function
Evgeny R. Gafarov
,
Alexander A. Lazarev
,
Frank Werner
Information Processing Letters
112
(3), 2012, pp. 72-76
A dichotomy in the complexity of consistent query answering for queries with two atoms
Phokion G. Kolaitis
,
Enela Pema
Information Processing Letters
112
(3), 2012, pp. 77-85
Flipping the winner of a poset game
Adam O. Kalinich
Information Processing Letters
112
(3), 2012, pp. 86-89
Analysis of total average queue length in multi-hop wireless networks
Jin-Ghoo Choi
Information Processing Letters
112
(3), 2012, pp. 90-94
A neighborhood condition for graphs to be maximally
k
-restricted edge connected
Shiying Wang
,
Lei Zhang
,
Shangwei Lin
Information Processing Letters
112
(3), 2012, pp. 95-97
Increasing the flexibility of the herding attack
Bart Mennink
Information Processing Letters
112
(3), 2012, pp. 98-105
Zen Puzzle Garden is NP-complete
Robin Houston
,
Joseph White
,
Martyn Amos
Information Processing Letters
112
(3), 2012, pp. 106-108
Computation of lucky number of planar graphs is NP-hard
A. Ahadi
,
A. Dehghan
,
M. Kazemi
,
E. Mollaahmadi
Information Processing Letters
112
(4), 2012, pp. 109-112
Oriented chromatic number of grids is greater than 7
Janusz Dybizbański
,
Anna Nenca
Information Processing Letters
112
(4), 2012, pp. 113-117
Optimal online pricing with network externalities
Shayan Ehsani
,
Mohammad Ghodsi
,
Ahmad Khajenezhad
,
Hamid Mahini
,
Afshin Nikzad
Information Processing Letters
112
(4), 2012, pp. 118-123
Seiten 1
2
3
4
5
6
7
8
>