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=447
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Beate Bollig
Theoretical Computer Science
447
, 2012, pp. 2-12
Computing feasible toolpaths for 5-axis machines
Danny Z. Chen
,
Ewa MisioĆšek
Theoretical Computer Science
447
, 2012, pp. 13-25
Pairwise cooperations in selfish ring routing for minimax linear latency
Xujin Chen
,
Xiaodong Hu
,
Weidong Ma
Theoretical Computer Science
447
, 2012, pp. 26-37
Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
Hongwei Du
,
Qiang Ye
,
Jiaofei Zhong
,
Yuexuan Wang
,
Wonjun Lee
,
Haesun Park
Theoretical Computer Science
447
, 2012, pp. 38-43
Extended dynamic subgraph statistics using
h
-index parameterized data structures
David Eppstein
,
Michael T. Goodrich
,
Darren Strash
,
Lowell Trott
Theoretical Computer Science
447
, 2012, pp. 44-52
Robust optimization of graph partitioning involving interval uncertainty
Neng Fan
,
Qipeng P. Zheng
,
Panos M. Pardalos
Theoretical Computer Science
447
, 2012, pp. 53-61
Compact visibility representation of 4-connected plane graphs
Xin He
,
Jiun-Jie Wang
,
Huaming Zhang
Theoretical Computer Science
447
, 2012, pp. 62-73
Finding strong bridges and strong articulation points in linear time
Giuseppe F. Italiano
,
Luigi Laura
,
Federico Santaroni
Theoretical Computer Science
447
, 2012, pp. 74-84
Searching for an axis-parallel shoreline
Elmar Langetepe
Theoretical Computer Science
447
, 2012, pp. 85-99
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
Deying Li
,
Zheng Li
,
Wenkai Ma
,
Hong Chen
,
Wenping Chen
Theoretical Computer Science
447
, 2012, pp. 100-106
New techniques for approximating optimal substructure problems in power-law graphs
Yilin Shen
,
Dung T. Nguyen
,
Ying Xuan
,
My T. Thai
Theoretical Computer Science
447
, 2012, pp. 107-119
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Tomoyuki Yamakami
Theoretical Computer Science
447
, 2012, pp. 120-135
Bases of primitive nonpowerful sign patterns
Guanglong Yu
,
Zhengke Miao
,
Jinlong Shu
Theoretical Computer Science
447
, 2012, pp. 136-143