Advertisement

Frontiers in Algorithmics

12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings

  • Jianer Chen
  • Pinyan Lu
Conference proceedings FAW 2018

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10823)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10823)

Table of contents

  1. Front Matter
    Pages I-X
  2. Graph Algorithms

    1. Front Matter
      Pages 1-1
    2. Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu
      Pages 3-14
    3. Ke Chen, Adrian Dumitrescu
      Pages 15-28
    4. S. Vaishali, M. S. Atulya, Nidhi Purohit
      Pages 29-42
    5. Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li
      Pages 43-53
    6. Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
      Pages 68-80
    7. Wei Yu, Zhaohui Liu, Xiaoguang Bao
      Pages 81-95
  3. Parameterized Algorithms

    1. Front Matter
      Pages 97-97
    2. Nitesh Tripathi, Manjish Pal, Minati De, Gautam Das, Subhas C. Nandy
      Pages 112-125
    3. Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
      Pages 126-139
    4. Wenjun Li, Junjie Ye, Yixin Cao
      Pages 140-153
    5. Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang
      Pages 169-180
  4. Other Algorithms

    1. Front Matter
      Pages 181-181
    2. Xiaotie Deng, Keyu Zhu
      Pages 183-196
    3. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
      Pages 197-211
    4. Gaoang Liu, Xiuying Liu
      Pages 224-237
    5. Sundar Annamalai, N. S. Narayanaswamy
      Pages 251-262
    6. Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi et al.
      Pages 263-272
    7. P. Wojciechowski, K. Subramani, Matthew Williamson
      Pages 300-314
  5. Back Matter
    Pages 315-316

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.
The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions. The papers of this workshop provide a focused forum on current trends of research on algorithms, discrete structures, and their applications.

Keywords

Algorithms Approximation polynomial time FPT Hardness Graphs problem solving graph theory approximation algorithms heuristic methods computer architecture

Editors and affiliations

  • Jianer Chen
    • 1
  • Pinyan Lu
    • 2
  1. 1.Texas A&M UniversityCollege StationUSA
  2. 2.Shanghai University of Finance and EconomicsShanghaiChina

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-78455-7
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-78454-0
  • Online ISBN 978-3-319-78455-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site