Follow
Nicolas Bourgeois
Nicolas Bourgeois
Paris I Panthéon-Sorbonne
Verified email at phare.normalesup.org
Title
Cited by
Cited by
Year
Heritage Sites of Astronomy and Archaeoastronomy in the context of the UNESCO World Heritage Convention: Thematic Study n° 2
C Ruggles, M Cotte, M Austin, J Belmonte, N Bourgeois, A Chadburn, ...
Ocarina Books & ICOMOS & International Astronomical Union, 2017
862017
Fast Algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62, 382-415, 2012
782012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Discrete Applied Mathematics 159 (17), 1954-1970, 2011
612011
Fast algorithms for min independent dominating set
N Bourgeois, F Della Croce, B Escoffier, VT Paschos
Discrete Applied Mathematics 161 (4-5), 558-572, 2013
532013
Experiment and simulation of novel liquid crystal plasma mirrors for high contrast, intense laser pulses
PL Poole, A Krygier, GE Cochran, PS Foster, GG Scott, LA Wilson, ...
Scientific reports 6 (1), 32041, 2016
482016
Efficient approximation of min set cover by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Theoretical Computer Science 410 (21-23), 2184-2195, 2009
392009
A Bottom-Up Method and Fast Algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithm Theory-SWAT 2010: 12th Scandinavian Symposium and Workshops on …, 2010
372010
«Half the park is after dark»* Les parcs et réserves de ciel étoilé: nouveaux concepts et outils de patrimonialisation de la nature
B Charlier, N Bourgeois
Espace géographique 42 (3), 200-212, 2013
342013
Suicide en prison: la France comparée à ses voisins européens
G Duthé, A Hazard, A Kensey, JL Pan Ké Shon, B Bouquet, N Bourgeois
Population & sociétés, 1-4, 2009
332009
Approximation of min coloring by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Information Processing Letters 109 (16), 950-954, 2009
302009
Exact and Approximation Algorithms for Densest k-Subgraph:
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013 …, 2013
262013
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
N Bourgeois, B Escoffier, VT Paschos
Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008
252008
Efficient approximation of combinatorial problems by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Workshop on Algorithms and Data Structures, 507-518, 2009
242009
Suicide in prison: a comparison between France and its European neighbours
G Duthé, A Hazard, A Kensey, JLPK Shon, B Bouquet, N Bourgeois
Population Societies 462 (11), 1-4, 2009
242009
Search for meaning through the study of co-occurrences in texts
N Bourgeois, M Cottrell, S Lamassé, M Olteanu
Advances in Computational Intelligence: 13th International Work-Conference …, 2015
202015
How to improve robustness in Kohonen maps and display additional information in factorial analysis: application to text mining
N Bourgeois, M Cottrell, B Déruelle, S Lamassé, P Letrémy
Neurocomputing 147, 120-135, 2015
192015
Fast Algorithms for min independent dominating set
N Bourgeois, B Escoffier, VT Paschos
Structural Information and Communication Complexity: 17th International …, 2010
182010
Maximum independent set in graphs of average degree at most three in
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
International Conference on Theory and Applications of Models of Computation …, 2010
172010
Probabilistic graph-coloring in bipartite and split graphs
N Bourgeois, F Della Croce, B Escoffier, C Murat, VT Paschos
Journal of combinatorial optimization 17, 274-311, 2009
172009
Efficient approximation by" low-complexity" exponential algorithms
N Bourgeois, B Escoffier, V Paschos
172007
The system can't perform the operation now. Try again later.
Articles 1–20