| 2016 | Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers Zsuzsanna Lipták, William F. Smyth |
| 2015 | 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge. Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta |
| 2015 | 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz |
| 2015 | A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem. Stepan Artamonov, Maxim A. Babenko |
| 2015 | A Faster FPTAS for the Unbounded Knapsack Problem. Klaus Jansen, Stefan Erich Julius Kraft |
| 2015 | About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra |
| 2015 | Adding Isolated Vertices Makes Some Online Algorithms Optimal. Joan Boyar, Christian Kudahl |
| 2015 | Algorithmic Aspects of the S-Labeling Problem. Guillaume Fertin, Irena Rusu, Stéphane Vialette |
| 2015 | Combinatorial Properties of Full-Flag Johnson Graphs. Irving Dai |
| 2015 | Computational Complexity of Distance Edge Labeling. Dusan Knop, Tomás Masarík |
| 2015 | Computing the BWT and the LCP Array in Constant Space. Felipe A. Louza, Guilherme P. Telles |
| 2015 | Contagious Sets in Dense Graphs. Daniel Freund, Matthias Poloczek, Daniel Reichman |
| 2015 | Dynamic Subtrees Queries Revisited: The Depth First Tour Tree. Gabriele Farina, Luigi Laura |
| 2015 | EERTREE: An Efficient Data Structure for Processing Palindromes in Strings. Mikhail Rubinchik, Arseny M. Shur |
| 2015 | Enumerating Cyclic Orientations of a Graph. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi |
| 2015 | Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2015 | Fast Multiple Order-Preserving Matching Algorithms. Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, Kunsoo Park |
| 2015 | Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma |
| 2015 | Gray Codes for AT-Free Orders via Antimatroids. Jou-Ming Chang, Ton Kloks, Hung-Lung Wang |
| 2015 | How to Design Graphs with Low Forwarding Index and Limited Number of Edges. Frédéric Giroire, Stéphane Pérennes, Issam Tahiri |
| 2015 | List Colouring and Partial List Colouring of Graphs On-line. Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac |
| 2015 | Longest Common Extensions in Partial Words. Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow |
| 2015 | Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. Hasna Mohsen Alqahtani, Thomas Erlebach |
| 2015 | Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. Toru Hasunuma |
| 2015 | On the Complexity of Rainbow Coloring Problems. Eduard Eiben, Robert Ganian, Juho Lauri |
| 2015 | On the Zero Forcing Number of Bijection Graphs. Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman |
| 2015 | Schröder Partitions and Schröder Tableaux. Luca Ferrari |
| 2015 | Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang |
| 2015 | Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. Mohammed Amin Abdullah, Colin Cooper, Moez Draief |
| 2015 | The k-Leaf Spanning Tree Problem Admits a Klam Value of 39. Meirav Zehavi |