Nicolas Bourgeois

32 papers B 4C 2Misc 1Journal 20Unranked 5

Year	Rank	Type	Title / Venue / Authors
2022	—	`conf`	Using Topic Generation Model to explore the French Parliamentary Debates during the early Third Republic (1881-1899). DiPaDA@DHNB Nicolas Bourgeois, Aurélien Pellet, Marie Puren
2019	J	`jnl`	Analysis of a site's integrity by 3D models and Integrated database, case study : the pic-du-midi high-mountain observatory (France). CoRR Michel Cotte, Florent Laroche, Matthieu Quantin, Loïc Jeanson, Nicolas Bourgeois
2017	J	`jnl`	Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2017	J	`jnl`	Validation and scalability of an open source parallel flow solver. Concurr. Comput. Pract. Exp. Laurent Bricteux, S. Zeoli, Nicolas Bourgeois
2015	J	`jnl`	Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model. CoRR Nicolas Bourgeois, R. Catellier, Tom Denat, Vangelis Th. Paschos
2015	J	`jnl`	How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: Application to text mining. Neurocomputing Nicolas Bourgeois, Marie Cottrell, Benjamin Déruelle, Stéphane Lamassé, Patrick Letrémy
2015	J	`jnl`	How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: application to text mining. CoRR Nicolas Bourgeois, Marie Cottrell, Benjamin Déruelle, Stéphane Lamassé, Patrick Letrémy
2015	—	`conf`	Search for Meaning Through the Study of Co-occurrences in Texts. IWANN (2) Nicolas Bourgeois, Marie Cottrell, Stéphane Lamassé, Madalina Olteanu
2013	B	`conf`	Exact and Approximation Algorithms for Densest WALCOM Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2013	J	`jnl`	Exponential approximation schemata for some network design problems. J. Discrete Algorithms Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2013	J	`jnl`	Fast algorithms for min independent dominating set. Discret. Appl. Math. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2013	J	`jnl`	Playing with Parameters: Cross-parameterization in Graphs. CoRR Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos
2012	J	`jnl`	Algorithms for dominating clique problems. Theor. Comput. Sci. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2012	J	`jnl`	Fast Algorithms for max independent set. Algorithmica Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2012	—	`conf`	Lexical Recount between Factor Analysis and Kohonen Map: Mathematical Vocabulary of Arithmetic in the Vernacular Language of the Late Middle Ages. WSOM Nicolas Bourgeois, Marie Cottrell, Benjamin Déruelle, Stéphane Lamassé, Patrick Letrémy
2012	J	`jnl`	The max quasi-independent set problem. J. Comb. Optim. Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
2011	J	`jnl`	Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2010	—	`conf`	A Bottom-Up Method and Fast Algorithms for max independent set. SWAT Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	J	`jnl`	Approximating the max-edge-coloring problem. Theor. Comput. Sci. Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2010	B	`conf`	Fast Algorithms for min independent dominating set. SIROCCO Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2010	C	`conf`	Maximum Independent Set in Graphs of Average Degree at Most Three in TAMC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	Misc	`conf`	The max quasi-independent set Problem. CSR Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
2009	C	`conf`	Approximating the Max Edge-Coloring Problem. IWOCA Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2009	J	`jnl`	Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Exact Algorithms for Dominating Clique Problems. ISAAC Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Fast Algorithms for Max Independent Set in Graphs of Small Average Degree CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2009	J	`jnl`	Fast algorithms for min independent dominating set CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos
2009	J	`jnl`	Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2008	—	`conf`	An O*(1.0977 IWPEC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos