Abstract is missing.
- Efficient Domination and Efficient Edge Domination: A Brief SurveyAndreas Brandstädt. 1-14 [doi]
- Mixed Unit Interval BigraphsAshok Kumar Das, Rajkamal Sahu. 15-29 [doi]
- Hamiltonian Path in K_1, t -free Split Graphs- A DichotomyPazhaniappan Renjith, Narasimhan Sadagopan. 30-44 [doi]
- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint SystemsBugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr J. Wojciechowski. 45-58 [doi]
- Probabilistic Properties of Highly Connected Random Geometric GraphsBodo Manthey, Victor M. J. J. Reijnders. 59-72 [doi]
- On Indicated Coloring of Some Classes of GraphsP. Francis, S. Francis Raj, M. Gokulnath. 73-80 [doi]
- Line Segment Disk CoverManjanna Basappa. 81-92 [doi]
- Fixed-Parameter Tractable Algorithms for Tracking Set ProblemsAritra Banik, Pratibha Choudhary. 93-104 [doi]
- Exact Computation of the Number of Accepting Paths of an NTMSubrahmanyam Kalyanasundaram, Kenneth W. Regan. 105-117 [doi]
- Determining Minimal Degree Polynomials of a Cyclic Code of Length 2^k over \mathbb Z_8Arpana Garg, Sucheta Dutt. 118-130 [doi]
- Consistent Subset Problem with Two LabelsKamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy. 131-142 [doi]
- The Edge Geodetic Number of Product GraphsBijo S. Anand, Manoj Changat, S. V. Ullas Chandran. 143-154 [doi]
- Burning SpidersSandip Das 0001, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen. 155-163 [doi]
- Drawing Graphs on Few Circles and Few SpheresMyroslav Kryven, Alexander Ravsky, Alexander Wolff. 164-178 [doi]
- On a Lower Bound for the Eccentric Connectivity Index of GraphsDevsi Bantva. 179-187 [doi]
- On the Tractability of (k, i)-ColoringSaurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu. 188-198 [doi]
- Window Queries for Problems on Intersecting Objects and Maximal PointsFarah Chanchary, Anil Maheshwari, Michiel H. M. Smid. 199-213 [doi]
- Bounded Stub Resolution for Some Maximal 1-Planar GraphsMichael Kaufmann 0001, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr. 214-220 [doi]
- On Structural Parameterizations of FirefightingBireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy. 221-234 [doi]
- On the Simultaneous Minimum Spanning Trees ProblemMatej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer. 235-248 [doi]
- Variations of Cops and Robbers Game on GridsSandip Das, Harmender Gahlawat. 249-259 [doi]
- Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential GapsKrishnamoorthy Dinesh 0001, Jayalal Sarma. 260-273 [doi]
- On Oriented L(p, 1)-labelingSandip Das 0001, Soumen Nandi, Sagnik Sen. 274-282 [doi]
- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance FunctionsSandip Das 0001, Ayan Nandy, Swami Sarvottamananda. 283-300 [doi]