default search action
Theoretical Computer Science, Volume 508
Volume 508, October 2013
- Binhai Zhu, Jun Luo:
Preface. 1
- Mingyu Xiao, Hiroshi Nagamochi:
Parameterized edge dominating set in graphs with degree bounded by 3. 2-15 - Jianxin Wang, Weizhong Luo, Qilong Feng, Jiong Guo:
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks. 16-25 - Huaming Zhang, Swetha Govindaiah:
Greedy routing via embedding graphs onto semi-metric spaces. 26-34 - Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D knapsack: Packing squares. 35-40 - Danny Z. Chen, Ewa Misiolek:
Algorithms for interval structures with applications. 41-53 - Martin Birks, Stanley P. Y. Fung:
Temperature aware online algorithms for scheduling equal length jobs. 54-65 - Xuehou Tan, Gangshan Wu:
Approximation algorithms for cutting a convex polyhedron out of a sphere. 66-73 - Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das:
Minimum-width rectangular annulus. 74-80
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.