Nicolas Boria

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