Skip to content

Home Search Authors Pakistan News Saved

SciRah

SciRah does not host or store research papers. Results come live from free, official scholarly APIs, and every paper links back to its original source.

Data sources

OpenAlex
Semantic Scholar
Crossref
CORE
arXiv
PubMed

Privacy policy Terms of service

N. Boria · SciRah

Researcher profile · Semantic Scholar

N. Boria

Share profile

N. Boria — researcher profile on SciRah

h-index: 10
Works: 37
Citations: 356

Most-cited papers

Comparing heuristics for graph edit distance computation
David B. Blumenthal, N. Boria, Johann Gamper, Sébastien Bougleux +1 more
2019The VLDB journal68 citations Open access
Semantic Scholar
On the max min vertex cover problem
N. Boria, F. Della Croce, V. Paschos
2013Discrete Applied Mathematics57 citations Open access
Semantic Scholar
Online maximum k -coverage ∗
G. Ausiello, N. Boria, Aristotelis Giannakos, Giorgio Lucarelli +2 more
201043 citations
Semantic Scholar
Fast reoptimization for the minimum spanning tree problem
N. Boria, V. Paschos
2010J. Discrete Algorithms26 citations Open access
Semantic Scholar
Improved local search for graph edit distance
N. Boria, David B. Blumenthal, Sébastien Bougleux, L. Brun
2019Pattern Recognition Letters21 citations Open access
Semantic Scholar
Reoptimization of maximum weight induced hereditary subgraph problems
N. Boria, J. Monnot, V. Paschos
2013Theoretical Computer Science15 citations Open access
Semantic Scholar
A survey on combinatorial optimization in dynamic environments
N. Boria, V. Paschos
2011RAIRO Oper. Res.15 citations Open access
Semantic Scholar
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem
N. Boria, Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2014Workshop on Algorithms in Bioinformatics12 citations
Semantic Scholar
The probabilistic minimum dominating set problem
N. Boria, Cécile Murat, V. Paschos
2018Discrete Applied Mathematics10 citations Open access
Semantic Scholar
A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem
N. Boria, G. Cabodi, P. Camurati, M. Palena +2 more
2016Annual Symposium on Combinatorial Pattern Matching10 citations
Semantic Scholar
Reoptimization in machine scheduling
N. Boria, F. Della Croce
2014Theoretical Computer Science9 citations Open access
Semantic Scholar
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing
David B. Blumenthal, N. Boria, Sébastien Bougleux, L. Brun +2 more
2021Information Systems8 citations Open access
Semantic Scholar
Generalized Median Graph via Iterative Alternate Minimizations
N. Boria, Sébastien Bougleux, Benoit Gaüzère, L. Brun
2019Workshop on Graph Based Representations in Pattern Recognition8 citations Open access
Semantic Scholar
On the probabilistic min spanning tree Problem
N. Boria, Cécile Murat, V. Paschos
2010Proceedings of the International Multiconference on Computer Science and Information Technology8 citations Open access
Semantic Scholar
Fréchet Mean Computation in Graph Space through Projected Block Gradient Descent
N. Boria, Benjamin Négrevergne, Florian Yger
2020The European Symposium on Artificial Neural Networks7 citations
Semantic Scholar
Approximating GED Using a Stochastic Generator and Multistart IPFP
N. Boria, Sébastien Bougleux, L. Brun
2018International Workshop on Structural and Syntactic Pattern Recognition7 citations Open access
Semantic Scholar
Optimization in dynamic environments
N. Boria, V. Paschos
20117 citations
Semantic Scholar
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
N. Boria, J. Monnot, V. Paschos
2012Workshop on Algorithms and Computation5 citations Open access
Semantic Scholar
Exponential approximation schemata for some network design problems
N. Boria, N. Bourgeois, B. Escoffier, V. Paschos
2013J. Discrete Algorithms4 citations Open access
Semantic Scholar
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
N. Boria, J. Monnot, V. Paschos
2012Latin American Symposium on Theoretical Informatics3 citations Open access
Semantic Scholar
An emergency management model for a wireless sensor network problem
N. Boria, Cécile Murat, V. Paschos
20123 citations
Semantic Scholar
A Greedy Approach to Answer Reachability Queries on DAGs
N. Boria, G. Cabodi, P. Camurati, M. Palena +2 more
2016arXiv.org2 citations
Semantic Scholar
Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph
N. Boria, J. Monnot, V. Paschos
2013Discret. Math. Algorithms Appl.2 citations Open access
Semantic Scholar
CAHIER DU LAMSADE 303 Mars 2011 Exponential approximation schemata for some network design problems
N. Boria, N. Bourgeois, B. Escoffier, V. Paschos
20112 citations
Semantic Scholar
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet
N. Boria, L. Gourvès, V. Paschos, J. Monnot
2021Workshop on Algorithms in Bioinformatics1 citations Open access
Semantic Scholar
The Probabilistic Min Dominating Set Problem
N. Boria, Cécile Murat, V. Paschos
2013Computer Science Symposium in Russia1 citations
Semantic Scholar
CAHIER DU LAMSADE 311 Juin 2011 Reoptimization of maximum weight induced hereditary subgraph problems
N. Boria, J. Monnot, V. Paschos
20111 citations
Semantic Scholar
On the PROBABILISTIC MIN SPANNING TREE problem (Extended abstract)
N. Boria, Cécile Murat
20101 citations
Semantic Scholar
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees
N. Boria, Jana Kiederle, Florian Yger, David B. Blumenthal
2023Pattern Recognition Letters0 citations
Semantic Scholar
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
Lucas Gnecco, N. Boria, Sébastien Bougleux, Florian Yger +1 more
2021Similarity Search and Applications0 citations
Semantic Scholar
Machine scheduling and re-optimization ( extended abstract )
N. Boria
20130 citations
Semantic Scholar
a e LAMSADE Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Juillet 2012 An emergency management model for a wireless sensor network problem
N. Boria, Cécile Murat
20120 citations
Semantic Scholar
CAHIER DU LAMSADE 311 Juin 2011 Reoptimization of maximum weight induced hereditary subgraph problems
N. Boria, Jérǒme Monnot, V. T. Paschos
20110 citations
Semantic Scholar
Exponential approximation schemas for some graph problems
N. Boria, N. Bourgeois, B. Escoffier
20110 citations
Semantic Scholar
CAHIER DU LAMSADE 303 Mars 2011 Exponential approximation schemata for some network design problems
N. Boria, N. Bourgeois, B. Escoffier, V. Paschos
20110 citations
Semantic Scholar
CAHIER DU LAMSADE 279 Novembre 2008 Fast reoptimization for the minimum spanning tree problem
N. Boria, V. Paschos
20080 citations
Semantic Scholar
POLITECNICO DI TORINO Repository ISTITUZIONALE On the probabilistic min spanning tree Problem /
N. Boria, Cécile Murat, V. Paschos
0 citations
Semantic Scholar

Frequent co-authors

Invite them to SciRah by sharing their profile.

V. Paschos×15
Invite
V. Paschos — researcher profile on SciRah
Sébastien Bougleux×6
Invite
Sébastien Bougleux — researcher profile on SciRah
J. Monnot×6
Invite
J. Monnot — researcher profile on SciRah
Cécile Murat×6
Invite
Cécile Murat — researcher profile on SciRah

David B. Blumenthal

×5

Invite

David B. Blumenthal — researcher profile on SciRah

Invite

L. Brun — researcher profile on SciRah

N. Bourgeois×4

Invite

N. Bourgeois — researcher profile on SciRah

Florian Yger×3

Invite

Florian Yger — researcher profile on SciRah

B. Escoffier×3

Invite

B. Escoffier — researcher profile on SciRah

Johann Gamper×2

Invite

Johann Gamper — researcher profile on SciRah

F. Della Croce×2

Invite

F. Della Croce — researcher profile on SciRah

Invite

G. Cabodi — researcher profile on SciRah