WALCOM: Algorithms and Computation

7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings

Editors:

ISBN: 978-3-642-36064-0 (Print) 978-3-642-36065-7 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-3

      Mobility and Computations: Some Open Research Directions

    2. No Access

      Book Chapter

      Pages 4-4

      Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries

  3. Computational Geometry

    1. No Access

      Book Chapter

      Pages 5-16

      A Novel Efficient Approach for Solving the Art Gallery Problem

    2. No Access

      Book Chapter

      Pages 17-28

      Fixed-Orientation Equilateral Triangle Matching of Point Sets

    3. No Access

      Book Chapter

      Pages 29-40

      Online Exploration and Triangulation in Orthogonal Polygonal Regions

    4. No Access

      Book Chapter

      Pages 41-52

      A Competitive Strategy for Distance-Aware Online Shape Allocation

    5. No Access

      Book Chapter

      Pages 53-64

      Base Location Problems for Base-Monotone Regions

    6. No Access

      Book Chapter

      Pages 65-76

      Counting Maximal Points in a Query Orthogonal Rectangle

    7. No Access

      Book Chapter

      Pages 77-88

      Voronoi Game on Graphs

  4. Approximation and Randomized Algorithms

    1. No Access

      Book Chapter

      Pages 89-100

      Approximation Schemes for Covering and Packing

    2. No Access

      Book Chapter

      Pages 101-113

      A Randomised Approximation Algorithm for the Hitting Set Problem

    3. No Access

      Book Chapter

      Pages 114-125

      Exact and Approximation Algorithms for Densest k-Subgraph

    4. No Access

      Book Chapter

      Pages 126-136

      Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs

    5. No Access

      Book Chapter

      Pages 137-145

      Approximation Algorithms for the Partition Vertex Cover Problem

  5. Parallel and Distributed Computing

    1. No Access

      Book Chapter

      Pages 146-157

      Daemon Conversions in Distributed Self-stabilizing Algorithms

    2. No Access

      Book Chapter

      Pages 158-169

      Broadcasting in Conflict-Aware Multi-channel Networks

    3. No Access

      Book Chapter

      Pages 170-181

      Shared-Memory Parallel Frontier-Based Search

  6. Graph Algorithms

    1. No Access

      Book Chapter

      Pages 182-193

      Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching

    2. No Access

      Book Chapter

      Pages 194-205

      Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs

    3. No Access

      Book Chapter

      Pages 206-216

      Alliances and Bisection Width for Planar Graphs

previous Page of 2