Skip to main content
SpringerLink
Log in

Algorithms and Discrete Applied Mathematics

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. B.S. Panda

    1. Indian Institute of Technology Delhi, New Delhi, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Partha P. Goswami

    1. University of Calcutta, Kolkata, India

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

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

Included in the following conference series:

Conference proceedings info: CALDAM 2018.

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 (24 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter PDF

  2. Efficient Domination and Efficient Edge Domination: A Brief Survey

    • Andreas Brandstädt
    Pages 1-14

  3. Mixed Unit Interval Bigraphs

    • Ashok Kumar Das, Rajkamal Sahu
    Pages 15-29

  4. Hamiltonian Path in \(K_{1,t}\)-free Split Graphs- A Dichotomy

    • Pazhaniappan Renjith, Narasimhan Sadagopan
    Pages 30-44

  5. A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems

    • Bugra Caskurlu, Matthew Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski
    Pages 45-58

  6. Probabilistic Properties of Highly Connected Random Geometric Graphs

    • Bodo Manthey, Victor M. J. J. Reijnders
    Pages 59-72

  7. On Indicated Coloring of Some Classes of Graphs

    • P. Francis, S. Francis Raj, M. Gokulnath
    Pages 73-80

  8. Line Segment Disk Cover

    • Manjanna Basappa
    Pages 81-92

  9. Fixed-Parameter Tractable Algorithms for Tracking Set Problems

    • Aritra Banik, Pratibha Choudhary
    Pages 93-104

  10. Exact Computation of the Number of Accepting Paths of an NTM

    • Subrahmanyam Kalyanasundaram, Kenneth W. Regan
    Pages 105-117

  11. Determining Minimal Degree Polynomials of a Cyclic Code of Length \(2^k\) over \(\mathbb {Z}_8\)

    • Arpana Garg, Sucheta Dutt
    Pages 118-130

  12. Consistent Subset Problem with Two Labels

    • Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy
    Pages 131-142

  13. The Edge Geodetic Number of Product Graphs

    • Bijo S. Anand, Manoj Changat, S. V. Ullas Chandran
    Pages 143-154

  14. Burning Spiders

    • Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma kant Sahoo, Sagnik Sen
    Pages 155-163

  15. Drawing Graphs on Few Circles and Few Spheres

    • Myroslav Kryven, Alexander Ravsky, Alexander Wolff
    Pages 164-178

  16. On a Lower Bound for the Eccentric Connectivity Index of Graphs

    • Devsi Bantva
    Pages 179-187

  17. On the Tractability of (k, i)-Coloring

    • Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
    Pages 188-198

  18. Window Queries for Problems on Intersecting Objects and Maximal Points*

    • Farah Chanchary, Anil Maheshwari, Michiel Smid
    Pages 199-213

  19. Bounded Stub Resolution for Some Maximal 1-Planar Graphs

    • Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr
    Pages 214-220

  20. On Structural Parameterizations of Firefighting

    • Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
    Pages 221-234
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

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.

Editors and Affiliations

  • Indian Institute of Technology Delhi, New Delhi, India

    B.S. Panda

  • University of Calcutta, Kolkata, India

    Partha P. Goswami

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation