


default search action
9. FAW 2015: Guilin, China
- Jianxin Wang, Chee-Keng Yap:

Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings. Lecture Notes in Computer Science 9130, Springer 2015, ISBN 978-3-319-19646-6
Invited Talks
- Fedor V. Fomin

, Saket Saurabh, Neeldhara Misra:
Graph Modification Problems: A Modern Perspective. 3-6 - Chee-Keng Yap:

Soft Subdivision Search in Motion Planning, II: Axiomatics. 7-22
Contributed Papers
- Toshihiro Akagi, Shin-Ichi Nakano:

On r-Gatherings on the Line. 25-32 - Jie Cheng, Daming Zhu, Binhai Zhu:

A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow. 33-44 - Martin Fürer

:
Efficient Computation of the Characteristic Polynomial of a Threshold Graph. 45-51 - Cunjing Ge, Feifei Ma:

A Fast and Practical Method to Estimate Volumes of Convex Polytopes. 52-65 - Chengwei Guo, Chenglong Ma, Shengyu Zhang:

Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine. 66-77 - Yusupjan Habibulla, Jin Hua Zhao, Hai-Jun Zhou:

The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation. 78-88 - Yijie Han:

A Linear Time Algorithm for Ordered Partition. 89-103 - Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong

, Randy Goebel, Yinfeng Xu, Guohui Lin:
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. 104-114 - Ping Huang, Kaile Su

:
Lower and Upper Bounds for Random Mimimum Satisfiability Problem. 115-124 - Gábor Ivanyos

, Miklos Santha:
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. 125-137 - Daniel Karapetyan

, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. 138-149 - Christian Komusiewicz, Andreea Radulescu:

On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. 150-161 - Gaidi Li, Dachuan Xu

, Donglei Du
, Chenchen Wu:
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties. 162-169 - Wenjun Li, Shuai Hu:

Smaller Kernels for Several FPT Problems Based on Simple Observations. 170-179 - Mugang Lin

, Wenjun Li, Qilong Feng:
Parameterized Minimum Cost Partition of a Tree with Supply and Demand. 180-189 - Henan Liu, Yinfeng Xu:

The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension. 190-197 - Tian Liu, Ke Xu:

Union Closed Tree Convex Sets. 198-203 - Yang Liu, Shengyu Zhang:

Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores. 204-216 - Photchchara Pisantechakool

, Xuehou Tan:
A New Distributed Algorithm for Computing a Dominating Set on Grids. 217-228 - Jinyan Wang, Minghao Yin

, Jingli Wu:
Approximate Model Counting via Extension Rule. 229-240 - Maoning Wang, Mingjie Liu:

Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory. 241-258 - Youshi Wang, Fa Zhang, Zhiyong Liu:

Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response. 259-270 - Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu:

Local Search to Approximate Max NAE- k k -Sat Tightly. 271-281 - Mingyu Xiao, Shaowei Kou:

Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. 282-293 - Katsuhisa Yamanaka, Shin-Ichi Nakano:

Enumeration, Counting, and Random Generation of Ladder Lotteries. 294-303 - Haibo Yu, Guoqiang Bai, Huikang Hao:

Efficient Modular Reduction Algorithm Without Correction Phase. 304-313 - Peng Zhang, Yong Gao:

Super Solutions of Random Instances of Satisfiability. 314-325 - Fengquan Zhou, Xin Song, Yinghua Han, Jing Gao:

A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application. 326-333

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














