Skip to main content
SpringerLink
Log in
Book cover

WALCOM: Algorithm and Computation

6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Md. Saidur Rahman

    1. Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Bangladesh

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Shin-ichi Nakano

    1. , Faculty of Engineering, Department of Computer Science, Gunma University, Kiryu-Shi, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up to date results
  • State of the art research
  • Fast-track conference proceedings

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

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

Included in the following conference series:

Conference proceedings info: WALCOM 2012.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.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

    Download chapter PDF

  3. Graph Algorithms I

    1. Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression

      • Takeaki Uno, Ryuhei Uehara, Shin-ichi Nakano
      Pages 5-16

    2. Generalized Above Guarantee Vertex Cover and r-Partization

      • R. Krithika, N. S. Narayanaswamy
      Pages 17-27

  4. Computational Geometry

    1. Farthest Voronoi Diagrams under Travel Time Metrics

      • Sang Won Bae, Kyung-Yong Chwa
      Pages 28-39

    2. Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments

      • Sang Won Bae
      Pages 40-51

    3. Range Aggregate Maximal Points in the Plane

      • Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli
      Pages 52-63

  5. Approximation Algorithms

    1. Approximating the Multi-level Bottleneck Assignment Problem

      • Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
      Pages 64-75

    2. Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion

      • Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
      Pages 76-87

    3. Comparing and Aggregating Partial Orders with Kendall Tau Distances

      • Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier
      Pages 88-99

  6. Graph Algorithms II

    1. On the Round-Trip 1-Center and 1-Median Problems

      • Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen
      Pages 100-111

    2. Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs

      • Sammi Abida Salma, Md. Saidur Rahman
      Pages 112-123

    3. On Relaxing the Constraints in Pairwise Compatibility Graphs

      • Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
      Pages 124-135

  7. Graph Drawing I

    1. Universal Line-Sets for Drawing Planar 3-Trees

      • Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman, Sammi Abida Salma
      Pages 136-147

    2. On the Hardness of Point-Set Embeddability

      • Stephane Durocher, Debajyoti Mondal
      Pages 148-159

  8. String and Data Structures

    1. Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet

      • Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz
      Pages 160-172

    2. Fat Heaps without Regular Counters

      • Amr Elmasry, Jyrki Katajainen
      Pages 173-185

  9. Graph Drawing II

    1. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles

      • Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff
      Pages 186-197
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Computation, WALCOM 2012, held in Dhaka, Bangladesh, in February 2012. The 20 full papers presented together with 3 invited papers were carefully reviewed and selected from 50 submissions. The papers are grouped in topical sections on graph algorithms; computational geometry; approximation algorithms; graph drawing; string and data structures; and games and cryptography.

Editors and Affiliations

  • Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Bangladesh

    Md. Saidur Rahman

  • , Faculty of Engineering, Department of Computer Science, Gunma University, Kiryu-Shi, Japan

    Shin-ichi Nakano

Bibliographic Information

  • Book Title: WALCOM: Algorithm and Computation

  • Book Subtitle: 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings

  • Editors: Md. Saidur Rahman, Shin-ichi Nakano

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-642-28076-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag GmbH Berlin Heidelberg 2012

  • Softcover ISBN: 978-3-642-28075-7Published: 25 January 2012

  • eBook ISBN: 978-3-642-28076-4Published: 27 February 2012

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XV, 241

  • Number of Illustrations: 67 b/w illustrations

  • Topics: Computer Science, general

Publish with us

Policies and ethics

Back to top

Search

Navigation