Publications de l'équipe Combinatoire et Algorithmique pour l'année 2006

Années: 2005, 2007, 2008, 2009, 2010, 2011, 2012, 2013

  1. P. Fraigniaud, C. Gavoille, and C. Paul. Eclectism shrinks even small worlds. Distributed Computing, 18(4):279-291, 2006.
  2. J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. Parallel Processing Letters, 16(2):165-183, 2006.
  3. C. Banino-Rokkones, O. Beaumont, and L. Natvig. Master-slave tasking on asymmetric networks. In Euro-Par 2006 Parallel Processing. Springer, 2006.
  4. O. Beaumont, L. Marchal, V. Rehn, and Y. Robert. Fifo scheduling of divisible loads with return messages under the one-port model. In Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, 2006.
  5. O. Beaumont, L. Marchal, and Y. Robert. Complexity results for collective communications on heterogeneous platforms. International Journal of High Performance Computing Applications, 2006.
  6. C. Johnen and L. H. Nguyen. Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks. In S. E. Nikoletseas and J. D. Rolim, editors, Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks, volume 4240 of LNCS, pages 83-94. Springer Berlin / Heidelberg, 2006.
  7. C. Johnen and L. H. Nguyen. Robust self-stabilizing clustering algorithm. In A. A. Shvartsman, editor, 10th International Conference Principles of Distributed Systems, volume 4305 of LNCS, pages 410-424. Springer-Verlag New York Inc, 2006.
  8. N. Kerkeni, F. Alexandre, M. H. Bedoui, and M. Dogui. Classification automatique des stades du sommeil par réseaux de neurones artificiels. In Troisième Workshop "Applications Médicales de l'Informatique : Nouvelles Approches" - AMINA'2006, 2006.
  9. Z. Neji Ben Salem, L. Bougrain, and F. Alexandre. Comparison between two spatio-temporal organization maps for speech recognition. In Second IAPR TC3 Workshop on Artificial Neural Networks in Pattern Recognition - ANNPR 2006, volume 4087 of Lecture Notes in Computer Science, pages 11-20. Springer Verlag, 2006.
  10. F. Alexandre, N. P. Rougier, and T. Viéville. A regularization process to implement self-organizing neuronal networks. In International Conference on Engineering and Mathematics - ENMA 2006, 2006.
  11. F. Alexandre, N. Kerkeni, K. Ben Khalifa, M. H. Bedoui, L. Bougrain, and M. Dogui. Supervised neuronal approaches for eeg signal classification: experimental studies. In A. P. del Pobil, editor, The 10th IASTED International Conference on Artificial Intelligence and Soft Computing - ASC 2006. Acta Press, 2006.
  12. F. Alexandre, N. Kerkeni, K. Ben Khalifa, and M. H. Bédoui. Artificial neural networks to extract knowledge from eeg. In The IASTED International Conference on Biomedical Engineering - BioMED2005, 2006.
  13. P. Ferrando, M. Arnaud, U. Briel, O. Citterio, R. Clédassou, P. Duchon, F. Fiore, P. Giommi, A. Goldwurm, G. Hasinger, E. Kendziorra, P. Laurent, F. Lebrun, O. Limousin, G. Malaguti, S. Mereghetti, G. Micela, G. Pareschi, Y. Rio, J. P. Roques, L. Strüder, and G. Tagliaferri. Simbol-x: mission overview. In G. Turner, Martin J. L. ; Hasinger, editor, Space Telescopes and Instrumentation II: Ultraviolet to Gamma Ray, volume 6266, page 62660F. Society Of Photo-Optical Instrumentation Engineers, 2006.
  14. G. Ackermann, F. Alexandre, J. Andrieu, C. Mering, and C. Ollivier. Dynamique des paysages et perspectives de développement durable sur la petite cote et dans le delta du sine - saloum (sénégal). Vertigo, 7(2):1-38, 2006.
  15. O. Beaumont, A.-M. Kermarrec, L. Marchal, and \C3. Rivière. Voronet, un réseau objet-à-objet sur le modèle petit-monde. In CFSE'5: Conférence Française sur les Systèmes d'Exploitation, 2006.
  16. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, and Y. Robert. Centralized versus distributed schedulers multiple bag-of-task applications. In International Parallel and Distributed Processing Symposium IPDPS'2006. IEEE Computer Society Press, 2006.
  17. I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: Upper bounds. In Symposium on Parallel Algorithms and Architectures (SPAA), pages 207-216. ACM Press, 2006.
  18. X. G. Viennot. Multidirected animals, connected heaps of dimers and lorentzian triangulations. Journal of Physics: Conference Series, 42:268-280, 2006.
  19. P. Dorbec and S. Gravier. On open packings and total coverings of two dimensional grid graphs. Geombinatorics, 15(4):161-165, 2006.
  20. P. Dorbec, S. Gravier, S. Klavzar, and S. Spacapan. Some results on total domination in direct products of graphs. Discussiones Mathematicae Graph Theory, 26(1):103-112, 2006.
  21. P. Dorbec and M. Mollard. Perfect codes in cartesian products of 2-paths and infinite paths. The Electronic Journal of Combinatorics, (12), 2006.
  22. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Exploration d'arbres avec oracle. In AlgoTel 2006, pages 25-28, 2006.
  23. C. Gavoille. An overview on compact routing. In 2nd Research Workshop on Flexible Network Design, Forli, Italie, octobre 2006, 2006.
  24. C. Gavoille. Distributed data structures: a survey on informative labeling schemes (invited talk). In 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), Stara Lesna, High Tatras, République slovaque, août 2006, volume 4162 of Lecture Notes in Computer Science, page 38. Springer, 2006.
  25. B. Derbel and C. Gavoille. Fast deterministic distributed algorithms for sparse spanners. In 13th International Colloquium on Structural Information & Communication Complexity (SIROCCO), Chester, Royaume-Uni, juillet 2006, volume 4056 of Lecture Notes in Computer Science, pages 100-114. Springer, 2006.
  26. I. Abraham and C. Gavoille. Object location using path separators. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), Denver, Colorado, USA, juillet 2006, pages 188-197. ACM Press, 2006.
  27. I. Abraham, C. Gavoille, A. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In 26th International Conference on Distributed Computing Systems (ICDCS), Lisbonne, juillet 2006. IEEE Computer Society Press, 2006.
  28. C. Gavoille, N. Bonichon, and A. Labourel. Schéma d'étiquetage d'adjacence pour les arbres de degrés borné. In 8èmes Journées Graphes et Algorithmes, Orléans, novembre 2006, 2006.
  29. I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: Lower bounds. In 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, Massachusetts, Etats-Unis, juillet 2006, pages 217-224. ACM Press, 2006.
  30. M. Bousquet-Mélou. Les séries rationnelles et algébriques en combinatoire énumérative. In Journées ALEA, 2006.
  31. M. Bousquet-Mélou and S. Butler. Forest-like permutations. In Permutation patterns 2006, 2006.
  32. M. Bousquet-Mélou, S. Linusson, and E. Nevo. On the independence complex of square grids. In Séminaire lotharingien de Combinatoire, 2006.
  33. J. Beauquier, C. Johnen, and S. Messika. Brief announcement: Computing automatically the stabilization time against the worst and the best schedules. In S. Dolev, editor, 20th International Symposium of Distributed Computing, DISC 2006, volume 4167 of LNCS, pages 543-547. Springer, 2006.
  34. M. Devos, J. Nesetril, and A. Raspaud. On edge-maps whose inverse preserves flows or tensions. Trens in Mathematics, pages 109-138, 2006.
  35. D. Gonçalves, A. Raspaud, and M. Shalu. On oriented labelling parameters. World Scientific, 66:33-45, 2006.
  36. A. Raspaud and E. Macajova. On the strong circular 5-flow conjecture. Journal of Graph Theory, 51:281-300, 2006.
  37. J.-C. Aval. Multivariate fuss-catalan numbers and b-quasisymmetric polynomials. In FPSAC'06., 2006.
  38. F. Mazoit. The branch-width of circular-arc graphs. In Latin American Theoretical Informatics Symposium, volume 3887/2006 of Lecture Notes in Computer Science, pages 727-736. Springer Berlin / Heidelberg, 2006.
  39. F. Mazoit. Listing all the minimal separators of a 3-connected planar graph. Discrete Mathematics, 306(3):372-380, 2006.
  40. A. Zvonkine. Topological classification of ramified coverings of the sphere. In Séminaire Lotharingien de Combinatoire 57, 2006.
  41. A. Zvonkine, S. Lando, and A. Semenov. Algorithmica. Informatica. "Prosveshchenie" editions, 2006.
  42. J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Gathering in specific radio networks. In 8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel06), Trégastel, pages 85-88, 2006.
  43. J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. In FAWN06, pages 75-79, 2006.
  44. P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, and S. Tixeuil. The reduced automata technique for graph exploration space lower bounds. In A. L. S. Oded Goldreich, Arnold L. Rosenberg, editor, Essays in Memory of Shimon Even. Springer Berlin / Heidelberg, 2006.
  45. R. Klasing, C. Laforest, J. G. Peters, and N. Thibault. Constructing incremental sequences in graphs. Algorithmic Operations Research, 1(2):1-7, 2006.
  46. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Tree exploration with an oracle. In P. U. Rastislav Královic, editor, MFCS 2006, volume 4162 of Lecture Notes in Computer Science, pages 24-37. Springer Berlin / Heidelberg, 2006.
  47. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Oracle size: a new measure of difficulty for communication tasks. In PODC 2006, pages 179-187. ACM New York, NY, USA, 2006.
  48. D. Ilcinkas. Setting port numbers for fast graph exploration. In L. G. Paola Flocchini, editor, SIROCCO 2006, volume 4056 of Lecture Notes in Computer Science, pages 59-69. Springer Berlin / Heidelberg, 2006.
  49. L. Higham and C. Johnen. Relationships between communication models in networks using atomic registers. In 20th EEE International Parallel & Distributed Processing Symposium, pages +1. IEEE computer society, 2006.
  50. J. Beauquier, C. Johnen, and S. Messika. All k -bounded policies are equivalent for self-stabilization. In M. G. Ajoy Kumar Datta, editor, 8th International Symposium, SSS 2006, volume 4280 of LNCS, pages 82-94. Springer Berlin / Heidelberg, 2006.
  51. A. Pêcher and A. Wagler. A construction for non-rank facets of stable set polytopes of webs. European Journal of Combinatorics, 27(7):1172-1185, 2006.
  52. J. Chalopin, E. Godard, Y. Métivier, and R. Ossamy. Mobile agent algorithms versus message passing algorithms. In 10th International Conference On Principles Of Distributed Systems (OPODIS 2006), volume 4305 of Lecture notes in computer science, pages 185-199. Springer, 2006.
  53. Y. Le Borgne. Counting upper interactions in dyck paths. Seminaire Lotharingien de Combinatoire, 54:17, 2006.
  54. Y. Le Borgne. An algorithm to describe bijections involving dyck paths. In FPSAC 06 : 18th International Conference on Formal Power Series and Algebraic Combinatorics, 2006.
  55. X. G. Viennot. Catalan tableaux and asymmetric exclusion process. In 57ième Séminaire Lotharingien de Combinatoire, 2006.
  56. X. G. Viennot. La combinatoire plurielle aujourdhui: énumérative, algébrique, bijective, expérimentale, quantique et ... magique. In Colloque Service Physique Théorique, CEA Saclay, 2006.
  57. X. G. Viennot. Processus d'exclusion asymétrique et tableaux de catalan. In Journées Pierre Leroux, UQAM, 2006.
  58. X. G. Viennot. Catalan numbers, permutation tableaux and asymmetric exclusion process. In GASCOM 2006, 2006.
  59. X. G. Viennot. Multi-directed animals, connected heaps of dimers and lorentzian triangulations. In Counting Complexity: An international workshop on statistical mechanics and combinatorics, pages 268-280, 2006.
  60. A. Pêcher and X. Zhu. On the circular chromatic number of circular partitionable graphs. Journal of Graph Theory, 52:294-306, 2006.
  61. A. Pecher and A. Wagler. Almost all webs are not rank-perfect. Mathematical Programming / Mathematical Programming Series B, 105:311-328, 2006.
  62. A. Pecher and A. Wagler. On non-rank facets in stable set polytopes of webs with clique number four. Discrete Applied Mathematics, 154:1408-1415, 2006.
  63. N. Bonichon, C. Gavoille, and A. Labourel. Short labels by traversal and jumping. In 13<sup>th</sup> International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 4056, pages 143-156, 2006.
  64. B. Derbel, M. Mosbah, and A. Zemmari. Fast distributed graph partition and application (extended abstract). In 20<sup>th</sup> IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006.
  65. M. Hosseini Dolama and E. Sopena. On the oriented chromatic number of graphs with given excess. Discrete Mathematics, 306:1342-1350, 2006.
  66. A. Don and N. Hanusse. A deterministic multidimensional scaling algorithm for data visualization. In IEEE IV2006 - International Conference on Information Visualization, pages 511-520, 2006.
  67. J.-F. Marckert and A. Mokkadem. Limit of normalized quadrangulations: the brownian map. The Annals of Probability, 34:2144-2202, 2006.
  68. Y. Métivier and M. Mosbah. Workshop on graph computation models. In Third International Conference on Graph Transformations, ICGT 2006, volume 4178 of Lecture notes in computer science, pages 463-464. Springer, 2006.
  69. P. Fraigniaud and C. Gavoille. Header-size lower bounds for end-to-end communication in memoryless networks. Computer Networks, 50(10):1630-1638, 2006.
  70. R. Klasing, E. Markou, and A. Pelc. Gathering asynchronous oblivious mobile robots in a ring. In Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006), volume 4288 of LNCS, pages 744-753, 2006.
  71. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Approximation bounds for black hole search problems. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005), volume 3974 of LNCS, pages 261-274, 2006.
  72. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small-world? Theoretical Computer Science, 355:96-103, 2006.
  73. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Towards small world emergence. In SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 225-232. Uzi Vishkin, 2006.
  74. P. Duchon, N. Hanusse, N. Saheb-Djahromi, and A. Zemmari. Broadcast in the rendezvous model. Information and Computation, pages 697-712, 2006.
  75. M. Montassier, A. Raspaud, and W. Wang. Acyclic 4-choosability of planar graphs without cycles of specific length. Algorithms and Combinatorics, 26:473-491, 2006.
  76. M. Montassier and A. Raspaud. (d,1)-total labeling of graphs with given maximum average degree. Journal of Graph Theory, 51:93-109, 2006.
  77. M. Montassier, P. Ochem, and A. Raspaud. On the acyclic choosability of graphs. Journal of Graph Theory, 51:281-300, 2006.
  78. M. Mosbah, A. Sellami, and A. Zemmari. Using graph relabelling systems for resolving conflicts. In NOuvelles TEchnologies de la REpartition,, pages 283-294. Hermès - Lavoisier, 2006.
  79. A. Pinlou and E. Sopena. The acircuitic directed star arboricity of subcubic graphs is at most four. Discrete Mathematics, 306:3281-3289, 2006.
  80. A. Pinlou and E. Sopena. Oriented vertex and arc colorings of outerplanar graphs. Information Processing Letters, 100:97-104, 2006.
  81. C. Cooper, R. Klasing, and T. Radzik. Searching for black-hole faults in a network using multiple agents. In Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS 2006), number 4305 in Lecture Notes in Computer Science, pages 320-332. Springer, 2006.
  82. A. Shehla, M. Mosbah, and A. Zemmari. Distributed computation of a spanning tree in a dynamic graph by mobile agents. In IEEE International Conference on Engineering of Intelligent Systems, IEEE Xplore, pages 1 - 6. IEEE Computer Science, 2006.
  83. M. Montassier, A. Raspaud, and W. Wang. Bordeaux 3-color conjecture and 3-choosability. Discrete Mathematics, 306(6):573-579, 2006.
  84. M. Bousquet-Mélou. Rational and algebraic series in combinatorial enumeration. In International Congress of Mathematicians, Madrid, volume Invited Lectures III, pages 789-826. European Mathematical Society, 2006.
  85. J.-C. Aval. Ideals and quotients of b-quasisymmetric functions. Seminaire Lotharingien de Combinatoire, B54, 2006.
  86. W. Zielonka, Y. Métivier, and J. Chalopin. Local computations in graphs: The case of cellular edge local computations. Fundamenta Informaticae, 74(1):85-114, 2006.
  87. N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, 22(2):185-202, 2006.
  88. A. Bernini, m. Bouvel, and L. Ferrari. Some statistics on permutations avoiding generalized patterns. In GASCom 2006, 2006.
  89. D. Rossin and M. Bouvel. The longest common pattern problem for two permutations. Pure Mathematics and Applications, 17(1-2):55-69, 2006.
  90. M. Bousquet-Mélou and S. Janson. The density of the ise and local limit laws for embedded trees. The Annals of Applied Probability, 16(3):1597-1632., 2006.
  91. M. Bousquet-Mélou. Three osculating walkers. Journal of Physics: Conference Series, 42:35-46., 2006.
  92. M. Bousquet-Mélou and A. Jehanne. Polynomial equations with one catalytic variable, algebraic series, and map enumeration. Journal of Combinatorial Theory Series B, 96:623-672., 2006.
  93. M. Bousquet-Mélou. Limit laws for embedded trees. applications to the integrated superbrownian excursion. Random Structures and Algorithms, 29(4):475-523., 2006.

Années: 2005, 2007, 2008, 2009, 2010, 2011, 2012, 2013

Page mise à jour le 21/08/2017 à 08:39