Skip to main content
SpringerLink
Log in
Book cover

Frontiers in Algorithmics

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Jianer Chen

    1. Texas A&M University, College Station, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pinyan Lu

    1. Shanghai University of Finance and Economics, Shanghai, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: FAW 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Graph Algorithms

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Two Kinds of Generalized 3-Connectivities of Alternating Group Networks

      • Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu
      Pages 3-14

    3. On the Longest Spanning Tree with Neighborhoods

      • Ke Chen, Adrian Dumitrescu
      Pages 15-28

    4. Efficient Algorithms for a Graph Partitioning Problem

      • S. Vaishali, M. S. Atulya, Nidhi Purohit
      Pages 29-42

    5. On the Minmax Regret Path Center Problem on Trees

      • Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li
      Pages 43-53

    6. A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees

      • Koki Takayama, Yusuke Kobayashi
      Pages 54-67

    7. The Maximum Distance-d Independent Set Problem on Unit Disk Graphs

      • Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
      Pages 68-80

    8. New Approximation Algorithms for the Minimum Cycle Cover Problem

      • Wei Yu, Zhaohui Liu, Xiaoguang Bao
      Pages 81-95

  3. Parameterized Algorithms

    1. Front Matter

      Pages 97-97
      Download chapter PDF

    2. Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

      • Jie You, Jianxin Wang, Qilong Feng
      Pages 99-111

    3. Guarding Polyhedral Terrain by k-Watchtowers

      • Nitesh Tripathi, Manjish Pal, Minati De, Gautam Das, Subhas C. Nandy
      Pages 112-125

    4. Some (in)tractable Parameterizations of Coloring and List-Coloring

      • Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
      Pages 126-139

    5. Kernelization for \(P_2\)-Packing: A Gerrymandering Approach

      • Wenjun Li, Junjie Ye, Yixin Cao
      Pages 140-153

    6. Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems

      • M. R. Rani, Mohith Jagalmohanan, R. Subashini
      Pages 154-168

    7. Improved Kernels for Several Problems on Planar Graphs

      • Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang
      Pages 169-180

  4. Other Algorithms

    1. Front Matter

      Pages 181-181
      Download chapter PDF

    2. On Bayesian Epistemology of Myerson Auction

      • Xiaotie Deng, Keyu Zhu
      Pages 183-196

    3. Low-Weight Superimposed Codes and Their Applications

      • Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
      Pages 197-211

    4. Single Vehicle’s Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time

      • Songhua Li, Yinfeng Xu
      Pages 212-223
Back to top

Other volumes

  1. Frontiers in Algorithmics

Keywords

About this book

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.

Editors and Affiliations

  • Texas A&M University, College Station, USA

    Jianer Chen

  • Shanghai University of Finance and Economics, Shanghai, China

    Pinyan Lu

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation