Nicolas Bourgeois

	2012
18		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)
17		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)
	2011
16		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discrete Applied Mathematics 159(17): 1954-1970 (2011)
	2010
15		Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié: The max quasi-independent set Problem. CSR 2010: 60-71
14		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261
13		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
12		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
11		Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010)
	2009
10		Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos: Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13
9		Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos: Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94
8		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518
7		Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos: Greedy Algorithms For On-Line Set-Covering. Algorithmic Operations Research 4(1): 36-48 (2009)
6		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)
5		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Fast algorithms for min independent dominating set CoRR abs/0905.1993: (2009)
4		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009)
3		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)
2		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)
	2008
1		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

1	Giorgio Ausiello	[7]
2	Federico Della Croce	[3] [10]
3	Bruno Escoffier	[1] [2] [3] [4] [5] [6] [8] [10] [12] [13] [14] [16] [18]
4	Aristotelis Giannakos (Telis Giannakos)	[7] [15] [17]
5	Giorgio Lucarelli	[9] [11] [15] [17]
6	Ioannis Milis	[9] [11] [15] [17]
7	Cécile Murat	[3]
8	Vangelis Th. Paschos	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18]
9	O. Pottié	[15] [17]
10	Johan M. M. van Rooij	[6] [12] [13] [18]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page