Department of Mathematics
Birla Institute of Technology and Science, Pilani (BITS Pilani)
K K Birla Goa Campus, Goa, India
February 13 to 18, 2017

CALDAM 2017 Accepted Papers

CALDAM 2017 Accepted Papers

Sizhong Zhou, Tao Zhang and Zurun Xu. Subgraphs with orthogonal $[0,k_{i}]_{1}^{n}$-factorizations in graphs
Sizhong Zhou, Yang Xu and Lan Xu. Stability number and k-Hamiltonian [a,b]-factors
Sucheta Dutt and Arpana Garg. On Rank and MDR Cyclic codes of length $2^k$ over $Z_8$
Jessie Abraham and Micheal Arockiaraj. Optimal embedding of locally twisted cubes into grids
M A Shalu, S Vijayakumar and T P Sandhya. A lower bound of the cd-chromatic number and its complexity
Ajit Diwan and Sai Sandeep. Decomposing semi-complete multigraphs and directed graphs into paths of length two
Manoj Changat, Ferdoos Hossein Nezhad and Narayanan Narayanan. Axiomatic Characterization of Interval Function of a Bipartite Graph
Pavan Sangha and Michele Zito. Finding Large Independent Sets in Line of Sight Networks
Sayan Bandyapadhyay and Aritra Banik. Polynomial Time Algorithms for Bichromatic Problems
Ajit Diwan and Bodhayan Roy. On colouring point visibility graphs
Gill Barequet and Minati De. Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
Vladimir Braverman, Harry Lang and Keith Levin. Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams
Klaus Jansen and Lars Rohwedder. Structured Instances of Restricted Assignment with Two Processing Times
P Renjith and Narasimhan Sadagopan. Hamiltonicity in Split Graphs- a dichotomy
Farah Chanchary, Anil Maheshwari and Michiel Smid. Querying Relational Event Graphs using Colored Range Searching Data Structures
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman and Prafullkumar Tale. Exact And Parameterized Algorithms For $(k,i)$-coloring
Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal and Vijay Pandey. Maximum weighted independent sets with a budget
Varunkumar Jayapaul, Venkatesh Raman and Dishant Goyal. Elusiveness of finding degrees
Arti Pandey, B.S. Panda, Manav Kashyap and Piyush Dane. Induced matching in some subclasses of bipartite graphs
Ramesh Jallu and Gautam K Das. Liar's Domination in 2D
Subhash Bhagat and Krishnendu Mukhopadhyaya. Optimum Gathering of Asynchronous Robots
Abdullah Makkeh, Mozhgan Pourmoradnasseri and Dirk Oliver Theis. The Graph of the Pedigree Polytope is Asymptotically Almost Complete
Ante Custic, Ehsan Iranmanesh and Ramesh Krishnamurti. Analysis of 2-Opt Heuristic for the Winner Determination Problem under the Chamberlin-Courant System
Hovhannes A. Harutyunyan and Zhiyuan Li. Broadcast Graphs Using New Dimensional Broadcast Schemes for Kn{\"o}del Graphs
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra and Vinod Reddy. On Structural Parameterizations of Graph Motif and Chromatic Number
Datta Krupa R, Aniket Basu Roy, Minati De and Sathish Govindarajan. Demand hitting and covering of intervals
Aloysius Godinho and Tarkeshwar Singh. Group Distance Magic Labeling of $C_n^r$
Ulrik Brandes, Moritz Heine, Julian Müller and Mark Ortmann. Positional Dominance: Concepts and Algorithms
Sandip Das, Soumen Nandi and Sagnik Sen. On chromatic number of colored mixed graphs
R Inkulu and Nitish Thakur. Incremental algorithms to update visibility polygons
Arindam Biswas, Varunkumar Jayapaul and Venkatesh Raman. Improved bounds for poset sorting in the forbidden-comparison regime
Sandip Das, Ayan Nandy and Sarvottamananda Swami. Optimizing movement in a convex path-network to establish connectivity

Sponsors of CALDAM

Contact Us

Department of Mathematics,
BITS Pilani K K Birla Goa Campus, Goa,
India 403726
+91 832-2580-435
+91 982-303-9869
Email: caldam2017[at]gmail[dot]com
For Registration: caldam[dot]reg[dot]2017[at]gmail[dot]com