Algorithms and Discrete Applied Mathematics

1. Front Matter

   PDF

2. Probabilistic Arguments in Graph Coloring (Invited Talk)

   • C. R. Subramanian

   Pages 1-8

3. Approximation Algorithms

   1. A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem

      • Santiago V. Ravelo, Carlos E. Ferreira

      Pages 9-20

   2. Constant Approximation for Broadcasting in k-cycle Graph

      • Puspal Bhabak, Hovhannes A. Harutyunyan

      Pages 21-32

4. Computational Geometry

   1. Three Paths to Point Placement

      • Md. Shafiul Alam, Asish Mukhopadhyay

      Pages 33-44

   2. Vertex Guarding in Weak Visibility Polygons

      • Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy

      Pages 45-57

   3. On Collections of Polygons Cuttable with a Segment Saw

      • Adrian Dumitrescu, Anirban Ghosh, Masud Hasan

      Pages 58-68

   4. Rectilinear Path Problems in Restricted Memory Setup

      • Binay K. Bhattacharya, Minati De, Anil Maheswari, Subhas C. Nandy, Sasanka Roy

      Pages 69-80

5. Graph Theory

   1. New Polynomial Case for Efficient Domination in P ₆-free Graphs

      • T. Karthick

      Pages 81-88

   2. Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties

      • Ahmad Biniaz, Anil Maheshwari, Michiel Smid

      Pages 89-100

   3. Separator Theorems for Interval Graphs and Proper Interval Graphs

      • B. S. Panda

      Pages 101-110

   4. Bounds for the b-chromatic Number of Induced Subgraphs and G − e

      • P. Francis, S. Francis Raj

      Pages 111-116

   5. New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs

      • Ashok Kumar Das, Ritapa Chakraborty

      Pages 117-125

   6. On Spectra of Corona Graphs

      • Rohan Sharma, Bibhas Adhikari, Abhishek Mishra

      Pages 126-137

   7. Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs

      • Manoj Changat, Divya Sindhu Lekha, Henry Martyn Mulder, Ajitha R. Subhamathi

      Pages 138-149

   8. Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property

      • N. S. Narayanaswamy, Anju Srinivasan

      Pages 150-156

   9. On a Special Class of Boxicity 2 Graphs

      • Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

      Pages 157-168

   10. Domination in Some Subclasses of Bipartite Graphs

       • Arti Pandey, B. S. Panda

       Pages 169-180

6. Computational Complexity

   1. Parameterized Analogues of Probabilistic Computation

      • Ankit Chauhan, B. V. Raghavendra Rao

      Pages 181-192

   2. Algebraic Expressions of Rhomboidal Graphs

      • Mark Korenblit

      Pages 193-204

This book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity.

• algebraic combinatorics
• approximation algorithms
• combinatorial algorithms
• combinatorial optimization
• computational complexity
• computational geometry
• data structures
• design and analysis of algorithms
• design theory
• discrete geometry
• experimental algorithm methodologies
• graph algorithms
• graph theory
• network optimization
• online algorithms
• parallel and distributed algorithms
• parameterized complexity
• probabilistic combinatorics
• randomized algorithms
• algorithm analysis and problem complexity

• Department of Computer Science and Engineering, I.I.T. Kanpur, India

  Sumit Ganguly

• School of Computing Science, Simon Fraser University, Burnaby, Canada

  Ramesh Krishnamurti

Policies and ethics