Recent Changes - Search:

Publications

Réunions

Problèmes

Participants

PmWiki

pmwiki.org

edit SideBar

Publis /

Publis12

Publis.Publis12 History

Hide minor edits - Show changes to markup

November 28, 2013, at 01:55 PM by 83.113.82.170 -
Changed lines 8-15 from:
to:
  1. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Algorithmica, 64(1): 69--84, 2012.
  2. O. Amini, D. Peleg, S. Pérennes, I. Sau and S. Saurabh. On the Approximability of Some Degree-constrained Subgraph Problems. Discrete Applied Mathematics, 160(12): 1661--1679, 2012.
  3. O. Amini, I. Sau and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs. Journal of Discrete Algorithms, 10: 70--83, 2012.
Added lines 22-23:
  1. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, 444: 3--16, 2012.
Deleted lines 50-52:
  1. O. Amini, D. Peleg, S. Pérennes, I. Sau and S. Saurabh. On the Approximability of Some Degree-constrained Subgraph Problems. Discrete Applied Mathematics, 160(12): 1661--1679, 2012.
Deleted lines 54-58:
  1. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Algorithmica, 64(1): 69--84, 2012.
  2. O. Amini, I. Sau and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs. Journal of Discrete Algorithms, 10: 70--83, 2012.
  3. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, 444: 3--16, 2012.
Restore
November 28, 2013, at 01:42 PM by 83.113.82.170 -
Changed lines 23-33 from:
  1. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. ``Information Processing Letters'' 112: 329--334, 2012.
  2. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. On the parameterized complexity of coloring graphs in the absence of a linear forest. ``Journal on Discrete Algorithms'' 15:56--62, 2012.
  3. J. Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconventional Computing, 8(1): 33-46, 2012.
  4. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. ``Algorithmica'' 62:637--658, 2012.
to:
  1. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. Information Processing Letters 112: 329--334, 2012.
  2. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. On the parameterized complexity of coloring graphs in the absence of a linear forest. Journal on Discrete Algorithms 15:56--62, 2012.
  3. J. Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconventional Computing, 8(1): 33-46, 2012.
  4. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. Algorithmica 62:637--658, 2012.
Changed lines 38-39 from:
  1. A. Grigoriev, B. Marchal, N. Usotskaya, and I. Todinca. A note on planar graphs with large width parameters and small grid-minors. ``Discrete Applied Mathematics'' 160(7-8): 1262--1269, 2012.
to:
  1. A. Grigoriev, B. Marchal, N. Usotskaya, and I. Todinca. A note on planar graphs with large width parameters and small grid-minors. Discrete Applied Mathematics 160(7-8): 1262--1269, 2012.
Changed lines 61-80 from:
  1. F. Becker, A. Kosowski, N. Nisse, I. Rapaport and K. Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models. ``Proceedings of 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012)", pp. 11-17, 2012.
  2. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in Networks with Star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop, Nice, France, pages 1-2, December 2012.
  3. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized Domination in Circle Graphs. ``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.
  4. J.-F. Couturier, P. Heggernes, P. van 't Hof, and D. Kratsch. Minimal dominating sets in graph classes: combinatorial bounds and enumeration. ``Proceedings of SOFSEM 2012, Lecture Notes in Computer Science'' Vol. 7147 (pp. 202-213), Springer-Verlag.
  5. D. Duchier, J. Durand-Lose, M. Senot. Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. ``Proccedings of TAMC Lecture Notes in Computer Science'' Vol. 7287 (pp. 435-447), 2012.
  6. F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web Surfers Is Hard. ``Proceedings of FUN with Algorithms 2012", Lecture Notes in Computer Science Vol. 7288, (pp. 166-176), 2012.
  7. P.A. Golovach, P. Heggernes, D. Kratsch, and R. Saei, An exact algorithm for Subset Feedback Vertex Set on chordal graphs. ``Proceedings of IPEC 2012, Lecture Notes in Computer Science'' Vol. 7535 (pp. 85-96), 2012.
  8. P. Golovach, D. Kratsch, and D. Paulusma. Detecting induced minors in AT-free graphs. ``Proceedings of ISAAC 2012, Lecture Notes in Computer Science'' Vol. 7676 (pp. 495--505), 2012.
  9. D. Gonçalves and E.J. Kim. On Exact Algorithms for Permutation CSP. ``Proceedings if APEX ’12'' (International Workshop on Approximation, Parameterized and EXact algorithms). February 2012.
to:
  1. F. Becker, A. Kosowski, N. Nisse, I. Rapaport and K. Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models. Proceedings of 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012), pp. 11-17, 2012.
  2. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in Networks with Star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop, Nice, France, pages 1-2, December 2012.
  3. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized Domination in Circle Graphs. Proceedings of WG 2012, Lecture Notes in Computer Science Vol. 7551 (pp. 308-319), June 2012.
  4. J.-F. Couturier, P. Heggernes, P. van 't Hof, and D. Kratsch. Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Proceedings of SOFSEM 2012, Lecture Notes in Computer Science Vol. 7147 (pp. 202-213), Springer-Verlag.
  5. D. Duchier, J. Durand-Lose, M. Senot. Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. Proccedings of TAMC Lecture Notes in Computer Science Vol. 7287 (pp. 435-447), 2012.
  6. F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web Surfers Is Hard. Proceedings of FUN with Algorithms 2012, Lecture Notes in Computer Science Vol. 7288, (pp. 166-176), 2012.
  7. P.A. Golovach, P. Heggernes, D. Kratsch, and R. Saei, An exact algorithm for Subset Feedback Vertex Set on chordal graphs. Proceedings of IPEC 2012, Lecture Notes in Computer Science Vol. 7535 (pp. 85-96), 2012.
  8. P. Golovach, D. Kratsch, and D. Paulusma. Detecting induced minors in AT-free graphs. Proceedings of ISAAC 2012, Lecture Notes in Computer Science Vol. 7676 (pp. 495--505), 2012.
  9. D. Gonçalves and E.J. Kim. On Exact Algorithms for Permutation CSP. Proceedings if APEX ’12 (International Workshop on Approximation, Parameterized and EXact algorithms). February 2012.
Changed lines 84-89 from:
  1. S., M. Koivisto, M. Liedloff, S. Ordyniak, and S. Szeider. On Finding Optimal Polytrees. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Ontario, Canada, July 2012.
  2. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), 2012.
  3. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012,Lecture Notes in Computer Science'' Vol. 7501 (pp. 707-718), 2012.
to:
  1. S., M. Koivisto, M. Liedloff, S. Ordyniak, and S. Szeider. On Finding Optimal Polytrees. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Ontario, Canada, July 2012.
  2. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), 2012.
  3. D. Kratsch and H. M\"uller. Colouring AT-free graphs. Proceedings of ESA 2012,Lecture Notes in Computer Science Vol. 7501 (pp. 707-718), 2012.
Restore
November 28, 2013, at 01:38 PM by 83.113.82.170 -
Restore
November 28, 2013, at 01:38 PM by 83.113.82.170 -
Changed lines 13-15 from:
  1. L. Barrière, P. Flocchini, F.V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, and D.M. Thilikos. Connected graph searching. ``Inf. Comput.", 219: 1-16, 2012.
  2. H.L. Bodlaender, F.V. Fomin, M.C.A. Koster, D. Kratsch, and D.M. Thilikos. A note on exact algorithms for vertex ordering problems on graphs. ``Theory of Computing Systems'' 50:420--432, 2012.
to:
  1. L. Barrière, P. Flocchini, F.V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, and D.M. Thilikos. Connected graph searching. Inf. Comput., 219: 1-16, 2012.
  2. H.L. Bodlaender, F.V. Fomin, M.C.A. Koster, D. Kratsch, and D.M. Thilikos. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems 50:420--432, 2012.
Restore
November 25, 2013, at 06:11 PM by Mathieu -
Changed line 32 from:
  1. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. ``Algorithmica'' 6:637--658, 2012.
to:
  1. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. ``Algorithmica'' 62:637--658, 2012.
Restore
November 25, 2013, at 04:38 PM by 138.96.199.96 -
Added lines 16-17:
  1. H.L. Bodlaender, F.V. Fomin, M.C.A. Koster, D. Kratsch, and D.M. Thilikos. On exact algorithms for treewidth. ACM Transactions on Algorithms 9(1): 12, 2012.
Restore
November 19, 2013, at 06:10 PM by 108.89.209.41 -
Changed lines 38-44 from:
  1. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.Discrete Applied Mathematics 160(18):2709–2715, 2012. fichier PDF
to:
  1. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. Discrete Applied Mathematics 160(18):2709–2715, 2012. fichier PDF
  2. O. Amini, D. Peleg, S. Pérennes, I. Sau and S. Saurabh. On the Approximability of Some Degree-constrained Subgraph Problems. Discrete Applied Mathematics, 160(12): 1661--1679, 2012.
  3. G. B. Mertzios, I. Sau, M. Shalom and S. Zaks. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. IEEE/ACM Transactions on Networking, 20(6): 1870--1879, 2012.
  4. I. Sau, P. Sparl and J. Zerovnik. Simpler Multicoloring of Triangle-free Hexagonal Graphs. Discrete Mathematics, 312(1): 181--187, 2012.
  5. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. Algorithmica, 64(1): 69--84, 2012.
  6. O. Amini, I. Sau and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs. Journal of Discrete Algorithms, 10: 70--83, 2012.
  7. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, 444: 3--16, 2012.
Added lines 92-96:
  1. J. Rué, I. Sau and D. M. Thilikos. Dynamic Programming for H-minor-free Graphs (Extended Abstract). In Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON), volume 7434 of LNCS, pages 86-97, Sydney, Australia, August 2012.
Deleted line 114:
Restore
November 29, 2012, at 06:12 AM by 96.49.228.84 -
Added lines 32-33:
  1. S. Gaspers, M. Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012.
Deleted line 40:
  1. S., M. Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012.
Restore
November 10, 2012, at 02:01 AM by 96.49.228.84 -
Added lines 89-92:
  1. P. Berthomé, J.-F. Lalande, and V. Levorato. Implementation of exponential and parametrized algorithms in the AGAPE project. Technical report, Laboratoire d’Informatique Fondamentale d’Orléans - LIFO, January 2012.
Restore
November 09, 2012, at 08:53 PM by 209.87.57.176 -
Added lines 25-29:
  1. J. Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconventional Computing, 8(1): 33-46, 2012.
Changed lines 56-62 from:
  1. F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web Surfers Is Hard. ``Proceedings of FUN with Algorithms 2012", Lecture Notes in Computer Science Vol. 7288, (pp. 166-176), Springer-Verlag.
  2. P.A. Golovach, P. Heggernes, D. Kratsch, and R. Saei, An exact algorithm for Subset Feedback Vertex Set on chordal graphs. ``Proceedings of IPEC 2012, Lecture Notes in Computer Science'' Vol. 7535 (pp. 85-96), Springer-Verlag.
  3. P. Golovach, D. Kratsch, and D. Paulusma. Detecting induced minors in AT-free graphs. ``Proceedings of ISAAC 2012, Lecture Notes in Computer Science'' Vol. 7676 (pp. 495--505), Springer-Verlag.
to:
  1. D. Duchier, J. Durand-Lose, M. Senot. Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. ``Proccedings of TAMC Lecture Notes in Computer Science'' Vol. 7287 (pp. 435-447), 2012.
  2. F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web Surfers Is Hard. ``Proceedings of FUN with Algorithms 2012", Lecture Notes in Computer Science Vol. 7288, (pp. 166-176), 2012.
  3. P.A. Golovach, P. Heggernes, D. Kratsch, and R. Saei, An exact algorithm for Subset Feedback Vertex Set on chordal graphs. ``Proceedings of IPEC 2012, Lecture Notes in Computer Science'' Vol. 7535 (pp. 85-96), 2012.
  4. P. Golovach, D. Kratsch, and D. Paulusma. Detecting induced minors in AT-free graphs. ``Proceedings of ISAAC 2012, Lecture Notes in Computer Science'' Vol. 7676 (pp. 495--505), 2012.
Changed lines 73-79 from:
  1. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), Springer-Verlag.
  2. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012,Lecture Notes in Computer Science'' Vol. 7501 (pp. 707-718), Springer-Verlag.
  3. K. Junosza-Szaniawski, J. Kratochvíl, M. Liedloff, P. Rzazewski. Determining the L(2, 1)-Span in Polynomial Space. Proceedings of WG 2012, Lecture Notes in Computer Science Vol. 7551 (pp. 126-137), Springer-Verlag.
to:
  1. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), 2012.
  2. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012,Lecture Notes in Computer Science'' Vol. 7501 (pp. 707-718), 2012.
  3. K. Junosza-Szaniawski, J. Kratochvíl, M. Liedloff, P. Rzazewski. Determining the L(2, 1)-Span in Polynomial Space. Proceedings of WG 2012, Lecture Notes in Computer Science Vol. 7551 (pp. 126-137), 2012.
Restore
November 08, 2012, at 07:33 PM by 142.58.8.150 -
Added lines 28-30:
  1. A. Grigoriev, B. Marchal, N. Usotskaya, and I. Todinca. A note on planar graphs with large width parameters and small grid-minors. ``Discrete Applied Mathematics'' 160(7-8): 1262--1269, 2012.
Restore
November 08, 2012, at 07:30 PM by 142.58.8.150 -
Added lines 56-58:
  1. E. Kim, C. Paul and G. Philip. Parameterized $K_4$-cover in single exponential time. Proceedings of SWAT,Lecture Notes in Computer Science Vol. 7357 (pp. 119--130), 2012.
Restore
November 08, 2012, at 07:28 PM by 142.58.8.150 -
Changed line 44 from:
  1. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Domination in Circle Graphs. ``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.
to:
  1. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized Domination in Circle Graphs. ``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.
Restore
November 08, 2012, at 09:24 AM by 138.96.201.169 -
Changed lines 59-60 from:
  1. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.

In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), Springer-Verlag.

to:
  1. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), Springer-Verlag.
Restore
November 08, 2012, at 09:24 AM by 138.96.201.169 -
Deleted line 16:
Deleted line 22:
Deleted lines 24-26:
Deleted line 28:
Changed lines 44-50 from:
  1. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Domination in Circle Graphs.

``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.

to:
  1. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Domination in Circle Graphs. ``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.
Restore
November 08, 2012, at 09:22 AM by 138.96.201.169 -
Added lines 46-47:
  1. F. Becker, A. Kosowski, N. Nisse, I. Rapaport and K. Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models. ``Proceedings of 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012)", pp. 11-17, 2012.
Added lines 60-61:
  1. F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. To Satisfy Impatient Web Surfers Is Hard. ``Proceedings of FUN with Algorithms 2012", Lecture Notes in Computer Science Vol. 7288, (pp. 166-176), Springer-Verlag.
Added lines 70-72:
  1. A. Kosowski, B. Li, N. Nisse and K. Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.

In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science Vol. 7392 (pp. 610-622), Springer-Verlag.

Restore
November 08, 2012, at 09:18 AM by 138.96.201.169 -
Added lines 12-13:
  1. L. Barrière, P. Flocchini, F.V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, and D.M. Thilikos. Connected graph searching. ``Inf. Comput.", 219: 1-16, 2012.
Restore
November 07, 2012, at 05:39 PM by 96.49.228.84 -
Added lines 45-51:
  1. N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Domination in Circle Graphs.

``Proceedings of WG 2012, Lecture Notes in Computer Science'' Vol. 7551 (pp. 308-319), June 2012.

Restore
November 07, 2012, at 05:38 PM by 96.49.228.84 -
Added line 32:
Added lines 52-54:
  1. D. Gonçalves and E.J. Kim. On Exact Algorithms for Permutation CSP. ``Proceedings if APEX ’12'' (International Workshop on Approximation, Parameterized and EXact algorithms). February 2012.
Restore
November 07, 2012, at 11:06 AM by 138.96.201.34 -
Changed lines 9-10 from:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski.

Weighted improper colouring. ``Journal of Discrete Algorithms'', 16:53–66, 2012.

to:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. ``Journal of Discrete Algorithms'', 16:53–66, 2012.
Restore
November 07, 2012, at 02:36 AM by 96.49.228.84 -
Changed lines 56-57 from:
  1. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012'',

Lecture Notes in Computer Science Vol. 7501 (pp. 707-718), Springer-Verlag.

to:
  1. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012,Lecture Notes in Computer Science'' Vol. 7501 (pp. 707-718), Springer-Verlag.
Restore
November 07, 2012, at 02:36 AM by 96.49.228.84 -
Changed line 67 from:

J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. ``INRIA research report'' RR-8024, 2012.

to:
  1. J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. ``INRIA research report'' RR-8024, 2012.
Restore
November 07, 2012, at 02:34 AM by 96.49.228.84 -
Changed lines 66-69 from:
  1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Research Report RR-8071, September 2012. fichier PDF
  2. D. Coudert and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, September 2012. fichier PDF
to:

J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. ``INRIA research report'' RR-8024, 2012.

  1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. ``INRIA Research Report'' RR-8071, September 2012. fichier PDF
  2. D. Coudert and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. ``INRIA Research Report'' RR-8074, September 2012. fichier PDF
Added lines 74-75:
  1. F. Havet, N. Paramaguru and R. Sampathkumar. Detection number of bipartite graphs and cubic graphs. ``INRIA research report'' RR-8115.
Restore
November 07, 2012, at 02:21 AM by 96.49.228.84 -
Changed lines 46-47 from:
  1. S., M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider. On Finding Optimal Polytrees. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Ontario, Canada, July 2012.
to:
  1. J.-F. Couturier, P. Heggernes, P. van 't Hof, and D. Kratsch. Minimal dominating sets in graph classes: combinatorial bounds and enumeration. ``Proceedings of SOFSEM 2012, Lecture Notes in Computer Science'' Vol. 7147 (pp. 202-213), Springer-Verlag.
  2. P.A. Golovach, P. Heggernes, D. Kratsch, and R. Saei, An exact algorithm for Subset Feedback Vertex Set on chordal graphs. ``Proceedings of IPEC 2012, Lecture Notes in Computer Science'' Vol. 7535 (pp. 85-96), Springer-Verlag.
  3. P. Golovach, D. Kratsch, and D. Paulusma. Detecting induced minors in AT-free graphs. ``Proceedings of ISAAC 2012, Lecture Notes in Computer Science'' Vol. 7676 (pp. 495--505), Springer-Verlag.
  4. S., M. Koivisto, M. Liedloff, S. Ordyniak, and S. Szeider. On Finding Optimal Polytrees. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Ontario, Canada, July 2012.
  5. D. Kratsch and H. M\"uller. Colouring AT-free graphs. ``Proceedings of ESA 2012'',

Lecture Notes in Computer Science Vol. 7501 (pp. 707-718), Springer-Verlag.

Added lines 69-70:
  1. P. A. Golovach, P. Heggernes, D. Kratsch, Y. Villanger: Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. arXiv:1208.5345, 2012.
Restore
November 07, 2012, at 02:08 AM by 96.49.228.84 -
Added lines 22-27:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. On the parameterized complexity of coloring graphs in the absence of a linear forest. ``Journal on Discrete Algorithms'' 15:56--62, 2012.
Restore
November 07, 2012, at 02:05 AM by 96.49.228.84 -
Deleted lines 16-18:
Added lines 20-21:
  1. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. ``Information Processing Letters'' 112: 329--334, 2012.
Restore
November 07, 2012, at 02:03 AM by 96.49.228.84 -
Added lines 14-19:
  1. H.L. Bodlaender, F.V. Fomin, M.C.A. Koster, D. Kratsch, and D.M. Thilikos. A note on exact algorithms for vertex ordering problems on graphs. ``Theory of Computing Systems'' 50:420--432, 2012.
Added lines 23-24:
  1. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. ``Algorithmica'' 6:637--658, 2012.
Restore
November 07, 2012, at 01:18 AM by 142.58.8.150 -
Added lines 8-10:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski.

Weighted improper colouring. ``Journal of Discrete Algorithms'', 16:53–66, 2012.

Restore
November 07, 2012, at 01:13 AM by 142.58.8.150 -
Changed lines 15-17 from:
  1. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. To appear in Discrete Applied Mathematics.
  2. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in Discrete Applied Mathematics. fichier PDF
to:
  1. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. Discrete Applied Mathematics 160(6):744–754, 2012.
  2. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs.Discrete Applied Mathematics 160(18):2709–2715, 2012. fichier PDF
Restore
November 07, 2012, at 01:12 AM by 142.58.8.150 -
Added lines 15-18:
  1. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. To appear in Discrete Applied Mathematics.
  2. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. To appear in Discrete Applied Mathematics. fichier PDF
Added lines 20-21:
Restore
November 07, 2012, at 01:11 AM by 142.58.8.150 -
Added lines 10-11:
  1. V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales and F. Maffray. New bounds on the Grundy number of products of graphs. Journal of Graph Theory 71 (1):78–88, 2012. fichier PDF
Restore
November 07, 2012, at 01:09 AM by 142.58.8.150 -
Changed lines 8-10 from:
  1. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Algorithmica, 63(1-2):158-190, 2012.
  2. S., M. Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012.
to:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph.Theoretical Computer Science, 443:10–24, 2012.
  2. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Algorithmica, 63(1-2):158-190, 2012.
  3. S., M. Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012.
Restore
November 06, 2012, at 09:56 PM by Mathieu -
Changed lines 19-21 from:
to:
  1. S., M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider. On Finding Optimal Polytrees. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), Toronto, Ontario, Canada, July 2012.
  2. K. Junosza-Szaniawski, J. Kratochvíl, M. Liedloff, P. Rzazewski. Determining the L(2, 1)-Span in Polynomial Space. Proceedings of WG 2012, Lecture Notes in Computer Science Vol. 7551 (pp. 126-137), Springer-Verlag.
Restore
November 06, 2012, at 09:51 PM by Mathieu -
Changed line 10 from:
to:
  1. S., M. Liedloff. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science 14(1): 29-42, 2012.
Restore
November 06, 2012, at 08:52 PM by 82.240.160.51 -
Changed lines 4-5 from:

Publications 2011 dans le cadre du projet AGAPE

to:

Publications 2012 dans le cadre du projet AGAPE

Added lines 19-21:

\\

Restore
November 06, 2012, at 08:51 PM by 82.240.160.51 -
Changed lines 17-19 from:
to:
  1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in Networks with Star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop, Nice, France, pages 1-2, December 2012.
Changed lines 22-23 from:
  1. D. Coudert and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, 2012. fichier PDF
to:
  1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Research Report RR-8071, September 2012. fichier PDF
  2. D. Coudert and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, September 2012. fichier PDF
Restore
November 06, 2012, at 08:43 PM by 82.240.160.51 -
Added lines 1-24:

(:notitle:)

Publications 2011 dans le cadre du projet AGAPE

Articles dans des revues internationales

  1. D. Coudert, F. Huc, and D. Mazauric. A distributed algorithm for computing and updating the process number of a forest. Algorithmica, 63(1-2):158-190, 2012.


Proceedings de conférences

Rapports de recherches

  1. D. Coudert and A. Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, 2012. fichier PDF
Restore
Edit - History - Print - Recent Changes - Search
Page last modified on November 28, 2013, at 01:55 PM