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
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
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 Farah Chanchary, Anil Maheshwari and Michiel Smid. Querying Relational Event Graphs using Colored Range Searching Data Structures
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
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$
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
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
