Recent Changes - Search:

Publications

Réunions

Problèmes

Participants

PmWiki

pmwiki.org

edit SideBar

Publis13

Publis.Publis13 History

Hide minor edits - Show changes to markup

November 30, 2013, at 09:44 PM by 78.234.49.18 -
Added lines 15-16:
  1. S. Bessy and A. Perez. Polynomial kernels for Proper Interval Completion and related problems. Information and Computation, 231:89-108, 2013.
Deleted line 20:
Deleted line 22:
Added line 74:
  1. A. Perez. Linear vertex-kernels for several dense Ranking r-Constraint Satisfaction Problems. TAMC 2013, volume 7876 of LNCS, pages 306-318, 2013.
November 28, 2013, at 02:04 PM by 83.113.82.170 -
Changed line 29 from:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
to:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems. Algorithmica, 65(4):900--926, 2013.
November 28, 2013, at 02:02 PM by 83.113.82.170 -
Changed lines 11-12 from:
  1. J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares: On the hull number of some graph classes. Theor. Comput. Sci. 475: 1-12, 2013.
to:
  1. J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares: On the hull number of some graph classes. Theor. Comput. Sci. 475: 1-12, 2013.
Changed line 44 from:
  1. L. Blin, J. Burman and N. Nisse: Exclusive Graph Searching. In Proceedings of ESA 2013: 181-192, LNCS 8125, 2013.
to:
  1. L. Blin, J. Burman and N. Nisse: Exclusive Graph Searching. In Proceedings of ESA 2013: 181-192, LNCS 8125, 2013.
November 25, 2013, at 06:20 PM by 192.245.60.132 -
November 25, 2013, at 06:20 PM by 192.245.60.132 -
Added lines 11-12:
  1. J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares: On the hull number of some graph classes. Theor. Comput. Sci. 475: 1-12, 2013.
Changed lines 44-46 from:
to:
  1. L. Blin, J. Burman and N. Nisse: Exclusive Graph Searching. In Proceedings of ESA 2013: 181-192, LNCS 8125, 2013.
Added lines 60-61:
  1. F. Giroire, D. Mazauric, N. Nisse, S. Pérennes and R. Soares: Connected Surveillance Game. In Proceedings of SIROCCO 2013: 68-79, LNCS 8179, 2013.
November 25, 2013, at 06:07 PM by Mathieu -
Changed lines 43-44 from:
  1. M. Chapelle, M. Cochefert, J.-F. Couturier, D. Kratsch, A. Perez, and M. Liedloff.

Exact Algorithms for Weak Roman Domination,In Proceedings of IWOCA 2013, to appear.

to:
  1. M. Chapelle, M. Cochefert, J.-F. Couturier, D. Kratsch, A. Perez, and M. Liedloff. Exact Algorithms for Weak Roman Domination, In Proceedings of IWOCA 2013, to appear.
November 25, 2013, at 06:06 PM by Mathieu - ajout de qq références
Added lines 29-30:
  1. K. Junosza-Szaniawski, J. Kratochvíl, M. Liedloff, P. Rossmanith, P. Rzazewski. Fast exact algorithm for L(2, 1)-labeling of graphs. Theoretical Computer Science, 505: 42--54, 2013.
Added lines 53-54:
  1. J.-F. Couturier, M. Liedloff. A tight bound on the number of minimal dominating sets in split graph. In Proceedings of the 12th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 67--70, Enschede, The Netherlands, May 2013.
November 25, 2013, at 05:47 PM by 138.96.199.96 -
Added lines 40-44:
  1. M. Chapelle, M. Cochefert, J.-F. Couturier, D. Kratsch, A. Perez, and M. Liedloff.

Exact Algorithms for Weak Roman Domination,In Proceedings of IWOCA 2013, to appear.

Changed line 57 from:
  1. P. A. Golovach, P. Heggernes, D. Kratsch, and Y. Villanger. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. In ICALP 2013, volume 7965 of LNCS, pages 485--496, Riga, Latvia, July 2013.
to:
  1. P. A. Golovach, P. Heggernes, D. Kratsch, and Y. Villanger. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 485--496, Riga, Latvia, July 2013.
November 25, 2013, at 05:44 PM by 138.96.199.96 -
Added lines 45-48:
  1.  M. Cochefert, J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. Sparse square roots. In Proceedings of WG 2013, volume 8165 of LNCS, pages 177--188, 2013.
  2. V. Garnero, I. Sau and D. M. Thilikos. A linear kernel for planar red-blue dominating set. In Proceedings of the 12th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 117--120, Enschede, The Netherlands, May 2013.
Added line 54:
Changed lines 57-58 from:
  1. V. Garnero, I. Sau and D. M. Thilikos. A linear kernel for planar red-blue dominating set. In Proceedings of the 12th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 117--120, Enschede, The Netherlands, May 2013.
to:
  1. D. Kratsch and S. Kratsch. The jump number problem: exact and parameterized. In Proceedings of IPEC 2013, volume 8246 of LNCS, pages 230 -- 242, 2013.
November 25, 2013, at 05:41 PM by 138.96.199.96 -
Added lines 43-46:
  1. P. A. Golovach, P. Heggernes, D. Kratsch, and A. Rafie. Cliques and Clubs. In CIAC 2013, pages 276--287, Barcelona, Span, May 2013.
November 25, 2013, at 05:39 PM by 138.96.199.96 -
Added lines 43-44:
  1. P. A. Golovach, P. Heggernes, D. Kratsch, and Y. Villanger. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. In ICALP 2013, volume 7965 of LNCS, pages 485--496, Riga, Latvia, July 2013.
November 25, 2013, at 05:36 PM by 138.96.199.96 -
Changed line 42 from:
  1. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe. In 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 1--4, Pornic, France, May 2013.
to:
  1. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe. In 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 1--4, Pornic, France, May 2013.
November 25, 2013, at 05:34 PM by 138.96.199.96 -
Changed lines 13-15 from:
  1. H. Broersma, D. Kratsch, G. J. Woeginger. Fully decomposable split graphs. Eur. J. Comb. 34(3):567--575, 2013.
  2. J.-F. Couturier, P. A. Golovach, D. Kratsch, M. Liedloff, A. V. Pyatkin. Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4):645--667, 2013.
to:
  1. H. Broersma, D. Kratsch, and G. J. Woeginger. Fully decomposable split graphs. Eur. J. Comb. 34(3):567--575, 2013.
  2. J.-F. Couturier, P. A. Golovach, D. Kratsch, M. Liedloff, and A. V. Pyatkin. Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4):645--667, 2013.
  3. J.-F. Couturier, P. Heggernes, P. van 't Hof, and D. Kratsch. Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487:82--94, 2013.
November 25, 2013, at 05:32 PM by 138.96.199.96 -
Added lines 20-21:
  1. P. A. Golovach, D. Kratsch, D. Paulusma: Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482:20--32, 2013.
November 25, 2013, at 05:31 PM by 138.96.199.96 -
Added lines 14-15:
  1. J.-F. Couturier, P. A. Golovach, D. Kratsch, M. Liedloff, A. V. Pyatkin. Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4):645--667, 2013.
November 25, 2013, at 05:30 PM by 138.96.199.96 -
Added lines 13-14:
  1. H. Broersma, D. Kratsch, G. J. Woeginger. Fully decomposable split graphs. Eur. J. Comb. 34(3):567--575, 2013.
Deleted line 15:
November 25, 2013, at 05:29 PM by 138.96.199.96 -
Added lines 14-16:
  1. F. V. Fomin, F. Grandoni, D. Kratsch, D. Lokshtanov, and S. Saurabh. Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3):584--604, 2013.
November 25, 2013, at 04:31 PM by 138.96.199.96 -
Changed lines 13-14 from:
  1. C. Crespelle and I. Todinca: An O(n^2)-time algorithm for the minimal interval completion problem. "Theoretical Computer Science" 494: 75--85, 2013.
to:
  1. C. Crespelle and I. Todinca: An O(n^2)-time algorithm for the minimal interval completion problem. Theoretical Computer Science 494: 75--85, 2013.
Changed lines 28-31 from:
  1. M. Chapelle, M. Liedloff, I. Todinca and Yngve Villanger. Treewidth and Pathwidth Parameterized by the Vertex Cover Number. In "WADS 2013", p. 232--243.
  2. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe. In ``15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)'', pages 1--4, Pornic, France, May 2013.
to:
  1. M. Chapelle, M. Liedloff, I. Todinca and Yngve Villanger. Treewidth and Pathwidth Parameterized by the Vertex Cover Number. In WADS 2013, p. 232--243.
  2. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe. In 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 1--4, Pornic, France, May 2013.
Changed line 41 from:
  1. F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, ``INRIA Research Report'' RR-8286, 2013.
to:
  1. F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, INRIA Research Report RR-8286, 2013.
November 25, 2013, at 04:30 PM by 138.96.199.96 -
Changed lines 9-11 from:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed and S. Thomassé. Oriented trees in digraphs. ``Discrete Mathematics'', 313 (8):967--974, 2013.
  2. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', 25(4):523--535, 2013.
to:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed and S. Thomassé. Oriented trees in digraphs. Discrete Mathematics, 313 (8):967--974, 2013.
  2. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Journal of Combinatorial Optimization, 25(4):523--535, 2013.
November 25, 2013, at 04:30 PM by 138.96.199.96 -
Changed lines 30-31 from:
  1. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe.

In ``15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)'', pages 1--4, Pornic, France, May 2013.

to:
  1. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe. In ``15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)'', pages 1--4, Pornic, France, May 2013.
November 25, 2013, at 04:29 PM by 138.96.199.96 -
November 25, 2013, at 04:29 PM by 138.96.199.96 -
Changed lines 28-31 from:
  1. M. Chapelle, M. Liedloff, I. Todinca and Yngve Villanger: Treewidth and Pathwidth Parameterized by the Vertex Cover Number. In "WADS 2013", p. 232--243.
to:
  1. M. Chapelle, M. Liedloff, I. Todinca and Yngve Villanger. Treewidth and Pathwidth Parameterized by the Vertex Cover Number. In "WADS 2013", p. 232--243.
  2. N. Cohen, D. Coudert, and Aurélien Lancin. Algorithme exact et approché pour le calcul de l’hyperbolicité d’un graphe.

In ``15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)'', pages 1--4, Pornic, France, May 2013.

November 25, 2013, at 10:19 AM by 194.167.30.129 -
Added lines 13-14:
  1. C. Crespelle and I. Todinca: An O(n^2)-time algorithm for the minimal interval completion problem. "Theoretical Computer Science" 494: 75--85, 2013.
Added line 28:
  1. M. Chapelle, M. Liedloff, I. Todinca and Yngve Villanger: Treewidth and Pathwidth Parameterized by the Vertex Cover Number. In "WADS 2013", p. 232--243.
November 19, 2013, at 06:03 PM by 108.89.209.41 -
Changed line 27 from:
  1. E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613--624, Riga, Latvia, July 2013.
to:
  1. E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613--624, Riga, Latvia, July 2013.
November 19, 2013, at 06:03 PM by 108.89.209.41 -
Changed lines 27-28 from:
  1. E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions.

In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613--624, Riga, Latvia, July 2013.

to:
  1. E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613--624, Riga, Latvia, July 2013.
November 19, 2013, at 06:03 PM by 108.89.209.41 -
Changed line 37 from:
  1. F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, ``INRIA Research Report'' RR-8286, 2013.
to:
  1. F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, ``INRIA Research Report'' RR-8286, 2013.
November 19, 2013, at 06:02 PM by 108.89.209.41 -
Added lines 27-30:
  1. E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions.

In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613--624, Riga, Latvia, July 2013.

  1. V. Garnero, I. Sau and D. M. Thilikos. A linear kernel for planar red-blue dominating set. In Proceedings of the 12th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 117--120, Enschede, The Netherlands, May 2013.
November 19, 2013, at 06:01 PM by 138.96.199.96 -
Changed lines 31-33 from:

Rapports de recherches

to:

Rapports de recherches

  1. F. Havet and A. K. Maia, On disjoint directed cycles with prescribed minimum lengths, ``INRIA Research Report'' RR-8286, 2013.
November 19, 2013, at 05:59 PM by 108.89.209.41 -
Changed lines 15-17 from:
  1. D. Peleg, I. Sau and M. Shalom. On approximating the d-girth of a graph. Discrete Applied Mathematics, 161(16-17):2587--2596, 2013.
  2. J. Rué, I. Sau and D. M. Thilikos. Asymptotic Enumeration of Non-crossing Partitions on Surfaces. Discrete Mathematics, 313(5-6):635--649, 2013.
to:
  1. D. Peleg, I. Sau and M. Shalom. On approximating the d-girth of a graph. Discrete Applied Mathematics, 161(16-17):2587--2596, 2013.
  2. J. Rué, I. Sau and D. M. Thilikos. Asymptotic Enumeration of Non-crossing Partitions on Surfaces. Discrete Mathematics, 313(5-6):635--649, 2013.
November 19, 2013, at 05:59 PM by 108.89.209.41 -
Changed lines 15-20 from:
  1. F. Havet and L. Sampaio. On the Grundy and b-chromatic Numbers of a Graph. Algorithmica,65(4):885--899, 2013.
to:
  1. D. Peleg, I. Sau and M. Shalom. On approximating the d-girth of a graph. Discrete Applied Mathematics, 161(16-17):2587--2596, 2013.
  2. J. Rué, I. Sau and D. M. Thilikos. Asymptotic Enumeration of Non-crossing Partitions on Surfaces. Discrete Mathematics, 313(5-6):635--649, 2013.
November 19, 2013, at 05:55 PM by 138.96.199.96 -
Added line 15:
  1. F. Havet and L. Sampaio. On the Grundy and b-chromatic Numbers of a Graph. Algorithmica,65(4):885--899, 2013.
November 19, 2013, at 05:54 PM by 138.96.199.96 -
Changed line 13 from:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for P`_l_'-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
to:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
November 19, 2013, at 05:53 PM by 138.96.199.96 -
Changed line 13 from:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for P_l_-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
to:
  1. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for P`_l_'-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
November 19, 2013, at 05:53 PM by 138.96.199.96 -
Changed lines 9-13 from:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed and S. Thomassé. Oriented trees in digraphs. Discrete Mathematics, Elsevier, 2013, 313 (8), pp. 967-974
to:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed and S. Thomassé. Oriented trees in digraphs. ``Discrete Mathematics'', 313 (8):967--974, 2013.
  2. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. ``Journal of Combinatorial Optimization'', 25(4):523--535, 2013.
  3. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for P_l_-free edge modi cation problems. Algorithmica, 65(4):900--926, 2013.
November 19, 2013, at 05:50 PM by 138.96.199.96 -
Added lines 8-9:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed and S. Thomassé. Oriented trees in digraphs. Discrete Mathematics, Elsevier, 2013, 313 (8), pp. 967-974
November 19, 2013, at 05:47 PM by 138.96.199.96 -
Changed lines 6-19 from:

Articles dans des revues internationales

to:

Articles dans des revues internationales


Proceedings de conférences


Rapports de recherches

November 19, 2013, at 05:46 PM by 138.96.199.96 -
Changed line 4 from:

Publications 2012 dans le cadre du projet AGAPE

to:

Publications 2013 dans le cadre du projet AGAPE

November 19, 2013, at 05:46 PM by 138.96.199.96 -
Added lines 1-6:

(:notitle:)

Publications 2012 dans le cadre du projet AGAPE

Articles dans des revues internationales

Edit - History - Print - Recent Changes - Search
Page last modified on November 30, 2013, at 09:44 PM