An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (IWPEC, 2008)

Exact Algorithms for Dominating Clique Problems. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (ISAAC, 2009)

Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (WADS, 2009)

Greedy Algorithms For On-Line Set-Covering. - Giorgio Ausiello; Nicolas Bourgeois; Telis Giannakos; Vangelis Th. Paschos (Algorithmic Oper. Res., 2009)

Fast Algorithms for Max Independent Set in Graphs of Small Average Degree - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (CoRR, 2009)

Approximation of min coloring by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Inf. Process. Lett., 2009)

Probabilistic graph-coloring in bipartite and split graphs. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Cécile Murat; Vangelis Th. Paschos (J. Comb. Optim., 2009)

Efficient approximation of min set cover by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2009)

Fast Algorithms for min independent dominating set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (SIROCCO, 2010)

A Bottom-Up Method and Fast Algorithms for max independent set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (SWAT, 2010)

Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){ mathcal O}(1.08537^n). - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (TAMC, 2010)

Approximating the max-edge-coloring problem. - Nicolas Bourgeois; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (Theor. Comput. Sci., 2010)

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Discret. Appl. Math., 2011)

Lexical Recount between Factor Analysis and Kohonen Map: Mathematical Vocabulary of Arithmetic in the Vernacular Language of the Late Middle Ages. - Nicolas Bourgeois; Marie Cottrell; Benjamin Déruelle; Stéphane Lamassé; Patrick Letrémy (WSOM, 2012)

Fast Algorithms for max independent set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (Algorithmica, 2012)

The max quasi-independent set problem. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos; O. Pottié (J. Comb. Optim., 2012)

Algorithms for dominating clique problems. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2012)

Exact and Approximation Algorithms for Densest k-Subgraph. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (WALCOM, 2013)

Playing with Parameters: Cross-parameterization in Graphs. - Nicolas Bourgeois; Konrad K. Dabrowski; Marc Demange; Vangelis Th. Paschos (CoRR, 2013)

Fast algorithms for min independent dominating set. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (Discret. Appl. Math., 2013)

Exponential approximation schemata for some network design problems. - Nicolas Boria; Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (J. Discrete Algorithms, 2013)

Search for Meaning Through the Study of Co-occurrences in Texts. - Nicolas Bourgeois; Marie Cottrell; Stéphane Lamassé; Madalina Olteanu (IWANN (2), 2015)

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $ mathcal{G}(n, p)$ random model. - Nicolas Bourgeois; R. Catellier; Tom Denat; Vangelis Th. Paschos (CoRR, 2015)

How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: Application to text mining. - Nicolas Bourgeois; Marie Cottrell; Benjamin Déruelle; Stéphane Lamassé; Patrick Letrémy (Neurocomputing, 2015)

Validation and scalability of an open source parallel flow solver. - Laurent Bricteux; S. Zeoli; Nicolas Bourgeois (Concurr. Comput. Pract. Exp., 2017)

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. - Nicolas Bourgeois; Aristotelis Giannakos; Giorgio Lucarelli; Ioannis Milis; Vangelis Th. Paschos (Eur. J. Oper. Res., 2017)

Analysis of a site's integrity by 3D models and Integrated database, case study : the pic-du-midi high-mountain observatory (France). - Michel Cotte; Florent Laroche; Matthieu Quantin; Loïc Jeanson; Nicolas Bourgeois (CoRR, 2019)

Using Topic Generation Model to explore the French Parliamentary Debates during the early Third Republic (1881-1899). - Nicolas Bourgeois; Aurélien Pellet; Marie Puren (DiPaDA@DHNB, 2022)