Publications
Réunions Problèmes Participants |
Publis /
ToAppearPublis.ToAppear HistoryShow minor edits - Show changes to markup November 25, 2013, at 05:48 PM
by
- Changed lines 15-16 from:
to:
Changed lines 36-38 from:
Exact algorithms to clique-colour graphs. In Proceedings of SOFSEM 2014, to appear. to:
November 25, 2013, at 05:48 PM
by
- Changed lines 33-35 from:
to:
Proceedings de conférencesNovember 25, 2013, at 05:47 PM
by
- Added lines 31-36:
Exact algorithms to clique-colour graphs. In Proceedings of SOFSEM 2014, to appear. November 25, 2013, at 10:23 AM
by
- Changed lines 15-16 from:
to:
Deleted line 30:
November 25, 2013, at 10:23 AM
by
- Changed lines 13-14 from:
to:
Changed lines 24-25 from:
to:
Deleted line 30:
November 19, 2013, at 05:56 PM
by
- Changed lines 11-13 from:
to:
Deleted lines 16-18:
November 19, 2013, at 05:54 PM
by
- Changed lines 31-32 from:
to:
November 19, 2013, at 05:53 PM
by
- Changed lines 29-31 from:
to:
Deleted line 32:
November 09, 2012, at 08:55 PM
by
- Changed line 24 from:
to:
November 09, 2012, at 08:54 PM
by
- Added lines 13-14:
November 08, 2012, at 07:14 PM
by
- Added lines 21-23:
November 08, 2012, at 07:11 PM
by
- Changed lines 12-13 from:
to:
November 08, 2012, at 07:10 PM
by
- Deleted line 11:
November 07, 2012, at 05:41 PM
by
- Added lines 15-16:
November 07, 2012, at 02:06 AM
by
- Deleted lines 15-18:
November 07, 2012, at 01:21 AM
by
- Changed lines 12-13 from:
graph. ``Journal of Combinatorial Optimization'', to appear. to:
November 07, 2012, at 01:20 AM
by
- Changed lines 21-24 from:
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:
November 07, 2012, at 01:20 AM
by
- 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
- Changed lines 12-14 from:
to:
graph. ``Journal of Combinatorial Optimization'', to appear. Added lines 20-22:
for Pl -free edge modification problems. Algorithmica, to appear. November 07, 2012, at 01:12 AM
by
- Deleted lines 17-20:
November 07, 2012, at 01:10 AM
by
- Deleted line 12:
Deleted lines 13-14:
November 07, 2012, at 01:08 AM
by
- Deleted lines 11-12:
November 06, 2012, at 08:39 PM
by
- Deleted lines 18-19:
November 06, 2012, at 08:28 PM
by
- Changed line 20 from:
to:
July 28, 2011, at 09:33 AM
by
- Added lines 11-14:
July 11, 2011, at 01:28 PM
by
- Changed lines 22-24 from:
to:
July 11, 2011, at 01:23 PM
by
- Added lines 14-15:
Added lines 21-22:
July 11, 2011, at 01:02 PM
by
- Added lines 14-15:
Changed lines 25-26 from:
to:
July 11, 2011, at 01:02 PM
by
- Added lines 21-24:
July 11, 2011, at 01:00 PM
by
- Changed lines 14-15 from:
algorithms for generalized domination. To appear in Algorithmica. to:
July 11, 2011, at 01:00 PM
by
- 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
- Added lines 10-11:
Added lines 19-24:
July 11, 2011, at 12:15 PM
by
- Added line 17:
July 11, 2011, at 11:56 AM
by
- Deleted lines 10-11:
January 26, 2011, at 02:00 PM
by
- Deleted line 19:
January 17, 2011, at 01:43 PM
by
- Added lines 8-10:
January 11, 2011, at 11:19 AM
by
- Changed lines 4-7 from:
Publications à paraitre dans le cadre du projet AGAPEArticles dans des revues internationalesto:
Publications à paraitre dans le cadre du projet AGAPEArticles dans des revues internationalesJanuary 11, 2011, at 11:05 AM
by
- Changed lines 17-18 from:
To appear in Algorithmica. to:
January 11, 2011, at 11:02 AM
by
- Changed lines 9-10 from:
robber games when the robber can hide and ride]]. To appear in SIAM Journal of Discrete Mathematics. to:
January 11, 2011, at 11:02 AM
by - January 11, 2011, at 11:01 AM
by
- 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
robber games when the robber can hide and ride]]. To appear in SIAM Journal of Discrete Mathematics.
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:
January 04, 2011, at 05:59 PM
by
- 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
- 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
- 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
- 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
- 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
- Added lines 1-5:
(:notitle:) Publications à paraitre dans le cadre du projet AGAPE |