Fast Algorithms for max independent set N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij Algorithmica 62, 382-415, 2012 | 75 | 2012 |
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 | 56 | 2011 |
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 | 49 | 2013 |
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 | 46 | 2016 |
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 | 38 | 2010 |
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 | 36 | 2009 |
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 | 30 | 2009 |
«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 | 28 | 2013 |
Approximation of min coloring by moderately exponential algorithms N Bourgeois, B Escoffier, VT Paschos Information Processing Letters 109 (16), 950-954, 2009 | 28 | 2009 |
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 | 24 | 2008 |
Efficient approximation of combinatorial problems by moderately exponential algorithms N Bourgeois, B Escoffier, VT Paschos Algorithms and Data Structures: 11th International Symposium, WADS 2009 …, 2009 | 23 | 2009 |
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 | 22 | 2013 |
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 | 22 | 2013 |
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 | 22 | 2013 |
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 | 19 | 2015 |
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 | 18 | 2015 |
Fast Algorithms for min independent dominating set N Bourgeois, B Escoffier, VT Paschos Structural Information and Communication Complexity: 17th International …, 2010 | 18 | 2010 |
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 | 18 | 2009 |
The max quasi-independent set problem N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos, O Pottié Journal of Combinatorial Optimization 23 (1), 94-117, 2012 | 17 | 2012 |
The max quasi-independent set problem N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos, O Pottié Journal of Combinatorial Optimization 23 (1), 94-117, 2012 | 17 | 2012 |