| 2018 | Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol. | Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone |
| 2018 | On the Complexity of Resilience for Aggregation Queries. | Dongjing Miao, Zhipeng Cai |
| 2018 | An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(\log n) Query Time. | Heng-Zhao Ma, Jianzhong Li |
| 2018 | Rectilinear Shortest Paths Among Transient Obstacles. | Anil Maheshwari, Arash Nouri, Jrg-Rdiger Sack |
| 2018 | Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. | Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit |
| 2018 | Effect of Crowd Composition on the Wisdom of Artificial Crowds Metaheuristic. | Christopher J. Lowrance, Dominic M. Larkin, Sang M. Yim |
| 2018 | Bipartizing with a Matching. | Carlos V. G. C. Lima, Dieter Rautenbach, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2018 | Generating Algebraic Expressions for Labeled Grid Graphs. | Mark Korenblit |
| 2018 | Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs. | Franklin Kenter, Daphne E. Skipper |
| 2018 | Heuristics for the Score-Constrained Strip-Packing Problem. | Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson |
| 2018 | Defend the Clique-based Attack for Data Privacy. | Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu |
| 2018 | Directed Path-Width of Sequence Digraphs. | Frank Gurski, Carolin Rehs, Jochen Rethmann |
| 2018 | Exact and Approximate Map-Reduce Algorithms for Convex Hull. | Anirban Ghosh, Samuel Schwartz |
| 2018 | Rent Division Among Groups. | Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin |
| 2018 | Online Unit Covering in Euclidean Space. | Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tth |
| 2018 | Star Routing: Between Vehicle Routing and Vertex Cover. | Diego Delle Donne, Guido Tagliavini |
| 2018 | Sequence Sentential Decision Diagrams. | Shuhei Denzumi |
| 2018 | Does a Robot Path Have Clearance C? | Ovidiu Daescu, Hemant Malik |
| 2018 | Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. | Fernanda Couto, Lus Felipe I. Cunha |
| 2018 | Graph Problems with Obligations. | Alexis Cornet, Christian Laforest |
| 2018 | Editing Graphs to Satisfy Diversity Requirements. | Huda Chuangpishit, Manuel Lafond, Lata Narayanan |
| 2018 | Robustly Assigning Unstable Items. | Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen |
| 2018 | Computing a Rectilinear Shortest Path amid Splinegons in Plane. | Tameem Choudhury, R. Inkulu |
| 2018 | Fast Approximation of Centrality and Distances in Hyperbolic Graphs. | Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxs, Hend Alrasheed |
| 2018 | Approximability of Covering Cells with Line Segments. | Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Lus Fernando Schultz Xavier da Silveira |