Skip to main content
SpringerLink
Log in

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Michael Fellows

    1. School of Engineering and Information Technology, Charles Darwin University, Darwin, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xuehou Tan

    1. School of High-Technology for Human Welfare, Tokai University, Numazu, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Binhai Zhu

    1. Department of Computer Science, Montana State University, Bozeman, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

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 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 (35 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures

    1. The Square Root Phenomenon in Planar Graphs

      • Dániel Marx
      Pages 1-1

    2. An Algorithm for Determining Whether a Pair of Polygons Is Reversible

      • Jin Akiyama, Hyunwoo Seong
      Pages 2-3

  3. Contributed Papers

    1. Disjoint Small Cycles in Graphs and Bipartite Graphs

      • Ding Ma, Yunshu Gao
      Pages 4-11

    2. An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree

      • Marcin Krzywkowski
      Pages 12-16

    3. Algorithms for Testing Length Four Permutations

      • Yijie Han, Sanjeev Saxena
      Pages 17-23

    4. Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

      • Pawan Aurora, Sumit Singh, Shashank K. Mehta
      Pages 24-35

    5. Faster Exact Computation of rSPR Distance

      • Zhi-Zhong Chen, Lusheng Wang
      Pages 36-47

    6. Arbitrated Quantum Signature Schemes: Attacks and Security

      • Xiangfu Zou, Daowen Qiu
      Pages 48-59

    7. Randomized Algorithms for Removable Online Knapsack Problems

      • Xin Han, Yasushi Kawase, Kazuhisa Makino
      Pages 60-71

    8. An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

      • Mingyu Xiao, Hiroshi Nagamochi
      Pages 72-83

    9. FWLS: A Local Search for Graph Coloring

      • Wei Wu, Chuan Luo, Kaile Su
      Pages 84-93

    10. A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids

      • Mark Korenblit, Vadim E. Levit
      Pages 94-105

    11. Monomial Testing and Applications

      • Shenshi Chen
      Pages 106-117

    12. The Optimal Rescue Path Set Problem in Undirected Graphs

      • Huili Zhang, Yinfeng Xu
      Pages 118-129

    13. Expected Computations on Color Spanning Sets

      • Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu
      Pages 130-141

    14. Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs

      • Min Lu, Tian Liu, Ke Xu
      Pages 142-152

    15. Spanning Distribution Trees of Graphs

      • Masaki Kawabata, Takao Nishizeki
      Pages 153-162

    16. A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem

      • Jinghao Sun, Yakun Meng, Guozhen Tan
      Pages 163-174

    17. Zero-Visibility Cops and Robber Game on a Graph

      • Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
      Pages 175-186
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
 The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.

Editors and Affiliations

  • School of Engineering and Information Technology, Charles Darwin University, Darwin, Australia

    Michael Fellows

  • School of High-Technology for Human Welfare, Tokai University, Numazu, Japan

    Xuehou Tan

  • Department of Computer Science, Montana State University, Bozeman, USA

    Binhai Zhu

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation