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

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

  1. A. Montejano, P. Ochem, A. Pinlou, A. Raspaud, and E. Sopena. Homomorphisms of 2-edge-colored graphs. In IV Latin American Algorithms, Graphs, and Optimization Symposium, volume 30 of Electronic Notes in Discrete Mathematics, pages 33-38, 2008.
  2. P. Ochem, A. Pinlou, and E. Sopena. On the oriented chromatic index of oriented graphs. Journal of Graph Theory, 57(4):313-332, 2008.
  3. P. Raïpin-Parvédy, M. Raynal, and C. Travers. Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures. Theory of Computing Systems, 2008.
  4. L. Eyraud-Dubois, A. Legrand, M. Quinson, and F. Vivien. A first step towards automatically building network representations. In 13th International Euro-Par Conference - Euro-Par 2007, volume 4641/2007 of Lecture Notes in Computer Science, pages 160-169. Springer Berlin / Heidelberg, 2008.
  5. P. Flocchini, D. Ilcinkas, and N. Santoro. Recherche optimale de trou noir avec cailloux. In D. Simplot-Ryl and S. Tixeuil, editors, 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), pages 101-104, 2008.
  6. D. Ilcinkas, N. Nisse, and D. Soguet. Le coût de la monotonie dans les stratégies d'encerclement réparti. In D. Simplot-Ryl and S. Tixeuil, editors, 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), pages 33-36, 2008.
  7. F. Alexandre, B. Cessac, and T. Viéville. Neurosciences computationelles: le cerveau est il un bon modèle de réseaux de neurones ? In Séminaire Algorithmique et Programmation des Professeurs de Mathématiques en Classes Préparatoires, 2008.
  8. A. Mostefaoui, M. Raynal, and C. Travers. Narrowing power vs. efficiency in synchronous set agreement. In M. C. Shrisha Rao, P. Jayanti, C. S. R. Murthy, and S. K. Saha, editors, 9th International Conference on Distributed Computing and Networking, volume 4904 of LNCS, pages 99-111. Springer Verlag, 2008.
  9. C. Banino-Rokkones, O. Beaumont, and H. Rejeb. Scheduling techniques for effective system reconfiguration in distributed storage systems. In IEEE Intl Conference on Parallel and Distributed Systems Conferences, 2008.
  10. A. Ghatpande, H. Nakazato, O. Beaumont, and H. Watanabe. Analysis of divisible load scheduling with result collection on heterogeneous systems. IEICE Transactions on Communications, 2008.
  11. A. Ghatpande, H. Nakazato, O. Beaumont, and H. Watanabe. Sport: An algorithm for divisible load scheduling with result collection on heterogeneous systems. IEICE Transactions on Communications, 2008.
  12. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, and Y. Robert. Centralized versus distributed schedulers for bag-of-tasks applications. IEEE Transactions on Parallel and Distributed Systems, 2008.
  13. O. Beaumont, N. Bonichon, and L. Eyraud-Dubois. Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. In Heterogeneity in Computing Workshop, in IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., 2008.
  14. H. Watanabe, H. Nakazato, A. Ghatpande, and O. Beaumont. Divisible load scheduling with result collection on heterogeneous systems. In IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., 2008.
  15. G. Grenet and F. Alexandre. Behavior learning using emotional conditioning. In IROS Workshop "From motor to interaction learning in robots", 2008.
  16. R. Baldoni, F. Bonnet, A. Milani, and M. Raynal. Anonymous graph exploration without collision by mobile robots. Information Processing Letters, 2008.
  17. R. Martin, C. Houssemand, C. Schiltz, Y. Burnod, and F. Alexandre. Is there a continuity between categorical and coordinate spatial relations coding? evidence from a grid/no-grid working memory paradigm. Neuropsychologia / Neuropsychologica, 46(2):576-594, 2008.
  18. O. Beaumont, P. Duchon, and M. Korzeniowski. Heterogenous dating service with application to rumor spreading. In IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE, 2008.
  19. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, and Y. Robert. Centralized versus distributed schedulers for multiple bag-of-tasks applications. IEEE Trans. Parallel Distributed Systems, 19:698―709, 2008.
  20. S. Bandyopadhyay and R. Klasing. Dissemination of Information in Optical Networks: From Technology to Algorithms. Springer, 2008.
  21. K. Dastidar, T. Herman, and C. Johnen. Safe peer-to-peer self-downloading. ACM Transactions on Autonomous and Adaptive Systems, 3(4):19, 2008.
  22. A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers. On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Computing, 21(3):201-222, 2008.
  23. A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers. The combined power of conditions and information on failures to solve asynchronous set agreement. SIAM Journal on Computing, 38(4):1574-1601, 2008.
  24. V. Féray. Combinatorial interpretation and positivity of kerov's character polynomials (extended abstract). In FPSAC 2008, pages 93-104, 2008.
  25. Z. Zhang, F. Comellas, G. Fertin, A. Raspaud, L. Rong, and S. Zhou. Vertex labeling and routing in expanded apollonian networks. Journal of Physics A: Mathematical and Theoretical, 41(3):035004, 2008.
  26. G. Fertin and A. Raspaud. Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Information Processing Letters, 105(2):65-72, 2008.
  27. P. Duchon. On the link pattern distribution of quarter-turn symmetric fpl configurations. In 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), page 12 pages, 2008.
  28. P. Dorbec and A. Gajardo. Langton's flies. Journal of Physics A Mathematical and Theoretical, 41(40):405101, 2008.
  29. P. Dorbec, S. Klavzar, M. Mollard, and S. Spacapan. Power domination in product graphs. SIAM Journal on Discrete Mathematics, 22(2):554-567, 2008.
  30. P. Dorbec, M. Henning, and D. Rall. On the upper total domination number of cartesian products of graphs. Journal of Combinatorial Optimization, 16(1):68-80, 2008.
  31. P. Duchon and F. Le Gac. Exact random generation of symmetric and quasi-symmetric alternating-sign matrices. In U. di Siena, editor, GASCom, pages 131-141, 2008.
  32. C. Gavoille and N. Hanusse. On compact encoding of pagenumber k graphs. Discrete Mathematics and Theoretical Computer Science, 10(3):23-34, 2008.
  33. O. Beaumont, N. Bonichon, P. Duchon, L. Eyraud-Dubois, and H. Larchevêque. Distributed approximation algorithm for resource clustering. In T. Baker, A. Bui, and S. Tixeuil, editors, Opodis 2008, volume 5401 of lncs, pages 564-567, 2008.
  34. 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 Limoges, 2008.
  35. X. G. Viennot. Alternating sign matrices: at the crossroads of algebra, combinatorics and physics. In Colloquium au CMUC (Centro de Matematica da Universidade do Coimbra),, 2008.
  36. X. G. Viennot. Growth diagrams for young tableaux, robinson-schensted correspondence and some quadratic algebra coming from physics. In colloquium au CMUP (Centro de Matematica da Universidade do Porto), 2008.
  37. X. G. Viennot. Alternative tableaux, permutations, a robinson-schensted like bijection and the asymmetric exclusion process in physics. In 61ème SLC (Séminaire Lotharingien de Combinatoire), 2008.
  38. X. G. Viennot. An alternative approach to alternating sign matrices. In T. E. S. I. for Mathematical Physics, editor, Workshop on “Combinatorics and Physics”, The Erwin Schrödinger Institute for Mathematical Physics, 2008.
  39. X. G. Viennot. Alternative tableaux, permutations and partially asymmetric exclusion process. In I. N. I. for Mathematical Science, editor, Worshop “Statistical Mechanics and Quantum-Field Theory Methods in Combinatorial Enumeration”, Isaac Newton Institiute for Mathematical Science, 2008.
  40. X. G. Viennot. Introduction to the theory of heaps of pieces and appplications to statistical mechanics and quantum gravity. In Workshop "Combinatorial Identities and Their Applications to Statistical Mechanics", Issac Newton Institute for Mathematical Science, 2008.
  41. X. G. Viennot. Pierre leroux (1942-2008). Gazette des Mathématiciens, (117):59-66, 2008.
  42. C. Gavoille and B. Derbel. Fast deterministic distributed algorithms for sparse spanners. Theoretical Computer Science, 399(1-2):83-100, 2008.
  43. C. Gavoille and Y. Dieng. La structure des graphes sans mineur k 2,4. In 10ièmes Journées Graphes et Algorithmes, INRIA Sophia Antipolis, Nice, novembre 2008, 2008.
  44. C. Gavoille, B. Derbel, D. Peleg, and L. Viennot. Construction locale de sous-graphes couvrants peu denses. In 10ièmes Rencontres francophones sur les aspects algorithmiques des télécommunications (AlgoTel), Saint-Malo, France, 2008, pages 105-108, 2008.
  45. C. Gavoille, I. Abraham, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms, 3(4), 2008.
  46. C. Gavoille and P. Fraigniaud. Polylogarithmic network navigability using compact metrics with small stretch. In 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Munich, Allemagne, juin 2008, pages 62-69. ACM Press, 2008.
  47. C. Gavoille and C. Paul. Optimal distance labeling for interval graphs and related graphs families. SIAM Journal on Discrete Mathematics, 22(3):1239-1258, 2008.
  48. N. Bonichon, M. Bousquet-Mélou, and E. Fusy. Permutations de baxter et orientations bipolaires planes. In Rencontres ALEA 2008, 2008.
  49. M. Bousquet-Mélou. Excursions discrètes. In Journées ALEA, 2008.
  50. M. Bousquet-Mélou. Prudent self-avoiding walks. In Colloque en l'honneur de Philippe Flajolet, 2008.
  51. M. Bousquet-Mélou, N. Bonichon, and E. Fusy. Baxter permutations and plane bipolar orientations. In TGGT, volume 31 of Electronic Notes in Discrete Mathematics, pages 69-74, 2008.
  52. M. Bousquet-Mélou. Families of prudent self-avoiding walks. In FPSAC (Formal Power Series and Algebraic Combinatorics), DMTCS Proceedings, 2008.
  53. M. Bousquet-Mélou. Prudent self-avoiding walks. In Biannual Meeting of Fachgruppe Diskrete Mathematik of Deutsche Mathematiker Vereinigung, 2008.
  54. M. Bousquet-Mélou. Counting coloured planar maps. In TGGT (Topological and Geometric Graph Theory), volume 31 of Electronic Notes in Discrete Mathematics, pages 57-62, 2008.
  55. M. Bousquet-Mélou. Counting permutations via generating trees. In 6th Conference of permutation patterns, 2008.
  56. M. Bousquet-Mélou. Prudent self-avoiding walks. In Meeting of the American Math Society, 2008.
  57. C. Johnen and J. Beauquier. Analyze of probabilistic algorithms under indeterministic scheduler. In International Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), pages 553-558. IEEE Computer Society, 2008.
  58. C. Johnen and L. H. Nguyen. Self-stabilizing construction of bounded size clusters. In The 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008, pages 43-50. IEEE Computer Society, 2008.
  59. J.-C. Aval. Enumeration of quarter-turm symmetric alternating sign matrices. In Second congrès Canada-France des Sciences Mathématiques., 2008.
  60. Y. Le Borgne. Conjectures for the first perimeter moment of directed animals. Journal of Physics A: Mathematical and Theoretical, 41:335004, 2008.
  61. F. Mazoit. Duality of width parameters. In SIAM Conference on Discrete Mathematics, 2008.
  62. A. Zvonkine. Fonctions de belyi : exemples, constructions, applications. In Journée "Tripode", 2008.
  63. A. Zvonkine. On some questions related to composition of coverings. In The Grothendieck-Teichmüller Theory of Dessins d'Enfants, 2008.
  64. A. Zvonkine. Belyi functions: examples, properties, and applications. In M.-Y. X. J. Koolen, J. H. Kwak, editor, Application of Group Theory to Combinatorics, pages 161-180. CRC Press, 2008.
  65. S. Abbas, M. Mosbah, and A. Zemmari. A probabilistic model for distributed merging of mobile agents. In Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008). eWIC, 2008.
  66. C. Gavoille, B. Derbel, D. Peleg, and L. Viennot. On the locality of distributed sparse spanner construction. In A. Press, editor, 27<sup>th</sup> Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 273-282, 2008.
  67. S. Bandyopadhyay and R. Klasing. Dissemination of Information in Optical Networks: From Technology to Algorithms. Springer-Verlag, 2008.
  68. R. Klasing, A. Kosowski, and A. Navarra. Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring. In Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS 2008), volume 5401 of LNCS, pages 446-462, 2008.
  69. R. Klasing, S. Pérennes, and N. Morales. On the complexity of bandwidth allocation in radio networks. Theoretical Computer Science, 406(3):225-239, 2008.
  70. C. Cooper, R. Klasing, and T. Radzik. A randomized algorithm for the joining protocol in dynamic distributed networks. Theoretical Computer Science, 406(3):248-262, 2008.
  71. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Approximation bounds for black hole search problems. Networks, 52(4):216-226, 2008.
  72. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Tree exploration with advice. Information and Computation, 206(11):1276-1287, 2008.
  73. D. Ilcinkas. Setting port numbers for fast graph exploration. Theoretical Computer Science, 401(1-3):236-242, 2008.
  74. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms, 4(4), 2008.
  75. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Impact of memory size on graph exploration capability. Discrete Applied Mathematics, 156(12):2310-2319, 2008.
  76. D. Ilcinkas and A. Pelc. Impact of asynchrony on the behavior of rational selfish agents. Fundamenta Informaticae, 82(1-2):113-125, 2008.
  77. P. Flocchini, D. Ilcinkas, and N. Santoro. Ping pong in dangerous graphs: Optimal black hole search with pure tokens. In G. Taubenfeld, editor, DISC 2008, volume 5218 of Lecture Notes in Computer Science, pages 227-241. Springer Berlin / Heidelberg, 2008.
  78. N. Hanusse, D. Kavvadias, E. Kranakis, and D. Krizanc. Memoryless search algorithms in a network with faulty advice. Theoretical Computer Science, 402(2-3):190-198, 2008.
  79. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro. Remembering without memory: Tree exploration by asynchronous oblivious robots. In P. F. Alexander A. Shvartsman, editor, SIROCCO 2008, volume 5058 of Lecture Notes in Computer Science, pages 33-47. Springer Berlin / Heidelberg, 2008.
  80. D. Ilcinkas, D. R. Kowalski, and A. Pelc. Fast radio broadcasting with advice. In P. F. Alexander A. Shvartsman, editor, SIROCCO 2008, volume 5058 of Lecture Notes in Computer Science, pages 291-305. Springer Berlin / Heidelberg, 2008.
  81. C. Johnen and L. Higham. Fault-tolerant implementations of atomic registers by safe registers in networks. In R. A. Bazzi and B. Patt-Shamir, editors, ACM Symposium on Principles of Distributed Computing, PODC 2008, page 449. ACM press, 2008.
  82. B. Courcelle, C. Gavoille, and M. M. Kanté. Efficient first-order model-checking using short labels. In X. W. Franco P. Preparata and J. Yin, editors, Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, volume 5059 of Lecture Notes in Computer Science, pages 159-170. Springer, 2008.
  83. B. Courcelle, C. Gavoille, M. M. Kanté, and A. Twigg. Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics, 31:151-155, 2008.
  84. A. Pêcher. Circular-clique polytopes and circular-perfect graphs. In KolKom08 - Kolloquium über Kombinatorik, 2008.
  85. J. Chalopin, A. Mazurkiewicz, and Y. Métivier. Labelled (hyper)graphs, negotiations and the naming problem. In International conference on graph transformation (ICGT), volume 5214 of Lecture notes in computer science, pages 54-68. Springer, 2008.
  86. J. Chalopin, E. Godard, and Y. Métivier. Local terminations and distributed computability in anonymous networks. In International symposium on distributed computing (DISC), volume 4218 of Lecture notes in computer science, pages 47-62. Springer, 2008.
  87. J. Fix, N. P. Rougier, and F. Alexandre. A computational approach to the covert and overt deployment of spatial attention. In Deuxième conférence française de Neurosciences Computationnelles, "Neurocomp08", 2008.
  88. F. Alexandre, J. Fix, A. Hutt, N. P. Rougier, and T. Viéville. On practical neural field parameters adjustment. In Deuxième conférence française de Neurosciences Computationnelles, "Neurocomp08", 2008.
  89. T. Girod and F. Alexandre. Mécanisme d'auto-organisation corticale : un modèle basé sur la règle de plasticité synaptique bcm. In Deuxième conférence française de Neurosciences Computationnelles, "Neurocomp08", 2008.
  90. O. Beaumont, N. Bonichon, P. Duchon, and H. Larchevêque. Distributed approximation algorithm for resource clustering. In SIROCCO 2008, pages 61-73, 2008.
  91. M. Bouvel and E. Pergola. Posets and permutations in the duplication-loss model. In GASCOM'08, 2008.
  92. A. El Hibaoui, Y. Métivier, J. Robson, N. Saheb-Djahromi, and A. Zemmari. Analysis of a randomized dynamic timetable handshake algorithm. In GASCOM, pages 294-305, 2008.
  93. A. Pêcher. Stable set polytope of claw-free graphs. In Graph coloring workshop, 2008.
  94. A. Pecher and A. Wagler. On classes of minimal circular-imperfect graphs. Discrete Applied Mathematics, 156:998-1010, 2008.
  95. A. Don and N. Hanusse. Content-based image retrieval using greedy routing. In Electronic Imaging - Multimedia Content Access Track, volume 6820, pages 68200I1-6820I11. Theo Gevers, Ramesh C. Jain and Simone Santini, 2008.
  96. R. Klasing, E. Markou, and A. Pelc. Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science, 390(1):27-39, 2008.
  97. A. Zemmari. On handshakes in random graphs. Information Processing Letters, 108(3):119-123, 2008.
  98. C. Joncour, A. Pecher, P. Pesneau, and F. Vanderbeck. Mathematical programming formulations for the orthogonal 2d knapsack problem. In ROADEF, 2008.
  99. C. Cooper, R. Klasing, and T. Radzik. Locating and repairing faults in a network with mobile agents. In Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), volume 5058 of LNCS, pages 20-32, 2008.
  100. M. Flammini, R. Klasing, A. Navarra, and S. Pérennes. Tightening the upper bound for the minimum energy broadcasting. Wireless Networks, 14(5):659-669, 2008.
  101. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On k-connectivity problems with sharpened triangle inequality. Journal of Discrete Algorithms, 6(4):605-617, 2008.
  102. S. Gravier, R. Klasing, and J. Moncel. Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Operations Research, 3(1):43-50, 2008.
  103. L. Gasieniec, R. Klasing, R. Martin, A. Navarra, and X. Zhang. Fast periodic graph exploration with constant memory. Journal of Computer and System Sciences, 74(5):808-822, 2008.
  104. L. Esperet, M. Montassier, and A. Raspaud. Linear choosability of graphs. Discrete Mathematics, 308(17):3938-3950, 2008.
  105. A. Raspaud and W. Wang. On the vertex-arboricity of planar graphs. European Journal of Combinatorics, 29(4):1064-1075, 2008.
  106. F. Mazoit and N. Nisse. Monotonicity of non-deterministic graph searching. Journal of Theoretical Computer Science (TCS), 399:169-178, 2008.
  107. A. Haddar, A. Hadj Kacem, Y. Métivier, M. Mosbah, and M. Jmaiel. Proving distributed algorithms for mobile agents: Examples of spanning tree computation in anonymous networks. In S. Rao, M. Chatterjee, P. Jayanti, C. S. R. Murthy, and S. K. Saha, editors, International Conference on Distributed Computing and Networking (ICDCN), volume 4904 of Lecture notes in computer science, pages 286-291. Springer, 2008.
  108. M. Jmaiel, M. Mosbah, Y. Métivier, A. Hadj Kacem, and A. Haddar. Electing a leader in the local computation model using mobile agents. In International Conference on Computer Systems and Applications (ACS/IEEE) (AICCSA-08), pages 473-480, 2008.
  109. G. Fertin and A. Raspaud. Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Information Processing Letters, pages 65-72, 2008.
  110. M. Montassier, A. Raspaud, W. Wang, and Y. Wang. A relaxation of havel's 3-color problem. Information Processing Letters, 107(3-4):107-109, 2008.
  111. S. Gravier and P. Dorbec. Paired-domination in p5-free graphs. Graphs and Combinatorics, 24:1–6, 2008.
  112. A. Pêcher. Sur le polytope des cliques circulaires. In Journée H. Thuillier, 2008.
  113. S. Gravier, P. Dorbec, and G. Sarközy. Monochromatic hamiltonian t-tight berge-cycles in hypergraphs. Journal of Graph Theory, 59:34-44, 2008.
  114. S. Gravier, P. Dorbec, and E. Duchêne. Solitaire clobber game on hamming graphs. INTEGERS Elect. J. on Combin. Number Th., 8(GO3):21 pages, 2008.
  115. A. Pêcher. Polytope des cliques circulaires et calcul du nombre d'indépendance des graphes quasi-adjoints. In JPOC5 Journées Polyèdres et Optimisation Combinatoire, 2008.
  116. A. Boussicault and J.-G. Luque. Staircase macdonald polynomials and the q-discriminant. In FPSAC 2008, pages 381-392, 2008.
  117. M. Albenque and J.-F. Marckert. Some families of increasing planar maps. Electronic Journal of Probability, 2008.
  118. J.-C. Aval. Keys and alternating sign matrices. Seminaire Lotharingien de Combinatoire, 59, 2008.
  119. J.-C. Aval. Multivariate fuss-catalan numbers. Discrete Mathematics, 308:4660-4669, 2008.
  120. J.-F. Marckert. One more approach to the convergence of the empirical process to the brownian bridge. Electronic Journal of Statistics, 2:118-126, 2008.
  121. H. Belbachir, A. Boussicault, and J.-G. Luque. Hankel hyperdeterminants, rectangular jack polynomials and even powers of the vandermonde. Journal of Algebra, 320(11):3911-3925, 2008.
  122. M. Bousquet-Mélou and Y. Ponty. Culminating paths. Discrete Mathematics and Theoretical Computer Science, 10(2):125-152, 2008.
  123. M. Bousquet-Mélou, S. Linusson, and E. Nevo. On the independence complex of square grids. Journal of Algebraic Combinatorics / Journal of Algebraic Combinatorics An International Journal, 27:423-450., 2008.
  124. M. Bousquet-Mélou. Discrete excursions. Seminaire Lotharingien de Combinatoire, 57:23 pp., 2008.

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

Page mise à jour le 11/12/2017 à 16:25