| 2018 | A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. Christine Dahn, Nils M. Kriege, Petra Mutzel |
| 2018 | An Efficient Representation of Partitions of Integers. Kentaro Sumigawa, Kunihiko Sadakane |
| 2018 | An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. Christine Markarian |
| 2018 | Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols. Takaaki Mizuki, Yuichi Komano |
| 2018 | Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
| 2018 | Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. Alexey Nikolaev, Mikhail Batsyn |
| 2018 | Collision-Free Routing Problem with Restricted L-Path. Jammigumpula Ajay, Sasanka Roy |
| 2018 | Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings Costas S. Iliopoulos, Hon Wai Leong, Wing-Kin Sung |
| 2018 | Computational Complexity of Robot Arm Simulation Problems. Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | Covering with Clubs: Complexity and Approximability. Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis |
| 2018 | Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. Mikito Nanashima |
| 2018 | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2018 | Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. Thaís Bardini Idalino, Lucia Moura |
| 2018 | Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation. Kristoffer Kleine, Ilias S. Kotsireas, Dimitris E. Simos |
| 2018 | Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. Rameshwar Pratap, Sandeep Sen |
| 2018 | Fully Leafed Induced Subtrees. Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme |
| 2018 | Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2018 | How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? Jean-François Culus, Sophie Toulouse |
| 2018 | LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2018 | Linear Clique-Width of Bi-complement Reducible Graphs. Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev |
| 2018 | Linear Ramsey Numbers. Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2018 | Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. Robin Milosz, Sylvie Hamel, Adeline Pierrot |
| 2018 | Minimum Polygons for Fixed Visibility VC-Dimension. Moritz Beck, Sabine Storandt |
| 2018 | Minsum k-Sink Problem on Dynamic Flow Path Networks. Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2018 | On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. Barbara Covella, Fabrizio Frati, Maurizio Patrignani |
| 2018 | On the Expected Number of Distinct Gapped Palindromic Factors. Philippe Duchon, Cyril Nicaud |
| 2018 | On the Parameterized Complexity of Colorful Components and Related Problems. Neeldhara Misra |
| 2018 | Pattern Matching for k-Track Permutations. Laurent Bulteau, Romeo Rizzi, Stéphane Vialette |
| 2018 | Placing Segments on Parallel Arcs. Yen Kaow Ng, Wenlong Jia, Shuai Cheng Li |
| 2018 | Separating Interaction Effects Using Locating and Detecting Arrays. Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk |
| 2018 | The Crossing Number of Seq-Shellable Drawings of Complete Graphs. Petra Mutzel, Lutz Oettershagen |
| 2018 | Zero-Suppression and Computation Models. Hiroki Morizumi |