Algorithms and Discrete Applied Mathematics

Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings

  • Daya Gaur
  • N.S. Narayanaswamy
Conference proceedings CALDAM 2017

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10156)

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Jessie Abraham, Micheal Arockiaraj
    Pages 1-11
  3. Sayan Bandyapadhyay, Aritra Banik
    Pages 12-23
  4. Subhash Bhagat, Krishnendu Mukhopadhyaya
    Pages 37-49
  5. Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman
    Pages 50-59
  6. Ulrik Brandes, Moritz Heine, Julian Müller, Mark Ortmann
    Pages 60-71
  7. Vladimir Braverman, Harry Lang, Keith Levin
    Pages 72-82
  8. Farah Chanchary, Anil Maheshwari, Michiel Smid
    Pages 83-95
  9. Manoj Changat, Ferdoos Hossein Nezhad, Narayanan Narayanan
    Pages 96-106
  10. Ante Ćustić, Ehsan Iranmanesh, Ramesh Krishnamurti
    Pages 107-117
  11. Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
    Pages 118-129
  12. Sandip Das, Soumen Nandi, Sagnik Sen
    Pages 130-140
  13. Sandip Das, Ayan Nandy, Swami Sarvottamananda
    Pages 141-155
  14. Ajit Arvind Diwan, Bodhayan Roy
    Pages 156-165
  15. Arpana Garg, Sucheta Dutt
    Pages 177-186
  16. Aloysius Godinho, T. Singh
    Pages 187-192
  17. Hovhannes A. Harutyunyan, Zhiyuan Li
    Pages 193-204
  18. R. Inkulu, Nitish P. Thakur
    Pages 205-218

About these proceedings


This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017.
The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry. 


Computer Science clustering colored mixed graphs comparability embedding graph algorithm minimal degree polynomial NP-complete optimal set sort stability number streaming algorithms subgraph topological traveling salesman problem

Editors and affiliations

  • Daya Gaur
    • 1
  • N.S. Narayanaswamy
    • 2
  1. 1.University of LethbridgeLethbridgeCanada
  2. 2.Indian Institute of Technology MadrasChennaiIndia

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-53006-2
  • Online ISBN 978-3-319-53007-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book