Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Discrete Applied Mathematics

Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Sathish Govindarajan

    1. Indian Institute of Science, Bangalore, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Anil Maheshwari

    1. Carleton University, Ottawa, 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 9602)

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

Included in the following conference series:

Conference proceedings info: CALDAM 2016.

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 EPUB and 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 (31 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Randomization for Efficient Dynamic Graph Algorithms

    • Surender Baswana
    Pages 1-13

  3. Algorithms for Problems on Maximum Density Segment

    • Md. Shafiul Alam, Asish Mukhopadhyay
    Pages 14-25

  4. Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs

    • Fouzul Atik, Pratima Panigrahi
    Pages 26-36

  5. Color Spanning Objects: Algorithms and Hardness Results

    • Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
    Pages 37-48

  6. On Hamiltonian Colorings of Trees

    • Devsi Bantva
    Pages 49-60

  7. On the Complexity Landscape of the Domination Chain

    • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
    Pages 61-72

  8. On the Probability of Being Synchronizable

    • Mikhail V. Berlinkov
    Pages 73-84

  9. Linear-Time Fitting of a k-Step Function

    • Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
    Pages 85-96

  10. Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications

    • Olivier Bodini, Julien David, Philippe Marchal
    Pages 97-114

  11. Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions

    • Manoj Changat, Ferdoos Hossein Nezhad, Narayanan Narayanan
    Pages 115-125

  12. Linear Time Algorithms for Euclidean 1-Center in \(\mathfrak {R}^d\) with Non-linear Convex Constraints

    • Sandip Das, Ayan Nandy, Swami Sarvottamananda
    Pages 126-138

  13. Lower Bounds on the Dilation of Plane Spanners

    • Adrian Dumitrescu, Anirban Ghosh
    Pages 139-151

  14. Lattice Spanners of Low Degree

    • Adrian Dumitrescu, Anirban Ghosh
    Pages 152-163

  15. AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables

    • Pavel Emelyanov
    Pages 164-175

  16. Approximation Algorithms for Cumulative VRP with Stochastic Demands

    • Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
    Pages 176-189

  17. Some Distance Antimagic Labeled Graphs

    • Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh
    Pages 190-200

  18. A New Construction of Broadcast Graphs

    • Hovhannes A. Harutyunyan, Zhiyuan Li
    Pages 201-211

  19. Improved Algorithm for Maximum Independent Set on Unit Disk Graph

    • Ramesh K. Jallu, Guatam K. Das
    Pages 212-223

  20. Independent Sets in Classes Related to Chair-Free Graphs

    • T. Karthick
    Pages 224-232
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

This book collects the refereed proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016. The volume contains 30 full revised papers from 90 submissions along with 1 invited talk presented at the conference. The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental) and the mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.

Editors and Affiliations

  • Indian Institute of Science, Bangalore, India

    Sathish Govindarajan

  • Carleton University, Ottawa, Canada

    Anil Maheshwari

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation