default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 447
Volume 447, August 2012
- Weili Wu, Ovidiu Daescu:
Preface. 1
- Beate Bollig:
On symbolic OBDD-based algorithms for the minimum spanning tree problem. 2-12 - Danny Z. Chen, Ewa Misiolek:
Computing feasible toolpaths for 5-axis machines. 13-25 - Xujin Chen, Xiaodong Hu, Weidong Ma:
Pairwise cooperations in selfish ring routing for minimax linear latency. 26-37 - Hongwei Du, Qiang Ye
, Jiaofei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park:
Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks. 38-43 - David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended dynamic subgraph statistics using h-index parameterized data structures. 44-52 - Neng Fan, Qipeng P. Zheng, Panos M. Pardalos:
Robust optimization of graph partitioning involving interval uncertainty. 53-61 - Xin He, Jiun-Jie Wang, Huaming Zhang:
Compact visibility representation of 4-connected plane graphs. 62-73 - Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Finding strong bridges and strong articulation points in linear time. 74-84 - Elmar Langetepe:
Searching for an axis-parallel shoreline. 85-99 - Deying Li, Zheng Li, Wenkai Ma, Hong Chen, Wenping Chen:
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks. 100-106 - Yilin Shen, Dung T. Nguyen, Ying Xuan, My T. Thai:
New techniques for approximating optimal substructure problems in power-law graphs. 107-119 - Tomoyuki Yamakami:
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs. 120-135 - Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of primitive nonpowerful sign patterns. 136-143
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
