Abstract is missing.
- Probabilistic Arguments in Graph Coloring (Invited Talk)C. R. Subramanian. 1-8 [doi]
- A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree ProblemSantiago V. Ravelo, Carlos E. Ferreira. 9-20 [doi]
- Constant Approximation for Broadcasting in k-cycle GraphPuspal Bhabak, Hovhannes A. Harutyunyan. 21-32 [doi]
- Three Paths to Point PlacementMd. Shafiul Alam, Asish Mukhopadhyay. 33-44 [doi]
- Vertex Guarding in Weak Visibility PolygonsPritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy. 45-57 [doi]
- On Collections of Polygons Cuttable with a Segment SawAdrian Dumitrescu, Anirban Ghosh, Masud Hasan. 58-68 [doi]
- Rectilinear Path Problems in Restricted Memory SetupBinay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy. 69-80 [doi]
- New Polynomial Case for Efficient Domination in P 6-free GraphsT. Karthick. 81-88 [doi]
- Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical PropertiesAhmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. 89-100 [doi]
- Separator Theorems for Interval Graphs and Proper Interval GraphsBhawani Sankar Panda. 101-110 [doi]
- Bounds for the b-chromatic Number of Induced Subgraphs and G - eP. Francis, S. Francis Raj. 111-116 [doi]
- New Characterizations of Proper Interval Bigraphs and Proper Circular Arc BigraphsAshok Kumar Das, Ritapa Chakraborty. 117-125 [doi]
- On Spectra of Corona GraphsRohan Sharma, Bibhas Adhikari, Abhishek Mishra. 126-137 [doi]
- Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete GraphsManoj Changat, Divya Sindhu Lekha, Henry Martyn Mulder, Ajitha R. Subhamathi. 138-149 [doi]
- Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones PropertyN. S. Narayanaswamy, Anju Srinivasan. 150-156 [doi]
- On a Special Class of Boxicity 2 GraphsSujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen. 157-168 [doi]
- Domination in Some Subclasses of Bipartite GraphsArti Pandey, Bhawani Sankar Panda. 169-180 [doi]
- Parameterized Analogues of Probabilistic ComputationAnkit Chauhan, B. V. Raghavendra Rao. 181-192 [doi]
- Algebraic Expressions of Rhomboidal GraphsMark Korenblit. 193-204 [doi]
- Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse ParameterSigve Hortemo Sæther. 205-216 [doi]
- Associativity for Binary Parallel Processes: A Quantitative StudyOlivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin. 217-228 [doi]
- A Tight Bound for Congestion of an EmbeddingPaul Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi. 229-237 [doi]
- Auction/Belief Propagation Algorithms for Constrained Assignment ProblemMindi Yuan, Wei Shen, Jun Li, Yannis Pavlidis, Shen Li. 238-249 [doi]
- Bi-directional Search for Skyline ProbabilityArun K. Pujari, Venkateswara Rao Kagita, Anubhuti Garg, Vineet Padmanabhan. 250-261 [doi]
- Cumulative Vehicle Routing Problem: A Column Generation ApproachDaya Ram Gaur, Rishi Ranjan Singh. 262-274 [doi]
- Energy Efficient Sweep Coverage with Mobile and Static SensorsBarun Gorain, Partha Sarathi Mandal 0001. 275-285 [doi]
- Generation of Random Digital Curves Using Combinatorial TechniquesApurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya. 286-297 [doi]