| 2019 | A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou |
| 2019 | A Note on Handicap Incomplete Tournaments. Appattu Vallapil Prajeesh, Krishnan Paramasivam, Nainarraj Kamatchi |
| 2019 | A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles |
| 2019 | Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. Sandip Banerjee, Sujoy Bhore |
| 2019 | An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
| 2019 | An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki |
| 2019 | An Improved Scheme in the Two Query Adaptive Bitprobe Model. Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani |
| 2019 | Burrows-Wheeler Transform of Words Defined by Morphisms. Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi |
| 2019 | Call Admission Problems on Trees with Advice - (Extended Abstract). Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm |
| 2019 | Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| 2019 | Complexity and Algorithms for Semipaired Domination in Graphs. Michael A. Henning, Arti Pandey, Vikash Tripathi |
| 2019 | Complexity of Fall Coloring for Restricted Graph Classes. Juho Lauri, Christodoulos Mitillos |
| 2019 | Computing the Rooted Triplet Distance Between Phylogenetic Networks. Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung |
| 2019 | Computing the k-Crossing Visibility Region of a Point in a Polygon. Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer |
| 2019 | Cops and Robber on Some Families of Oriented Graphs. Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen |
| 2019 | Disjoint Clustering in Combinatorial Circuits. Zola Donovan, K. Subramani, Vahan Mkrtchyan |
| 2019 | Dual Domination. Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno |
| 2019 | Extension and Its Price for the Connected Vertex Cover Problem. Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis |
| 2019 | Finding Periods in Cartesian Tree Matching. Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 2019 | Fixed-Parameter Tractability of (n-k) List Coloring. Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman |
| 2019 | Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph. Rahul Raj Gupta, Sushanta Karmakar |
| 2019 | Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno |
| 2019 | Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. Lachlan Plant, Lucia Moura |
| 2019 | On Erdős-Szekeres-Type Problems for k-convex Point Sets. Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr |
| 2019 | On the Average Case of MergeInsertion. Florian Stober, Armin Weiß |
| 2019 | Parameterized Algorithms for Graph Burning Problem. Anjeneya Swami Kare, I. Vinod Reddy |
| 2019 | Parameterized Complexity of Min-Power Asymmetric Connectivity. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein |
| 2019 | Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2019 | Reaching 3-Connectivity via Edge-Edge Additions. Giordano Da Lozzo, Ignaz Rutter |
| 2019 | Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | Shortest-Path-Preserving Rounding. Herman J. Haverkort, David Kübel, Elmar Langetepe |
| 2019 | Solving Group Interval Scheduling Efficiently. Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2019 | Stable Noncrossing Matchings. Suthee Ruangwises, Toshiya Itoh |
| 2019 | Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints. Fumito Miyake, Eiji Takimoto, Kohei Hatano |
| 2019 | Supermagic Graphs with Many Odd Degrees. Dalibor Froncek, Jiangyi Qiu |
| 2019 | The Hull Number in the Convexity of Induced Paths of Order 3. Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach |
| 2019 | Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. Janka Chlebíková, Clément Dallard |