| 2018 | Manipulation Strategies for the Rank-Maximal Matching Problem. | Pratik Ghosal, Katarzyna E. Paluch |
| 2018 | LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. | Takuro Fukunaga |
| 2018 | Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage. | Bin Fu |
| 2018 | Minimum Spanning Tree of Line Segments. | Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy |
| 2018 | Exact Algorithms for Finding Partial Edge-Disjoint Paths. | Yunyun Deng, Longkun Guo, Peihuang Huang |
| 2018 | Reconstruction of Boolean Formulas in Conjunctive Normal Form. | Evgeny Dantsin, Alexander Wolpert |
| 2018 | Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | Bipartite Graphs of Small Readability. | Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma |
| 2018 | On Contact Representations of Directed Planar Graphs. | Chun-Hsiang Chan, Hsu-Chun Yen |
| 2018 | SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. | T.-H. Hubert Chan, Bintao Sun |
| 2018 | Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. | T.-H. Hubert Chan, Zhibin Liang |
| 2018 | Generalized Graph k-Coloring Games. | Raffaello Carosi, Gianpiero Monaco |
| 2018 | Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. | Alan Digo Aurlio Carneiro, Fbio Protti, Uverton S. Souza |
| 2018 | Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. | Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow |
| 2018 | Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. | Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang |
| 2018 | Computation and Growth of Road Network Dimensions. | Johannes Blum, Sabine Storandt |
| 2018 | On Colorful Bin Packing Games. | Vittorio Bil, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco |
| 2018 | Improved Learning of k-Parities. | Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal |
| 2018 | Amplitude Amplification for Operator Identification and Randomized Classes. | Debajyoti Bera |
| 2018 | Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. | Gill Barequet, Minati De, Michael T. Goodrich |
| 2018 | Properties of Minimal-Perimeter Polyominoes. | Gill Barequet, Gil Ben-Shachar |
| 2018 | Computing Coverage Kernels Under Restricted Settings. | Jrmy Barbay, Pablo Prez-Lantero, Javiel Rojas-Ledesma |
| 2018 | Synergistic Solutions for Merging and Computing Planar Convex Hulls. | Jrmy Barbay, Carlos Ochoa |
| 2018 | Minimum Transactions Problem. | Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti |
| 2018 | Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. | Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger |