Abstract is missing.
- Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence AnalysisCostas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani. 3-14 [doi]
- Tropical Dominating Sets in Vertex-Coloured GraphsJean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza. 17-27 [doi]
- On Hamiltonian Colorings of Block GraphsDevsi Bantva. 28-39 [doi]
- Vertex-Coloring with Star-DefectsPatrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Vincenzo Roselli. 40-51 [doi]
- Lower Bounds for Graph Exploration Using Local PoliciesAditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin. 55-67 [doi]
- Optimal Distributed Searching in the Plane with and Without UncertaintyAlejandro López-Ortiz, Daniela Maftuleac. 68-79 [doi]
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis AgreementSubhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya. 80-91 [doi]
- On Aligned Bar 1-Visibility GraphsFranz J. Brandenburg, Alexander Esch, Daniel Neuwirth. 95-106 [doi]
- A Necessary Condition and a Sufficient Condition for Pairwise Compatibility GraphsMd. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman 0001. 107-113 [doi]
- Mixing Times of Markov Chains of 2-OrientationsStefan Felsner, Daniel Heldt. 114-127 [doi]
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]Sang Won Bae. 131-142 [doi]
- A General Framework for Searching on a LineProsenjit Bose, Jean-Lou De Carufel. 143-153 [doi]
- An Optimal Algorithm for Computing the Integer Closure of UTVPI ConstraintsK. Subramani, Piotr J. Wojciechowski. 154-165 [doi]
- Covering Points with Convex Sets of Minimum SizeHwan-Gue Cho, William Evans, Noushin Saeedi, Chan-Su Shin. 166-178 [doi]
- Efficient Generation of Top-k Procurements in a Multi-item AuctionBiswajit Sanyal, Subhashis Majumder, Wing-Kai Hon. 181-193 [doi]
- Counting Subgraphs in Relational Event GraphsFarah Chanchary, Anil Maheshwari. 194-206 [doi]
- Large Independent Sets in Subquartic Planar GraphsMatthias Mnich. 209-221 [doi]
- As Close as It GetsMike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. 222-235 [doi]
- Shortest Reconfiguration of Sliding Tokens on a CaterpillarTakeshi Yamada, Ryuhei Uehara. 236-248 [doi]
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex CoversToshihiro Fujito, Daichi Suzuki. 251-262 [doi]
- Approximation Algorithms for Generalized Bounded Tree CoverBarun Gorain, Partha Sarathi Mandal 0001, Krishnendu Mukhopadhyaya. 263-273 [doi]
- Approximation Algorithms for Three Dimensional Protein FoldingDipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman. 274-285 [doi]
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility GameMorito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi. 286-297 [doi]
- Optimal Online Algorithms for the Multi-objective Time Series Search ProblemShun Hasegawa, Toshiya Itoh. 301-312 [doi]
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference GraphsTiziana Calamoneri, Angelo Monti, Rossella Petreschi. 313-324 [doi]
- A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning ProblemsOliver G. Czibula, Hanyu Gu, Yakov Zinder. 327-338 [doi]
- Semimetric Properties of Sørensen-Dice and Tversky IndexesAlonso Gragera, Vorapong Suppakitpaisarn. 339-350 [doi]
- Finding Mode Using Equality ComparisonsVarunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti. 351-360 [doi]