Nicolas Bourgeois - Citegraph

Author Info

Name	Affiliation	Papers
NICOLAS BOURGEOIS	LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, France	17
Collaborators	Citations	PageRank
23	99	7.96
Referers	Referees	References
131	222	206

Search Limit

100222

Publications (17 rows)

Collaborators (23 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
How to improve robustness in Kohonen maps and display additional information in Factorial Analysis: Application to text mining.	3	0.39	2015
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model	0	0.34	2015
Search for Meaning Through the Study of Co-occurrences in Texts.	0	0.34	2015
Exact and Approximation Algorithms for Densest k-Subgraph.	8	0.51	2013
Exponential approximation schemata for some network design problems	2	0.36	2013
Playing with Parameters: Cross-parameterization in Graphs.	0	0.34	2013
Lexical Recount between Factor Analysis and Kohonen Map: Mathematical Vocabulary of Arithmetic in the Vernacular Language of the Late Middle Ages.	1	0.37	2012
Fast Algorithms for max independent set	25	1.05	2012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms	24	0.73	2011
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n)	1	0.36	2010
A bottom-up method and fast algorithms for MAX INDEPENDENT SET	3	0.40	2010
Probabilistic graph-coloring in bipartite and split graphs	3	0.37	2009
Approximating the Max Edge-Coloring Problem	4	0.42	2009
Greedy Algorithms For On-Line Set-Covering	2	0.40	2009
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms	12	0.66	2009
Approximation of min coloring by moderately exponential algorithms	8	0.46	2009
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree	3	0.46	2009

1