PmWiki | Publis / Publis09

November 25, 2013, at 10:13 AM by 194.167.30.129 -

Changed line 35 from:

# Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca: Constructing Brambles. In "MFCS 2009", p. 223-234.

to:

# M. Chapelle, F. Mazoit, I. Todinca: Constructing Brambles. In "MFCS 2009", p. 223-234.

November 25, 2013, at 10:13 AM by 194.167.30.129 -

Changed lines 15-16 from:

to:

# F. V. Fomin, F. Mazoit, and I. Todinca: Computing branchwidth via efficient triangulations and blocks. "Discrete Applied Mathematics" 157(12): 2726-2736, 2009.

Added line 35:

# Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca: Constructing Brambles. In "MFCS 2009", p. 223-234.

January 11, 2011, at 10:57 AM by 138.96.199.96 -

Changed line 10 from:

# O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. [[http://hal.inria.fr/hal-00414326 | Submodular Partition Functions]]. ''Discrete Mathematics'' 309(20): 6000-6008, 2009.

to:

# O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. [[http://hal.inria.fr/hal-00414326 | Submodular Partition Functions]]. ''Discrete Mathematics'' 309(20): 6000-6008, 2009. [[ http://hal.archives-ouvertes.fr/docs/00/41/43/26/PDF/bramble.pdf | fichier PDF]]

January 11, 2011, at 10:56 AM by 138.96.199.96 -

Added lines 10-12:

# O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. [[http://hal.inria.fr/hal-00414326 | Submodular Partition Functions]]. ''Discrete Mathematics'' 309(20): 6000-6008, 2009.

Added line 17:

January 11, 2011, at 10:50 AM by 138.96.199.96 -

Changed line 15 from:

<br>

to:

\\

January 11, 2011, at 10:50 AM by 138.96.199.96 -

Added lines 6-9:

!!Articles dans des revues internationales

Changed lines 13-15 from:

!!Articles dans des revues internationales

to:

# S. Gaspers, D. Kratsch, M. Liedloff, and I. Todinca. Exponential time algorithms for the minimum dominating set problem on some graph classes. ''ACM Transcactions on Algorithms'' 6(1): article 9, 2009.

<br>

Changed lines 37-58 from:

P. Gambette, V. Berry and C. Paul.
The Structure of Level-k Phylogenetic Networks.
In ''CPM 2009'' p. 289-300.

S. Gaspers, D. Kratsch, M. Liedloff and I. Todinca.
Exponential time
algorithms for the minimum dominating set problem on some graph classes.
''ACM Transcactions on Algorithms'' 6(1): article 9, 2009.

P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov, D.Meister and S. Saurabh.
Bandwidth on AT-free graphs.
In '' Proceedings of ISAAC 2009'',
Springer-Verlag, Berlin, ''Lecture Notes in Computer Science'' 5878, pp. 573--582, 2009.

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In ''European Conference on Combinatorics, Graph Theory and Applications'' (Eurocomb 2009), ''Electronic Notes on Discrete Mathematics'' 34:139-143, 2009.
[[ftp://ftp-sop.inria.fr/mascotte/Publications/GHPT09.pdf | fichier PDF]]

to:

# P. Gambette, V. Berry, and C. Paul. The Structure of Level-k Phylogenetic Networks. In ''CPM 2009'' p. 289-300.

# P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov, D.Meister and S. Saurabh. Bandwidth on AT-free graphs. In '' Proceedings of ISAAC 2009'', Springer-Verlag, Berlin, ''Lecture Notes in Computer Science'' 5878, pp. 573--582, 2009.

# D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In ''European Conference on Combinatorics, Graph Theory and Applications'' (Eurocomb 2009), ''Electronic Notes on Discrete Mathematics'' 34:139-143, 2009. [[ftp://ftp-sop.inria.fr/mascotte/Publications/GHPT09.pdf | fichier PDF]]

January 11, 2011, at 10:47 AM by 138.96.199.96 -

Changed lines 6-7 from:

to:

# F.V. Fomin, F. Grandoni, and D. Kratsch. A Measure & Conquer approach for the analysis of exact algorithms. ''Journal of the ACM'' 56(5): article 25, 2009.

Changed lines 12-47 from:

!!A

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomassé.
Kernels for Feedback Arc Set in Tournaments.
In ''FSTTCS 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelFAST.pdf | fichier PDF]]

S. Bessy, C. Paul and A. Perez
Polynomial Kernels for 3-Leaf Power Graph Modification Problems.
In ''IWOCA 2009'' p. 72-82.

H. Bodlaender, S. Thomassé and A. Yeo,
Kernel bounds for disjoint cycles and disjoint paths
In ''ESA '09''.
[[<http://www.lirmm.fr/%7Ethomasse/liste/kernelcycle.pdf> | fichier PDF]]

J. Daligault and S. Thomassé.
On finding directed trees with many leaves.
In ''IWPEC 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelRMLO.pdf | fichier PDF]]

F. Fomin, S. Gaspers, S. Thomassé and S. Saurabh.
A linear vertex kernel for Maximum Internal Spanning Tree.
In ''ISAAC 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelMIST.pdf | fichier PDF]]

F.V. Fomin, F. Grandoni and D. Kratsch.
A Measure & Conquer approach for the analysis of exact
algorithms.
''Journal of the ACM'' 56(5): article 25, 2009.

to:

!!Proceedings de conférences

# S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomassé. Kernels for Feedback Arc Set in Tournaments. In ''FSTTCS 2009''. [[http://www.lirmm.fr/%7Ethomasse/liste/kernelFAST.pdf | fichier PDF]]

# S. Bessy, C. Paul and A. Perez. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. In ''IWOCA 2009'' p. 72-82.

# H. Bodlaender, S. Thomassé and A. Yeo. Kernel bounds for disjoint cycles and disjoint paths. In ''ESA '09'' [[<http://www.lirmm.fr/%7Ethomasse/liste/kernelcycle.pdf> | fichier PDF]]

# J. Daligault and S. Thomassé. On finding directed trees with many leaves. In ''IWPEC 2009''. [[http://www.lirmm.fr/%7Ethomasse/liste/kernelRMLO.pdf | fichier PDF]]

# F. Fomin, S. Gaspers, S. Thomassé and S. Saurabh. A linear vertex kernel for Maximum Internal Spanning Tree. In ''ISAAC 2009''. [[http://www.lirmm.fr/%7Ethomasse/liste/kernelMIST.pdf | fichier PDF]]

January 11, 2011, at 10:45 AM by 138.96.199.96 -

Added lines 6-11:

!!Articles dans des revues internationales

!!A

April 13, 2010, at 05:39 PM by 138.96.199.96 -

Changed line 7 from:

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Thomassé and S. Saurabh.

to:

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomassé.

Added lines 12-30:

S. Bessy, C. Paul and A. Perez
Polynomial Kernels for 3-Leaf Power Graph Modification Problems.
In ''IWOCA 2009'' p. 72-82.

H. Bodlaender, S. Thomassé and A. Yeo,
Kernel bounds for disjoint cycles and disjoint paths
In ''ESA '09''.
[[<http://www.lirmm.fr/%7Ethomasse/liste/kernelcycle.pdf> | fichier PDF]]

J. Daligault and S. Thomassé.
On finding directed trees with many leaves.
In ''IWPEC 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelRMLO.pdf | fichier PDF]]

Deleted lines 36-37:

Added lines 41-45:

P. Gambette, V. Berry and C. Paul.
The Structure of Level-k Phylogenetic Networks.
In ''CPM 2009'' p. 289-300.

April 13, 2010, at 05:14 PM by 138.96.199.96 -

Changed line 13 from:

A 3/k kernel for Maximum Internal Spanning Tree.

to:

A linear vertex kernel for Maximum Internal Spanning Tree.

April 13, 2010, at 05:13 PM by 138.96.199.96 -

Changed line 7 from:

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez et S. Thomassé and S. Saurabh.

to:

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Thomassé and S. Saurabh.

Changed lines 10-15 from:

[[http://www.lirmm.fr/%7Ethomasse/liste/kernelFAST.pdf | fichier PDF]].

to:

[[http://www.lirmm.fr/%7Ethomasse/liste/kernelFAST.pdf | fichier PDF]]

F. Fomin, S. Gaspers, S. Thomassé and S. Saurabh.
A 3/k kernel for Maximum Internal Spanning Tree.
In ''ISAAC 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelMIST.pdf | fichier PDF]]

April 13, 2010, at 05:11 PM by 138.96.199.96 -

Added lines 5-12:

S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez et S. Thomassé and S. Saurabh.
Kernels for Feedback Arc Set in Tournaments.
In ''FSTTCS 2009''.
[[http://www.lirmm.fr/%7Ethomasse/liste/kernelFAST.pdf | fichier PDF]].

April 12, 2010, at 01:09 PM by 138.96.199.96 -

Added lines 5-16:

F.V. Fomin, F. Grandoni and D. Kratsch.
A Measure & Conquer approach for the analysis of exact
algorithms.
''Journal of the ACM'' 56(5): article 25, 2009.

S. Gaspers, D. Kratsch, M. Liedloff and I. Todinca.
Exponential time
algorithms for the minimum dominating set problem on some graph classes.
''ACM Transcactions on Algorithms'' 6(1): article 9, 2009.

April 12, 2010, at 01:08 PM by 138.96.199.96 -

Changed line 14 from:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), ''Electronic Notes on Discrete Mathematics'' 34:139-143, 2009.

to:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In ''European Conference on Combinatorics, Graph Theory and Applications'' (Eurocomb 2009), ''Electronic Notes on Discrete Mathematics'' 34:139-143, 2009.

April 12, 2010, at 01:07 PM by 138.96.199.96 -

Added lines 5-11:

P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov, D.Meister and S. Saurabh.
Bandwidth on AT-free graphs.
In '' Proceedings of ISAAC 2009'',
Springer-Verlag, Berlin, ''Lecture Notes in Computer Science'' 5878, pp. 573--582, 2009.

March 31, 2010, at 10:08 AM by 138.96.199.96 -

Deleted line 0:

Changed line 7 from:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34, Bordeaux, France, September 2009.

to:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), ''Electronic Notes on Discrete Mathematics'' 34:139-143, 2009.

March 31, 2010, at 10:07 AM by 138.96.199.96 -

Changed lines 1-9 from:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34, Bordeaux, France, September 2009.

to:

(:notitle:)

!!Publications 2009 dans le cadre du projet AGAPE

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34, Bordeaux, France, September 2009.
[[ftp://ftp-sop.inria.fr/mascotte/Publications/GHPT09.pdf | fichier PDF]]

March 31, 2010, at 10:04 AM by 138.96.199.96 -

Added line 1:

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34, Bordeaux, France, September 2009.

Publis09

Publis.Publis09 History