| 2018 | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 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 | Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. | Thas Bardini Idalino, Lucia Moura |
| 2018 | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | On the Expected Number of Distinct Gapped Palindromic Factors. | Philippe Duchon, Cyril Nicaud |
| 2018 | Covering with Clubs: Complexity and Approximability. | Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis |
| 2018 | A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. | Christine Dahn, Nils M. Kriege, Petra Mutzel |
| 2018 | How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? | Jean-Franois Culus, Sophie Toulouse |
| 2018 | On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. | Barbara Covella, Fabrizio Frati, Maurizio Patrignani |
| 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 | Pattern Matching for k-Track Permutations. | Laurent Bulteau, Romeo Rizzi, Stphane Vialette |
| 2018 | Minsum k-Sink Problem on Dynamic Flow Path Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2018 | Minimum Polygons for Fixed Visibility VC-Dimension. | Moritz Beck, Sabine Storandt |
| 2018 | Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). | Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2018 | Linear Ramsey Numbers. | Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2018 | Linear Clique-Width of Bi-complement Reducible Graphs. | Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev |
| 2018 | Collision-Free Routing Problem with Restricted L-Path. | Jammigumpula Ajay, Sasanka Roy |
| 2017 | Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. | Narayan Vikas |
| 2017 | On Solving the Queen Graph Coloring Problem. | Michel Vasquez, Yannick Vimont |
| 2017 | Computing Abelian String Regularities Based on RLE. | Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | Orientations of 1-Factors and the List Edge Coloring Conjecture. | Uwe Schauz |
| 2017 | Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm. | Ramesh Rajaby, Wing-Kin Sung |
| 2017 | Derandomization for k-Submodular Maximization. | Hiroki Oshima |
| 2017 | A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. | Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2017 | Shortest Unique Palindromic Substring Queries in Optimal Time. | Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |