Abstract is missing.
- A Note on Handicap Incomplete TournamentsAppattu Vallapil Prajeesh, Krishnan Paramasivam, Nainarraj Kamatchi. 1-9 [doi]
- Computing the k-Crossing Visibility Region of a Point in a PolygonYeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer. 10-21 [doi]
- An Improved Scheme in the Two Query Adaptive Bitprobe ModelMirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani. 22-34 [doi]
- On Erdős-Szekeres-Type Problems for k-convex Point SetsMartin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr. 35-47 [doi]
- Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating SetSandip Banerjee, Sujoy Bhore. 48-60 [doi]
- Fixed-Parameter Tractability of (n-k) List ColoringAritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman 0001. 61-69 [doi]
- Finding Periods in Cartesian Tree MatchingMagsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park. 70-84 [doi]
- Parameterized Complexity of Min-Power Asymmetric ConnectivityMatthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein. 85-96 [doi]
- Solving Group Interval Scheduling EfficientlyArindam Biswas, Venkatesh Raman 0001, Saket Saurabh. 97-107 [doi]
- Call Admission Problems on Trees with Advice - (Extended Abstract)Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm. 108-121 [doi]
- Power Edge Set and Zero Forcing Set Remain Difficult in Cubic GraphsPierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. 122-135 [doi]
- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar GraphsJanka Chlebíková, Clément Dallard. 136-147 [doi]
- Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree HypergraphsAlessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno. 148-159 [doi]
- Dual DominationGennaro Cordasco, Luisa Gargano, Adele Anna Rescigno. 160-174 [doi]
- Reaching 3-Connectivity via Edge-Edge AdditionsGiordano Da Lozzo, Ignaz Rutter. 175-187 [doi]
- Cops and Robber on Some Families of Oriented GraphsSandip Das 0001, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen. 188-200 [doi]
- Disjoint Clustering in Combinatorial CircuitsZola Donovan, K. Subramani, Vahan Mkrtchyan. 201-213 [doi]
- The Hull Number in the Convexity of Induced Paths of Order 3Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach. 214-228 [doi]
- Supermagic Graphs with Many Odd DegreesDalibor Froncek, Jiangyi Qiu. 229-236 [doi]
- Incremental Algorithm for Minimum Cut and Edge Connectivity in HypergraphRahul Raj Gupta, Sushanta Karmakar. 237-250 [doi]
- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and ApplicationsMichel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou. 251-264 [doi]
- Shortest-Path-Preserving RoundingHerman J. Haverkort, David Kübel, Elmar Langetepe. 265-277 [doi]
- Complexity and Algorithms for Semipaired Domination in GraphsMichael A. Henning, Arti Pandey, Vikash Tripathi. 278-289 [doi]
- Computing the Rooted Triplet Distance Between Phylogenetic NetworksJesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung. 290-303 [doi]
- Parameterized Algorithms for Graph Burning ProblemAnjeneya Swami Kare, I. Vinod Reddy. 304-314 [doi]
- Extension and Its Price for the Connected Vertex Cover ProblemMehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis. 315-326 [doi]
- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing NumberYasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki. 327-338 [doi]
- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse GraphsKazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura. 339-351 [doi]
- Complexity of Fall Coloring for Restricted Graph ClassesJuho Lauri, Christodoulos Mitillos. 352-364 [doi]
- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence ConstraintsFumito Miyake, Eiji Takimoto, Kohei Hatano. 365-377 [doi]
- Maximum Clique Exhaustive Search in Circulant k-HypergraphsLachlan Plant, Lucia Moura. 378-392 [doi]
- Burrows-Wheeler Transform of Words Defined by MorphismsSrecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi. 393-404 [doi]
- Stable Noncrossing MatchingsSuthee Ruangwises, Toshiya Itoh. 405-416 [doi]
- On the Average Case of MergeInsertionFlorian Stober, Armin Weiß. 417-429 [doi]
- Shortest Unique Palindromic Substring Queries on Run-Length Encoded StringsKiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 430-441 [doi]
- A Partition Approach to Lower Bounds for Zero-Visibility Cops and RobberYuan Xue, Boting Yang, Farong Zhong, Sandra Zilles. 442-454 [doi]