PmWiki | Publis / ToAppear

November 25, 2013, at 05:48 PM by 138.96.199.96 -

Changed lines 15-16 from:

# F. Fomin, I. Todinca and Y. Villanger. Large induced subgraphs via triangulations and CMSO. To appear in ``SODA 2014''.

to:

Changed lines 36-38 from:

# M. Cochefert and D. Kratsch.
Exact algorithms to clique-colour graphs. In Proceedings of ''SOFSEM 2014'', to appear.

to:

# M. Cochefert and D. Kratsch. Exact algorithms to clique-colour graphs. In Proceedings of ''SOFSEM 2014'', to appear.

# F. Fomin, I. Todinca and Y. Villanger. Large induced subgraphs via triangulations and CMSO. To appear in ''SODA 2014''.

November 25, 2013, at 05:48 PM by 138.96.199.96 -

Changed lines 33-35 from:

to:

\\

!! Proceedings de conférences

November 25, 2013, at 05:47 PM by 138.96.199.96 -

Added lines 31-36:

# M. Cochefert and D. Kratsch.
Exact algorithms to clique-colour graphs. In Proceedings of ''SOFSEM 2014'', to appear.

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

Changed lines 15-16 from:

# F. Fomin, I. Todinca and Y. Villanger. Large induced subgraphs via triangulations and CMSO. To appear in "SODA 2014".

to:

# F. Fomin, I. Todinca and Y. Villanger. Large induced subgraphs via triangulations and CMSO. To appear in ``SODA 2014''.

Deleted line 30:

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

Changed lines 13-14 from:

# J. Durand-Lose. Abstract Geometrical Computation 7: Geometrical accumulations and computably enumerable real numbers. ``Natural Computing'' to appear

to:

# J. Durand-Lose. Abstract Geometrical Computation 7: Geometrical accumulations and computably enumerable real numbers. ``Natural Computing'' to appear.

# F. Fomin, I. Todinca and Y. Villanger. Large induced subgraphs via triangulations and CMSO. To appear in "SODA 2014".

Changed lines 24-25 from:

to:

# M. Liedloff, Ioan Todinca and Y. Villanger. Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. To appear in ''Discrete Applied Mathematics''.

Deleted line 30:

November 19, 2013, at 05:56 PM by 138.96.199.96 -

Changed lines 11-13 from:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', to appear.

to:

Deleted lines 16-18:

# S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for Pl -free edge modification problems. Algorithmica, to appear.

# F. Havet and L. Sampaio. On the Grundy and b-chromatic numbers of a Graph. ``Algorithmica'', to appear.

November 19, 2013, at 05:54 PM by 108.89.209.41 -

Changed lines 31-32 from:

to:

# J. Rué, I. Sau and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. To appear in ''ACM Transactions on Algorithms''.

November 19, 2013, at 05:53 PM by 108.89.209.41 -

Changed lines 29-31 from:

to:

# N. Bousquet, D. Gonçalves, G. B. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized Domination in Circle Graphs. To appear in ''Theory of Computing Systems''.

Deleted line 32:

November 09, 2012, at 08:55 PM by 209.87.57.176 -

Changed line 24 from:

# P. Heggernes, P. van't Hof, B. L\'evêque}, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. ``Algorithmica'', to appear.

to:

# P. Heggernes, P. van't Hof, B. Lévêque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. ``Algorithmica'', to appear.

November 09, 2012, at 08:54 PM by 209.87.57.176 -

Added lines 13-14:

# J. Durand-Lose. Abstract Geometrical Computation 7: Geometrical accumulations and computably enumerable real numbers. ``Natural Computing'' to appear

November 08, 2012, at 07:14 PM by 142.58.8.150 -

Added lines 21-23:

# P. Heggernes, P. van't Hof, B. L\'evêque}, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. ``Algorithmica'', to appear.

November 08, 2012, at 07:11 PM by 142.58.8.150 -

Changed lines 12-13 from:

# S. Bessy et al. Kernels for feedback arc set in tournaments. To appear in ''Journal of Computer and System Sciences''.

to:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', to appear.

November 08, 2012, at 07:10 PM by 142.58.8.150 -

Deleted line 11:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', to appear.

November 07, 2012, at 05:41 PM by 96.49.228.84 -

Added lines 15-16:

# D. Gonçalves and E.J. Kim. On Exact Algorithms for Permutation CSP. ``Theoretical Computer Science'', to appear.

November 07, 2012, at 02:06 AM by 96.49.228.84 -

Deleted lines 15-18:

# F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time algorithms for generalized domination. To appear in ''Algorithmica''.

# S. Gaspers, D. Kratsch, and M. Liedloff. On independent sets and bicliques. To appear in ''Algorithmica''.

November 07, 2012, at 01:21 AM by 142.58.8.150 -

Changed lines 12-13 from:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular
graph. ``Journal of Combinatorial Optimization'', to appear.

to:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', to appear.

November 07, 2012, at 01:20 AM by 142.58.8.150 -

Changed lines 21-24 from:

# S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels
for Pl -free edge modification problems. Algorithmica, to appear.

F. Havet and L. Sampaio. On the Grundy and b-chromatic numbers of a Graph. ``Algorithmica'', to appear.

to:

# S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for Pl -free edge modification problems. Algorithmica, to appear.

# F. Havet and L. Sampaio. On the Grundy and b-chromatic numbers of a Graph. ``Algorithmica'', to appear.

November 07, 2012, at 01:20 AM by 142.58.8.150 -

Added lines 23-24:

F. Havet and L. Sampaio. On the Grundy and b-chromatic numbers of a Graph. ``Algorithmica'', to appear.

November 07, 2012, at 01:19 AM by 142.58.8.150 -

Changed lines 12-14 from:

to:

# S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular
graph. ``Journal of Combinatorial Optimization'', to appear.

Added lines 20-22:

# S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels
for Pl -free edge modification problems. Algorithmica, to appear.

November 07, 2012, at 01:12 AM by 142.58.8.150 -

Deleted lines 17-20:

# D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. To appear in ''Discrete Applied Mathematics''.

# F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in ''Discrete Applied Mathematics''. [[http://hal.archives-ouvertes.fr/docs/00/46/87/34/PDF/RR-7241.pdf | fichier PDF]]

November 07, 2012, at 01:10 AM by 142.58.8.150 -

Deleted line 12:

Deleted lines 13-14:

# V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. To appear in ''Journal of Graph Theory''. [[http://hal.archives-ouvertes.fr/docs/00/47/01/58/PDF/RR-7243.pdf | fichier PDF]]

November 07, 2012, at 01:08 AM by 142.58.8.150 -

Deleted lines 11-12:

# J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. To appear in''Theoretical Computer Science''.

November 06, 2012, at 08:39 PM by 82.240.160.51 -

Deleted lines 18-19:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 63(1-2):158-190, 2012.

November 06, 2012, at 08:28 PM by 82.240.160.51 -

Changed line 20 from:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 2011, to appear.

to:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 63(1-2):158-190, 2012.

July 28, 2011, at 09:33 AM by 90.37.185.152 -

Added lines 11-14:

# J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. To appear in''Theoretical Computer Science''.

July 11, 2011, at 01:28 PM by 138.96.199.96 -

Changed lines 22-24 from:

# F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in ''Discrete Apllied Mathematics''. [[http://hal.archives-ouvertes.fr/docs/00/46/87/34/PDF/RR-7241.pdf | fichier PDF]]

to:

# D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. To appear in ''Discrete Applied Mathematics''.

# F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in ''Discrete Applied Mathematics''. [[http://hal.archives-ouvertes.fr/docs/00/46/87/34/PDF/RR-7241.pdf | fichier PDF]]

July 11, 2011, at 01:23 PM by 138.96.199.96 -

Added lines 14-15:

# V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. To appear in ''Journal of Graph Theory''. [[http://hal.archives-ouvertes.fr/docs/00/47/01/58/PDF/RR-7243.pdf | fichier PDF]]

Added lines 21-22:

# F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in ''Discrete Apllied Mathematics''. [[http://hal.archives-ouvertes.fr/docs/00/46/87/34/PDF/RR-7241.pdf | fichier PDF]]

July 11, 2011, at 01:02 PM by 138.96.199.96 -

Added lines 14-15:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 2011, to appear.

Changed lines 25-26 from:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 2011, to appear.

to:

July 11, 2011, at 01:02 PM by 138.96.199.96 -

Added lines 21-24:

# D. Coudert, F. Huc, and D. Mazauric. [[http://hal.inria.fr/docs/00/58/78/19/PDF/paper-noformat.pdf | A distributed algorithm for computing and updating the process number of a forest]]. Algorithmica, 2011, to appear.

July 11, 2011, at 01:00 PM by 138.96.199.96 -

Changed lines 14-15 from:

# F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time
algorithms for generalized domination. To appear in ''Algorithmica''.

to:

# F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time algorithms for generalized domination. To appear in ''Algorithmica''.

July 11, 2011, at 01:00 PM by 138.96.199.96 -

Changed lines 15-16 from:

algorithms for generalized domination.
To appear in ''Algorithmica''.

to:

algorithms for generalized domination. To appear in ''Algorithmica''.

July 11, 2011, at 12:59 PM by 138.96.199.96 -

Added lines 10-11:

# I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. To appear in ''Algorithmica''.

Added lines 19-24:

# G. B. Mertzios, I. Sau, and S. Zaks. The Recognition of Tolerance and Bounded Tolerance Graphs. To appear in ''SIAM Journal on Computing''.

# I. Sau and D. M. Thilikos. On Self-duality of Branchwidth in Graphs of Bounded Genus. To appear in ''Discrete Applied Mathematics''.

July 11, 2011, at 12:15 PM by 138.96.199.96 -

Added line 17:

July 11, 2011, at 11:56 AM by 138.96.199.96 -

Deleted lines 10-11:

# J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. [[http://hal.archives-ouvertes.fr/inria-00448243/fr/ | Cop and robber games when the robber can hide and ride]]. To appear in ''SIAM Journal of Discrete Mathematics''.

January 26, 2011, at 02:00 PM by 138.96.199.96 -

Deleted line 19:

# F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs. To appear in ''Algorithmica''.

January 17, 2011, at 01:43 PM by 138.96.195.232 -

Added lines 8-10:

# S. Bessy et al. Kernels for feedback arc set in tournaments. To appear in ''Journal of Computer and System Sciences''.

January 11, 2011, at 11:19 AM by 138.96.199.96 -

Changed lines 4-7 from:

!!Publications à paraitre dans le cadre du projet AGAPE

!!! Articles dans des revues internationales

to:

!Publications à paraitre dans le cadre du projet AGAPE

!! Articles dans des revues internationales

January 11, 2011, at 11:05 AM by 138.96.199.96 -

Changed lines 17-18 from:

# F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs,
To appear in ''Algorithmica''.

to:

# F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs. To appear in ''Algorithmica''.

January 11, 2011, at 11:02 AM by 138.96.199.96 -

Changed lines 9-10 from:

# J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. [[http://hal.archives-ouvertes.fr/inria-00448243/fr/ | Cop and
robber games when the robber can hide and ride]]. To appear in ''SIAM Journal of Discrete Mathematics''.

to:

# J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. [[http://hal.archives-ouvertes.fr/inria-00448243/fr/ | Cop and robber games when the robber can hide and ride]]. To appear in ''SIAM Journal of Discrete Mathematics''.

January 11, 2011, at 11:02 AM by 138.96.199.96 -

January 11, 2011, at 11:01 AM by 138.96.199.96 -

Changed lines 7-12 from:

F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time

to:

!!! Articles dans des revues internationales

# J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. [[http://hal.archives-ouvertes.fr/inria-00448243/fr/ | Cop and
robber games when the robber can hide and ride]]. To appear in ''SIAM Journal of Discrete Mathematics''.

# F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time

Changed lines 16-18 from:

S. Gaspers, D. Kratsch, and M. Liedloff. On independent sets and bicliques. To appear in ''Algorithmica''.

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs,

to:

# S. Gaspers, D. Kratsch, and M. Liedloff. On independent sets and bicliques. To appear in ''Algorithmica''.

# F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs,

January 04, 2011, at 05:59 PM by 138.96.199.96 -

Changed line 13 from:

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for $L(2,1)$-labeling of graphs,

to:

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs,

January 04, 2011, at 05:59 PM by 138.96.199.96 -

Changed line 7 from:

F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge~:~Moderately exponential-time

to:

F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge : Moderately exponential-time

January 04, 2011, at 05:57 PM by 138.96.199.96 -

Changed lines 7-12 from:

to:

F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff. Branch and Recharge~:~Moderately exponential-time
algorithms for generalized domination.
To appear in ''Algorithmica''.

S. Gaspers, D. Kratsch, and M. Liedloff. On independent sets and bicliques. To appear in ''Algorithmica''.

Changed lines 14-24 from:

to appear in ''Algorithmica''.

F.V. Fomin, P.A. Golovach,
J. Kratochvil, D. Kratsch, M. Liedloff,
Branch and Recharge~:~Moderately exponential-time
algorithms for generalized domination,
to appear in {\em Algorithmica}.

S. Gaspers, D. Kratsch,
M. Liedloff, On independent sets and bicliques,
to appear in {\em Algorithmica}.

to:

To appear in ''Algorithmica''.

January 04, 2011, at 05:55 PM by 138.96.199.96 -

Changed lines 8-10 from:

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff.
Exact algorithms for $L(2,1)$-labeling of graphs,
to appear in ``Algorithmica''.

to:

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for $L(2,1)$-labeling of graphs,
to appear in ''Algorithmica''.

January 04, 2011, at 05:55 PM by 138.96.199.96 -

Added lines 6-20:

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff.
Exact algorithms for $L(2,1)$-labeling of graphs,
to appear in ``Algorithmica''.

F.V. Fomin, P.A. Golovach,
J. Kratochvil, D. Kratsch, M. Liedloff,
Branch and Recharge~:~Moderately exponential-time
algorithms for generalized domination,
to appear in {\em Algorithmica}.

S. Gaspers, D. Kratsch,
M. Liedloff, On independent sets and bicliques,
to appear in {\em Algorithmica}.

January 04, 2011, at 05:51 PM by 138.96.199.96 -

Added lines 1-5:

(:notitle:)

!!Publications à paraitre dans le cadre du projet AGAPE

ToAppear

Publis.ToAppear History