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

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

  1. F. Mazoit and S. Thomassé. Branchwidth of graphic matroids. London Mathematical Society Lecture Note Series, 346:275-286, 2007.
  2. O. Beaumont. Introduction to HeteroPar'07 Proceedings. IEEE International Conference on Cluster Computing, 2007, 2007.
  3. O. Beaumont, A.-M. Kermarrec, and E. Rivière. Peer to peer multidimensional overlays: Approximating complex structures. In OPODIS, 2007.
  4. O. Beaumont, A.-M. Kermarrec, L. Marchal, and E. Rivière. Voronet: A scalable object network based on voronoi tessellations. In International Parallel and Distributed Processing Symposium - IPDPS 2007. IEEE, 2007.
  5. A. Mostefaoui, M. Raynal, and C. Travers. From renaming to set agreement. In G. Prencipe and S. Zaks, editors, 14th International Colloquium on Structural Information and Communication Complexity, volume 4474 of LNCS, pages 66-80. Springer Verlag, 2007.
  6. A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers. From omega to omega: A simple bounded quiescent reliable broadcast-based transformation. Journal of Parallel and Distributed Computing, 67(1):125-129, 2007.
  7. A. Pêcher, P. Pesneau, and A. Wagler. Générer des facettes pour le polytope des stables dans un graphe sans griffes par la programmation entière. In FRANCORO V / ROADEF, 2007.
  8. L. Eyraud-Dubois and M. Quinson. Assessing the quality of automatically built network representations. In A. Goldman, A. Legrand, D. Trystram, and R. Cerqueira, editors, Workshop on Programming Models for Grid Computing - organized at IEEE/ACM International Symposium on Cluster Computing and the Grid - CCGrid 2007, pages 795 - 800. IEEE Computer Society, 2007.
  9. Z. Neji Ben Salem, L. Bougrain, and F. Alexandre. Spatio-temporal biologically inspired models for clean and noisy speech recognition. Neurocomputing, 71(1-3):131-136, 2007.
  10. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro. Exploration d'arbres par des équipes de robots asynchrones et sans mémoire. In 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pages 99-102, 2007.
  11. Y. Dieng and C. Gavoille. Routage dans les graphes cellulaires. In 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pages 91-94, 2007.
  12. P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, and Z. Lotker. A propos des schémas d'augmentation universels pour la navigation dans les réseaux. In 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pages 23-26, 2007.
  13. P. Duchon, N. Eggemann, and N. Hanusse. Non-searchability of random scale-free graphs. In 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pages 27-30, 2007.
  14. F. Alexandre. Coordination, attention, communication. In ICANN Workshop "What it means to communicate", page 10 p., 2007.
  15. J. Fix, N. P. Rougier, and F. Alexandre. A top-down attentional system scanning multiple targets with saccades. In From Computational Cognitive Neuroscience to Computer Vision : CCNCV 2007, 2007.
  16. J. Fix, N. P. Rougier, and F. Alexandre. From physiological principles to computational models of the cortex. Journal of Physiology - Paris, 101(1-3):32-39, 2007.
  17. T. Girod, L. Bougrain, and F. Alexandre. Toward a robust 2d spatio-temporal self-organization. In 15th European Symposium on Artificial Neural Networks - ESANN'2007, 2007.
  18. N. Kerkeni, L. Bougrain, M. H. Bedoui, F. Alexandre, and M. Dogui. Reconnaissance automatique des grapho-éléments temporels de l'électroencéphalogramme du sommeil. In 5ème édition des Ateliers Traitement et Analyse de l'Information : Méthodes et Applications - TAIMA 2007, 2007.
  19. Z. Neji Ben Salem, L. Bougrain, and F. Alexandre. Spatio-temporal and complex-valued models based on som map applied to speech recognition. In Twentieth International Joint Conference on Artificial Intelligence - IJCAI'2007, 2007.
  20. M. Lecompte, F. Alexandre, M. Bertherlot, A. Casagrande, M. Cohen, and F. Garlatti. Éléments pour une géographie du ravinement dans les secteurs marneux des alpes du sud. Travaux de l'Institut de Géographie de Reims, (123-124,):27-58., 2007.
  21. B. Perthame, J. Rauch, N. El Karoui, M. Yor, W. Werner, X. Viennot, B. Teissier, D. Cerveau, F. Morel, P. Berthelot, B. Kahn, and L. Lafforgue. Leçons de mathématiques d'aujourd'hui. Vol. 3. Cassini, 2007.
  22. A. Boussicault. Chaînes de couvertures et sommes de greene. In International Conference on Enterprise and Scientific Computing Systems, number 1, page 10pp., 2007.
  23. M. Bouvel, D. Rossin, and S. Vialette. Longest common separable pattern between permutations. In M. Bin and Z. Kaizhong, editors, Symposium on Combinatorial Pattern Matching (CPM'07), volume 4580 of LNCS, pages 316-327. Springer, 2007.
  24. B. Bresar, P. Dorbec, S. Klavzar, and M. Mollard. Hamming polynomials and their partial derivatives. European Journal of Combinatorics, 28(4):1156-1162, 2007.
  25. P. Dorbec, M. Henning, and J. Mccoy. Upper total domination versus upper paired-domination. Quaestiones Mathematicae, 30(1):1-12, 2007.
  26. X. G. Viennot. De leonhard euler (1707-1783) aux mathématiques combinatoires et à la physique d'aujourd'hui. In Les Rendez-vous du Lundi, Université de Bordeaux, 2007.
  27. X. G. Viennot. Leonhard euler, précurseur de la combinatoire contemporaine. In 187ème Congrès annuel SCNAT, Académie Suisse, 2007.
  28. X. G. Viennot. Leonhard euler, précurseur de la combinatoire contemporaine. In Journée "Leonhard Euler 1707-1783, La passion de la raison", 2007.
  29. X. G. Viennot. Euler, strahler and knuth. In journées en l'honneur de Donald E. Knuth, 2007.
  30. X. G. Viennot. Leonhard euler (1707-1783), père de la combinatoire contemporaine. In 59ème Séminaire Lotharingien de Combinatoire, 2007.
  31. X. G. Viennot. Combinatoire expérimentale. In Université d'été, Expérimentation et démarches d'investigation en mathématiques, 2007.
  32. X. G. Viennot. Canopy of binary trees, catalan tableaux and the asymmetric exclusion process. In C. Nankai University, Tianjin, editor, FPSAC 2007, Formal Power Series and Algebraic Combinatorics, 2007.
  33. X. G. Viennot. Leonhard euler, père de la combinatoire contemporaine. In Journée IHES "Leonhard Euler, mathématicien universel, tricentaire de sa naissance", 2007.
  34. X. G. Viennot. Métamorphoses algorithmiques et merveilleuses coïncidences mathématiques. In Journées Maths-Info en fête, Université Bordeaux 1, volume vidéo: http://www.u-bordeaux1.fr/math_info_fete/videos/Merveilleuses/Merveilleuses.mp4, 2007.
  35. X. G. Viennot. Arbres, triangulations, molécules d'arn: quelles mathématiques, quelle informatique ? In Journées Maths-Info en fête, Université Bordeaux 1, 2007.
  36. I. Abraham, C. Gavoille, D. Malkhi, and U. Wieder. Strong-diameter decompositions of minor free graphs. In 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Diego, Californie, Etats-Unis, 2007, pages 16-24. ACM Press, 2007.
  37. T. Eilam, C. Gavoille, and D. Peleg. Average stretch analysis of compact routing schemes. Discrete Applied Mathematics, 155:598-610, 2007.
  38. C. Gavoille, B. Derbel, and D. Peleg. Deterministic distributed construction of linear stretch spanners in polygarithmic time. In 21rst International Symposium on Distributed Computing (DISC), Lemesos, Chypre, 2007, volume 4731 of Lecture Notes in Computer Science, pages 179-192. Springer, 2007.
  39. C. Gavoille. Localized data structures (keynote talk). In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), PODC, Portland, Oregon, Etats-Unis, août 2007, 2007.
  40. Y. Dourisboure, F. Dragan, C. Gavoille, and C. Yan. Spanners for bounded tree-length graphs. Theoretical Computer Science, 383(1):34-44, 2007.
  41. B. Courcelle, C. Gavoille, M. M. Kanté, and A. Twigg. Forbidden-set labeling on graphs. In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), Portland, Etats-Unis, 2007.
  42. C. Gavoille, N. Bonichon, and A. Labourel. Short labels by traversal and jumping. In E. N. in Discrete Mathematics, editor, 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, mars 2007, volume 28, pages 153-160. Elsevier, 2007.
  43. C. Gavoille, R. Klasing, A. Kosowski, and A. Navarra. Brief announcement: On the complexity of distributed greedy coloring. In 21rst International Symposium on Distributed Computing (DISC), septembre 2007, Lemesos, Chypre, volume 4731 of Lecture Notes in Computer Science, pages 482-484. Springer, 2007.
  44. C. Gavoille and A. Labourel. Shorter implicit representation for planar graphs and bounded treewidth graphs. In L. Arge and E. Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), octobre 2007, Eilat, Israël, volume 4698 of Lecture Notes in Computer Science, pages 582-593. Springer, 2007.
  45. C. Gavoille and A. Labourel. Brief announcement: On local representation of distances in trees. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), août 2007, Portland, WA, Etats-Unis, pages 246-247. ACM Press, 2007.
  46. C. Gavoille and A. Labourel. Distributed relationship schemes for trees. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), décembre 2007, Sendai, Japon, volume 4835 of Lectures Notes in Computer Science, pages 728-738. Springer, 2007.
  47. C. Gavoille and A. Labourel. Schéma relationnel distribué pour les arbres. In 9èmes Journées Graphes et Algorithmes, Paris, novembre 2007, page 19, 2007.
  48. O. Beaumont and A. Guermouche. Task scheduling for parallel multifrontal methods. In Euro-Par 2007 Parallel Processing, pages 758-766, 2007.
  49. M. Bousquet-Mélou. Negative hard squares. In Workshop on Combinatorial Problems Raised by Statistical Mechanics, 2007.
  50. M. Bousquet-Mélou. On the shape of binary trees. In Analysis of Algorithms, 2007.
  51. M. Bousquet-Mélou. Asymptotic enumeration and large random objects. In Ecole d'hiver "Statistical Mechanics and Combinatorics", 2007.
  52. M. Bousquet-Mélou. Families of prudent self-avoiding walks. In Workshop on quantum random walks, 2007.
  53. M. Bousquet-Mélou. The shape of binary trees, and applications to the integrated superbrownian excursion. In Northeast Probability Seminar, 2007.
  54. A. Raspaud and X. Zhu. List circular coloring of trees and cycles. Journal of Graph Theory, 55:249-265, 2007.
  55. F. Mazoit and N. Nisse. Monotonicity of non-deterministic graph searching. In International Workshop on Graph-Theoretic Concepts in Computer Science, volume 4769/2007 of Lecture Notes in Computer Science, pages 33-44. Springer Berlin / Heidelberg, 2007.
  56. B. Durand and A. Zvonkine. Kolmogorov complexity. In N. N. É. Charpentier, A. Lesne, editor, Kolmogorov's Heritage in Mathematics, pages 281-299. Springer-Verlag, 2007.
  57. E. Sopena. Colourings of oriented graphs. In Colourings, Independence and Domination - CID'07, 2007.
  58. P. Duchon, N. Eggemann, and N. Hanusse. Non-searchability of random scale-free graphs. In PODC'2007, pages 380-381, 2007.
  59. D. Ilcinkas, N. Nisse, and D. Soguet. The cost of monotonicity in distributed graph searching. In H. F. Eduardo Tovar, Philippas Tsigas, editor, OPODIS 2007, volume 4878 of Lecture Notes in Computer Science, pages 415-428. Springer Berlin / Heidelberg, 2007.
  60. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro. Computing without communicating: Ring exploration by asynchronous oblivious robots. In H. F. Eduardo Tovar, Philippas Tsigas, editor, OPODIS 2007, volume 4878 of Lecture Notes in Computer Science, pages 105-118. Springer Berlin / Heidelberg, 2007.
  61. P. Fraigniaud, C. Gavoille, D. Ilcinkas, and A. Pelc. Distributed computing with advice: Information sensitivity of graph coloring. In L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki, editors, ICALP 2007, volume 4596 of Lecture Notes in Computer Science, pages 231-242. Springer Berlin / Heidelberg, 2007.
  62. K. Dastidar, T. Herman, and C. Johnen. Safe peer-to-peer self-downloading. In M. G. Ajoy Kumar Datta, editor, 8th International Symposium, SSS 2006, volume 4280 of LNCS, pages 324-334. Springer Berlin / Heidelberg, 2007.
  63. C. Johnen and L. Higham. Fault-tolerant implementations of the atomic-state communication model in weaker networks. In 21st International Symposium on Distributed Computing, DISC 2007, volume 4731 of LNCS, pages 485-487. Springer-Verlag, 2007.
  64. J. Beauquier, M. Gradinariu, and C. Johnen. Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing, 20(1):75-93, 2007.
  65. J. Chalopin, E. Godard, Y. Métivier, and G. Tel. About the termination detection in the asynchronous message passing model. In 33rd International conference on Current trends in theory and practice of computer science (SOFSEM 2007), volume 4362 of Lecture notes in computer science, pages 200-211. springer, 2007.
  66. J. Chalopin and Y. Métivier. An efficient message passing algorithm based on mazurkiewicz s algorithm. Fundamenta Informaticae, 80(1-3):221-246, 2007.
  67. X. G. Viennot. A combinatorial approach to differential equations and nonlinear functional expansions with enriched rooted trees and weighted paths. In Conference on Combinatorics and Physics, Max Planck Institute für Mathematik, 2007.
  68. X. G. Viennot. Enumerative combinatorics and physics. In Ecole jeunes chercheurs: mécanique statistique et combinatoire, 2007.
  69. X. G. Viennot. Enumerative combinatorics and physics: 1- basic enumerative combinatorics, 2- applications and interaction with physics. In B. R. J.P. Gazeau, J. Nesetril, editor, NATO School "Computer Science and Physics", NATO Security through Science Series - D: Information and Communication Security, pages 211-229. IOS Press, 2007.
  70. X. G. Viennot and Q. Association Cont Science. D'une lettre oubliée d'euler (1707-1783) à la combinatoire et à la physique contemporaine. In Un texte, un mathématicien (SMF et BNF), 2007.
  71. X. G. Viennot. Canopy of binary trees and asymmetric exclusion process. In Problèmes combinatoires soulevés par la mécanique statistique, 2007.
  72. X. G. Viennot. Énumérons ! (de la combinatoire énumérative classique aux nouvelles combinatoires : bijectives, algébriques, expérimentales, quantiques et ... magiques). Editions scientifiques Cassini, 2007.
  73. O. Bernardi and N. Bonichon. Catalans intervals and realizers of triangulations (extended abstract). In FPSAC07, 2007.

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

Page mise à jour le 27/06/2017 à 20:56