default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Bourgeois
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c12]Nicolas Bourgeois, Aurélien Pellet, Marie Puren:
Using Topic Generation Model to explore the French Parliamentary Debates during the early Third Republic (1881-1899). DiPaDA@DHNB 2022: 35-51
2010 – 2019
- 2019
- [i6]Michel Cotte, Florent Laroche
, Matthieu Quantin, Loïc Jeanson, Nicolas Bourgeois:
Analysis of a site's integrity by 3D models and Integrated database, case study : the pic-du-midi high-mountain observatory (France). CoRR abs/1901.06265 (2019) - 2017
- [j14]Laurent Bricteux, S. Zeoli, Nicolas Bourgeois:
Validation and scalability of an open source parallel flow solver. Concurr. Comput. Pract. Exp. 29(21) (2017) - [j13]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. 262(3): 894-903 (2017) - 2015
- [j12]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 147: 120-135 (2015) - [c11]Nicolas Bourgeois, Marie Cottrell, Stéphane Lamassé, Madalina Olteanu:
Search for Meaning Through the Study of Co-occurrences in Texts. IWANN (2) 2015: 578-591 - [i5]Nicolas Bourgeois, R. Catellier, Tom Denat, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model. CoRR abs/1505.04969 (2015) - [i4]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. CoRR abs/1506.07732 (2015) - 2013
- [j11]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4-5): 558-572 (2013) - [j10]Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22: 43-52 (2013) - [c10]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and Approximation Algorithms for Densest k-Subgraph. WALCOM 2013: 114-125 - [i3]Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos:
Playing with Parameters: Cross-parameterization in Graphs. CoRR abs/1309.6144 (2013) - 2012
- [j9]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012) - [j8]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set problem. J. Comb. Optim. 23(1): 94-117 (2012) - [j7]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. Theor. Comput. Sci. 459: 77-88 (2012) - [c9]Nicolas Bourgeois, Marie Cottrell, Benjamin Déruelle, 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. WSOM 2012: 255-264 - 2011
- [j6]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17): 1954-1970 (2011) - 2010
- [j5]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010) - [c8]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set Problem. CSR 2010: 60-71 - [c7]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261 - [c6]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
A Bottom-Up Method and Fast Algorithms for max independent set. SWAT 2010: 62-73 - [c5]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). TAMC 2010: 373-384
2000 – 2009
- 2009
- [j4]Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos:
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4(1): 36-48 (2009) - [j3]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009) - [j2]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - [j1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) - [c4]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 - [c3]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94 - [c2]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518 - [i2]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR abs/0901.1563 (2009) - [i1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. CoRR abs/0905.1993 (2009) - 2008
- [c1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
