Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Discrete Applied Mathematics

First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Sumit Ganguly

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ramesh Krishnamurti

    1. School of Computing Science, Simon Fraser University, Burnaby, Canada

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

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

Included in the following conference series:

Conference proceedings info: CALDAM 2015.

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. 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 6-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
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

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.

Editors and Affiliations

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

    Sumit Ganguly

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

    Ramesh Krishnamurti

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation