Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings

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