Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2017

Algorithms and Discrete Applied Mathematics

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

Editors:

  1. Daya Gaur

    1. University of Lethbridge, Lethbridge, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. N.S. Narayanaswamy

    1. Indian Institute of Technology Madras, Chennai, 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 10156)

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

Conference series link(s): CALDAM: Conference on Algorithms and Discrete Applied Mathematics

Conference proceedings info: CALDAM 2017.

Sections

Buy it now

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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (32 papers)

  1. Front Matter

    Pages I-XIX
    PDF

  2. Optimal Embedding of Locally Twisted Cubes into Grids

    • Jessie Abraham, Micheal Arockiaraj
    Pages 1-11

  3. Polynomial Time Algorithms for Bichromatic Problems

    • Sayan Bandyapadhyay, Aritra Banik
    Pages 12-23

  5. Optimum Gathering of Asynchronous Robots

    • Subhash Bhagat, Krishnendu Mukhopadhyaya
    Pages 37-49

  6. Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime

    • Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman
    Pages 50-59

  7. Positional Dominance: Concepts and Algorithms

    • Ulrik Brandes, Moritz Heine, Julian Müller, Mark Ortmann
    Pages 60-71

  8. Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams

    • Vladimir Braverman, Harry Lang, Keith Levin
    Pages 72-82

  9. Querying Relational Event Graphs Using Colored Range Searching Data Structures

    • Farah Chanchary, Anil Maheshwari, Michiel Smid
    Pages 83-95

  10. Axiomatic Characterization of the Interval Function of a Bipartite Graph

    • Manoj Changat, Ferdoos Hossein Nezhad, Narayanan Narayanan
    Pages 96-106

  11. Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System

    • Ante Ćustić, Ehsan Iranmanesh, Ramesh Krishnamurti
    Pages 107-117

  12. On Structural Parameterizations of Graph Motif and Chromatic Number

    • Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
    Pages 118-129

  13. On Chromatic Number of Colored Mixed Graphs

    • Sandip Das, Soumen Nandi, Sagnik Sen
    Pages 130-140

  14. Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity

    • Sandip Das, Ayan Nandy, Swami Sarvottamananda
    Pages 141-155

  15. On Colouring Point Visibility Graphs

    • Ajit Arvind Diwan, Bodhayan Roy
    Pages 156-165

  17. On Rank and MDR Cyclic Codes of Length \(2^k\) Over \(Z_8\)

    • Arpana Garg, Sucheta Dutt
    Pages 177-186

  18. Group Distance Magic Labeling of \(C_n^r\)

    • Aloysius Godinho, T. Singh
    Pages 187-192

  19. Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs

    • Hovhannes A. Harutyunyan, Zhiyuan Li
    Pages 193-204

  20. Incremental Algorithms to Update Visibility Polygons

    • R. Inkulu, Nitish P. Thakur
    Pages 205-218
Back to top

Other Volumes

  1. Algorithms and Discrete Applied Mathematics

Back to top

About this book

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. 

Back to top

Keywords

Back to top

Editors and Affiliations

  • University of Lethbridge, Lethbridge, Canada

    Daya Gaur

  • Indian Institute of Technology Madras, Chennai, India

    N.S. Narayanaswamy

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation