From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: CombAlg2010

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

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

  1. L. Dacheux, N. Berthet, G. Dissard, E. C. Holmes, O. Delmas, F. Larrous, G. Guigon, P. Dickinson, O. Faye, A. A. Sall, I. G. Old, K. Kong, G. C. Kennedy, J.-C. Manuguerra, S. T. Cole, V. Caro, A. Gessain, and H. Bourhy. Application of broad-spectrum resequencing microarray for genotyping rhabdoviruses. J Virol, 2010.
  2. R. Assenberg, O. Delmas, J. Ren, P.-O. Vidalain, A. Verma, F. Larrous, S. C. Graham, F. Tangy, J. M. Grimes, and H. Bourhy. Structure of the nucleoprotein binding domain of mokola virus phosphoprotein. Journal of Virology, 84(2):1089-96, 2010.
  3. A. Montejano, P. Ochem, A. Pinlou, A. Raspaud, and E. Sopena. Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics, 158(12):1365-1379, 2010.
  4. G. Mascle, A. Pecher, and S. Guillot. Himalaya-Tibet: la collision continental Inde-Eurasie. Vuibert, 2010.
  5. F. Herman, P. Copeland, J.-P. Avouac, L. Bollinger, G. Mahéo, P. Le Fort, S. Rai, D. Foster, A. Pêcher, K. Stüwe, and P. Henry. Exhumation, crustal deformation, and thermal structure of the nepal himalaya derived from the inversion of thermochronological and thermobarometric data and modeling of the topography. Journal of Geophysical Research, 115:06407, 2010.
  6. P. Duchon and L. Hubert. On the search path length of random binary skip graphs. In SIAM, editor, ANALCO 2010, pages 1-8. SIAM, 2010.
  7. C. Gavoille, Q. Godfroy, and L. Viennot. Multipath spanners. In T. E. Boaz Patt-Shamir, editor, Structural Information and Communication Complexity, 17th International Colloquium (SIROCCO), volume 6058 of Lecture Notes in Computer Science, pages 211-223. Springer, 2010.
  8. Y. Afek, E. Gafni, S. Rajsbaum, R. Michel, and C. Travers. The k-simultaneous consensus problem. Distributed Computing, 22(3):185-196, 2010.
  9. O. Beaumont and A. Rosenberg. Link-heterogeneity vs. node-heterogeneity in clusters. In HIPC - International Conference on High Performance Computing, 2010, 2010.
  10. W. Taouali, N. P. Rougier, and F. Alexandre. Saccades generation : from the visual input to the superior colliculus. In International Conference on Neural Computation ICNC 2010, 2010.
  11. N. Bonichon, C. Gavoille, N. Hanusse, D. Ilcinkas, and L. Perkovic. Comment résumer le plan. In M. G. P.-B. et Hervé Rivano, editor, 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010.
  12. C. Gavoille, Q. Godfroy, and L. Viennot. Graphes de recouvrement multichemins. In 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010.
  13. N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. Comment battre la marche aléatoire en comptant ? In M. G. P.-B. et Hervé Rivano, editor, 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010.
  14. O. Beaumont, L. Eyraud-Dubois, and S. Kumar. Broadcasting on large scale heterogeneous platforms under the bounded multi-port model. In 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), 2010.
  15. O. Beaumont and H. Rejeb. On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms. In 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), 2010.
  16. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves. On-line allocation of clients to multiple servers on large scale heterogeneous systems. In PDP 2010 - The 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing, 2010.
  17. E. Sopena. Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. In 8th French Combinatorial Conference 8FCC, 2010.
  18. I. Abraham, C. Gavoille, D. Malkhi, and U. Wieder. Strong-diameter decompositions of minor free graphs. Theory of Computing Systems, 47(4):837-855, 2010.
  19. J. Chalopin, S. Das, and A. Kosowski. Constructing a map of an anonymous graph: Applications of universal sequences. In OPODIS - 14th International Conference On Principles Of DIstributed Systems - 2010, volume 6490 of Lecture Notes in Computer Science, pages 119-134. Springer, 2010.
  20. Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. About randomised distributed graph colouring and graph partition algorithms. Information and Computation, 208(11):1296-1304, 2010.
  21. A. Bacher and M. Bousquet-Mélou. Weakly directed self-avoiding walks. In Formal power series and algebraic combinatorics 2010, DMTCS Proceedings, pages 473-484, 2010.
  22. M. Bousquet-Mélou. Sur les chemins auto-évitants. In Journées MAS, (Modélisation Aléatoire et Statistique), 2010.
  23. M. Bousquet-Mélou. The expected inversion number after n adjacent transpositions. In Aurora borealis combinatorics, 2010.
  24. A. Zvonkine. Fonctions de belyi : exemples, propriétés et applications. In Journées de Géométrie Algorithmique, 2010.
  25. O. Baudon, F. Gilbert, and M. Wozniak. Recursively arbitrarily vertex-decomposable graphs. In 8th French Combinatorial Conference, 2010.
  26. F. Kaisser, C. Johnen, and V. Vèque. Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway. In VNC 2010, pages 330-337, 2010.
  27. N. Ouled Abdallah, H. Hadj Kacem, M. Mosbah, and A. Zemmari. Broadcast in wireless mobile sensor networks with population protocols and extension with the rendezvous model. In K. Drira, A. H. Kacem, and M. Jmaiel, editors, NOuvelles TEchnologies de la REpartition 2010, IEEE, pages 219-226, 2010.
  28. V. Féray and E. A. Vassilieva. Linear coefficients of kerov's polynomials: bijective proof and refinement of zagier's result. In Formal Power Series and Algebraic Combinatorics, pages 713-724, 2010.
  29. C. Johnen and F. Mekhaldi. Robust self-stabilizing construction of bounded size weight-based clusters. In D. T. Pasqua D'Ambra, Mario Rosario Guarracino, editor, 16th International Parallel Processing Conference (Euro-Par 2010), volume 6271 of LNCS, pages 535-546. Springer, 2010.
  30. I. Adler, B.-M. Bui-Xuan, Y. Rabinovich, G. Renault, J. A. Telle, and M. Vatshelle. On the boolean-width of a graph: structure and applications. In 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10), volume 6410, pages 159-170, 2010.
  31. W. Taouali, T. Viéville, N. Rougier, and F. Alexandre. On asynchronous dynamic neural field computation. In Cinquième conférence plénière française de Neurosciences Computationnelles, "Neurocomp'10", 2010.
  32. N. Hanusse and S. Maabout. Un algorithme parallèle pour l'extraction des bordures. In BDA'10 : Actes des 26èmes Journées Bases de Données Avancées, page 11 pages, 2010.
  33. J. Andrieu, F. Alexandre, A. Genin, and J. San-Emeterio. Ressource fourragère en afrique soudano-sahélienne : estimation, cartographie, et suivi par analyse de séries temporelles de ndvi noaa. In LES SATELLITES GRAND CHAMP pour le suivi de l'environnement, des ressources naturelles et des risques, Clermont-Ferrand : France (2010), 2010.
  34. A. Mostefaoui, M. Raynal, and C. Travers. Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Theoretical Computer Science, 411(1):58-69, 2010.
  35. A. Pêcher. On the lovasz's theta function of power of chordless cycles. In 2010 International Conference on Graph Theory, Combinatorics and Applications, 2010.
  36. N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas. Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces. In WG 2010, volume 6410 of Lecture Notes in Computer Science, pages 266-278. Springer Berlin / Heidelberg, 2010.
  37. E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, and A. Labourel. Almost optimal asynchronous rendezvous in infinite multidimensional grids. In DISC 2010, volume 6343 of Lecture Notes in Computer Science, pages 297-311. Springer Berlin / Heidelberg, 2010.
  38. N. Bonichon, C. Gavoille, N. Hanusse, and L. Perkovic. Plane spanners of maximum degree six. In ICALP, volume 6198, pages 19-30, 2010.
  39. Y. Métivier and J. Chalopin. On the power of synchronization between two adjacent processes. Distributed Computing, 23(3):177-196, 2010.
  40. P. Dorbec and S. Gravier. Paired-domination in subdivided star-free graphs. Graphs and Combinatorics, 26(1):43-49, 2010.
  41. R. Klasing, A. Kosowski, and A. Navarra. Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theoretical Computer Science, 411(34-36):3235-3246, 2010.
  42. N. Hanusse, D. Ilcinkas, A. Kosowski, and N. Nisse. Locating a target with an agent guided by unreliable local advice. In PODC 2010, pages 355-364. ACM New York, NY, USA, 2010.
  43. J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc. Optimal exploration of terrains with obstacles. In SWAT 2010, volume 6139 of Lecture Notes in Computer Science, pages 1-12. Springer Berlin / Heidelberg, 2010.
  44. J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc. Asynchronous deterministic rendezvous in bounded terrains. In SIROCCO 2010, volume 6058 of Lecture Notes in Computer Science, pages 72-85. Springer Berlin / Heidelberg, 2010.
  45. Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. About randomised distributed graph colouring and graph partition algorithms. Information and Computation, 208(2):1296-1304, 2010.
  46. F. Mazoit. Tree-width of hypergraphs and surface duality. Journal of Combinatorial Theory, Series B, 102(3):671-687, 2010.
  47. T. Heymes, P. Monie, N. Arnaud, A. Pecher, J.-P. Bouillin, and R. Compagnoni. Alpine tectonics in the calabrian-peloritan belt (southern italy): New ar-40/ar-39 data in the aspromonte massif area. Lithos, 114(3-4):451-472, 2010.
  48. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro. Remembering without memory: Tree exploration by asynchronous oblivious robots. Theoretical Computer Science, 411(14-15):1583-1598, 2010.
  49. D. Ilcinkas, D. R. Kowalski, and A. Pelc. Fast radio broadcasting with advice. Theoretical Computer Science, 411(14-15):1544-1557, 2010.
  50. H.-J. Böckenhauer, R. Klasing, T. Mömke, and M. Steinová. Improved approximations for tsp with simple precedence constraints. In CIAC 2010, volume 6078 of Lecture Notes in Computer Science, pages 61-72, 2010.
  51. C. Joncour, A. Pêcher, and P. Valicov. Mpq-trees for orthogonal packing problem. In International Symposium on Combinatorial Optimization, volume 36, pages 423-429, 2010.
  52. C. Joncour and A. Pêcher. Consecutive ones matrices for multi-dimensional orthogonal packing problems. In International Symposium on Combinatorial Optimization, volume 36, pages 327-334, 2010.
  53. A. Pêcher and A. Wagler. Clique and chromatic number of circular-perfect graphs. In International Symposium on Combinatorial Optimization, volume 36, pages 199-206, 2010.
  54. A. El Hibaoui, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. Uniform election in trees and polyominoids. Discrete Applied Mathematics, (158):981-987, 2010.
  55. C. Cooper, R. Klasing, and T. Radzik. Locating and repairing faults in a network with mobile agents. Theoretical Computer Science, 411(14-15):1638-1647, 2010.
  56. J.-C. Aval and X. G. Viennot. The product of trees in the loday-ronco algebra through catalan alternative tableaux. Seminaire Lotharingien de Combinatoire, 63, 2010.
  57. A. Pêcher and X. Zhu. Claw-free circular-perfect graphs. Journal of Graph Theory, 65(2):163-172, 2010.
  58. J.-C. Aval and P. Duchon. Enumeration of alternating sign matrices of even size (quasi-)nvariant under a quarter-turn rotation. Electronic Journal of Combinatorics, 17, 2010.
  59. M. Dolega, V. Féray, and P. Sniady. Explicit combinatorial interpretation of kerov character polynomials as numbers of permutation factorizations. Advances in Mathematics, 225(1):81-120, 2010.
  60. V. Féray. Stanley's formula for characters of the symmetric group. Annals of Combinatorics, 13(4):453-461, 2010.
  61. J.-C. Aval, N. Bergeron, and H. Li. Non-commutative combinatorial inverse systems. International Journal of Algebra, 4(21):1003 - 1020, 2010.
  62. M. Bousquet-Mélou. The expected number of inversions after n adjacent transpositions. Discrete Mathematics and Theoretical Computer Science, 12(2):65-88, 2010.
  63. P. Fraigniaud, D. Ilcinkas, and A. Pelc. Communication algorithms with advice. Journal of Computer and System Sciences, 76(3-4):222-232, 2010.
  64. A. Zvonkine and S. Lando. Graphes sur les surfaces et leurs applications. Centre d'éducation continue en mathématiques de Moscou, 2010.
  65. O. Borodin, M. Montassier, and A. Raspaud. Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Mathematics, 310(1):167-173, 2010.
  66. E. Sopena and J. Wu. Coloring the square of the cartesian product of two cycles. Discrete Mathematics, 310(17-18):2327-2333, 2010.
  67. O. Borodin, A. Ivanova, M. Montassier, P. Ochem, and A. Raspaud. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory, 65(2):83-93, 2010.
  68. M. Bousquet-Mélou, A. Claesson, M. Dukes, and S. Kitaev. (2+2)-free posets, ascent sequences and pattern avoiding permutations. Journal of Combinatorial Theory, Series A, 117(7):884-909, 2010.
  69. B. Derbel, M. Mosbah, and A. Zemmari. Sublinear fully distributed partition with applications. Theory of Computing Systems, 47(3):368-404, 2010.
  70. V. Bonifaci, R. Klasing, P. Korteweg, L. Stougie, and A. Marchetti-Spaccamela. Data gathering in wireless networks. In A. Koster and X. Munoz, editors, Graphs and Algorithms in Communication Networks, pages 357-377. Springer-Verlag, 2010.
  71. I. Caragiannis, M. Flammini, C. Kaklamanis, R. Klasing, and A. Navarra. Energy consumption minimization in ad hoc wireless and multi-interface networks. In A. Koster and X. Munoz, editors, Graphs and Algorithms in Communication Networks, pages 335-355. Springer-Verlag, 2010.
  72. M. Bousquet-Mélou and M. Mishna. Walks with small steps in the quarter plane. Contemporary Mathematics, 520:1-40, 2010.
  73. A. Pêcher and A. Wagler. On facets of stable set polytopes of claw-free graphs with stability number three. Discrete Mathematics, 310(3):493-498, 2010.
  74. N. Bonichon, M. Bousquet-Mélou, and E. Fusy. Baxter permutations and plane bipolar orientations. Seminaire Lotharingien de Combinatoire, 61A, 2010.
  75. M. Bousquet-Mélou. Families of prudent self-avoiding walks. Journal of Combinatorial Theory Series A, 117(3):313-344, 2010.

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

Récupéré sur
Page mise à jour le 03/07/2020 à 15:34