Abstract is missing.
- Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk)Surender Baswana. 1-13 [doi]
- Algorithms for Problems on Maximum Density SegmentMd. Shafiul Alam, Asish Mukhopadhyay. 14-25 [doi]
- Distance Spectral Radius of Some k-partitioned Transmission Regular GraphsFouzul Atik, Pratima Panigrahi. 26-36 [doi]
- Color Spanning Objects: Algorithms and Hardness ResultsSandip Banerjee, Neeldhara Misra, Subhas C. Nandy. 37-48 [doi]
- On Hamiltonian Colorings of TreesDevsi Bantva. 49-60 [doi]
- On the Complexity Landscape of the Domination ChainCristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau. 61-72 [doi]
- On the Probability of Being SynchronizableMikhail V. Berlinkov. 73-84 [doi]
- Linear-Time Fitting of a k-Step FunctionBinay Bhattacharya, Sandip Das, Tsunehiko Kameda. 85-96 [doi]
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and ApplicationsOlivier Bodini, David Julien, Philippe Marchal. 97-114 [doi]
- Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit FunctionsManoj Changat, Ferdoos Hossein Nezhad, Narayanan Narayanan. 115-125 [doi]
- Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex ConstraintsSandip Das, Ayan Nandy, Swami Sarvottamananda. 126-138 [doi]
- Lower Bounds on the Dilation of Plane SpannersAdrian Dumitrescu, Anirban Ghosh. 139-151 [doi]
- Lattice Spanners of Low DegreeAdrian Dumitrescu, Anirban Ghosh. 152-163 [doi]
- AND-Decomposition of Boolean Polynomials with Prescribed Shared VariablesPavel G. Emelyanov. 164-175 [doi]
- Approximation Algorithms for Cumulative VRP with Stochastic DemandsDaya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh. 176-189 [doi]
- Some Distance Antimagic Labeled GraphsAdarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh. 190-200 [doi]
- A New Construction of Broadcast GraphsHovhannes A. Harutyunyan, Zhiyuan Li. 201-211 [doi]
- Improved Algorithm for Maximum Independent Set on Unit Disk GraphRamesh K. Jallu, Gautam K. Das. 212-223 [doi]
- Independent Sets in Classes Related to Chair-Free GraphsT. Karthick. 224-232 [doi]
- Cyclic Codes over Galois RingsJasbir Kaur, Sucheta Dutt, Ranjeet Sehmi. 233-239 [doi]
- On the Center Sets of Some Graph ClassesManoj Changat, Kannan Balakrishnan, R. Ram Kumar, G. N. Prasanth, A. Sreekumar. 240-253 [doi]
- On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular LatticesNibedita Mandal, Pratima Panigrahi. 254-263 [doi]
- Medians of Permutations: Building ConstraintsRobin Milosz, Sylvie Hamel. 264-276 [doi]
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness ResultsArti Pandey, B. S. Panda. 277-288 [doi]
- m-Gracefulness of GraphsJessica Pereira, T. Singh, S. Arumugam. 289-298 [doi]
- Domination Parameters in HypertreesR. Jayagopal, Indra Rajasingh, R. Sundara Rajan. 299-307 [doi]
- Complexity of Steiner Tree in Split Graphs - Dichotomy ResultsMadhu Illuri, P. Renjith, N. Sadagopan. 308-325 [doi]
- Relative Clique Number of Planar Signed GraphsSandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen. 326-336 [doi]
- The cd-Coloring of GraphsM. A. Shalu, T. P. Sandhya. 337-348 [doi]
- Characterizations of H-graphsH. P. Patil, V. Raja. 349-356 [doi]
- On the Power Domination Number of Graph ProductsSeethu Varghese, A. Vijayakumar. 357-367 [doi]