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

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

  1. O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. Submodular partition functions. Discrete Mathematics, 309:6000-6008, 2009.
  2. P. Van Der Beek, J. Van Melle, S. Guillot, A. Pêcher, P. W. Reiners, S. Nicolescu, and M. Latif. Eocene tibetan plateau remnants preserved in the northwest himalaya. Nature geoscience, 2:364-368, 2009.
  3. P. Van Der Beek, J. Van Melle, S. Guillot, A. Pêcher, P. W. Reiners, S. Nicolescu, and M. Latif. Eocene tibetan plateau remnants preserved in the northwest himalaya. Nature geoscience, 2(4):364 - 368, 2009.
  4. G. Mahéo, J. Blichert-Toft, C. Pin, S. Guillot, and A. Pêcher. Partial melting of mantle and crustal sources beneath south karakorum, pakistan: Implications for the miocene geodynamic evolution of the india–asia convergence zone. Journal of Petrology, 50(3):427-449, 2009.
  5. C. Basile, A. Pecher, M. Corazzi, F. Odonne, A. Maillard, E. Debroas, and P. Callot. Trackdip: A multi-scale processing of dipmeter data – method, tests, and field example for 3-d description of gravity-driven deformations in the eocene foreland basin of ainsa, spain. Marine and Petroleum Geology, 26(5):738-751, 2009.
  6. F. Kaisser, C. Johnen, and V. Vèque. Vers une modélisation robuste des protocoles de routage pour réseaux de véhicules. In CFIP'2009, 2009.
  7. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves. Allocation of clients to multiple servers on large scale heterogeneous platforms. In The Fifteenth International Conference on Parallel and Distributed Systems (ICPADS'09), 2009.
  8. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves. Online and offline independent tasks allocation schemes on large scale master-worker heterogeneous platforms. In 1st Workshop on New Challenges in Distributed Systems, 2009.
  9. W. Taouali, F. Alexandre, A. Hutt, and N. P. Rougier. Asynchronous evaluation as an efficient and natural way to compute neural networks. In 7th International Conference of Numerical Analysis and Applied Mathematics - ICNAAM 2009, volume 1168, pp. 554-558 of AIP Conference Proceedings, 2009.
  10. F. Alexandre. Usefulness of emotions in robots. In International Society for Research on Emotion Conference, 2009.
  11. T. Girod and F. Alexandre. Effects of a modulatory feedback upon the bcm learning rule. In Computational Neuroscience, 2009.
  12. N. Hanusse, S. Maabout, and R. Tofan. Algorithme distribué pour l'extraction des fréquents maximaux. In A. Chaintreau and C. Magnien, editors, Algotel, 2009.
  13. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves. Online allocation of splitable clients to multiple servers on large scale heterogeneous platforms. In A. Chaintreau and C. Magnien, editors, AlgoTel, 2009.
  14. C. Gavoille. Spanner et routage compact : similarités et différences. In A. Chaintreau and C. Magnien, editors, AlgoTel, 2009.
  15. O. Beaumont and L. Marchal. Steady-state scheduling. In Y. Robert and F. Vivien, editors, Introduction To Scheduling. Taylor and Francis, 2009.
  16. L. Eyraud-Dubois and A. Legrand. The impact of platform models on scheduling techniques. In Y. Robert and F. Vivien, editors, Introduction to Scheduling. Taylor and Francis, 2009.
  17. R. Kassab and F. Alexandre. Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data. Machine Learning, 74(2):191-234, 2009.
  18. F. Alexandre. Cortical basis of communication: local computation, coordination, attention. Neural Networks, 22:126-133, 2009.
  19. A. Pêcher and A. Wagler. On the polynomial time computability of the circular chromatic number for some superclasses of perfect graph. In Lagos'09, pages 53-58, 2009.
  20. A. Boussicault and V. Féray. Application of graph combinatorics to rational identities of type a. The Electronic Journal of Combinatorics, 16(1), 2009.
  21. O. Khorunzhiy and J.-F. Marckert. Uniform bounds for exponential moment of maximum of a dyck paths. Electronic Communications in Probability, 14:327-333, 2009.
  22. M. Bousquet-Mélou. Sada : Structures aléatoires discrètes et algorithmes. In Colloque de bilan du premier programme Blanc de l'ANR, 2009.
  23. M. Bousquet-Mélou. Comptage de cartes planaires coloriées. In Première journée du projet ANR A3, 2009.
  24. M. Bousquet-Mélou. Permutations sans longue sous-suite croissante : aspects combinatoires. In ALEA, 2009.
  25. C. Johnen and L. H. Nguyen. Robust self-stabilizing weight-based clustering algorithm. Theoretical Computer Science, 410(6-7):581-594, 2009.
  26. C. Johnen and F. Mekhaldi. Brief announcement: Robust self-stabilizing construction of bounded size weight-based clusters. In F. P. Rachid Guerraoui, editor, 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), volume 5873 of LNCS, pages 787-788. Springer, 2009.
  27. F. Kardos, D. Kral, J. Miskuf, and J.-S. Sereni. Fullerene graphs have exponentially many perfect matchings. Journal of Mathematical Chemistry, 46(2):443-447, 2009.
  28. F. Bassino, M. Bouvel, A. Pierrot, and D. Rossin. Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial. In L. Ferrari, editor, Permutation Patterns 2009 (PP 2009), page 13–20. Florentina Studiorum Universitas, 2009.
  29. L. Esperet, F. Kardos, and D. Kral. Cubic bridgeless graphs have more than a linear number of perfect matchings. In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), pages 411-415, 2009.
  30. Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. Brief annoucement: Analysis of an optimal bit complexity randomised distributed vertex colouring algorithm. In T. F. Abdelzaher, M. Raynal, and N. Santoro, editors, 13th International Conference on Principles of Distributed Systems, (OPODIS 2009), volume 5923 of Lecture Notes in Computer Science, pages 359-364. Springer, 2009.
  31. E. Gafni, A. Mostefaoui, M. Raynal, and C. Travers. From adaptive renaming to set agreement. Theoretical Computer Science, 410(14):1328-1335, 2009.
  32. M. Dolega, V. Féray, and P. Sniady. Characters of symmetric groups in terms of free cumulants and frobenius coordinates. In FPSAC 2009, pages 337-348, 2009.
  33. A. Boussicault and V. Féray. Application of graph combinatorics to rational identities of type a (extended abstract). In FPSAC 2009, pages 231-242, 2009.
  34. V. Féray. Combinatorial interpretation and positivity of kerov's character polynomials. Journal of Algebraic Combinatorics / Journal of Algebraic Combinatorics An International Journal, 29(4):473-507, 2009.
  35. E. Bampas, L. Gasieniec, R. Klasing, A. Kosowski, and T. Radzik. Robustness of the rotor-router mechanism. In OPODIS 2009, volume 5923 of Lecture Notes in Computer Science, pages 345-358. Springer Berlin / Heidelberg, 2009.
  36. X. G. Viennot. Des arbres dans les étoiles, des arbres dans les grains de lumière. Tangente, (127):44-47, 2009.
  37. X. G. Viennot. Des cartes, des permutations, des bijections, des fractions continues: old and new. In Journées Robert Cori, 2009.
  38. P. Dorbec, S. Gravier, I. Honkala, and M. Mollard. Weighted codes in lee metric. Designs Codes and Cryptography / Designs Codes and Cryptography An International Journal, 52(2):209-218, 2009.
  39. D. Ilcinkas, N. Nisse, and D. Soguet. The cost of monotonicity in distributed graph searching. Distributed Computing, 22(2):117-127, 2009.
  40. A. Raspaud, H. Schroder, O. Sykora, L. Torok, and I. Vrto. Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics, pages 3541-3552, 2009.
  41. D. Kral, E. Macajova, O. Pangrac, A. Raspaud, J.-S. Sereni, and M. Skoviera. Projective, affine, and abelian colorings of cubic graphs. European Journal of Combinatorics, 30:53-69, 2009.
  42. M. Chen and A. Raspaud. Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electronic Notes in Discrete Mathematics, 34:659-667, 2009.
  43. A. Raspaud and J. Wu. Game chromatic number of toroidal grids. Electronic Notes in Discrete Mathematics, 34:381-385, 2009.
  44. G. Macgillivray, A. Raspaud, and J. Swarts. Injective oriented colourings. In 35th International Workshop on Graph-Theoretic Concepts in Computer Science 2009, 2009.
  45. Y. Bu, D. Chen, A. Raspaud, and W. Wang. Injective coloring of planar graphs. Discrete Applied Mathematics, pages 663-672, 2009.
  46. A. Doyon, H. Gena, and A. Raspaud. Some bounds on the injective chromatic number of graphs. Discrete Mathematics, 2009.
  47. J.-F. Marckert and O. Khorunzhiy. Uniform bounds for the exponential moments of the maximum of dyck paths. Electronic Communications in Probability, 14:327-333, 2009.
  48. A. Montejano, A. Pinlou, A. Raspaud, and E. Sopena. The chromatic number of sparse colored mixed graphs. In European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), volume 34, page 363–367, 2009.
  49. C. Gavoille, A. Kosowski, and M. Markiewicz. What can be observed locally? round-based models for quantum distributed computing. In DISC, volume 5805 of Lecture Notes in Computer Science, pages 243-257. Springer, 2009.
  50. B. Derbel, C. Gavoille, D. Peleg, and L. Viennot. Local computation of nearly additive spanners. In DISC, volume 5805 of Lecture Notes in Computer Science, pages 176-190. Springer, 2009.
  51. Y. Dieng and C. Gavoille. On the tree-width of planar graphs. In E. N. in Discrete Mathematics, editor, EuroComb 2009, Bordeaux, France, volume 34C, pages 593-596. Elsevier, 2009.
  52. E. Diot and C. Gavoille. On the path separability of planar graphs. In EuroComb 2009, Bordeaux, France, volume 34C, pages 549-552, 2009.
  53. M. Chapelle, F. Mazoit, and I. Todinca. Constructing brambles. In International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 223-234, 2009.
  54. M. Ollivier, O. Absil, F. Allard, J.-P. Berger, P. Bordé, F. Cassaing, B. Chazelas, A. Chelli, O. Chesneau, V. Coudé du Foresto, D. Defrère, P. Duchon, P. Gabor, J. Gay, E. Herwats, S. Jacquinod, P. Kern, P. Kervella, A. Léger, B. Lopez, F. Malbet, D. Mourard, D. Pelat, G. Perrin, Y. Rabbia, D. Rouan, J.-M. Reiss, G. Rousset, F. Selsis, P. Stee, and J. Surdej. Pegase, an infrared interferometer to study stellar environments and low mass companions around nearby stars. Experimental Astronomy, 23:403-434, 2009.
  55. O. Delmas and A. Raspaud. Preface. Discrete Mathematics, 309(11):3463 - 3464, 2009.
  56. A. Zvonkine. Dessiner les fonctions rationnelles (et méromorphes). In Journées Combinatoires de Bordeaux '09, 2009.
  57. N. Hanusse, S. Maabout, and R. Tofan. Matérialisation partielle des cubes de données. In 25èmes journées "Bases de Données Avancées" BDA'09, pages 1-20, 2009.
  58. H. Hocquard and M. Montassier. Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Information Processing Letters, 2009.
  59. J. Hromkovič, P. Kanarek, R. Klasing, K. Lorys, W. Unger, and H. Wagener. On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks. Siam Journal on Discrete Mathematics, 23(3):1612-1645, 2009.
  60. E. Bampas, L. Gasieniec, N. Hanusse, D. Ilcinkas, R. Klasing, and A. Kosowski. Euler tour lock-in problem in the rotor-router model. In DISC 2009, volume 5805 of Lecture Notes in Computer Science, pages 421-433. Springer Berlin / Heidelberg, 2009.
  61. H. Hocquard and M. Montassier. Acyclic choosability of planar graphs : a steinberg like approach. In EuroComb'09, European conference on Combinatorics, Graph Theory and Applications, volume 34, pages 199-205, 2009.
  62. J.-C. Aval and P. Duchon. Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation. In FPSAC'09, DMTCS proceedings, 2009.
  63. M. Bousquet-Mélou, A. Claesson, and M. Dukes. Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. In Formal Power Series and Algebraic Combinatorics, page 12 pages, 2009.
  64. M. Bousquet-Mélou, J. Propp, and J. West. Perfect matchings for the three-term gale-robinson sequences. The Electronic Journal of Combinatorics, 16(1), 2009.
  65. P. Fraigniaud, C. Gavoille, D. Ilcinkas, and A. Pelc. Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing, 21(6):395-403, 2009.
  66. Y. Le Borgne, L. Lapointe, and P. Nadeau. A normalization formula for the jack polynomials in superspace and an identity on partitions. The Electronic Journal of Combinatorics, 16(1), 2009.
  67. R. Cori and C. Mathieu. Indecomposable permutations with a given number of cycles. In Formal Power Series and Algebraic Combinatorics, 2009.
  68. F. V. Fomin, F. Mazoit, and I. Todinca. Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics, 157:2726-2736, 2009.
  69. L. Beaudou, P. Dorbec, P. Jha, and S. Gravier. On planarity of direct product of multipartite complete graphs. Discrete Mathematics, Algorithms and Applications, 1(1):85-104, 2009.
  70. X. G. Viennot. Des arbres dans les étoiles, des arbres dans les grains de lumière. In Fête à Fermat, 2009.
  71. X. G. Viennot. The cellular ansatz. In Séminaire Algo, INRIA Rocquencourt, 2009.
  72. X. G. Viennot. At the crossroad of algebra, combinatorics and physics: a story of the mysterious and ubiquitous sequence 1, 2, 7, 42, 429, ... In Colloquium Mathematics CIUL, Complexo Interdisciplinar Universidade de Lisboa, 2009.
  73. X. G. Viennot. Au carrefour de l'algèbre, la combinatoire et la physique: une petite histoire de la mystérieuse suite 1, 2, 7, 42, 429, ... In Colloquium Mathématiques, Université de Lyon, 2009.
  74. F. Mazoit. Tree-width of hypergraphs and surface duality. In DIMAP Workshop on Algorithmic Graph Theory, volume 32, pages 93-97, 2009.
  75. A. El Hibaoui, Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. Analysis of a randomized dynamic timetable handshake algorithm. Pure Mathematics and Applications (Algebra and Theoretical Computer Science), 2009.
  76. N. Hanusse, S. Maabout, and R. Tofan. Algorithmes pour la sélection de vues à matérialiser avec garantie de performance. In 5ème journées francophones sur les entrepôts de données et l'analyse en ligne (EDA'09), pages 1-15, 2009.
  77. C. Cooper, D. Ilcinkas, R. Klasing, and A. Kosowski. Derandomizing random walks in undirected graphs using locally fair exploration strategies. In ICALP 2009, volume 5556 of Lecture Notes in Computer Science, pages 411-422. Springer Berlin / Heidelberg, 2009.
  78. J. Czyzowicz, S. Dobrev, L. Gasieniec, D. Ilcinkas, J. Jansson, R. Klasing, I. Lignos, R. Martin, K. Sadakane, and W.-K. Sung. More efficient periodic traversal in anonymous undirected graphs. In SIROCCO 2009, volume 5869 of Lecture Notes in Computer Science, pages 174-188. Springer Berlin / Heidelberg, 2009.
  79. Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang. On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discrete Mathematics, 309(13):4596-4607, 2009.
  80. F. Bazzaro and C. Gavoille. Localized and compact data-structure for comparability graphs. Discrete Mathematics, 309(11):3465-3484, 2009.
  81. C. Gavoille and Y. Dieng. Routage dans les réseaux cellulaires. In 10ièmes Journées Doctorales en Informatique et Réseaux, Belfort, UTMB, France, février 2009, pages 7-12, 2009.
  82. N. Bonichon, M. Bousquet-Mélou, and E. Fusy. Permutations de baxter et orientations bipolaires. In Premières Journées de Combinatoire de Bordeaux, 2009.
  83. J.-C. Aval. On the symmetry of the partition function of some square ice models. Theoretical and Mathematical Physics, 161(3):1582-1589, 2009.
  84. J.-F. Marckert, N. Saheb-Djahromi, and A. Zemmari. Election algorithms with random delays in trees. In In 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Discrete Mathematics and Theoretical Computer Science, 2009.
  85. R. Cori. Hypermaps and indecomposable permutations. European Journal of Combinatorics, 30:540-541, 2009.
  86. C. Johnen and L. Higham. Fault-tolerant implementations of regular registers by safe registers. In K. K. Vijay Garg, Roger Wattenhofer, editor, 10th International conference on Distributed Computing and Networking, ICDCN 2009, volume 5408 of LNCS, pages 337-348. Springer, 2009.
  87. M. Bouvel, C. Chauve, M. Mishna, and D. Rossin. Average-case analysis of perfect sorting by reversals. In CPM'09, volume 5577, pages 314-325, 2009.
  88. Y. Bu, D. W. Cranston, M. Montassier, A. Raspaud, and W. Wang. Star coloring of sparse graphs. Journal of Graph Theory, 62(3):201-219, 2009.
  89. O. Borodin, A. Glebov, M. Montassier, and A. Raspaud. Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009.
  90. L. Lyaudet, F. Mazoit, and S. Thomassé. Partitions versus sets : a case of duality. European Journal of Combinatorics, pages 1-7, 2009.
  91. R. Cori. Indecomposable permutations, hypermaps and labeled dyck paths. Journal of Combinatorial Theory(A), 2009.
  92. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From balls and bins to points and vertices. Algorithmic Operations Research, 4(2):133-143, 2009.
  93. C. Gavoille, R. Klasing, A. Kosowski, \C5. Kuszner, and A. Navarra. On the complexity of distributed graph coloring with local minimality constraints. Networks, 54(1):12-19, 2009.
  94. M. Bousquet-Mélou and R. Brak. Exactly solved models of polyominoes and polygons. In Polygons, Polyominoes and Polycubes, pages 43-78. Springer Berlin / Heidelberg, 2009.
  95. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Labeling schemes for tree representation. Algorithmica, 53(1):1-15, 2009.
  96. N. Hanusse, S. Maabout, and R. Tofan. A view selection algorithm with performance guarantee. In International Conference on Extending Database Technology, 2009.
  97. A. Pêcher. Circular-clique polytopes and circular-perfect graphs. In 2009 Workshop on Graph Theory, 2009.
  98. A. Boussicault, C. Tollu, and J.-G. Luque. Hyperdeterminantal computation for the laughlin wave function. Journal of Physics A: Mathematical and Theoretical, 42(14):145301.1-145301.13, 2009.
  99. M. Montassier, A. Raspaud, and X. Zhu. An upper bound on the adaptable choosability of graphs. European Journal of Combinatorics, 30(2):351-355, 2009.
  100. S. Coulonges, A. Pêcher, and A. Wagler. Characterizing and bounding the imperfection ratio for some classes of graphs. Mathematical Programming, Series A, 118(1):37-46, 2009.
  101. S. Coulonges, A. Pecher, and A. Wagler. Triangle-free strongly circular-perfect graphs. Discrete Mathematics, 309:3632-3643, 2009.
  102. R. Klasing, A. Kosowski, and A. Navarra. Cost minimisation in wireless networks with a bounded and unbounded number of interfaces. Networks, 53(3):266-275, 2009.
  103. S. Abbas, M. Mosbah, and A. Zemmari. A generic distributed algorithm for computing by random mobile agents. In 10th Pacific Rim International Workshop on Multi-Agents (PRIMA), volume 5044 of Lecture Notes in Artificial Intelligence, pages 392-397. Springer, 2009.
  104. A. Haddar, A. Hadj Kacem, Y. Métivier, M. Mosbah, and M. Jmaiel. A distributed computational model for mobile agents. In 10th Pacific Rim International Workshop on Multi-Agents, volume 5044 of Lecture Notes in Artificial Intelligence, pages 417-421. Springer, 2009.
  105. A. Guignard and E. Sopena. Compound node-kayles on paths. Theoretical Computer Science, 410(21-23):2033-2044, 2009.
  106. M. Bouvel and E. Pergola. Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theoretical Computer Science, 411(26-28):2487-2501, 2009.
  107. M. Bouvel and D. Rossin. A variant of the tandem duplication - random loss model of genome rearrangement. Theoretical Computer Science, 410(8-10):847-858, 2009.
  108. O. Bernardi and N. Bonichon. Catalan's intervals and realizers of triangulations. Journal of Combinatorial Theory Series A, 116(1):55-75, 2009.
  109. A. Akhavi, J.-F. Marckert, and A. Rouault. On the reduction of a random basis. ESAIM: Probability and Statistics, 13:4357-4394, 2009.

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

Page mise à jour le 11/12/2017 à 22:01