default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 607
Volumes 607, Part 1, November 2015
- Qian-Ping Gu, Pavol Hell, Boting Yang:
Preface. 1
- Yuya Higashikawa, Mordecai J. Golin
, Naoki Katoh:
Multiple sink location problems in dynamic path networks. 2-15 - Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. 16-34 - Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou:
Competitive algorithms for unbounded one-way trading. 35-48 - Leizhen Cai, Junjie Ye:
Parameterized complexity of finding connected induced subgraphs. 49-59 - Chengwei Guo, Leizhen Cai:
Obtaining split graphs by edge contraction. 60-67 - Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Yue-Li Wang:
Edge-clique covers of the tensor product. 68-74 - Taibo Luo, Yin-Feng Xu:
Semi-online hierarchical load balancing problem with bounded processing times. 75-82 - Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. 83-95 - Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme. 96-112 - Tamal T. Biswas, Kenneth W. Regan:
Approximation of function evaluation over sequence arguments via specialized data structures. 113-123
Volumes 607, Part 2, November 2015
- Jianer Chen, John E. Hopcroft:
Frontiers of Algorithmics. 125
- Danny Z. Chen, David Craft, Lin Yang:
A circular matrix-merging algorithm with application in Volumetric Intensity-Modulated Arc Therapy. 126-134 - Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
The complexity of zero-visibility cops and robber. 135-148 - Md. Iqbal Hossain, Md. Saidur Rahman:
Good spanning trees in graph drawing. 149-165 - Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations. 166-180 - Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Penalty cost constrained identical parallel machine scheduling problem. 181-192 - Ling Lin, Xiaochen Xian, Yujie Yan, Xing He, Zhiyi Tan:
Inefficiency of equilibria for scheduling game with machine activation costs. 193-207 - Yuji Obata, Takao Nishizeki:
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs. 208-220 - Yangguang Shi, Fa Zhang, Jie Wu, Zhiyong Liu:
Randomized oblivious integral routing for minimizing power cost. 221-246 - Hing-Fung Ting, Xiangzhong Xiang:
Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching. 247-256 - Jie You, Jianxin Wang, Qilong Feng, Feng Shi:
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. 257-270
Volumes 607, Part 3, November 2015
- Zhao Zhang, Lidong Wu, Ding-Zhu Du:
Preface. 271
- Sicen Guo, Minming Li, Yingchao Zhao:
Optimal trees for minimizing average individual updating cost. 272-281 - Iyad A. Kanj, Stefan Szeider:
Parameterized and subexponential-time complexity of satisfiability problems and applications. 282-295 - Jianjie Zhou, Liying Kang, Erfang Shan:
Two paths location of a tree with positive or negative weights. 296-305 - Jungtaek Seo, Subhankar Mishra, Xiang Li, My T. Thai:
Catastrophic cascading failures in power networks. 306-319 - Yi-Jun Chang, Hsu-Chun Yen:
Constrained floorplans in 2D and 3D. 320-336 - Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally bracing grid frameworks with holes. 337-350 - Bogdan Armaselu, Ovidiu Daescu:
Algorithms for fair partitioning of convex polygons. 351-362 - Xiaofeng Gao, Jun Li, Guihai Chen:
A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks. 363-380 - Zaobo He, Zhipeng Cai, Siyao Cheng, Xiaoming Wang:
Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. 381-390 - Zhenhua Duan, Jin Liu, Jie Li, Cong Tian:
Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts. 391-410 - Binay K. Bhattacharya, Tsunehiko Kameda:
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. 411-425 - Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the parameterized complexity of dynamic problems. 426-434 - Bjørn Kjos-Hanssen:
Kolmogorov structure functions for automatic complexity. 435-445 - Lin Chen, Deshi Ye, Guochuan Zhang:
An asymptotic competitive scheme for online bin packing. 446-454 - Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Improved parameterized and exact algorithms for cut problems on trees. 455-470 - Liang Song, Haibin Chen, Hao Gu, Hejiao Huang, Hongwei Du:
Set covering in fuel-considered vehicle routing problems. 471-479 - Xueliang Li, Meiqin Wei, Jun Yue:
Proper connection number and connected dominating sets. 480-487
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-06-23 21:03 CEST 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:
