Skip to main content
SpringerLink
Log in

WALCOM: Algorithms and Computation

4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Md. Saidur Rahman

    1. Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Satoshi Fujita

    1. Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Higashi-Hiroshima, Japan

    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 5942)

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

Included in the following conference series:

Conference proceedings info: WALCOM 2010.

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

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Crossings between Curves with Many Tangencies

      • Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi
      Pages 1-8

    2. Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon

      • Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
      Pages 9-20

    3. Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

      • Subir Kumar Ghosh
      Pages 21-34

    4. The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing

      • Emilio Di Giacomo, Giuseppe Liotta
      Pages 35-46

  3. Graph Drawing

    1. Small Grid Drawings of Planar Graphs with Balanced Bipartition

      • Xiao Zhou, Takashi Hikino, Takao Nishizeki
      Pages 47-57

    2. Switch-Regular Upward Planar Embeddings of Trees

      • Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin
      Pages 58-69

    3. A Global k-Level Crossing Reduction Algorithm

      • Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Ferdinand Hübner
      Pages 70-81

  4. Computational Geometry

    1. Computation of Non-dominated Points Using Compact Voronoi Diagrams

      • Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
      Pages 82-93

    2. Cutting a Convex Polyhedron Out of a Sphere

      • Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam
      Pages 94-101

    3. A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion

      • Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
      Pages 102-112

  5. Graph Algorithms I

    1. Acyclically 3-Colorable Planar Graphs

      • Patrizio Angelini, Fabrizio Frati
      Pages 113-124

    2. Reconstruction Algorithm for Permutation Graphs

      • Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
      Pages 125-135

    3. Harmonious Coloring on Subclasses of Colinear Graphs

      • Kyriaki Ioannidou, Stavros D. Nikolopoulos
      Pages 136-148

  6. Computational Biology and Strings

    1. Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions

      • Guillaume Blin, Sylvie Hamel, Stéphane Vialette
      Pages 149-160

    2. The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time

      • Jesun S. Firoz, Masud Hasan, Ashik Z. Khan, M. Sohel Rahman
      Pages 161-166

    3. Parallel Algorithms for Encoding and Decoding Blob Code

      • Saverio Caminiti, Rossella Petreschi
      Pages 167-178

  7. Combinatorial Optimization

    1. A Rooted-Forest Partition with Uniform Vertex Demand

      • Naoki Katoh, Shin-ichi Tanigawa
      Pages 179-190

    2. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

      • Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki
      Pages 191-203

  8. Graph Algorithms II

    1. On Some Simple Widths

      • Ling-Ju Hung, Ton Kloks
      Pages 204-215
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Keywords

Editors and Affiliations

  • Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh

    Md. Saidur Rahman

  • Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Higashi-Hiroshima, Japan

    Satoshi Fujita

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation