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

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

  1. O. Beaumont, L. Marchal, and Y. Robert. Scheduling divisible loads with return messages on heterogeneous master-worker platforms. In High Performance Computing – HiPC 2005. Springer, 2005.
  2. O. Beaumont, L. Marchal, and Y. Robert. Broadcast trees for heterogeneous platforms. In Parallel and Distributed Processing Symposium, IPDPS 2005. Proceedings. 19th IEEE International. IEEE, 2005.
  3. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Steady-state scheduling on heterogeneous clusters. International Journal of Foundations of Computer Science, 2005.
  4. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Pipelining broadcasts on heterogeneous platforms. IEEE Transactions on Parallel and Distributed Systems, 2005.
  5. O. Beaumont, H. Casanova, Y. Yang, and Y. Robert. Scheduling divisible loads on star and tree networks: results and open problems. IEEE Transactions on Parallel and Distributed Systems, 2005.
  6. M. Bouvel, V. Grebinski, and G. Kucherov. Combinatorial search on graphs motivated by bioinformatics applications: a brief survey. In 31st International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2005, volume 3787 of Lecture Notes in Computer Science, pages 16-27. Springer verlag, 2005.
  7. O. Ménard, H. Frezza-Buet, and F. Alexandre. Towards word semantics from multi-modal acoustico-motor integration: Application of the bijama model to the setting of action-dependant phonetic representations. In S. Wermter, G. Palm, and M. Elshaw, editors, Biomimetic Neural Learning for Intelligent Robots: Intelligent Systems, Cognitive Robotics, and Neuroscience, volume 3575, pages 144-161. Springer-Verlag, 2005.
  8. M. Attik, L. Bougrain, and F. Alexandre. Neural network topology optimization. In W. Duch, J. Kacprzyk, E. Oja, and S. Zadrozny, editors, 15th International conference on Artificial Neural Networks - ICANN 2005, volume 3697 of Lecture Notes in Computer Science, pages 53-58. Springer Verlag, 2005.
  9. M. Attik, L. Bougrain, and F. Alexandre. Self-organizing map initialization. In W. Duch, J. Kacprzyk, E. Oja, and S. Zadrozny, editors, 15th International conference on Artificial Neural Networks - ICANN 2005, volume 3696 of Lecture Notes in Computer Science, pages 357-362. Springer Verlag, 2005.
  10. F. Alexandre. Anticipation and selective attention. In 7eme colloque de la Société des Neurosciences, 2005.
  11. J. C. Sarrazin, A. Tonnelier, and F. Alexandre. A model of contextual effect on reproduced extents in recall tasks: The issue of the imputed motion hypothesis. Biological cybernetics., 92(5):303-315, 2005.
  12. N. Kerkeni, F. Alexandre, M. H. Bedoui, L. Bougrain, and M. Dogui. Automatic classification of sleep stages on a eeg signal by artificial neural networks. In 5th WSEAS International Conference on SIGNAL, SPEECH and IMAGE PROCESSING - WSEAS SSIP'05, 2005.
  13. N. Kerkeni, F. Alexandre, M. H. Bedoui, L. Bougrain, and M. Dogui. Neuronal spectral analysis of eeg and expert knowledge integration for automatic classification of sleep stages. WSEAS Transactions on Information Science and Applications, 2(11):1854-1861, 2005.
  14. F. Alexandre. Les spiking neurons : une leçon de la biologie pour le codage et le traitement des données. In J.-P. H. e. L. B. Y. Faouzi Ghorbel, Stephane Derrode, editor, Traitement et Analyse de l'Information Méthodes et Applications - TAIMA'05, 2005.
  15. J. Vitay, N. P. Rougier, and F. Alexandre. A distributed model of spatial visual attention. In G. P. S. Wermter and M. Elshaw, editors, Biomimetic Neural Learning for Intelligent Robotics, volume 3575, pages 54-72. Springer-Verlag, 2005.
  16. O. Beaumont, V. Boudet, P.-F. Dutot, A. Legrand, and Y. Robert. Fondements théoriques pour la conception d'algorithmes efficaces de gestion de ressources. In Informatique répartie: architecture, parallélisme et systèmes. Hermes Sciences, 2005.
  17. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert. Independent and divisible tasks scheduling on heterogeneous star-schaped platforms with limited memory. In PDP2005, 13th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, page 179―186. IEEE Computer Society Press, 2005.
  18. O. Baudon. 2-1 routing requests in the hypercube. In 7th International Colloquium on Graph Theory, volume 22, pages 535-538. Elsevier, 2005.
  19. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Exploration par un automate fini de réseaux anonymes étiquetés. In AlgoTel 2005, pages 9-12, 2005.
  20. F. V. Fomin, F. Mazoit, and I. Todinca. Computing branchwidth via efficient triangulations and blocks. In International Workshop on Graph-Theoretic Concepts in Computer Science, volume 3787 of Lecture Notes in Computer Science, pages 374-384, 2005.
  21. F. Bazzaro and C. Gavoille. Distance labeling for permutation graphs. In E. N. in Discrete Mathematics, editor, 7th International Conference on Graph Theory (ICGT), Hyères, octobre 2005, volume 22, pages 461-467. Elsevier, 2005.
  22. C. Gavoille. Etiquetage des graphes. In Ecole Jeunes Chercheurs en Algorithmique et Calcul Formel, Ecole thématique CNRS 05 13 051, Montpellier, avril 2005, 2005.
  23. F. Bazzaro and C. Gavoille. Localized and compact data-structure for comparability graphs. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), Sanya, Hainan, Chine, décembre 2005, volume 3827 of Lecture Notes in Computer Science, pages 1122-1131. Springer, 2005.
  24. I. Abraham, C. Gavoille, and D. Malkhi. Compact routing for graphs excluding a fixed minor. In 19th International Symposium on Distributed Computing (DISC), Cracovie, Pologne, septembre 2005, volume 3724 of Lecture Notes in Computer Science, pages 442-456. Springer, 2005.
  25. M. Bousquet-Mélou. On the shape of binary trees. In Séminaire lotharingien de Combinatoire, 2005.
  26. M. Bousquet-Mélou and E. Steingrimsson. Decreasing subsequences in permutations and wilf equivalence for involutions. In FPSAC (Formal Power series and Algebraic Combinatorics), 2005.
  27. M. Bousquet-Mélou, T. Guttmann, and I. Jensen. Self-avoiding walks crossing a square. Journal of Physics A, 38:9159-9181, 2005.
  28. L. Esperet, M. Montassier, and A. Raspaud. Linear choosability of graphs. In European conference on Combinatorics, Graph Theory and Applications., pages 99-104, 2005.
  29. O. Ly and C. Gavoille. Distance labeling in hyperbolic graphs. In 16th Annual International Symposium on Algorithms and Computation, ISAAC, volume 3827 of Lectures Notes in Computer Science, pages 1071-1081, 2005.
  30. J.-C. Aval. Diagonal temperley-lieb invariants and coinvariants. In FPSAC'05, 2005.
  31. A. Zvonkine. Topological classification of ramified coverings: a case study. In Computer Algebra and Informatics, 2005.
  32. A. Zvonkine. Topological classification of polynomials. In Graph Embeddings and Maps on Surfaces 2005, 2005.
  33. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg. Graph exploration by a finite automaton. Theoretical Computer Science, 345(2-3):331-344, 2005.
  34. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Labeling schemes for tree representation. In R. K. Ajit Pal, Ajay D. Kshemkalyani and A. Gupta, editors, IWDC 2005, volume 3741 of Lecture Notes in Computer Science, pages 13-24. Springer Berlin / Heidelberg, 2005.
  35. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Label-guided graph exploration by a finite automaton. In L. Caires, G. Italiano, L. Monteiro, P. D., and M. Yung, editors, ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 335-346. Springer Berlin / Heidelberg, 2005.
  36. P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, and S. Tixeuil. Space lower bounds for graph exploration via reduced automata. In M. R. Andrzej Pelc, editor, SIROCCO 2005, volume 3499 of Lecture Notes in Computer Science, pages 140-154. Springer Berlin / Heidelberg, 2005.
  37. T. Herman and C. Johnen. Strategies for peer-to-peer downloading. Information Processing Letters, 94(5):203-209, 2005.
  38. S. Coulonges, A. Pêcher, and A. Wagler. On the imperfection ratio of a-perfect webs. In 8th Combinatorial Optimization Workshop, Aussois, 2005.
  39. S. Coulonges, A. Pêcher, and A. Wagler. Graphes fortement circulaires-parfaits sans triangles. In JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinatoire, 2005.
  40. A. Wagler, A. Pêcher, and S. Coulonges. Polytope des stables des graphes fortement circulaires-parfaits. In JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinatoire, pages 728-738, 2005.
  41. S. Coulonges, A. Pêcher, and A. Wagler. On strongly circular-perfectness. In VIIth International Conference on Graph Theory, volume 22, pages 369-374, 2005.
  42. A. Wagler, A. Pêcher, and S. Coulonges. On stable set polytopes of circular-perfect graphs. In 5th ALIO/EURO conference on combinatorial optimization, 2005.
  43. S. Coulonges, A. Pêcher, and A. Wagler. On the imperfection ratio of a-perfect graphs and some consequences. In CTW05 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2005.
  44. J. Chalopin and Y. Métivier. A bridge between the asynchronous message passing model and local computations in graphs. In International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), volume 3618 of Lecture notes in computer science, pages 212-223. Springer, 2005.
  45. Y. Le Borgne. Counting upper interactions in dyck paths. In FPSAC 05, 2005.
  46. X. G. Viennot. A walk in the garden of bijections. In 54ème édition du Séminaire Lotharingien de Combinatoire, The Viennot Festschrift, 2005.
  47. X. G. Viennot. Heaps of segments, 2d lorentzian triangulations and curvature of the space-time. In 27th Nordic and 1st Franco-Nordic Congress of Mathematicians, 2005.
  48. X. G. Viennot. Combinatorics for 2d lorentzian quantum gravity. In Institut Mittag-Leffler, Algebraic combinatorics Seminar, 2005.
  49. X. G. Viennot. Kepler towers, catalan numbers and strahler distribution. In FPSAC05 (Formal Power Series and Algebraic Combinatorics), session spéciale dédiée à Adriano Garsia, 2005.
  50. M. Bousquet-Mélou. Are algebraic generating functions ordinary? In 24th Nordic and 1st Franco-Nordic Congress of Mathematicians, 2005.
  51. M. Bousquet-Mélou. Embedded trees. In Quantum Field Theory, Then and Now: A tribute to Claude Itzykson, 2005.
  52. M. Bousquet-Mélou. The ising and hard-particle models on planar maps. In 2nd Workshop on Tutte polynomials and applications, 2005.
  53. M. Bousquet-Mélou. Algebraic generating functions in enumerative combinatorics and context-free languages. In STACS (Symposium on Theoretical Aspects of Computer Science), volume 3404 of Lect. Notes Comput. Sci., pages 18-35, 2005.
  54. M. Bousquet-Mélou, T. Guttmann, and I. Jensen. Self-avoiding walks crossing a square. In Formal power series and algebraic combinatorics, pages 9159-9181, 2005.
  55. M. Bousquet-Mélou. On the shape of binary trees. In EUROCOMB, 2005.
  56. A. El Hibaoui, N. Saheb-Djahromi, and A. Zemmari. A uniform probabilistic election algorithm in k-trees. In IMACS : 17th IMACS World Congress : Scientific Computation, Applied Mathematics and Simulation, 2005.
  57. A. El Hibaoui, N. Saheb-Djahromi, and A. Zemmari. Polyominoids and uniform election. In FPSAC : 17th International Conference on Formal Power Series and Algebraic Combinatorics, 2005.
  58. N. Bonichon, C. Gavoille, and A. Labourel. Edge partition of toroidal graphs into forests in linear time. In 7th International Conference on Graph Theory (ICGT), volume 22, pages 421-425, 2005.
  59. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected planar graphs - (extended abstract). In Graph Drawing: 12th International Symposium, GD 2004, volume 3383, pages 60-70, 2005.
  60. C. Gavoille, N. Bonichon, and N. Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. Journal of Graph Algorithms and Applications, 9:185-204, 2005.
  61. N. Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths. Discrete Mathematics, 298:104-114, 2005.
  62. O. Borodin, A. Glebov, A. Raspaud, and M. Salavatipour. Planar graphs without cycles of length from 4 to 7 are 3-colorable. Journal of Combinatorial Theory Series B, 93:303-311, 2005.
  63. M. Hosseini Dolama and E. Sopena. On the oriented chromatic number of halin graphs. Information Processing Letters, 98:247-252, 2005.
  64. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small-world ? In Actes d'AlgoTel'2005 (conférence francophone sur les algorithmes de communications), pages 511-513, 2005.
  65. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small world ? In International Symposium on Distributed Computing (DISC), volume 3724, pages 511-513. Pierre Fraigniaud, 2005.
  66. J.-F. Marckert and S. Janson. Convergence of discrete snakes. Journal of Theoretical Probability, 18:615-645, 2005.
  67. J.-F. Marckert. Reinforced weak convergence of stochastic processes. Statistics and Probability Letters, 71:283-294, 2005.
  68. Y. Métivier, N. Saheb-Djahromi, and A. Zemmari. Locally guided randomized elections in trees: the totally fair case. Information and Computation, 198:40-55, 2005.
  69. C. Gavoille and M. Nehéz. Interval routing in reliability networks. Theoretical Computer Science, 333(3):415-432, 2005.
  70. C. Gavoille. Distributed data structures: a survey (invited lecture). In 12th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 3499 of Lecture Notes in Computer Science, page 2, 2005.
  71. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), volume 3499 of LNCS, pages 200-215, 2005.
  72. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From balls and bins to points and vertices. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), volume 3827, pages 757-766, 2005.
  73. M. Montassier and A. Raspaud. A note on 2-facial coloring of plane graphs. Information Processing Letters, 98:235-241, 2005.
  74. R. Klasing, J. Hromkovic, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer-Verlag, 2005.
  75. C. Cooper, R. Klasing, and M. Zito. Lower bounds and algorithms for dominating sets in web graphs. Internet Mathematics, 2(3):275-300, 2005.
  76. J.-C. Aval, F. Bergeron, and N. Bergeron. Diagonal temperley-lieb invariants and harmonics. Seminaire Lotharingien de Combinatoire, 54A, 2005.
  77. J.-C. Aval and N. Bergeron. Schur partial derivative operators. European Journal of Combinatorics, 26(6):785-794, 2005.
  78. B. Chauvin, T. Klein, J.-F. Marckert, and A. Rouault. Martingales and profile of binary search trees. Electronic Journal of Probability, 10 paper N°12:420-435, 2005.
  79. F. Fomin, F. Mazoit, and I. Todinca. Computing branchwidth via efficient triangulations and blocks. In 31st International Workshop on Graph-Theoretic Aspects in Computer Science (WG'05), LNCS vol. 3787, pages 374-384. Springer, 2005.
  80. M. Bousquet-Mélou and G. Xin. On partitions avoiding 3-crossings. Seminaire Lotharingien de Combinatoire, 54, 2005.
  81. P.-F. Dutot, L. Eyraud-Dubois, G. Mounié, and D. Trystram. Scheduling on large scale distributed platforms: From models to implementations. International Journal of Foundations of Computer Science, 16(2):217-237, 2005.
  82. M. Bousquet-Mélou and E. Steingrimsson. Decreasing subsequences in permutations and wilf equivalence for involutions. Journal of Algebraic Combinatorics / Journal of Algebraic Combinatorics An International Journal, 22(4):383 - 409, 2005.
  83. M. Bousquet-Mélou. Walks in the quarter plane: Kreweras' algebraic model. The Annals of Applied Probability, 15(2):1451-1491., 2005.

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

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