Publications
Réunions Problèmes Participants |
Publis /
Publis10Publis.Publis10 HistoryHide minor edits - Show changes to markup November 19, 2013, at 06:20 PM
by
- Changed lines 42-43 from:
to:
Deleted line 109:
November 08, 2012, at 07:39 PM
by
- Added lines 57-59:
February 01, 2011, at 11:08 AM
by
- Changed lines 80-82 from:
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:
February 01, 2011, at 11:08 AM
by
- Added lines 78-82:
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
- Added lines 57-60:
January 17, 2011, at 01:40 PM
by
- Added lines 16-17:
January 17, 2011, at 01:36 PM
by
- Added lines 22-25:
January 17, 2011, at 01:32 PM
by
- 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:
January 17, 2011, at 01:32 PM
by
- 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
- Changed lines 44-46 from:
to:
January 17, 2011, at 01:27 PM
by
- Changed lines 44-45 from:
to:
Changed line 48 from:
to:
January 17, 2011, at 01:25 PM
by - January 17, 2011, at 01:21 PM
by
- Added lines 33-34:
January 17, 2011, at 01:19 PM
by
- Changed lines 19-21 from:
to:
January 17, 2011, at 01:17 PM
by
- Added line 35:
January 13, 2011, at 04:34 PM
by
- Changed lines 58-60 from:
to:
Added lines 62-65:
January 13, 2011, at 04:32 PM
by
- Changed lines 17-19 from:
Exact exponential-time algorithms for finding bicliques, Information Processing Letters 111 (2010), pp. 64-67. to:
January 13, 2011, at 04:31 PM
by
- Added lines 15-21:
Exact exponential-time algorithms for finding bicliques, Information Processing Letters 111 (2010), pp. 64-67. January 11, 2011, at 11:14 AM
by
- Changed lines 50-51 from:
fichier PDF to:
January 11, 2011, at 11:14 AM
by
- Changed lines 37-40 from:
to:
Added lines 48-52:
fichier PDF January 11, 2011, at 11:11 AM
by
- Changed line 39 from:
to:
January 11, 2011, at 11:10 AM
by
- Changed line 26 from:
to:
January 11, 2011, at 11:08 AM
by
- Added lines 24-26:
January 11, 2011, at 10:44 AM
by
- Changed line 14 from:
Articles dans des revuesto:
Articles dans des revues internationalesJanuary 05, 2011, at 11:44 AM
by
- Changed line 58 from:
to:
January 05, 2011, at 11:43 AM
by
- Added lines 55-58:
January 05, 2011, at 11:31 AM
by
- Changed lines 52-53 from:
Rapports de recherchesto:
Rapports de recherchesJanuary 05, 2011, at 11:29 AM
by
- Changed lines 42-43 from:
International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478. to:
January 05, 2011, at 11:28 AM
by
- Added lines 39-43:
International Symposium on Parameterized and Exact Computation(IPEC), Springer-Verlag, 2010, Berlin, LNCS 6478. January 04, 2011, at 07:01 PM
by
- Added lines 39-40:
January 04, 2011, at 06:59 PM
by
- Added line 16:
January 04, 2011, at 06:54 PM
by
- Changed lines 39-42 from:
and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345. to:
Changed lines 55-56 from:
INRIA Research Report RR-7241, Mar. 2010. fichier PDF to:
January 04, 2011, at 06:54 PM
by
- Changed lines 20-22 from:
Theoretical Computer Science 411: 1045-1053, 2010. to:
Changed lines 40-51 from:
and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} Springer-Verlag, 2010, Berlin, LNCS 6139, pp. 334-345.
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.
Changed lines 50-65 from:
Cop and robber games when the robber can hide and ride. INRIA Research Report RR-7178, Jan. 2010. fichier PDF
New bounds on the Grundy number of products of graphs. INRIA Research Report RR-7243, Apr. 2010. fichier PDF
How to beat the random walk when you have a clock? INRIA Research Report RR-7210, Feb. 2010. fichier PDF to:
Changed lines 57-64 from:
INRIA Research Report RR-7241, Mar. 2010. fichier PDF
Reducing Multicut to bounded treewidth. submitted. to:
INRIA Research Report RR-7241, Mar. 2010. fichier PDF
January 04, 2011, at 06:52 PM
by
- Changed lines 9-13 from:
Hardcover, 204 p., Springer, 2010. to:
Changed lines 23-29 from:
Information Processing Letters 110: 702-706, 2010.
Journal of Discrete Algorithms, 2010. fichier PDF to:
Changed lines 34-45 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.
reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. fichier PDF
``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50. to:
January 04, 2011, at 06:50 PM
by
- Changed lines 22-23 from:
Iterative compression and exact algorithms. to:
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.
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.
reconfiguration problem. Fifth International conference on Fun with Algorithms (FUN 2010), Lecture Notes in Computer Science, to appear, 2010. Changed lines 46-59 from:
Colorings with few colors: counting, enumeration and combinatorial bounds. ``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} to:
``Proceedings of WG 2010'', Springer-Verlag, 2010, Berlin, LNCS 6410, pp. 39--50.
and Disjoint Rectangle Stabbing. Proceedings of SWAT 2010} January 04, 2011, at 06:48 PM
by
- Changed lines 9-10 from:
Texts in Computer Science, An EATCS Series, to:
Changed lines 27-29 from:
Parameterized algorithm for eternal vertex cover, to:
Changed lines 41-42 from:
D. Kratsch, A. Langer, M. Liedloff, and to:
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
- Changed line 9 from:
to:
Changed lines 20-23 from:
[3] F. Fomin, S. Gaspers, D. Kratsch, M. Liedloff and S. Saurabh, to:
Changed line 28 from:
[4] F. Fomin, S. Gaspers, P. Golovach, D. Kratsch, and S. Saurabh. to:
Changed line 34 from:
[5] I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. to:
Changed line 44 from:
[6] D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, to:
Changed line 54 from:
[7] N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno and N. Nisse. to:
Changed line 62 from:
[8] P.A. Golovach, D. Kratsch, and J.F. Couturier. to:
Changed line 70 from:
[9] P. Heggernes, D. Kratsch, D. Lokshtanov, V. Raman, and S. Saurabh. to:
Changed line 78 from:
[10] F. Huc, C. Caillouet, N. Nisse, S. Pérennes and H. Rivano. to:
Changed line 88 from:
J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. to:
Changed line 93 from:
V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. to:
Changed line 98 from:
N. Hanusse, D. Ilcinkas, A. Kosowski and N. Nisse. to:
Changed line 104 from:
F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. to:
Changed lines 110-112 from:
J. Daligault, C. Paul, A. Perez and S. Thomassé. to:
January 04, 2011, at 06:45 PM
by
- Changed line 9 from:
[1] F.V. Fomin, D. Kratsch, Exact Exponential Algorithms, to:
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:
January 04, 2011, at 06:10 PM
by
- Changed line 38 from:
<br> to:
\\ January 04, 2011, at 06:10 PM
by
- Changed lines 14-15 from:
<br> to:
\\ January 04, 2011, at 06:10 PM
by
- Changed lines 14-15 from:
to:
<br> Added lines 36-37:
<br> January 04, 2011, at 06:09 PM
by
- Changed lines 4-8 from:
Publications 2010 dans le cadre du projet AGAPELivreto:
Publications 2010 dans le cadre du projet AGAPELivreChanged 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érencesto:
Proceedings de conférencesChanged 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
- 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
- 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
- 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
- Changed line 9 from:
to:
[#] F.V. Fomin, D. Kratsch, Changed line 19 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 158(16): 1777-1788, 2010. fichier PDF January 04, 2011, at 06:03 PM
by
- Changed line 9 from:
# F.V. Fomin, D. Kratsch, to:
January 04, 2011, at 06:02 PM
by
- 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:
January 04, 2011, at 05:54 PM
by
- 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
- Changed lines 7-8 from:
LIVREto:
LivreChanged 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 revuesN. 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érencesD. 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 recherchesJ. 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
- Added lines 7-17:
LIVREF.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
- 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
- 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
- Added lines 25-27:
April 05, 2010, at 08:24 PM
by - April 05, 2010, at 07:25 PM
by
- 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 - April 04, 2010, at 02:04 PM
by
- 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
- 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
- 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
- Added lines 1-6:
(:notitle:) Publications 2010 dans le cadre du projet AGAPEMarch 31, 2010, at 10:00 AM
by
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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] |