default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Boria
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Nicolas Boria, Jana Kiederle
, Florian Yger, David B. Blumenthal:
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees. Pattern Recognit. Lett. 167: 189-195 (2023)- 2021
- [j13]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: 101766 (2021) - [c13]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: 337-351 - [c12]Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot:
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI 2021: 5:1-5:12 - [i4]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 abs/2107.14525 (2021) - 2020
- [j12]Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun:
Improved local search for graph edit distance. Pattern Recognit. Lett. 129: 19-25 (2020) - [j11]David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, Luc Brun:
Comparing heuristics for graph edit distance computation. VLDB J. 29(1): 419-458 (2020) - [c11]Nicolas Boria, Benjamin Négrevergne, Florian Yger:
Fréchet Mean Computation in Graph Space through Projected Block Gradient Descent. ESANN 2020: 193-198
2010 – 2019
- 2019
- [c10]Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Generalized Median Graph via Iterative Alternate Minimizations. GbRPR 2019: 99-109 - [i3]Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Generalized Median Graph via Iterative Alternate Minimizations. CoRR abs/1906.11009 (2019) - [i2]Nicolas Boria, David B. Blumenthal, Sébastien Bougleux, Luc Brun:
Improved local search for graph edit distance. CoRR abs/1907.02929 (2019) - 2018
- [j10]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The probabilistic minimum dominating set problem. Discret. Appl. Math. 234: 93-113 (2018) - [c9]Nicolas Boria, Sébastien Bougleux, Luc Brun:
Approximating GED Using a Stochastic Generator and Multistart IPFP. S+SSPR 2018: 460-469 - 2016
- [c8]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: 11:1-11:8 - [i1]Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer:
A Greedy Approach to Answer Reachability Queries on DAGs. CoRR abs/1611.02506 (2016) - 2015
- [j9]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover problem. Discret. Appl. Math. 196: 62-71 (2015) - 2014
- [j8]Nicolas Boria, Federico Della Croce:
Reoptimization in machine scheduling. Theor. Comput. Sci. 540: 13-26 (2014) - [c7]Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI 2014: 14-25 - 2013
- [j7]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5(2) (2013) - [j6]Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22: 43-52 (2013) - [j5]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514: 61-74 (2013) - [c6]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Min Dominating Set Problem. CSR 2013: 298-309 - [c5]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover Problem. WAOA 2013: 37-48 - 2012
- [j4]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012) - [j3]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11(1): 45-76 (2012) - [c4]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84 - [c3]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM 2012: 76-87 - 2011
- [j2]Nicolas Boria, Vangelis Th. Paschos:
A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. 45(3): 241-294 (2011) - [c2]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - 2010
- [j1]Nicolas Boria, Vangelis Th. Paschos:
Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms 8(3): 296-310 (2010) - [c1]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the Probabilistic min spanning tree problem. IMCSIT 2010: 893-900
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
