Abstract is missing.
- Optimal Embedding of Locally Twisted Cubes into GridsJessie Abraham, Micheal Arockiaraj. 1-11 [doi]
- Polynomial Time Algorithms for Bichromatic ProblemsSayan Bandyapadhyay, Aritra Banik. 12-23 [doi]
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance FunctionGill Barequet, Minati De. 24-36 [doi]
- Optimum Gathering of Asynchronous RobotsSubhash Bhagat, Krishnendu Mukhopadhyaya. 37-49 [doi]
- Improved Bounds for Poset Sorting in the Forbidden-Comparison RegimeArindam Biswas, Varunkumar Jayapaul, Venkatesh Raman 0001. 50-59 [doi]
- Positional Dominance: Concepts and AlgorithmsUlrik Brandes, Moritz Heine, Julian Müller, Mark Ortmann. 60-71 [doi]
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only StreamsVladimir Braverman, Harry Lang, Keith Levin. 72-82 [doi]
- Querying Relational Event Graphs Using Colored Range Searching Data StructuresFarah Chanchary, Anil Maheshwari, Michiel H. M. Smid. 83-95 [doi]
- Axiomatic Characterization of the Interval Function of a Bipartite GraphManoj Changat, Ferdoos Hossein Nezhad, N. Narayanan. 96-106 [doi]
- Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant SystemAnte Custic, Ehsan Iranmanesh, Ramesh Krishnamurti. 107-117 [doi]
- On Structural Parameterizations of Graph Motif and Chromatic NumberBireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy. 118-129 [doi]
- On Chromatic Number of Colored Mixed GraphsSandip Das, Soumen Nandi, Sagnik Sen. 130-140 [doi]
- Optimizing Movement in Convex and Non-convex Path-Networks to Establish ConnectivitySandip Das, Ayan Nandy, Swami Sarvottamananda. 141-155 [doi]
- On Colouring Point Visibility GraphsAjit Arvind Diwan, Bodhayan Roy. 156-165 [doi]
- Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length TwoAjit A. Diwan, Sai Sandeep. 166-176 [doi]
- 8Arpana Garg, Sucheta Dutt. 177-186 [doi]
- rAloysius Godinho, Tarkeshwar Singh. 187-192 [doi]
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel GraphsHovhannes A. Harutyunyan, Zhiyuan Li. 193-204 [doi]
- Incremental Algorithms to Update Visibility PolygonsR. Inkulu, Nitish P. Thakur. 205-218 [doi]
- Liar's Domination in 2DRamesh K. Jallu, Gautam K. Das. 219-229 [doi]
- Structured Instances of Restricted Assignment with Two Processing TimesKlaus Jansen, Lars Rohwedder. 230-241 [doi]
- Elusiveness of Finding DegreesDishant Goyal, Varunkumar Jayapaul, Venkatesh Raman 0001. 242-253 [doi]
- Maximum Weighted Independent Sets with a BudgetTushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey. 254-266 [doi]
- Demand Hitting and Covering of IntervalsDatta Krupa R., Aniket Basu Roy, Minati De, Sathish Govindarajan. 267-280 [doi]
- Exact and Parameterized Algorithms for (k, i)-ColoringDiptapriyo Majumdar, Rian Neogi, Venkatesh Raman 0001, Prafullkumar Tale. 281-293 [doi]
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis. 294-307 [doi]
- Induced Matching in Some Subclasses of Bipartite GraphsArti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap. 308-319 [doi]
- Hamiltonicity in Split Graphs - A DichotomyP. Renjith, N. Sadagopan. 320-331 [doi]
- Finding Large Independent Sets in Line of Sight NetworksPavan Sangha, Michele Zito. 332-343 [doi]
- A Lower Bound of the cd-Chromatic Number and Its ComplexityM. A. Shalu, S. Vijayakumar, T. P. Sandhya. 344-355 [doi]
- Stability Number and k-Hamiltonian [a, b]-factorsSizhong Zhou, Yang Xu, Lan Xu. 356-361 [doi]
- n -Factorizations in GraphsSizhong Zhou, Tao Zhang, Zurun Xu. 362-370 [doi]