| 2019 | LIKE Patterns and Complexity. | Holger Petersen |
| 2019 | Give and Take: Adaptive Balanced Allocation for Peer Assessments. | Hideaki Ohashi, Yasuhito Asano, Toshiyuki Shimizu, Masatoshi Yoshikawa |
| 2019 | On the Hardness of Reachability Reduction. | Dongjing Miao, Zhipeng Cai |
| 2019 | An Erdős-Psa Theorem on Neighborhoods and Domination Number. | Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh |
| 2019 | The Seeding Algorithm for Functional k-Means Problem. | Min Li, Yishui Wang, Dachuan Xu, Dongmei Zhang |
| 2019 | APTER: Aggregated Prognosis Through Exponential Re-weighting. | Yang Liu, Kristiaan Pelckmans |
| 2019 | Lower Bounds for Small Ramsey Numbers on Hypergraphs. | S. Cliff Liu |
| 2019 | More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space. | Daogao Liu |
| 2019 | A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs. | Hung Le, Baigong Zheng |
| 2019 | Reoptimization of Path Vertex Cover Problem. | Mehul Kumar, Amit Kumar, C. Pandu Rangan |
| 2019 | An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead. | Koji M. Kobayashi |
| 2019 | Data Structures for Incremental Interval Coloring. | Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy |
| 2019 | On 1-Factorizations of Bipartite Kneser Graphs. | Kai Jin |
| 2019 | Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. | Ashwin Jacob, Venkatesh Raman, Vibha Sahlot |
| 2019 | Incremental Optimization of Independent Sets Under the Reconfiguration Framework. | Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki |
| 2019 | Matching Cut in Graphs with Large Minimum Degree. | Sun-Yuan Hsieh, Hong-Oanh Le, Van Bang Le, Sheng-Lung Peng |
| 2019 | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts. | Alessandro Hill, Stefan Vo, Roberto Baldacci |
| 2019 | No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract). | Md. Manzurul Hasan, Md. Saidur Rahman |
| 2019 | A Simple Construction of Broadcast Graphs. | Hovhannes A. Harutyunyan, Zhiyuan Li |
| 2019 | Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs. | Grzegorz Guspiel |
| 2019 | Imbalance, Cutwidth, and the Structure of Optimal Orderings. | Jan Gorzny, Jonathan F. Buss |
| 2019 | Feasibility Algorithms for the Duplication-Loss Cost. | Pawel Grecki, Alexey Markin, Oliver Eulenstein |
| 2019 | Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. | Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy |
| 2019 | On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models. | Purnata Ghosal, B. V. Raghavendra Rao |