Nicolas Boria

According to our database, Nicolas Boria authored at least 26 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

The edge-preservation similarity for comparing rooted, unordered, node-labeled trees.

Nicolas Boria, Jana Kiederle, Florian Yger, David B. Blumenthal

Pattern Recognit. Lett., March, 2023

2021

Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing.

David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper, Benoit Gaüzère

Inf. Syst., 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version].

Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal

CoRR, 2021

The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet.

Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.

Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal

Proceedings of the Similarity Search and Applications - 14th International Conference, 2021

2020

Comparing heuristics for graph edit distance computation.

David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, Luc Brun

VLDB J., 2020

Improved local search for graph edit distance.

Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun

Pattern Recognit. Lett., 2020

Fréchet Mean Computation in Graph Space through Projected Block Gradient Descent.

Nicolas Boria, Benjamin Négrevergne, Florian Yger

Proceedings of the 28th European Symposium on Artificial Neural Networks, 2020

2019

Generalized Median Graph via Iterative Alternate Minimizations.

Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun

Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018

The probabilistic minimum dominating set problem.

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos

Discret. Appl. Math., 2018

Approximating GED Using a Stochastic Generator and Multistart IPFP.

Nicolas Boria, Sébastien Bougleux, Luc Brun

Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

2016

A Greedy Approach to Answer Reachability Queries on DAGs.

Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer

CoRR, 2016

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

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

On the max min vertex cover problem.

Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos

Discret. Appl. Math., 2015

2014

Reoptimization in machine scheduling.

Nicolas Boria, Federico Della Croce

Theor. Comput. Sci., 2014

Improved Approximation for the Maximum Duo-Preservation String Mapping Problem.

Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli

Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013

Reoptimization of maximum weight induced hereditary subgraph problems.

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Theor. Comput. Sci., 2013

Exponential approximation schemata for some network design problems.

Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos

J. Discrete Algorithms, 2013

Reoptimization under Vertex Insertion: Max P_K-Free Subgraph and Max Planar Subgraph.

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Discret. Math. Algorithms Appl., 2013

The Probabilistic Min Dominating Set Problem.

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos

Proceedings of the Computer Science - Theory and Applications, 2013

2012

On the probabilistic min spanning tree Problem.

Nicolas Boria, Cécile Murat, Vangelis Th. Paschos

J. Math. Model. Algorithms, 2012

Online maximum k-coverage.

Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos

Discret. Appl. Math., 2012

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.

Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

A survey on combinatorial optimization in dynamic environments.

Nicolas Boria, Vangelis Th. Paschos

RAIRO Oper. Res., 2011

2010

Fast reoptimization for the minimum spanning tree problem.

Nicolas Boria, Vangelis Th. Paschos

J. Discrete Algorithms, 2010