Algorithms and Discrete Applied Mathematics

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

  • Sumit Ganguly
  • Ramesh Krishnamurti

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

Table of contents

  1. Front Matter
  2. Approximation Algorithms

    1. Puspal Bhabak, Hovhannes A. Harutyunyan
      Pages 21-32
  3. Computational Geometry

    1. Md. Shafiul Alam, Asish Mukhopadhyay
      Pages 33-44
    2. Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy
      Pages 45-57
    3. Adrian Dumitrescu, Anirban Ghosh, Masud Hasan
      Pages 58-68
    4. Binay K. Bhattacharya, Minati De, Anil Maheswari, Subhas C. Nandy, Sasanka Roy
      Pages 69-80
  4. Graph Theory

    1. Ahmad Biniaz, Anil Maheshwari, Michiel Smid
      Pages 89-100
    2. Rohan Sharma, Bibhas Adhikari, Abhishek Mishra
      Pages 126-137
    3. Manoj Changat, Divya Sindhu Lekha, Henry Martyn Mulder, Ajitha R. Subhamathi
      Pages 138-149
    4. Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
      Pages 157-168
    5. Arti Pandey, B. S. Panda
      Pages 169-180
  5. Computational Complexity

    1. Ankit Chauhan, B. V. Raghavendra Rao
      Pages 181-192
    2. Mark Korenblit
      Pages 193-204

About these proceedings

Introduction

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.

Keywords

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

Editors and affiliations

  • Sumit Ganguly
    • 1
  • Ramesh Krishnamurti
    • 2
  1. 1.Department of Computer Science and EngineeringI.I.T. KanpurIndia
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnabyCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-14974-5
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-14973-8
  • Online ISBN 978-3-319-14974-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Energy, Utilities & Environment
Biotechnology