default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. FAW 2016: Qingdao, China
- Daming Zhu, Sergey Bereg:
Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings. Lecture Notes in Computer Science 9711, Springer 2016, ISBN 978-3-319-39816-7 - Thomas Erlebach:
Algorithms for Queryable Uncertainty. 1-7 - Binhai Zhu:
Genomic Scaffold Filling: A Progress Report. 8-16 - Zhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang:
Better Approximation Algorithms for Scaffolding Problems. 17-28 - Zihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, Hui Meng, Jinhui Xu:
How to Block Blood Flow by Using Elastic Coil. 29-40 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. 41-52 - Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Positive Zero Forcing and Edge Clique Coverings. 53-64 - Qilong Feng, Xiong Jiang, Jianxin Wang:
Improved Algorithms for Several Parameterized Problems Based on Random Methods. 65-74 - Qilong Feng, Zeyang Zhou, Jianxin Wang:
Parameterized Algorithms for Maximum Edge Biclique and Related Problems. 75-83 - He Hong, Cao Boyan:
The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model. 84-91 - Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. 92-101 - Tian Liu:
Fractional Edge Cover Number of Model RB. 102-110 - Yanli Liu, Chumin Li, Kun He, Yi Fan:
Breaking Cycle Structure to Improve Lower Bound for Max-SAT. 111-124 - Yunlong Liu, Jianxin Wang:
On Counting Parameterized Matching and Packing. 125-134 - Kelin Luo
, Yin-Feng Xu, Xin Feng:
Online Scheduling with Increasing Subsequence Serving Constraint. 135-144 - Jingjing Ma, Haitao Jiang:
Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling. 145-157 - Yuzhe Ma, Kun He, John E. Hopcroft, Pan Shi:
Nonlinear Dimension Reduction by Local Multidimensional Scaling. 158-171 - Lili Mei, Deshi Ye, Guochuan Zhang:
Mechanism Design for One-Facility Location Game with Obnoxious Effects. 172-182 - Li Ning, Zhongying Zhao, Rong Zhou, Yong Zhang, Shengzhong Feng:
Realtime Channel Recommendation: Switch Smartly While Watching TV. 183-193 - Wei Peng, Dongxia Wang, Xinwen Jiang:
Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One. 194-204 - Lianrong Pu, Haitao Jiang:
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? 205-214 - Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. 215-226 - Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin:
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. 227-237 - Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo:
Kernelization of Two Path Searching Problems on Split Graphs. 238-249 - Hongluan Zhao, Guoyong Han, Gongwen Xu:
The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs. 250-256 - Cheng Zhong, Jing Zhang, Bei Hua, Feng Yang, Zhengping Liu:
Parallel Identifying (l, d)-Motifs in Biosequences Using CPU and GPU Computing. 257-268 - Guangyan Zhou:
On the Lower Bounds of Random Max 3 and 4-SAT. 269-278 - Peng Zou, Hui Li, Chunlin Xin, Wencheng Wang, Binhai Zhu:
Finding Disjoint Dense Clubs in an Undirected Graph. 279-288
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 2024-09-19 23:31 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:
