default search action
Theoretical Computer Science, Volume 734
Volume 734, July 2018
- Daming Zhu, Sergey Bereg:
Preface. 1-2 - Zihe Chen, Danyang Chen, Xiangyu Wang, Robert J. Damiano, Hui Meng, Jinhui Xu:
Novel geometric approach for virtual coiling. 3-14 - Peng Zou, Hui Li, Wencheng Wang, Chunlin Xin, Binhai Zhu:
Finding disjoint dense clubs in a social network. 15-23 - Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin:
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. 24-31 - Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. 32-37 - Lianrong Pu, Yu Lin, Daming Zhu, Haitao Jiang:
Can a breakpoint graph be decomposed into none other than 2-cycles? 38-45 - Lili Mei, Deshi Ye, Guochuan Zhang:
Mechanism design for one-facility location game with obnoxious effects on a line. 46-57 - Yuzhe Ma, Kun He, John E. Hopcroft, Pan Shi:
Neighbourhood-preserving dimension reduction via localised multidimensional scaling. 58-71 - Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
On the kernelization of split graph problems. 72-82 - Yunlong Liu, Shaokai Wang, Jianxin Wang:
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS. 83-93 - Qilong Feng, Neng Huang, Xiong Jiang, Jianxin Wang:
Dealing with several parameterized problems by random methods. 94-104 - Qilong Feng, Shaohua Li, Zeyang Zhou, Jianxin Wang:
Parameterized algorithms for Edge Biclique and related problems. 105-118 - Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Compressed cliques graphs, clique coverings and positive zero forcing. 119-130 - Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
Approximation algorithms for the scaffolding problem and its generalizations. 131-141
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.