Skip to Main content
Number of documents

41

very short cv - Nicolas Bourgeois


2007 - 2010 : PhD student Computer Science Université Paris Dauphine

2010 - 2011 : Game Designer Beyond the Pillars

2011 - 2012 : Post-Doctorate ESSEC Business School

2012 - 2019 : Associate Professor Université Paris 1 Panthéon Sorbonne

2019 - ... Research Director EPITECH Institute of Technology


Journal articles11 documents

  • Muriel Epstein, Nicolas Bourgeois. A statistical analysis of French teachers’ blogs: beyond institutional perspectives. French Journal for Media Research, French Journal for Media Research, 2018, Le web 2.0 : lieux de perception des transformations des sociétés/Web 2.0: Places of perception of the transformations of societies, 10, http://frenchjournalformediaresearch.com/lodel/index.php?id=1642. ⟨hal-01841976⟩
  • Gabrielle Lavenir, Nicolas Bourgeois. Old people, video games and french press: a topic model approach on a study about discipline, entertainment and self-improvement.. MedieKultur: Journal of media and communication research, Sara Mosberg Iversen, 2017. ⟨hal-01521530⟩
  • Nicolas Bourgeois, S. Scott Goldsborough, Guillaume Vanhove, Matthieu Duponcheel, Hervé Jeanmart, et al.. CFD simulations of Rapid Compression Machines using detailed chemistry: Impact of multi-dimensional effects on the auto-ignition of the iso-octane. Proceedings of the Combustion Institute, Elsevier, 2017, 36 (1), pp.383 - 391. ⟨10.1016/j.proci.2016.08.064⟩. ⟨hal-01738369⟩
  • Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th Paschos. Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problem. European Journal of Operational Research, Elsevier, 2017, 262, pp.894 - 903. ⟨10.1016/j.ejor.2017.04.034⟩. ⟨hal-01539561⟩
  • Nicolas Bourgeois, Marie Cottrell, Benjamin Déruelle, Stéphane Lamassé, Patrick Letrémy. How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: application to text mining. Neurocomputing, Elsevier, 2014, 147, pp.120-135. ⟨10.1016/j.neucom.2013.12.057⟩. ⟨hal-01168120⟩
  • Nicolas Bourgeois, Federico Della Croce, Vangelis Paschos, Bruno Escoffier. Fast algorithms for min independent dominating set. Discrete Applied Mathematics, Elsevier, 2013, 161 (4-5), pp.558-572. ⟨hal-01519214⟩
  • Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Exponential approximation schemata for some network design problems. Journal of Discrete Algorithms, Elsevier, 2013, 22, ⟨10.1016/j.jda.2013.06.011⟩. ⟨hal-01509539⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, Johan van Rooij. Fast Algorithms for max independent set. Algorithmica, Springer Verlag, 2012, 62 (1), pp.382-415. ⟨10.1007/s00453-010-9460-7⟩. ⟨hal-01509542⟩
  • Nicolas Bourgeois. Cartographie de la Chronique d'Henri de Livonie. Revue des Nouvelles Technologies de l'Information, Editions RNTI, 2012, pp.85-96. ⟨hal-00796291⟩
  • Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, et al.. The max quasi-independent set problem. Journal of Combinatorial Optimization, Springer Verlag, 2012, 23, pp.94-117. ⟨10.1007/s10878-010-9343-5⟩. ⟨hal-01185274⟩
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Algorithms for dominating clique problems. Theoretical Computer Science, Elsevier, 2012, 459 (9), ⟨10.1016/j.tcs.2012.07.016⟩. ⟨hal-01509536⟩

Conference papers10 documents

  • Nicolas Bourgeois, Vincent Berry, Esteban Giner. Jeux de simulation : typologie et pratiques ludiques. Table ronde dans le cadre du Stunfest : festival des cultures vidéo-ludiques, Association 3 Hit Combo, May 2018, Rennes, France. ⟨hal-01791286⟩
  • Gabrielle Lavenir, Nicolas Bourgeois. "Older adults, video games and the European francophone press: a mixed-methods discourse analysis". European Sociological Assocaition 13th Conference, 2017, Athènes, Greece. ⟨hal-01518979⟩
  • Muriel Epstein, Nicolas Bourgeois. Des blogs enseignants comme « meilleurs entretiens non directifs » ? L’apport d’une analyse textuelle quantitative. Sciences XXL Ce que l’abondance et la diversité des données numériques font aux sciences sociales, Mar 2017, Paris, France. ⟨hal-01519001⟩
  • Muriel Epstein, Nicolas Bourgeois. Etudier des blogs enseignants comme « meilleurs entretiens non directifs » avec des techniques d'analyses textuelles quantitatives. Sciences XXL, journée d'étude de l'INSED, Mar 2017, Paris, France. ⟨hal-01843595⟩
  • Nicolas Bourgeois, Maxime Le Heiget. Statistical factors and The Law : how experts decide if you are a victim in a public health scandal. MASHS, May 2016, Paris, France. ⟨hal-01518935⟩
  • Nicolas Bourgeois, Gabrielle Lavenir. Old people, Video Games and Newspapers : A topic-model approach on a study about deviance, entertainment and self-development. MASHS, May 2016, Paris, France. ⟨hal-01518947⟩
  • Nicolas Bourgeois, Marie Cottrell, Stéphane Lamasse, Madalina Olteanu. Search for Meaning Through the Study of Co-occurrences in Texts. International Work-Conference on Artificial Neural Networks, Jun 2015, Palma de Mallorca, Spain. ⟨hal-01519217⟩
  • Lewertowski Gabriel, Nicolas Bourgeois. Utilisation d’outils graphiques et statistiques pour l’étude de l’évolution du contenu d’un journal : l’exemple du monde diplomatique. MASHS, May 2014, Paris, France. ⟨hal-01518927⟩
  • Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos. Exact and approximation algorithms for DENSEST k-SUBGRAPH. 7th International Workshop on Algorithms and Computation (WALCOM 2013), Feb 2013, Kharagpur, India. pp.114-125, ⟨10.1007/978-3-642-36065-7_12⟩. ⟨hal-01215976⟩
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Fast algorithms for min independent dominating set. Seventh International Conference on Graphs and Optimization 2010, Jun 2010, Ovronnaz, Switzerland. pp.558-572, ⟨10.1016/j.dam.2012.01.003⟩. ⟨hal-01508849⟩

Book sections1 document

  • Nicolas Bourgeois, Marie Cottrell, Benjamin Deruelle, Stéphane Lamassé, Patrick Letrémy. Lexical Recount between Factor Analysis and Kohonen Map: Mathematical Vocabulary of Arithmetic in the Vernacular Language of the Late Middle Ages. P.A. Estevez et al. Advances in Self-Organizing Maps, Proceedings of WSOM 2012, 198, Springer-Verlag Berlin Heidelberg, pp.255-264, 2012, AISC, ⟨10.1007/978-3-642-35230-0_26⟩. ⟨hal-00759587⟩

Preprints, Working Papers, ...19 documents

  • Nicolas Bourgeois, Aurélien Pellet, Marie Puren. Using Topic Generation Model to explore the French Parliamentary Debates during the early Third Republic (1881-1899). 2022. ⟨hal-03526254⟩
  • Nicolas Bourgeois, Rémi Catellier, T Denat, Vangelis Paschos. Average-case complexity of a branch-and-bound algorithm for max independent set under the G(n,p) random model. 2017. ⟨hal-01518581⟩
  • Nicolas Bourgeois, Rémi Catellier, T. Denat, V. Th. Paschos. Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model. 2015. ⟨hal-01258958⟩
  • Nicolas Bourgeois, Konrad Kazimierz Dabrowski, Marc Demange, Vangelis Paschos. Playing with Parameters: Cross-parameterization in Graphs. 2013. ⟨hal-00874243⟩
  • Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos. Exact and approximation algorithms for densest k-subgraph. 2012. ⟨hal-00874586⟩
  • Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Exponential approximation schemata for some network design problems. 2011. ⟨hal-00875650⟩
  • Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos, et al.. The max quasi-independent set problem. 2010. ⟨hal-00880207⟩
  • Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos. Approximating the max edge-coloring problem. 2009. ⟨hal-00877049⟩
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Exact algorithms for dominating clique problems. 2009. ⟨hal-00877043⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. van Rooij. Fast algorithms for max independent set. 2009. ⟨hal-00880187⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation of MIN SET COVER by "low-complexity" exponential algorithms. 2008. ⟨hal-00906972⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. van Rooij. Fast algorithms for max independent set in graphs of small average degree. 2008. ⟨hal-00907043⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation of MIN COLORING by moderately exponential algorithms. 2008. ⟨hal-00906946⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. An improved exact algorithm for maximum independent set in sparse graphs. 2008. ⟨hal-00203163⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, J. M. M. van Rooij. Fast algorithms for MAX INDEPENDENT SET in graphs of small average degree. 2008. ⟨hal-00321618⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Effcient approximation by “low-complexity” exponential algorithms. 2008. ⟨hal-00203156⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. An improved exact algorithm for maximum independent set in sparse graphs. 2008. ⟨hal-00907599⟩
  • Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cecile Murat, Vangelis Paschos. Probabilistic graph-coloring in bipartite and split graphs. 2007. ⟨hal-00909484⟩
  • Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Efficient approximation by "low-complexity" exponential algorithms. 2007. ⟨hal-00907607⟩