November 19, 2013, at 06:20 PM by 108.89.209.41 -

Changed lines 42-43 from:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 2010. fichier PDF

to:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 8(3):330--338, 2010. fichier PDF
J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi and I. Sau. Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM Journal on Discrete Mathematics, 24(2): 400--419, 2010.

Deleted line 109:

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

Added lines 57-59:

C. Crespelle and I. Todinca: An $O(n^2){\mathcal{O}}(n^2)$-time Algorithm for the Minimal Interval Completion Problem. ``Porccedings of TAMC 2010'', pp. 175--186, 2010.

February 01, 2011, at 11:08 AM by 128.93.176.92 -

Changed lines 80-82 from:

C. Lenté, M. Liedloff, E. Neron, A. Soukhal et V. T'Kindt.

 Complexité d'algorithmes exponentiels : application au domaine de l'ordonnancement. ROADEF'2010 : 11ième congrès de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision.

Toulouse, France. 2010.

to:

C. Lenté, M. Liedloff, E. Neron, A. Soukhal et V. T'Kindt. Complexité d'algorithmes exponentiels : application au domaine de l'ordonnancement. ROADEF'2010 : 11ième congrès de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision. Toulouse, France. 2010.

February 01, 2011, at 11:08 AM by 128.93.176.92 -

Added lines 78-82:

C. Lenté, M. Liedloff, E. Neron, A. Soukhal et V. T'Kindt.

 Complexité d'algorithmes exponentiels : application au domaine de l'ordonnancement. ROADEF'2010 : 11ième congrès de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision.

Toulouse, France. 2010.

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

Added lines 57-60:

M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides and N. Yu. Milling a graph with turn costs : a parameterized complexity perspective. Graph Theoretical Concepts in Computer Science - WG , Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 123-134.

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

Added lines 16-17:

S. Bessy, C. Paul, and A. Perez. Polynomial kernels for 3-leaf power graph modification problems. Discrete Applied Mathematics 158:1732-1744, 2010.

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

Added lines 22-25:

J. Daligault, D. Gonçalves, and M. Rao, Diamond-free circle graphs are Helly circle. Discrete Math. 310(4):845-849, 2010.
J. Daligault, G. Gutin, E.-J. Kim, and A. Yeo. FPT algorithms and kernels for the Directed k-Leaf Problem. J. Comput. Syst. Sci. 76:144-152, 2010.

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

Changed line 72 from:

J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, 2010, Berlin, LNCS 6198, pp. 372-383.

to:

J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, 2010, Berlin, LNCS 6198, pp. 372-383.

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

Changed line 72 from:

to:

J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, 2010, Berlin, LNCS 6198, pp. 372-383.

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

Changed lines 44-46 from:

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Proceedings of the 18th Annual European Symposium on Algorithms (ESA), Springer-Verlag, 2010, Berlin, LNCS 6346, pp. 97-109, 2010.

to:

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Faster Parameterized Algorithms for Minor Containment. Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 322-333.
I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Proceedings of the 18th Annual European Symposium on Algorithms (ESA), Springer-Verlag, 2010, Berlin, LNCS 6346, pp. 97-109.

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

Changed lines 44-45 from:

to:

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Proceedings of the 18th Annual European Symposium on Algorithms (ESA), Springer-Verlag, 2010, Berlin, LNCS 6346, pp. 97-109, 2010.

Changed line 48 from:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, Berlin, LNCS 6099, pp. 121-132, 2010. fichier PDF

to:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Springer-Verlag, 2010, Berlin, LNCS 6099, pp. 121-132, 2010. fichier PDF

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

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

Added lines 33-34:

L. Lyaudet, F. Mazoit, and S. Thomassé. Partitions versus sets: A case of duality. European J. Combin. 31:681-687, 2010.

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

Changed lines 19-21 from:

N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Discrete Mathematics, 310(21):3049--3051, 2010. fichier PDF

to:

N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Discrete Mathematics, 310(21):3049-3051, 2010. fichier PDF
J. Daligault, M. Rao, and S. Thomassé. Well-quasi-order of relabel functions. Order 27:301-315, 2010.

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

Added line 35:

S. Thomassé. A quadratic kernel for feedback vertex set. ACM Transactions on Algorithms', 6, Art. 32, 8 pp., 2010.

January 13, 2011, at 04:34 PM by 138.96.199.96 -

Changed lines 58-60 from:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

to:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010}, Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

Added lines 62-65:

M. Liedloff, I. Todinca,and Y. Villanger. Solving Capacitated dominating Set by using Covering by Subsets and Maximum Matching. Proceedings of WG 2010, Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 88-99.

January 13, 2011, at 04:32 PM by 138.96.199.96 -

Changed lines 17-19 from:

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff :

Exact exponential-time algorithms for finding bicliques, Information Processing Letters 111 (2010), pp. 64-67.

to:

D. Binkele-Raible, H. Fernau, S. Gaspers, and M. Liedloff. Exact exponential-time algorithms for finding bicliques. Information Processing Letters 111: 64-67, 2010.

January 13, 2011, at 04:31 PM by 138.96.199.96 -

Added lines 15-21:

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff :

Exact exponential-time algorithms for finding bicliques, Information Processing Letters 111 (2010), pp. 64-67.

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

Changed lines 50-51 from:

N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. Locating a target with an agent guided by unreliable local advice. In Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 355-364, 2010.

fichier PDF

to:

N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. Locating a target with an agent guided by unreliable local advice. In Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 355-364, 2010. fichier PDF

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

Changed lines 37-40 from:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.
N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, Berlin, LNCS 6099, pp. 121-132, 2010, 2010. fichier PDF

to:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311-322.
N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, Berlin, LNCS 6099, pp. 121-132, 2010. fichier PDF

Added lines 48-52:

N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. Locating a target with an agent guided by unreliable local advice. In Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 355-364, 2010.

fichier PDF

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

Changed line 39 from:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF

to:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, Berlin, LNCS 6099, pp. 121-132, 2010, 2010. fichier PDF

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

Changed line 26 from:

F. Fomin, P. Golovach, J. Kratochvil, N. Nisse, and K. Suchan. Pursuing a fast robber on a graph. Theoretical Computer Science 411(7-9): 1167-1181, 2010.

to:

F. Fomin, P. Golovach, J. Kratochvil, N. Nisse, and K. Suchan. Pursuing a fast robber on a graph. Theoretical Computer Science 411(7-9): 1167-1181, 2010. fichier PDF

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

Added lines 24-26:

F. Fomin, P. Golovach, J. Kratochvil, N. Nisse, and K. Suchan. Pursuing a fast robber on a graph. Theoretical Computer Science 411(7-9): 1167-1181, 2010.

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

Changed line 14 from:

Articles dans des revues

to:

Articles dans des revues internationales

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

Changed line 58 from:

J. Bang-Jensen, F. Havet, and N. Trotignon.Finding an induced subdivision of a digraph INRIA Research Report RR-7430, Oct. 2010. fichier PDF

to:

J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph INRIA Research Report RR-7430, Oct. 2010. fichier PDF

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

Added lines 55-58:

J. Bang-Jensen, F. Havet, and N. Trotignon.Finding an induced subdivision of a digraph INRIA Research Report RR-7430, Oct. 2010. fichier PDF

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

Changed lines 52-53 from:

Rapports de recherches

to:

Rapports de recherches

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

Changed lines 42-43 from:

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

International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478.

to:

S. Guillemot, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems. International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478.

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

Added lines 39-43:

G. Gutin, E.-J. Kim, A. Soleimanfallah, S. Szeider, and A. Yeo. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478.
S. Guillemot, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems.

International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478.

January 04, 2011, at 07:01 PM by 138.96.199.96 -

Added lines 39-40:

F. Havet and L. Sampaio. On the Grundy number of a graph. International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478.

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

Added line 16:

N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Discrete Mathematics, 310(21):3049--3051, 2010. fichier PDF

January 04, 2011, at 06:54 PM by 138.96.199.96 -

Changed lines 39-42 from:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number

and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

to:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

Changed lines 55-56 from:

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.

INRIA Research Report RR-7241, Mar. 2010. fichier PDF

to:

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. INRIA Research Report RR-7241, Mar. 2010. fichier PDF

January 04, 2011, at 06:54 PM by 138.96.199.96 -

Changed lines 20-22 from:

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh, Iterative compression and exact algorithms.

Theoretical Computer Science 411: 1045-1053, 2010.

to:

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh, Iterative compression and exact algorithms.Theoretical Computer Science 411: 1045-1053, 2010.

Changed lines 40-51 from:

and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

Stability of a localized and greedy routing algorithm. 12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010. fichier PDF

to:

and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano. Stability of a localized and greedy routing algorithm. 12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010. fichier PDF

Changed lines 50-65 from:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès.

Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178, Jan. 2010. fichier PDF

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray.

New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse.

How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF

to:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178, Jan. 2010. fichier PDF
V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF
N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse. How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF

Changed lines 57-64 from:

INRIA Research Report RR-7241, Mar. 2010. fichier PDF

J. Daligault, C. Paul, A. Perez and S. Thomassé.

Reducing Multicut to bounded treewidth. submitted.

to:

INRIA Research Report RR-7241, Mar. 2010. fichier PDF

J. Daligault, C. Paul, A. Perez and S. Thomassé. Reducing Multicut to bounded treewidth. submitted.

January 04, 2011, at 06:52 PM by 138.96.199.96 -

Changed lines 9-13 from:

F.V. Fomin and D. Kratsch, Exact Exponential Algorithms, Texts in Computer Science, An EATCS Series,

Hardcover, 204 p., Springer, 2010.

to:

F.V. Fomin and D. Kratsch, Exact Exponential Algorithms, Texts in Computer Science, An EATCS Series, Hardcover, 204 p., Springer, 2010.

Changed lines 23-29 from:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh. Parameterized algorithm for eternal vertex cover,

Information Processing Letters 110: 702-706, 2010.

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.

Journal of Discrete Algorithms, 2010. fichier PDF

to:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh. Parameterized algorithm for eternal vertex cover, Information Processing Letters 110: 702-706, 2010.
I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 2010. fichier PDF

Changed lines 34-45 from:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and

P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM

reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF

P.A. Golovach, D. Kratsch, and J.F. Couturier. Colorings with few colors: counting, enumeration and combinatorial bounds.

``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

to:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.
N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF
P.A. Golovach, D. Kratsch, and J.F. Couturier. Colorings with few colors: counting, enumeration and combinatorial bounds.``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

January 04, 2011, at 06:50 PM by 138.96.199.96 -

Changed lines 22-23 from:

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

Iterative compression and exact algorithms.

to:

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh, Iterative compression and exact algorithms.

Deleted line 24:

Deleted line 27:

Changed lines 39-49 from:

P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse.

Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010.

to:

P. Rossmanith. Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, Proceedings of CIAC 2010, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM

reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010.

Changed lines 46-59 from:

P.A. Golovach, D. Kratsch, and J.F. Couturier.

 Colorings with few colors: counting, enumeration and combinatorial bounds.

``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh.

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010}

to:

P.A. Golovach, D. Kratsch, and J.F. Couturier. Colorings with few colors: counting, enumeration and combinatorial bounds.

``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number

and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010}

January 04, 2011, at 06:48 PM by 138.96.199.96 -

Changed lines 9-10 from:

F.V. Fomin and D. Kratsch, Exact Exponential Algorithms,

Texts in Computer Science, An EATCS Series,

to:

F.V. Fomin and D. Kratsch, Exact Exponential Algorithms, Texts in Computer Science, An EATCS Series,

Changed lines 27-29 from:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh.

Parameterized algorithm for eternal vertex cover,

to:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh. Parameterized algorithm for eternal vertex cover,

Changed lines 41-42 from:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis,

D. Kratsch, A. Langer, M. Liedloff, and

to:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and

Changed lines 43-44 from:

irredundance: a parameterized route to solving exact puzzles,

to:

irredundance: a parameterized route to solving exact puzzles,

January 04, 2011, at 06:47 PM by 138.96.199.96 -

Changed line 9 from:

[1] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms,

to:

F.V. Fomin and D. Kratsch, Exact Exponential Algorithms,

Changed lines 20-23 from:

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

[3] F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

to:

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF
F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

Changed line 28 from:

[4] F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh.

to:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh.

Changed line 34 from:

[5] I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.

to:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.

Changed line 44 from:

[6] D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis,

to:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis,

Changed line 54 from:

[7] N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse.

to:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse.

Changed line 62 from:

[8] P.A. Golovach, D. Kratsch, and J.F. Couturier.

to:

P.A. Golovach, D. Kratsch, and J.F. Couturier.

Changed line 70 from:

[9] P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh.

to:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh.

Changed line 78 from:

[10] F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

to:

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

Changed line 88 from:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès.

to:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès.

Changed line 93 from:

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray.

to:

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray.

Changed line 98 from:

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse.

to:

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse.

Changed line 104 from:

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.

to:

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.

Changed lines 110-112 from:

J. Daligault, C. Paul, A. Perez and S. Thomassé.

to:

J. Daligault, C. Paul, A. Perez and S. Thomassé.

January 04, 2011, at 06:45 PM by 138.96.199.96 -

Changed line 9 from:

[1] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms,

to:

[1] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms,

Changed line 20 from:

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

to:

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

January 04, 2011, at 06:10 PM by 138.96.199.96 -

Changed line 38 from:

<br>

to:

\\

January 04, 2011, at 06:10 PM by 138.96.199.96 -

Changed lines 14-15 from:

<br>

to:

\\

January 04, 2011, at 06:10 PM by 138.96.199.96 -

Changed lines 14-15 from:

to:

<br>

Added lines 36-37:

<br>

January 04, 2011, at 06:09 PM by 138.96.199.96 -

Changed lines 4-8 from:

Publications 2010 dans le cadre du projet AGAPE

Livre

to:

Publications 2010 dans le cadre du projet AGAPE

Livre

Changed lines 15-20 from:

Articles dans des revues

[2] -> N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF -<

to:

Articles dans des revues

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

Changed lines 36-39 from:

Proceedings de conférences

to:

Proceedings de conférences

Changed line 50 from:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse.

to:

[7] N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse.

Changed lines 58-60 from:

P.A. Golovach, D. Kratsch, and J.F. Couturier.

to:

[8] P.A. Golovach, D. Kratsch, and J.F. Couturier.

Changed line 66 from:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh.

to:

[9] P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh.

Changed lines 74-75 from:

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

to:

[10] F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

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

Changed line 18 from:

[2] -> N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF <-

to:

[2] -> N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF -<

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

Changed line 18 from:

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

to:

[2] -> N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF <-

January 04, 2011, at 06:04 PM by 138.96.199.96 -

Changed lines 9-10 from:

[#] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms,

to:

[1] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms,

Changed lines 18-21 from:

[#] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

to:

[2] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

[3] F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

Changed lines 26-27 from:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh.

to:

[4] F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh.

Changed lines 32-34 from:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.

to:

[5] I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.

Changed line 40 from:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis,

to:

[6] D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis,

January 04, 2011, at 06:03 PM by 138.96.199.96 -

Changed line 9 from:

F.V. Fomin, D. Kratsch,

to:

[#] F.V. Fomin, D. Kratsch,

Changed line 19 from:

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

to:

[#] N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

January 04, 2011, at 06:03 PM by 138.96.199.96 -

Changed line 9 from:

 # F.V. Fomin, D. Kratsch,

to:

F.V. Fomin, D. Kratsch,

January 04, 2011, at 06:02 PM by 138.96.199.96 -

Changed line 9 from:

F.V. Fomin, D. Kratsch,

to:

 # F.V. Fomin, D. Kratsch,

Changed line 19 from:

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

to:

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

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

Changed line 28 from:

P. Golovach, D. Kratsch, S. Saurabh,

to:

P. Golovach, D. Kratsch, and S. Saurabh.

Added lines 62-80:

P.A. Golovach, D. Kratsch, and J.F. Couturier.

 Colorings with few colors: counting, enumeration and combinatorial bounds.

``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.

Changed lines 122-157 from:

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, S. Saurabh, Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing, {\em Proceedings of SWAT 2010}, Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334--345.

P.A. Golovach, D. Kratsch, J.F. Couturier, Colorings with few colors: counting, enumeration and combinatorial bounds, {\em Proceedings of WG 2010}, Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

ARTICLES ACCEPTES (accesible par Online First)

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff, Exact algorithms for $L(2,1)$-labeling of graphs, to appear in {\em 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:

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

Changed lines 7-8 from:

LIVRE

to:

Livre

Changed lines 16-44 from:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178, Jan. 2010. fichier PDF

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF

J. Daligault, C. Paul, A. Perez and S. Thomassé. Reducing Multicut to bounded treewidth. submitted.

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics, to appear, 2010. fichier PDF

to:

Articles dans des revues

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics 158(16): 1777-1788, 2010. fichier PDF

Changed lines 34-50 from:

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse. How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. INRIA Research Report RR-7241, Mar. 2010. fichier PDF

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano. Stability of a localized and greedy routing algorithm. 12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010. fichier PDF

to:

Changed lines 40-43 from:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, P. Rossmanith, Breaking the $2^n$-barrier for

to:

Proceedings de conférences

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, and P. Rossmanith. Breaking the $2^n$-barrier for

Changed line 49 from:

{\em Proceedings of CIAC 2010},

to:

Proceedings of CIAC 2010,

Added lines 52-101:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano. Stability of a localized and greedy routing algorithm. 12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010. fichier PDF

Rapports de recherches

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178, Jan. 2010. fichier PDF

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse. How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. INRIA Research Report RR-7241, Mar. 2010. fichier PDF

J. Daligault, C. Paul, A. Perez and S. Thomassé. Reducing Multicut to bounded treewidth. submitted.

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

Added lines 7-17:

LIVRE

F.V. Fomin, D. Kratsch, Exact Exponential Algorithms, Texts in Computer Science, An EATCS Series, Hardcover, 204 p., Springer, 2010.

Changed line 45 from:

F.V. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

to:

F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh,

Changed lines 50-56 from:

to:

F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, S. Saurabh, Parameterized algorithm for eternal vertex cover, Information Processing Letters 110: 702-706, 2010.

Added lines 76-124:

D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, P. Rossmanith, Breaking the $2^n$-barrier for irredundance: a parameterized route to solving exact puzzles, {\em Proceedings of CIAC 2010}, Springer-Verlag, 2010, Berlin, LNCS 6078, pp. 311--322.

P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, S. Saurabh, Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing, {\em Proceedings of SWAT 2010}, Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334--345.

P.A. Golovach, D. Kratsch, J.F. Couturier, Colorings with few colors: counting, enumeration and combinatorial bounds, {\em Proceedings of WG 2010}, Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.

ARTICLES ACCEPTES (accesible par Online First)

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff, Exact algorithms for $L(2,1)$-labeling of graphs, to appear in {\em 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}.

April 14, 2010, at 09:27 AM by 138.96.199.96 -

Added lines 23-29:

J. Daligault, C. Paul, A. Perez and S. Thomassé. Reducing Multicut to bounded treewidth. submitted.

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

Added lines 26-29:

F.V. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh, Iterative compression and exact algorithms. Theoretical Computer Science 411: 1045-1053, 2010.

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

Added lines 25-27:

April 05, 2010, at 08:24 PM by 86.209.255.99 -

April 05, 2010, at 07:25 PM by 86.209.255.99 -

Changed lines 13-15 from:

New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010.

to:

New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF

April 05, 2010, at 07:24 PM by 86.209.255.99 -

April 04, 2010, at 02:04 PM by 83.205.234.210 -

Changed lines 12-17 from:

to:

V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010.

Changed line 32 from:

F. Havet, C.Linhares and L. Sampaio. b-coloring of tight graphs.

to:

F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.

April 04, 2010, at 01:59 PM by 83.205.234.210 -

Changed lines 38-39 from:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 2010. fichier PDF

to:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 2010. fichier PDF

March 31, 2010, at 03:49 PM by 138.96.199.96 -

Changed lines 24-29 from:

fichier PDF

to:

fichier PDF

F. Havet, C.Linhares and L. Sampaio. b-coloring of tight graphs. INRIA Research Report RR-7241, Mar. 2010. fichier PDF

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

Added lines 1-6:

(:notitle:)

Publications 2010 dans le cadre du projet AGAPE

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

Changed lines 13-14 from:

to:

N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics, to appear, 2010. fichier PDF

Added line 20:

Added lines 25-28:

I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 2010. fichier PDF

March 29, 2010, at 02:54 PM by 138.96.199.96 -

Changed line 3 from:

INRIA Research Report RR-7178, Jan. 2010.

to:

INRIA Research Report RR-7178, Jan. 2010.

Changed line 10 from:

Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010.

to:

Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010.

Changed line 17 from:

INRIA Research Report RR-7210, Feb. 2010.

to:

INRIA Research Report RR-7210, Feb. 2010.

Changed line 22 from:

12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010.

to:

12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010.

March 29, 2010, at 02:53 PM by 138.96.199.96 -

Changed line 3 from:

"INRIA Research Report RR-7178", Jan. 2010.

to:

INRIA Research Report RR-7178, Jan. 2010.

March 29, 2010, at 02:53 PM by 138.96.199.96 -

Changed lines 2-3 from:

'Cop and robber games when the robber can hide and ride'. INRIA Research Report RR-7178, Jan. 2010.

to:

Cop and robber games when the robber can hide and ride. "INRIA Research Report RR-7178", Jan. 2010.

March 29, 2010, at 02:52 PM by 138.96.199.96 -

Changed line 2 from:

Cop and robber games when the robber can hide and ride.

to:

'Cop and robber games when the robber can hide and ride'.

March 29, 2010, at 02:51 PM by 138.96.199.96 -

Added lines 5-11:

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF

March 29, 2010, at 02:47 PM by 138.96.199.96 -

Deleted line 0:

Changed line 3 from:

INRIA Research Report RR-7178}, Jan. 2010.

to:

INRIA Research Report RR-7178, Jan. 2010.

Changed line 13 from:

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano

to:

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano.

March 29, 2010, at 02:46 PM by 138.96.199.96 -

Deleted line 1:

Changed lines 12-17 from:

fichier PDF

to:

fichier PDF

F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano Stability of a localized and greedy routing algorithm. 12th Workshop on Advances in Parallel and Distributed Computational Models, IEEE, to appear, 2010. fichier PDF

March 29, 2010, at 02:44 PM by 138.96.199.96 -

Added lines 1-9:

J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178}, Jan. 2010. fichier PDF

March 29, 2010, at 02:40 PM by 138.96.199.96 -

Changed lines 1-3 from:

How to beat the random walk when you have a clock? fichier PDF

to:

N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse. How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF

March 29, 2010, at 02:34 PM by 138.96.199.96 -

Changed lines 2-4 from:

[http://hal.inria.fr/inria-00458808/en/}| How to beat the random walk when you have a clock?] [http://hal.inria.fr/inria-00458808/PDF/RR-7210.pdf}|fichier PDF]

to:

How to beat the random walk when you have a clock? fichier PDF

March 29, 2010, at 02:33 PM by 138.96.199.96 -

Added lines 1-4:

[http://hal.inria.fr/inria-00458808/en/}| How to beat the random walk when you have a clock?] [http://hal.inria.fr/inria-00458808/PDF/RR-7210.pdf}|fichier PDF]

Publis10

Publis.Publis10 History

Articles dans des revues

Articles dans des revues internationales

Rapports de recherches

Rapports de recherches

Publications 2010 dans le cadre du projet AGAPE

Livre

Publications 2010 dans le cadre du projet AGAPE

Livre

Articles dans des revues

Articles dans des revues

Proceedings de conférences

Proceedings de conférences

LIVRE

Livre

Articles dans des revues

Proceedings de conférences

Rapports de recherches

LIVRE

Publications 2010 dans le cadre du projet AGAPE