Recent Changes - Search:

Publications

Réunions

Problèmes

Participants

PmWiki

pmwiki.org

edit SideBar

Publis11

Publis.Publis11 History

Hide minor edits - Show changes to markup

November 25, 2013, at 06:12 PM by Mathieu -
Changed line 37 from:
  1. H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible, P. Rossmanith. A fast exact algorithm for the Maximum Leaf Spanning Tree problem, ``Theoretical Computer Science'' 412:6290 -- 6302, 2011.
to:
  1. H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible, P. Rossmanith. An exact algorithm for the Maximum Leaf Spanning Tree problem, ``Theoretical Computer Science'' 412:6290 -- 6302, 2011.
November 19, 2013, at 06:18 PM by 108.89.209.41 -
Changed lines 50-61 from:
to:
  1. G. B. Mertzios, I. Sau and S. Zaks. The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM Journal on Computing, 40(5): 1234--1257, 2011.
  2. X. Muñoz, Z. Li and I. Sau. Edge-partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. SIAM Journal on Discrete Mathematics, 25(4): 1490--1505, 2011.
  3. I. Adler, F. Dorn, F. V. Fomin, I. Sau and D. M. Thilikos. Faster Parameterized Algorithms for Minor Containment. Theoretical Computer Science, 412(50): 7018--7028, 2011.
  4. I. Sau and D. M. Thilikos. On Self-duality of Branchwidth in Graphs of Bounded Genus. Discrete Applied Mathematics, 159(17): 2184--2186, 2011.
Deleted line 129:
November 19, 2013, at 06:14 PM by 108.89.209.41 -
Changed lines 8-10 from:
  1. O. Amini, I. Sau, and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs.Journal of Discrete Algorithms, 2011, to appear. doi: 10.1016/j.jda.2011.05.001.
to:
Changed lines 92-93 from:
  1. G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé. Hitting and harvesting pumpkins. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
to:
  1. G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé. Hitting and harvesting pumpkins. Proceedings of European Symposium on Algorithms - ESA, volume 6942 of Lecture Notes in Computer Science, pages 394--407, 2011.
  2. D. Peleg, I. Sau, and M. Shalom. On approximating the d-girth of a graph. In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 6543 of LNCS, pages 467--481, Novy Smokovec, Slovakia, January 2011.
Deleted line 118:
November 09, 2012, at 09:04 PM by 209.87.57.176 -
Changed line 37 from:
to:
  1. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. ``SIAM Journal on Discrete Mathematics'', 25(1):401-422, 2011. fichier PDF.
November 09, 2012, at 09:00 PM by 209.87.57.176 -
Added lines 9-11:
  1. M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet and T. Müller. Acyclic edge-coloring of planar graphs. ``SIAM Journal of Discrete Mathematics'', 25(2):463--478, 2011. fichier PDF.
November 09, 2012, at 08:56 PM by 209.87.57.176 -
Added lines 27-33:
  1. J. Durand-Lose. Abstract geometrical computation 4: Small Turing universal signal machines. ``Theor. Comput. Sci.'' 412(1-2): 57-67, 2011.
  2. J. Durand-Lose. Abstract geometrical computation 5: embedding computable analysis. ``Natural Computing'' 10(4): 1261-1273, 2011.
November 09, 2012, at 08:51 PM by 209.87.57.176 -
Deleted lines 26-27:
  1. J. Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconventional Computing, in press.
November 09, 2012, at 09:28 AM by 96.49.228.84 -
Changed lines 50-52 from:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. ``Proceedings of IWOCA'11, ``Lecture Notes in Computer Science Vol. 7056(pp. 1-18), Springer-Verlag, 2011.
to:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. ``Proceedings of IWOCA'11, ``Lecture Notes in Computer Science Vol. 7056(pp. 1-18), 2011.
Changed lines 57-62 from:
  1. S. Bessy and A. Perez Polynomial kernels for Proper Interval Completion and related problems. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory. Oslo, Norway. August 22-25, 2011
  2. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 59-70), Springer-Verlag, 2011.
to:
  1. S. Bessy and A. Perez Polynomial kernels for Proper Interval Completion and related problems. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory. ``Lecture Notes in Computer Science'' Vol. 6914 (pp. 1732-1744), 2011.
  2. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 59-70), 2011.
Changed lines 65-68 from:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 119-130), Springer-Verlag, 2011.
to:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 119-130), 2011.
Changed lines 77-79 from:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 167-178), Springer-Verlag, 2011.
to:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 167-178), 2011.
Changed line 88 from:
  1. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, and P. Rzazewski. Fast Exact Algorithm for L(2,1)-Labeling of Graphs. Proceedings of TAMC 2011, Lecture Notes in Computer Science Vol. 6648 (pp. 82-93), Springer-Verlag, 2011.
to:
  1. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, and P. Rzazewski. Fast Exact Algorithm for L(2,1)-Labeling of Graphs. Proceedings of TAMC 2011, Lecture Notes in Computer Science Vol. 6648 (pp. 82-93), 2011.
November 08, 2012, at 07:36 PM by 142.58.8.150 -
Changed line 75 from:
  1. F. Fomin, I. Todinca, Y. Villanger. Exact algorithm for the maximum induced planar subraph problem. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
to:
  1. F. Fomin, I. Todinca, Y. Villanger. Exact algorithm for the maximum induced planar subraph problem. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, (pp. 287-298), 2011.
November 08, 2012, at 07:35 PM by 142.58.8.150 -
Changed line 42 from:
to:
  1. I. Rapaport, K. Suchan, I. Todinca, and J. Verstraëte. On Dissemination Thresholds in Regular and Irregular Graph Classes. ``Algorithmica'' 59(1): 16-34, 2011.
November 08, 2012, at 07:29 PM by 142.58.8.150 -
Deleted lines 88-89:
  1. E. Kim, C. Paul and G. Philip. Parameterized $K_4$-cover in single exponential time. Proceedings of SWAT 2011,Lecture Notes in Computer Science Vol. 7357 (pp. 119--130), 2012.
November 08, 2012, at 07:26 PM by 142.58.8.150 -
Changed lines 60-62 from:
  1. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 59-70), Springer-Verlag.
to:
  1. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 59-70), Springer-Verlag, 2011.
Changed lines 65-74 from:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 119-130), Springer-Verlag.
  2. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. Proceedings of CTW 2011, pp. 130-133.
  3. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded space and time by geometrical computation. "Proceedings of CiE'11", pages 76-86.
  4. F. Fomin, P. Heggernes, D. Kratsch, C. Papadopoulos, and Y. Villanger. Enumerating minimal subset feedback vertex sets. Proceedings of WADS 2011, Lecture Notes in Computer Science Vol. 6844 (pp. 399-410), Springer-Verlag.
to:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 119-130), Springer-Verlag, 2011.
  2. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. Proceedings of CTW 2011, pp. 130-133, 2011
  3. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded space and time by geometrical computation. "Proceedings of CiE'11", pages 76-86, 2011.
  4. F. Fomin, P. Heggernes, D. Kratsch, C. Papadopoulos, and Y. Villanger. Enumerating minimal subset feedback vertex sets. Proceedings of WADS 2011, Lecture Notes in Computer Science Vol. 6844 (pp. 399-410), Springer-Verlag, 2011.
Changed lines 77-80 from:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 167-178), Springer-Verlag.
  2. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
to:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 167-178), Springer-Verlag, 2011.
  2. P. Heggernes P. van 't Hof, B. Lévêque, and C. Paul. Contracting chordal graphs to paths and trees. Proceedings of LAGOS 2011, Electronic Notes in Discrete Mathematics 37:87-92, 2011.
  3. P. Heggernes, P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Proceedings of IPEC 2011, Lecture Notes in Computer Science Vol. 7112 (pp. 55-66), 2011.
  4. P. Heggernes, P. van't Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. ``Proceedings of International Workshop On Combinatorial Algorithms - FSTTCS''. ``Leibnitz International Proceedings in Informatics}, Vol. 13 (pp. 217--228), 2011.
Changed lines 88-92 from:
  1. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, and P. Rzazewski. Fast Exact Algorithm for L(2,1)-Labeling of Graphs. Proceedings of TAMC 2011, Lecture Notes in Computer Science Vol. 6648 (pp. 82-93), Springer-Verlag.
  2. E. Kim, C. Paul and G. Philip. A single exponential time algorithm for the K4-cover problem. Proceedings of IPEC 2011, to appear.
  3. C. Paul, A. Perez, and S. Thomassé. Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. Proceedings of International Symposium on Mathematical Foundations of Computer Science - MFSC, Lecture Notes in Computer Science, to appear, 2011.
to:
  1. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, and P. Rzazewski. Fast Exact Algorithm for L(2,1)-Labeling of Graphs. Proceedings of TAMC 2011, Lecture Notes in Computer Science Vol. 6648 (pp. 82-93), Springer-Verlag, 2011.
  2. E. Kim, C. Paul and G. Philip. Parameterized $K_4$-cover in single exponential time. Proceedings of SWAT 2011,Lecture Notes in Computer Science Vol. 7357 (pp. 119--130), 2012.
  3. C. Paul, A. Perez, and S. Thomassé. Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. Proceedings of International Symposium on Mathematical Foundations of Computer Science - MFSC, Lecture Notes in Computer Science, Vol. 6907 (pp. 497--507), 2011.
November 08, 2012, at 07:13 PM by 142.58.8.150 -
Added lines 9-12:
  1. S. Bessy, F. Fomin, S. Gaspers. C. Paul, A Perez, S. Saurabh and S. Thomassé. Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences 77(6):1071-1078, 2011.
November 08, 2012, at 07:11 PM by 142.58.8.150 -
Deleted line 8:
November 07, 2012, at 02:26 AM by 96.49.228.84 -
Added lines 45-48:
  1. J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. ``Proceedings of IWOCA'11, ``Lecture Notes in Computer Science Vol. 7056(pp. 1-18), Springer-Verlag, 2011.
November 07, 2012, at 02:12 AM by 96.49.228.84 -
Changed lines 53-55 from:
  1. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, 12 p., to appear.
to:
  1. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 59-70), Springer-Verlag.
Changed lines 58-60 from:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, 12 p., to appear in Lecture Notes in Computer Science, Springer-Verlag.
to:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 119-130), Springer-Verlag.
Changed line 66 from:
  1. F. Fomin, P. Heggernes, D. Kratsch, C. Papadopoulos, and Y. Villanger. Enumerating minimal subset feedback vertex sets. Proceedings of WADS 2011, 12 p., to appear.
to:
  1. F. Fomin, P. Heggernes, D. Kratsch, C. Papadopoulos, and Y. Villanger. Enumerating minimal subset feedback vertex sets. Proceedings of WADS 2011, Lecture Notes in Computer Science Vol. 6844 (pp. 399-410), Springer-Verlag.
November 07, 2012, at 02:01 AM by 96.49.228.84 -
Added lines 13-14:
Added lines 32-34:
  1. P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov, D.Meister, and S. Saurabh. Bandwidth on AT-free graphs. ``Theoretical Computer Science'' 412:7001 -- 7008, 2012.
November 07, 2012, at 01:26 AM by 142.58.8.150 -
Added lines 24-30:
  1. H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible, P. Rossmanith. A fast exact algorithm for the Maximum Leaf Spanning Tree problem, ``Theoretical Computer Science'' 412:6290 -- 6302, 2011.
  2. F.V. Fomin, P.A. Golovach, J. Kratochvil, D. Kratsch and M. Liedloff. Branch and Recharge : Exact algorithms for generalized domination, ``Algorithmica'' 61:252--273, 2011.
November 06, 2012, at 09:47 PM by Mathieu - reference updated
Changed lines 57-58 from:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011. To appear in Lecture Notes in Computer Science, Springer-Verlag.
to:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011, Lecture Notes in Computer Science Vol. 6986 (pp. 167-178), Springer-Verlag.
Deleted line 61:
November 06, 2012, at 08:32 PM by 82.240.160.51 -
Changed line 16 from:
  1. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, to appear, 2011.
to:
  1. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, Elsevier, 2011, 412 (35), pp. 4675-4687.
July 28, 2011, at 09:31 AM by 90.37.185.152 -
Changed line 34 from:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Proceedings of LAGOS 2011, Electronic Notes on Discrete Mathematics, 37 p.9--14, 2011.
to:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Proceedings of LAGOS 2011, Electronic Notes on Discrete Mathematics, 37 pages 9--14, 2011.
July 28, 2011, at 09:31 AM by 90.37.185.152 -
Changed line 34 from:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Proceedings of LAGOS 2011, Electronic Notes on Discrete Mathematics, to appear.
to:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Proceedings of LAGOS 2011, Electronic Notes on Discrete Mathematics, 37 p.9--14, 2011.
July 25, 2011, at 03:13 PM by 138.96.199.96 -
Added lines 81-82:
  1. R. Crowston, M. Fellows, G. Gutin, M. Jones, F. Rosamond, S. Thomassé and A. Yeo. Simultaneously satisfying linear equations over F2. Submitted.
July 25, 2011, at 03:05 PM by 138.96.199.96 -
Added lines 59-60:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
Changed lines 66-67 from:
to:
  1. E. Kim, C. Paul and G. Philip. A single exponential time algorithm for the K4-cover problem. Proceedings of IPEC 2011, to appear.
Changed lines 80-82 from:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
to:
Deleted lines 82-83:
  1. E. Kim, C. Paul and G. Philip. A single exponential time algorithm for the K4-cover problem. Submitted to IPEC 2011.
July 25, 2011, at 03:02 PM by 138.96.199.96 -
Added lines 83-87:
  1. V. Levorato, ANR AGAPE - Implémentation d'algorithmes exacts pour le problème du stable maximum, Rapport de recherche RR-2011-15, LIFO, 2011
  2. V. Levorato, ANR AGAPE - Implémentation du problème de couverture minimum et applications d'algorithmes exacts paramétrés aux graphes aléatoires, Rapport de recherche RR-2011-16, LIFO, 2011
July 15, 2011, at 02:47 PM by 86.221.140.157 -
Added lines 54-55:
  1. F. Fomin, I. Todinca, Y. Villanger. Exact algorithm for the maximum induced planar subraph problem. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
July 15, 2011, at 02:44 PM by 86.221.140.157 -
Changed lines 23-24 from:
to:
  1. J. Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. Int. J. Unconventional Computing, in press.
Changed line 51 from:
  1. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded space and time by geometrical computation. "Proceedings of CiE'11",pages 76-86.
to:
  1. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded space and time by geometrical computation. "Proceedings of CiE'11", pages 76-86.
July 15, 2011, at 02:43 PM by 86.221.140.157 -
Changed lines 50-51 from:
  1. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded

space and time by geometrical computation. "Proceedings of CiE'11",pages 76-86. http://hal.archives-ouvertes.fr/hal-00605661

to:
  1. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded space and time by geometrical computation. "Proceedings of CiE'11",pages 76-86.
July 15, 2011, at 02:41 PM by 86.221.140.157 -
Changed lines 50-56 from:
  1. D. Duchier, J. Durand-Lose, and M. Senot.

[[http://hal.archives-ouvertes.fr/hal-00605661|Solving Q-SAT in bounded space and time by geometrical computation]]. In Hristo Ganchev, Benedikt Löwe, Dag Normann, Ivan Soskov, and Mariya Soskova, editors, Models of computability in contecxt, 7th Int. Conf. Computability in Europe (CiE '11) (abstracts and handout booklet), pages 76-86. St. Kliment Ohridski University Press, Sofia University, 2011.

to:
  1. D. Duchier, J. Durand-Lose, and M. Senot. Solving Q-SAT in bounded

space and time by geometrical computation. "Proceedings of CiE'11",pages 76-86. http://hal.archives-ouvertes.fr/hal-00605661

July 15, 2011, at 02:39 PM by 86.221.140.157 -
Added lines 49-56:
  1. D. Duchier, J. Durand-Lose, and M. Senot.

[[http://hal.archives-ouvertes.fr/hal-00605661|Solving Q-SAT in bounded space and time by geometrical computation]]. In Hristo Ganchev, Benedikt Löwe, Dag Normann, Ivan Soskov, and Mariya Soskova, editors, Models of computability in contecxt, 7th Int. Conf. Computability in Europe (CiE '11) (abstracts and handout booklet), pages 76-86. St. Kliment Ohridski University Press, Sofia University, 2011.

July 13, 2011, at 10:17 AM by 138.96.199.96 -
Changed lines 37-39 from:
  1. S. Bessy et A. Perez Polynomial kernels for Proper Interval Completion and related problems. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory. Oslo, Norway. August 22-25, 2011
to:
  1. S. Bessy and A. Perez Polynomial kernels for Proper Interval Completion and related problems. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory. Oslo, Norway. August 22-25, 2011
Added lines 41-43:
  1. N. Bousquet, J. Daligault, and S. Thomassé. Multicut is FPT. Proceedings of STOC 2011 p.459.
July 13, 2011, at 09:11 AM by 138.96.199.96 -
Added lines 36-37:
  1. S. Bessy et A. Perez Polynomial kernels for Proper Interval Completion and related problems. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory. Oslo, Norway. August 22-25, 2011
July 11, 2011, at 01:53 PM by 138.96.199.96 -
Changed lines 40-42 from:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, 12 p., to appear.
to:
  1. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, 12 p., to appear in Lecture Notes in Computer Science, Springer-Verlag.
Added lines 47-48:
  1. S. Gaspers, M. Liedloff, M. Stein, and K. Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. Proceedings of WG 2011. To appear in Lecture Notes in Computer Science, Springer-Verlag.
Added lines 50-53:
  1. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, and P. Rzazewski. Fast Exact Algorithm for L(2,1)-Labeling of Graphs. Proceedings of TAMC 2011, Lecture Notes in Computer Science Vol. 6648 (pp. 82-93), Springer-Verlag.
July 11, 2011, at 01:29 PM by 138.96.199.96 -
Changed line 55 from:

P. Aboulker, F. Havet, and Nicolas Trotignon. On wheel-free graphs. Research Report RR-7651, INRIA, June 2011. fichier PDF

to:
  1. P. Aboulker, F. Havet, and Nicolas Trotignon. On wheel-free graphs. Research Report RR-7651, INRIA, June 2011. fichier PDF
July 11, 2011, at 01:17 PM by 138.96.199.96 -
Added lines 32-33:
  1. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Proceedings of LAGOS 2011, Electronic Notes on Discrete Mathematics, to appear.
July 11, 2011, at 01:15 PM by 138.96.199.96 -
Added lines 53-55:

P. Aboulker, F. Havet, and Nicolas Trotignon. On wheel-free graphs. Research Report RR-7651, INRIA, June 2011. fichier PDF

Added lines 57-58:
  1. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Research Report RR-7652, INRIA, June 2011. fichier PDF
July 11, 2011, at 01:06 PM by 138.96.199.96 -
Added lines 18-19:
  1. D. Coudert, F. Giroire, and I. Sau. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks 11(3-4):121--141, 2011. fichier PDF.
July 11, 2011, at 01:04 PM by 138.96.199.96 -
Changed lines 19-20 from:
  1. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics 159(11):1094--1109, 2011.

fichier PDF.

to:
  1. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics 159(11):1094--1109, 2011. fichier PDF.
July 11, 2011, at 01:04 PM by 138.96.199.96 -
Added lines 17-20:
  1. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics 159(11):1094--1109, 2011.

fichier PDF.

July 11, 2011, at 12:56 PM by 138.96.199.96 -
Changed lines 8-10 from:
to:
  1. O. Amini, I. Sau, and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs.Journal of Discrete Algorithms, 2011, to appear. doi: 10.1016/j.jda.2011.05.001.
Added lines 20-22:
July 11, 2011, at 12:17 PM by 138.96.199.96 -
Changed lines 45-47 from:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
  2. P. Heggernes, P. van 't Hof, D. Lokshtanov, and C. Paul. Obtaining a Bipartite Graph by Contracting Few Edges. Submitted to FSTTCS 2011.
to:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
  2. P. Heggernes, P. van 't Hof, D. Lokshtanov, and C. Paul. Obtaining a Bipartite Graph by Contracting Few Edges. Submitted to FSTTCS 2011.
July 11, 2011, at 12:16 PM by 138.96.199.96 -
Added lines 35-36:
  1. G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé. Hitting and harvesting pumpkins. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
Deleted line 38:
  1. G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé. Hitting and harvesting pumpkins. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
July 11, 2011, at 12:14 PM by 138.96.199.96 -
Changed lines 35-37 from:
to:
  1. C. Paul, A. Perez, and S. Thomassé. Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. Proceedings of International Symposium on Mathematical Foundations of Computer Science - MFSC, Lecture Notes in Computer Science, to appear, 2011.
  2. G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé. Hitting and harvesting pumpkins. Proceedings of European Symposium on Algorithms - ESA, Lecture Notes in Computer Science, to appear, 2011.
July 11, 2011, at 12:11 PM by 138.96.199.96 -
July 11, 2011, at 12:09 PM by 138.96.199.96 -
July 11, 2011, at 12:08 PM by 138.96.199.96 -
Deleted line 13:
Deleted line 16:
Changed lines 42-44 from:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees?. Submitted to IPEC 2011.
  2. P. Heggernes, P. van 't Hof, D. Lokshtanov, and C. Paul. Obtaining a Bipartite Graph by Contracting Few Edges?. Submitted to FSTTCS 2011.
to:
  1. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees. Submitted to IPEC 2011.
  2. P. Heggernes, P. van 't Hof, D. Lokshtanov, and C. Paul. Obtaining a Bipartite Graph by Contracting Few Edges. Submitted to FSTTCS 2011.
July 11, 2011, at 12:06 PM by 138.96.199.96 -
Changed lines 42-50 from:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs INRIA Research Report RR-7502, Jan. 2011. fichier PDF
to:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs INRIA Research Report RR-7502, Jan. 2011. fichier PDF
  2. P. Heggernes P. van 't Hof, B. Lévêque, D. Lokshtanov, and C. Paul. Contracting Graphs to Paths and Trees?. Submitted to IPEC 2011.
  3. P. Heggernes, P. van 't Hof, D. Lokshtanov, and C. Paul. Obtaining a Bipartite Graph by Contracting Few Edges?. Submitted to FSTTCS 2011.
  4. E. Kim, C. Paul and G. Philip. A single exponential time algorithm for the K4-cover problem. Submitted to IPEC 2011.
July 11, 2011, at 12:02 PM by 138.96.199.96 -
Added lines 26-37:
  1. H. L. Bodlaender and D. Kratsch. Exact algorithms for Kayles, Proceedings of WG 2011, 12 p., to appear.
  2. J.-F. Couturier, P. Golovach, D. Kratsch, and D. Paulusma. List coloring in the absence of a linear forest. Proceedings of WG 2011, 12 p., to appear.
  3. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. Proceedings of CTW 2011, pp. 130-133.
  4. F. Fomin, P. Heggernes, D. Kratsch, C. Papadopoulos, and Y. Villanger. Enumerating minimal subset feedback vertex sets. Proceedings of WADS 2011, 12 p., to appear.
July 11, 2011, at 11:59 AM by 138.96.199.96 -
Added lines 8-9:
  1. D. Binkele-Raible, L. Brankovic, M. Cygan, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, M. Pilipczuk, P. Rossmanith, J.O. Wojtaszczyk. Breaking the $2^n$-barrier for irredundance: two lines of attack. Journal of Discrete Algorithms 9:214--230, 2011.
July 11, 2011, at 11:55 AM by 138.96.199.96 -
Changed lines 9-13 from:
  1. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, to appear, 2011.
to:
  1. J. Chalopin, V. Chepoi, N. Nisse and Y. Vaxès. Cop and robber games when the robber can hide and ride. SIAM Journal of Discrete Mathematics, 25(1):333--359, 2011.
  2. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, to appear, 2011.
July 11, 2011, at 11:53 AM by 138.96.199.96 -
Added lines 9-12:
  1. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, to appear, 2011.
Changed line 19 from:
  1. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), to appear, 2011.
to:
  1. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), to appear, 2011.
January 26, 2011, at 02:02 PM by 138.96.199.96 -
Changed line 9 from:
  1. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs. Algorithmica 59(2):169--194, 2011
to:
  1. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs. Algorithmica 59(2):169--194, 2011.
January 26, 2011, at 02:01 PM by 138.96.199.96 -
Changed lines 6-10 from:
  1. 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:

Articles dans des revues internationales

  1. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labeling of graphs. Algorithmica 59(2):169--194, 2011

\\

January 26, 2011, at 02:00 PM by 138.96.199.96 -
Added lines 5-9:
  1. 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 11, 2011, at 11:26 AM by 138.96.199.96 -
Changed line 7 from:

Proceedings de conférence

to:

Proceedings de conférences

January 11, 2011, at 11:18 AM by 138.96.199.96 -
Changed line 7 from:

Proceedinds de conférence

to:

Proceedings de conférence

January 11, 2011, at 11:18 AM by 138.96.199.96 -
Changed lines 14-17 from:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé.

Oriented trees in digraphs INRIA Research Report RR-7502, Jan. 2011. fichier PDF

to:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs INRIA Research Report RR-7502, Jan. 2011. fichier PDF
January 11, 2011, at 11:18 AM by 138.96.199.96 -
Changed line 14 from:

L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé.

to:
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé.
January 11, 2011, at 11:18 AM by 138.96.199.96 -
Changed lines 9-10 from:
  1. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. ''Proceedings of the 25th IEEE International Parallel &

Distributed Processing Symposium (IPDPS)'', to appear, 2011.

to:
  1. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), to appear, 2011.
January 11, 2011, at 11:17 AM by 138.96.199.96 -
Added lines 5-11:

Proceedinds de conférence

  1. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can(not) be computed in one round. ''Proceedings of the 25th IEEE International Parallel &

Distributed Processing Symposium (IPDPS)'', to appear, 2011.

January 04, 2011, at 06:45 PM by 138.96.199.96 -
Changed lines 6-7 from:

Rapports de recherche

to:

Rapports de recherches

Changed line 11 from:

Version PDF

to:

fichier PDF

January 04, 2011, at 06:44 PM by 138.96.199.96 -
Added line 11:

Version PDF

January 04, 2011, at 06:43 PM by 138.96.199.96 -
Changed lines 8-11 from:

to:

L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs INRIA Research Report RR-7502, Jan. 2011.

January 04, 2011, at 06:41 PM by 138.96.199.96 -
Added lines 1-8:

(:notitle:)

Publications 2011 dans le cadre du projet AGAPE

Rapports de recherche

Edit - History - Print - Recent Changes - Search
Page last modified on November 25, 2013, at 06:12 PM