Nicolas Boria

DBLP Page

Articles in Refereed Journals

David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper and Benoit Gaüzère Scalable generalized median graph estimation and applications in clustering, classification, and indexing submitted to VLDB Journal

Nicolas Boria, David B. Blumenthal, Sébastien Bougleux and Luc Brun Improved Local Search for Graph Edit Distance Pattern Recognition Letters 129: 19-25 (2020)

David B. Blumenthal, Sébastien Bougleux, Nicolas Boria, and Luc Brun Comparing heuristics for graph edit distance computation VLDB J. 29(1): 419-458 (2020)

Nicolas Boria, Cécile Murat, Vangelis Paschos The probabilistic minimum dominating set Problem. Discrete Applied Mathematics, 2018, 234: 93-113

Nicolas Boria, Federico Della Croce, Vangelis Paschos On the Max Min Vertex Cover Problem. Discrete Applied Mathematics, 2015, 196-C: 62-71

Nicolas Boria, Federico Della Croce Reoptimization in machine scheduling. Theoretical computer Science, 2014, 540: 13-26

Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos Exponential approximation schemata for some network design problems Journal of Discrete Algorithms, 2013, 22: 43-52

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos, Reoptimization under vertex insertion: max $P_k$-free subgraph and max planar subgraph Discrete Mathematics, Algorithms and Applications, 2013, 5(2)

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos Reoptimization of maximum weight induced hereditary subgraph problems. Theoretical computer Science, 2013, 514: 61-74

Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos. Online maximum k-coverage. Discrete Applied Mathematics, 2012, 160(13-14): 1901-1913

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos. On the Probabilistic min spanning tree problem. Journal of Mathematical Modelling and Algorithms, 2012, 11(1): 45-76

Nicolas Boria, Vangelis Paschos. A Survey on Combinatorial Optimization in Dynamic Environments. RAIRO-Operations Research, 2011, 45(3): 241-294

Nicolas Boria, Vangelis Paschos. Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms, 2010, 8(3): 296-310

Articles in Refereed conference proceedings

Nicolas Boria, Florian Yger and Benjamin Negrevergne Fréchet Mean Computation in Graph Space through Projected Block Gradient Descent accepted at ESANN 2020

Nicolas Boria, Sébastien Bougleux, Benoit Gauzère and Luc Brun Generalized Median Graph via Iterative Alternate Minimizations. GbRPR 2019: 99-109

Nicolas Boria, Sébastien Bougleux, Luc Brun Approximating GED using a Stochastic Generator and Multistart IPFP. S+SSPR 2018, Beijing, China

Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini and Stefano Quer A 7/2-approximation algorithm for the Maximum Duo-Preservation String Mapping Problem. CPM 2016, Tel-Aviv, Israel

Nicolas Boria, Adam Kurpisz, Samuli Leppanen, Monaldo Mastrolilli Improved Approximation for the Maximum Duo-preservation String Mapping Problem. WABI 2014, Wroclaw, Poland

Nicolas Boria, Federico Della Croce, Vangelis Paschos On the Max Min Vertex Cover Problem. WAOA 2013, Sophia Antipolis, France

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos The probabilistic Min Dominating Set Problem. CSR 2013, Ekaterinburg, Russia.

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos Reoptimization of Maximum Induced Hereditary Subgraph Problem. LATIN 2012, Arequipa, Peru.

Nicolas Boria, Vangelis Th. Paschos, Jérôme Monnot Reoptimization of the Maximum Weighted $P_k$-Free Subgraph Problem under Vertex Insertion. WALCOM 2012, Dhaka, Bangladesh.

Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos. Online k-coverage. FCT 2011, Oslo, Norway.

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos. On the Probabilistic min spanning tree problem. IMCSIT 2010: 893-900, Wisla, Poland.