Nicolas Boria

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 15

Top Topics

Network Design Problem

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Nicolas Boria, Jana Kiederle, Florian Yger, David B. Blumenthal
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees. Pattern Recognit. Lett. 167 (2023)
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]. CoRR (2021)
Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI (2021)
David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper, Benoit Gaüzère
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing. Inf. Syst. 100 (2021)
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. SISAP (2021)
Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun
Improved local search for graph edit distance. Pattern Recognit. Lett. 129 (2020)
David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, Luc Brun
Comparing heuristics for graph edit distance computation. VLDB J. 29 (1) (2020)
Nicolas Boria, Benjamin Négrevergne, Florian Yger
Fréchet Mean Computation in Graph Space through Projected Block Gradient Descent. ESANN (2020)
Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun
Generalized Median Graph via Iterative Alternate Minimizations. GbRPR (2019)
Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun
Generalized Median Graph via Iterative Alternate Minimizations. CoRR (2019)
Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun
Improved local search for graph edit distance. CoRR (2019)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
The probabilistic minimum dominating set problem. Discret. Appl. Math. 234 (2018)
Nicolas Boria, Sébastien Bougleux, Luc Brun
Approximating GED Using a Stochastic Generator and Multistart IPFP. S+SSPR (2018)
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer
A Greedy Approach to Answer Reachability Queries on DAGs. CoRR (2016)
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer
A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem. CPM (2016)
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
On the max min vertex cover problem. Discret. Appl. Math. 196 (2015)
Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI (2014)
Nicolas Boria, Federico Della Croce
Reoptimization in machine scheduling. Theor. Comput. Sci. 540 (2014)
Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22 (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514 (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5 (2) (2013)
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
On the max min vertex cover Problem. WAOA (2013)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
The Probabilistic Min Dominating Set Problem. CSR (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM (2012)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN (2012)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11 (1) (2012)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online maximum k-coverage. Discret. Appl. Math. 160 (13-14) (2012)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online Maximum k-Coverage. FCT (2011)
Nicolas Boria, Vangelis Th. Paschos
A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. 45 (3) (2011)
Nicolas Boria, Vangelis Th. Paschos
Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms 8 (3) (2010)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
On the Probabilistic min spanning tree problem. IMCSIT (2010)