Abstract is missing.
- Bounds on Quasi-CompletenessMalay Bhattacharyya, Sanghamitra Bandyopadhyay. 1-5 [doi]
- Infinite Random Geometric Graphs from the Hexagonal MetricAnthony Bonato, Jeannette Janssen. 6-19 [doi]
- Saving on Phases: Parameterized Approximation for Total Vertex CoverHenning Fernau. 20-31 [doi]
- On Graph Identification Problems and the Special Case of Identifying Vertices Using PathsFlorent Foucaud, Matjaz Kovse. 32-45 [doi]
- Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree ConstructionWojciech Fraczak, Andrew Miller. 46-59 [doi]
- On Some Properties of Doughnut GraphsMd. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman 0001. 60-64 [doi]
- On the Steiner Radial Number of GraphsKumarappan Kathiresan, S. Arockiaraj, R. Gurusamy, K. Amutha. 65-72 [doi]
- Further Results on the Mycielskian of GraphsT. Kavaskar. 73-75 [doi]
- Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data InstancesNiraj Ramesh Dayama, Ketki Kulkarni. 76-80 [doi]
- Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small DiameterJay Mahadeokar, Sanjeev Saxena. 81-85 [doi]
- Acyclic Coloring with Few Division VerticesDebajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman 0001, Sue Whitesides. 86-99 [doi]
- Degree Associated Edge Reconstruction NumberS. Monikandan, S. Sundar Raj. 100-109 [doi]
- Touring Polygons: An Approximation AlgorithmAmirhossein Mozafari, Alireza Zarei. 110-121 [doi]
- Super Connectivity of the Generalized Mycielskian of GraphsS. Francis Raj. 122-124 [doi]
- k-Coloring AlgorithmLaxman Saha, Pratima Panigrahi. 125-129 [doi]
- Maximum Order of a Planar Oclique Is 15Sagnik Sen. 130-142 [doi]
- n - An Improved BoundShanmugasundaram Jeevadoss, Appu Muthusamy. 143-147 [doi]
- Incomparability Graphs of Lattices IIMeenakshi Wasadikar, Pradnya Survase. 148-161 [doi]
- On Antimagic Labeling of Odd Regular GraphsTao-Ming Wang, Guang-Hui Zhang. 162-168 [doi]
- A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for TranslocationsPritom Ahmed, A. S. M. Shohidull Islam, M. Sohel Rahman. 169-181 [doi]
- ω-LanguagesR. Arulprakasam, V. Rajkumar Dare, S. Gnanasekaran. 182-188 [doi]
- Border Array for Structural StringsRichard Beal, Donald A. Adjeroh. 189-205 [doi]
- Computing the Partial Word Avoidability Indices of Ternary PatternsFrancine Blanchet-Sadri, Andrew Lohr, Shane Scott. 206-218 [doi]
- Computing a Longest Common Palindromic SubsequenceShihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman. 219-223 [doi]
- Multiset, Set and Numerically Decipherable Codes over Directed FiguresMichal Kolarz, Wlodzimierz Moczurad. 224-235 [doi]
- A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern MatchingBruce W. Watson, Derrick G. Kourie, Tinus Strauss. 236-248 [doi]
- A Catalogue of Algorithms for Building Weak HeapsStefan Edelkamp, Amr Elmasry, Jyrki Katajainen. 249-262 [doi]
- On Counting Range Maxima Points in PlaneAnil Kishore Kalavagattu, Jatin Agarwal, Ananda Swarup Das, Kishore Kothapalli. 263-273 [doi]
- Indexing Highly Repetitive CollectionsGonzalo Navarro. 274-279 [doi]
- Range Extremum QueriesRajeev Raman. 280-287 [doi]
- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure PermutationsRay Jinzhu Chen, Kevin Scott Reschke, Hailong Hu. 288-292 [doi]
- GRP_CH Heuristic for Generating Random Simple PolygonSanjib Sadhu, Subhashis Hazarika, Kapil Kumar Jain, Saurav Basu, Tanmay De. 293-302 [doi]