Nicolas Bourgeois
Nicolas Bourgeois
Paris I Panthéon-Sorbonne
Geverifieerd e-mailadres voor phare.normalesup.org
Titel
Geciteerd door
Geciteerd door
Jaar
Fast algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62 (1-2), 382-415, 2012
612012
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
472011
Covering graphs with few complete bipartite subgraphs
H Fleischner, E Mujuni, D Paulusma, S Szeider
Theoretical Computer Science 410 (21-23), 2045-2053, 2009
452009
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
382013
A Bottom-Up Method and Fast Algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Scandinavian Workshop on Algorithm Theory, 62-73, 2010
352010
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
342009
Approximation of min coloring by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Information Processing Letters 109 (16), 950-954, 2009
262009
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, 32041, 2016
242016
Efficient approximation of combinatorial problems by moderately exponential algorithms
N Bourgeois, B Escoffier, VT Paschos
Workshop on Algorithms and Data Structures, 507-518, 2009
232009
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs
N Bourgeois, B Escoffier, VT Paschos
International Workshop on Parameterized and Exact Computation, 55-65, 2008
212008
Exact and Approximation Algorithms for Densest k-Subgraph
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
International Workshop on Algorithms and Computation, 114-125, 2013
192013
Exact and Approximation Algorithms for Densest k-Subgraph
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
International Workshop on Algorithms and Computation, 114-125, 2013
192013
Exact and Approximation Algorithms for Densest k-Subgraph
N Bourgeois, A Giannakos, G Lucarelli, I Milis, VT Paschos
International Workshop on Algorithms and Computation, 114-125, 2013
192013
Fast Algorithms for min independent dominating set
N Bourgeois, B Escoffier, VT Paschos
International Colloquium on Structural Information and Communication …, 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 (3), 274-311, 2009
172009
Effcient approximation by “low-complexity” exponential algorithms
N Bourgeois, B Escoffier, V Paschos
172008
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
162015
Half the park is after dark
B Charlier, N Bourgeois
LEspace geographique 42 (3), 200-212, 2013
162013
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
162010
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
152012
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20