Frontiers in Algorithmics

1. Front Matter

   Pages I-X

   PDF

2. On the Complexity of Minimizing the Total Calibration Cost

   • Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos

   Pages 1-12

3. On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model

   • Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu

   Pages 13-21

4. The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments

   • Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti

   Pages 22-33

5. On Computational Aspects of Greedy Partitioning of Graphs

   • Piotr Borowiecki

   Pages 34-46

6. Maximum Edge Bicliques in Tree Convex Bipartite Graphs

   • Hao Chen, Tian Liu

   Pages 47-55

7. Complete Submodularity Characterization in the Comparative Independent Cascade Model

   • Wei Chen, Hanrui Zhang

   Pages 56-67

8. A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate

   • Xiaoli Chen, Weijun Xu

   Pages 68-78

9. Designing and Implementing Algorithms for the Closest String Problem

   • Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang

   Pages 79-90

10. The Broken-Triangle Property with Adjoint Values

    • Jian Gao, Rong Chen, Minghao Yin, Hui Li

    Pages 91-102

11. Online Knapsack Problem Under Concave Functions

    • Xin Han, Ning Ma, Kazuhisa Makino, He Chen

    Pages 103-114

12. Fluctuated Fitting Under the \(\ell _1\)-metric

    • Kai Jin

    Pages 115-126

13. Optimal Partitioning Which Maximizes the Weighted Sum of Products

    • Kai Jin

    Pages 127-138

14. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity

    • Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

    Pages 139-150

15. Online Strategies for Evacuating from a Convex Region in the Plane

    • Songhua Li, Yinfeng Xu

    Pages 151-162

16. A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism

    • Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang

    Pages 163-174

17. A 42k Kernel for the Complementary Maximal Strip Recovery Problem

    • Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang

    Pages 175-186

18. On-line Scheduling with a Monotonous Subsequence Constraint

    • Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo

    Pages 187-195

19. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling

    • Jingjing Ma, Haitao Jiang, Daming Zhu, Shu Zhang

    Pages 196-208

20. FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters

    • Diptapriyo Majumdar, Venkatesh Raman

    Pages 209-220

This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017.
The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

• graph theory
• approximation algorithms
• problem solving
• approximation theory
• optimal systems
• competitive ratio
• graph theory
• vertex set
• probabilistic computation
• proof complexity
• graph algorithms analysis
• mathematical optimization
• online algorithms
• parameterized complexity
• exact algorithms
• algorithmic game theory
• algorithm analysis and problem complexity
• data structures

• University of Electronic Science and Technology of China, Chengdu, China

  Mingyu Xiao

• University of Bergen, Bergen, Norway

  Frances Rosamond

Policies and ethics