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=Theor.~Comput.~Sci. AND Volume=439
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A
(1+\epsilon)
-approximation algorithm for sorting by short block-moves
Haitao Jiang
,
Daming Zhu
,
Binhai Zhu
Theoretical Computer Science
439
, 2012, pp. 1-8
Complexity of independent set reconfigurability problems
Marcin Kamiński
,
Paul Medvedev
,
Martin Milanic̑
Theoretical Computer Science
439
, 2012, pp. 9-15
On the complexity of the Eulerian closed walk with precedence path constraints problem
H.L.M. Kerivin
,
M. Lacroix
,
A.R. Mahjoub
Theoretical Computer Science
439
, 2012, pp. 16-29
Approximating the number of Double Cut-and-Join scenarios
István Miklós
,
Eric Tannier
Theoretical Computer Science
439
, 2012, pp. 30-40
A fully dynamic algorithm for the recognition of
P_4
-sparse graphs
Stavros D. Nikolopoulos
,
Leonidas Palios
,
Charis Papadopoulos
Theoretical Computer Science
439
, 2012, pp. 41-57
Approximate counting with
m
counters: A detailed analysis
Helmut Prodinger
Theoretical Computer Science
439
, 2012, pp. 58-68
Almost optimal distributed M2M multicasting in wireless mesh networks
Qin Xin
,
Fredrik Manne
,
Yan Zhang
,
Xin Wang
Theoretical Computer Science
439
, 2012, pp. 69-82