| 2021 | SISAP | The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. | Lucas Gnecco, Nicolas Boria, Sbastien Bougleux, Florian Yger, David B. Blumenthal |
| 2021 | WABI | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. | Nicolas Boria, Laurent Gourvs, Vangelis Th. Paschos, Jrme Monnot |
| 2020 | ESANN | Frchet Mean Computation in Graph Space through Projected Block Gradient Descent. | Nicolas Boria, Benjamin Ngrevergne, Florian Yger |
| 2018 | SSPR | Approximating GED Using a Stochastic Generator and Multistart IPFP. | Nicolas Boria, Sbastien Bougleux, Luc Brun |
| 2016 | CPM | A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem. | Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer |
| 2014 | WABI | Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. | Nicolas Boria, Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2013 | CSR | The Probabilistic Min Dominating Set Problem. | Nicolas Boria, Ccile Murat, Vangelis Th. Paschos |
| 2013 | WAOA | On the max min vertex cover Problem. | Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos |
| 2012 | LATIN | Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. | Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos |
| 2012 | WALCOM | Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. | Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos |
| 2011 | FCT | Online Maximum k-Coverage. | Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos |