Nicolas Boria

According to our database1, Nicolas Boria authored at least 20 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Comparing heuristics for graph edit distance computation.
VLDB J., 2020

Improved local search for graph edit distance.
Pattern Recognit. Lett., 2020

2019
Generalized Median Graph via Iterative Alternate Minimizations.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018
The probabilistic minimum dominating set problem.
Discret. Appl. Math., 2018

Approximating GED Using a Stochastic Generator and Multistart IPFP.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

2016
A Greedy Approach to Answer Reachability Queries on DAGs.
CoRR, 2016

A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
On the max min vertex cover problem.
Discret. Appl. Math., 2015

2014
Reoptimization in machine scheduling.
Theor. Comput. Sci., 2014

Improved Approximation for the Maximum Duo-Preservation String Mapping Problem.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
Reoptimization of maximum weight induced hereditary subgraph problems.
Theor. Comput. Sci., 2013

Exponential approximation schemata for some network design problems.
J. Discrete Algorithms, 2013

Reoptimization under Vertex Insertion: Max P<sub>K</sub>-Free Subgraph and Max Planar Subgraph.
Discret. Math. Algorithms Appl., 2013

The Probabilistic Min Dominating Set Problem.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
On the probabilistic min spanning tree Problem.
J. Math. Model. Algorithms, 2012

Online maximum k-coverage.
Discret. Appl. Math., 2012

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
A survey on combinatorial optimization in dynamic environments.
RAIRO Oper. Res., 2011

2010
Fast reoptimization for the minimum spanning tree problem.
J. Discrete Algorithms, 2010


  Loading...