Algorithms and Discrete Applied Mathematics

4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings

  • B.S. Panda
  • Partha P. Goswami
Conference proceedings CALDAM 2018

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

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

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Ashok Kumar Das, Rajkamal Sahu
    Pages 15-29
  3. Pazhaniappan Renjith, Narasimhan Sadagopan
    Pages 30-44
  4. Bugra Caskurlu, Matthew Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski
    Pages 45-58
  5. Bodo Manthey, Victor M. J. J. Reijnders
    Pages 59-72
  6. P. Francis, S. Francis Raj, M. Gokulnath
    Pages 73-80
  7. Manjanna Basappa
    Pages 81-92
  8. Aritra Banik, Pratibha Choudhary
    Pages 93-104
  9. Subrahmanyam Kalyanasundaram, Kenneth W. Regan
    Pages 105-117
  10. Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy
    Pages 131-142
  11. Bijo S. Anand, Manoj Changat, S. V. Ullas Chandran
    Pages 143-154
  12. Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma kant Sahoo, Sagnik Sen
    Pages 155-163
  13. Myroslav Kryven, Alexander Ravsky, Alexander Wolff
    Pages 164-178
  14. Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
    Pages 188-198
  15. Farah Chanchary, Anil Maheshwari, Michiel Smid
    Pages 199-213
  16. Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr
    Pages 214-220
  17. Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
    Pages 221-234

About these proceedings

Introduction

This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018.

The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.

Keywords

approximation algorithms combinatorial algorithms computational geometry computer science directed graphs graph algorithms graph g graph theory graph methods randomized algorithms

Editors and affiliations

  • B.S. Panda
    • 1
  • Partha P. Goswami
    • 2
  1. 1.Indian Institute of Technology DelhiNew DelhiIndia
  2. 2.University of CalcuttaKolkataIndia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-74180-2
  • Copyright Information Springer International Publishing AG 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-74179-6
  • Online ISBN 978-3-319-74180-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering