| 2016 | Weighted Online Problems with Advice. | Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen |
| 2016 | Essential Constraints of Edge-Constrained Proximity Graphs. | Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid |
| 2016 | Online Chromatic Number is PSPACE-Complete. | Martin Bhm, Pavel Vesel |
| 2016 | SOBRA - Shielding Optimization for BRAchytherapy. | Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa |
| 2016 | Plane Bichromatic Trees of Low Degree. | Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs. | Robert Benkoczi, Ram Dahal, Daya Ram Gaur |
| 2016 | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | On Computing the Total Displacement Number via Weighted Motzkin Paths. | Andreas Brtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager |
| 2016 | Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. | N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
| 2016 | Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations. | Max A. Alekseyev |
| 2016 | A Boundary Property for Upper Domination. | Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jrme Monnot, Bernard Ries, Victor Zamaraev |
| 2015 | The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. | Meirav Zehavi |
| 2015 | About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. | Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra |
| 2015 | On the Zero Forcing Number of Bijection Graphs. | Denys Shcherbak, Gerold Jger, Lars-Daniel hman |
| 2015 | EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. | Mikhail Rubinchik, Arseny M. Shur |
| 2015 | Computing the BWT and the LCP Array in Constant Space. | Felipe A. Louza, Guilherme P. Telles |
| 2015 | Computational Complexity of Distance Edge Labeling. | Dusan Knop, Toms Masark |
| 2015 | A Faster FPTAS for the Unbounded Knapsack Problem. | Klaus Jansen, Stefan Erich Julius Kraft |
| 2015 | Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. | Toru Hasunuma |
| 2015 | Fast Multiple Order-Preserving Matching Algorithms. | Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park |
| 2015 | Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2015 | How to Design Graphs with Low Forwarding Index and Limited Number of Edges. | Frdric Giroire, Stphane Prennes, Issam Tahiri |
| 2015 | Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. | Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stphane Vialette, Louxin Zhang |
| 2015 | Algorithmic Aspects of the S-Labeling Problem. | Guillaume Fertin, Irena Rusu, Stphane Vialette |
| 2015 | Schrder Partitions and Schrder Tableaux. | Luca Ferrari |