Recent Changes - Search:






edit SideBar

Publications 2012 dans le cadre du projet AGAPE

Articles dans des revues internationales

  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.
  4. 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.
  5. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph.Theoretical Computer Science, 443:10–24, 2012.
  6. 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.
  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.
  8. 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.
  9. 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.
  10. 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
  11. 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.
  12. J.-F. Couturier and D. Kratsch. Bicolored independent set and bicliques. Information Processing Letters 112: 329--334, 2012.
  13. 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.
  14. 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.
  15. S. Gaspers, D. Kratsch, M. Liedloff. On independent sets and bicliques. Algorithmica 62:637--658, 2012.
  16. 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.
  17. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. Discrete Applied Mathematics 160(6):744–754, 2012.
  18. 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.
  19. F. Havet, C. Linhares Sales and L. Sampaio. b-coloring of tight graphs. Discrete Applied Mathematics 160(18):2709–2715, 2012. fichier PDF
  20. 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.
  21. I. Sau, P. Sparl and J. Zerovnik. Simpler Multicoloring of Triangle-free Hexagonal Graphs. Discrete Mathematics, 312(1): 181--187, 2012.

Proceedings de conférences

  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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. 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.

Rapports de recherches

  1. J. Bang-Jensen, F. Havet, and A. K. Maia. Finding a subdivision of a digraph. ``INRIA research report'' RR-8024, 2012.
  2. 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
  3. 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.
  4. 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
  5. P. A. Golovach, P. Heggernes, D. Kratsch, Y. Villanger: Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. arXiv:1208.5345, 2012.
  6. F. Havet, N. Paramaguru and R. Sampathkumar. Detection number of bipartite graphs and cubic graphs. ``INRIA research report'' RR-8115.
Edit - History - Print - Recent Changes - Search
Page last modified on November 28, 2013, at 01:55 PM