| 2015 | Line Segment Covering of Cells in Arrangements. | Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen |
| 2015 | Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem. | Michael Yu. Khachay, Helen Zaytseva |
| 2015 | Proportional Cost Buyback Problem with Weight Bounds. | Yasushi Kawase, Xin Han, Kazuhisa Makino |
| 2015 | The Connected p-Centdian Problem on Block Graphs. | Liying Kang, Jianjie Zhou, Erfang Shan |
| 2015 | Edge-Disjoint Packing of Stars and Cycles. | Minghui Jiang, Ge Xia, Yong Zhang |
| 2015 | Trees, Paths, Stars, Caterpillars and Spiders. | Minghui Jiang |
| 2015 | Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. | Danjun Huang, Ko-Wei Lih, Wei-Fan Wang |
| 2015 | Directed Pathwidth and Palletizers. | Frank Gurski, Jochen Rethmann, Egon Wanke |
| 2015 | Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D. | David Furcy, Scott M. Summers |
| 2015 | Online Scheduling for Electricity Cost in Smart Grid. | Xin Feng, Yinfeng Xu, Feifeng Zheng |
| 2015 | Variants of Multi-resource Scheduling Problems with Equal Processing Times. | Hamed Fahimi, Claude-Guy Quimper |
| 2015 | On the Minimal Constraint Satisfaction Problem: Complexity and Generation. | Guillaume Escamocher, Barry O'Sullivan |
| 2015 | An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. | Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart |
| 2015 | Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. | Jessica A. Enright, Kitty Meeks |
| 2015 | A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks. | Hongwei Du, Rongrong Zhu, Xiaohua Jia, Chuang Liu |
| 2015 | On Clustering Without Replication in Combinatorial Circuits. | Zola Donovan, Vahan Mkrtchyan, K. Subramani |
| 2015 | Approximating the Restricted 1-Center in Graphs. | Wei Ding, Ke Qiu |
| 2015 | Dynamic Single-Source Shortest Paths in Erds-Rnyi Random Graphs. | Wei Ding, Ke Qiu |
| 2015 | Orbital Independence in Symmetric Mathematical Programs. | Gustavo Dias, Leo Liberti |
| 2015 | A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks. | Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro |
| 2015 | Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset. | Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang |
| 2015 | Black and White Bin Packing Revisited. | Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting |
| 2015 | A New Tractable Case of the QAP with a Robinson Matrix. | Eranda ela, Vladimir G. Deineko, Gerhard J. Woeginger |
| 2015 | An I/O Efficient Algorithm for Minimum Spanning Trees. | Alka Bhushan, Sajith Gopalan |
| 2015 | Approximation Algorithms for Generalized MST and TSP in Grid Clusters. | Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol |