| 2018 | Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). | Clifford Stein |
| 2018 | A Relaxed FPTAS for Chance-Constrained Knapsack. | Galia Shabtai, Danny Raz, Yuval Shavitt |
| 2018 | Complexity of Unordered CNF Games. | Md Lutfar Rahman, Thomas Watson |
| 2018 | Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. | Johanna E. Preier, Jens M. Schmidt |
| 2018 | Extending the Centerpoint Theorem to Multiple Points. | Alexander Pilz, Patrick Schnider |
| 2018 | Algorithms for Coloring Reconfiguration Under Recolorability Constraints. | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2018 | Minimizing Distance-to-Sight in Polygonal Domains. | Eunjin Oh |
| 2018 | Point Location in Incremental Planar Subdivisions. | Eunjin Oh |
| 2018 | Succinct Data Structures for Chordal Graphs. | J. Ian Munro, Kaiyu Wu |
| 2018 | Computing Approximate Statistical Discrepancy. | Michael Matheny, Jeff M. Phillips |
| 2018 | Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2018 | Approximation Algorithms for Facial Cycles in Planar Embeddings. | Giordano Da Lozzo, Ignaz Rutter |
| 2018 | A Cut Tree Representation for Pendant Pairs. | On-Hei Solomon Lo, Jens M. Schmidt |
| 2018 | Impatient Online Matching. | Xingwu Liu, Zhida Pan, Yuyi Wang, Roger Wattenhofer |
| 2018 | Efficient Enumeration of Dominating Sets for Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2018 | An Algorithm for the Maximum Weight Strongly Stable Matching Problem. | Adam Kunysz |
| 2018 | Longest Unbordered Factor in Quasilinear Time. | Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis |
| 2018 | Colouring (P_r+P_s)-Free Graphs. | Tereza Klimosov, Josef Malk, Toms Masark, Jana Novotn, Danil Paulusma, Veronika Slvov |
| 2018 | Convex Partial Transversals of Planar Regions. | Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Lffler, Frank Staals, Jrme Urhausen, Jordi L. Vermeulen, Lionov Wiratma |
| 2018 | Simple 2^f-Color Choice Dictionaries. | Frank Kammer, Andrej Sajenko |
| 2018 | Encoding Two-Dimensional Range Top-k Queries Revisited. | Seungbum Jo, Srinivasa Rao Satti |
| 2018 | Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete. | Matthew P. Johnson |
| 2018 | On the Complexity of Stable Fractional Hypergraph Matching. | Takashi Ishizuka, Naoyuki Kamiyama |
| 2018 | Half-Duplex Communication Complexity. | Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal |
| 2018 | Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. | Eunpyeong Hong, Mong-Jen Kao |