From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: CombAlg2011

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

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

  1. F. Jouanne, A. Awan, A. Madji, A. Pêcher, M. Latif, A. Kausar, J.-L. Mugnier, I. Khan, and N. Khan. Postseismic deformation in pakistan after the 8 october 2005 earthquake: Evidence of afterslip along a flat north of the balakot-bagh thrust. Journal of Geophysical Research Solid Earth, 116, 2011.
  2. W. Taouali, T. Vieville, N. P. Rougier, and F. Alexandre. No clock to rule them all. Journal of Physiology - Paris, 105(1-3):83-90, 2011.
  3. J. Czap, S. Jendrol', and F. Kardos. On the strong parity chromatic number. Discussiones Mathematicae Graph Theory, 31(3):587-600, 2011.
  4. J. Czap, S. Jendrol', and F. Kardos. Facial parity edge colouring. Ars Mathematica Contemporanea, 4(2):255-269, 2011.
  5. I. Atsonios, O. Beaumont, N. Hanusse, and Y. Kim. On power-law distributed balls in bins and its applications to view size estimation. In ISAAC, 2011.
  6. O. Beaumont, N. Bonichon, L. Eyraud-Dubois, and P. Uznanski. Broadcasting on large scale heterogeneous platforms with connectivity artifacts under the bounded multi-port model. In IEEE, editor, ICPADS 2011 - 17th Internation Conference on Parallel and Distributed Systems, volume Proceeding of ICPADS 2011, pages 173-180, 2011.
  7. A. Kosowski, A. Navarra, and C. Pinotti. Synchronous black hole search in directed graphs. Theoretical Computer Science, 412(41):5752-5759, 2011.
  8. O. Beaumont, L. Eyraud-Dubois, and Y. Won. Using the last-mile model as a distributed scheme for available bandwidth prediction. In Springer, editor, EuroPar 2011, 2011.
  9. O. Beaumont, N. Bonichon, P. Duchon, and H. Larchevêque. Use of internet embedding tools for heterogeneous resources aggregation. In IEEE, editor, Heterogeneity in Computing Workshop (HCW) - in IPDPS 2011, pages 114-124, 2011.
  10. E. Diot, C. Gavoille, and P. Ochem. Sur la difficulté de séparer un graphe par des plus courts chemins. In P. Ducourthial, Bertrand et Felber, editor, 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011.
  11. F. Kaisser, C. Johnen, and V. Vèque. Étude de la formation de convois dans un réseau de véhicules sur autoroute. In CFIP 2011 - Colloque Francophone sur l Ingénierie des Protocoles, 2011.
  12. N. Shah and F. Alexandre. Cooperation between reinforcement and procedural learning in the basal ganglia. In International Joint Conference on Neural Networks IJCNN 2011 Special Topic Neuroscience and Neurocognition, 2011.
  13. N. Shah and F. Alexandre. Reinforcement learning and dimensionality reduction: a model in computational neuroscience. In International Joint Conference on Neural Networks IJCNN 2011, 2011.
  14. O. Beaumont, N. Bonichon, P. Duchon, and H. Larchevêque. Utilisation d'outils de plongement d'internet pour l'agrégation de ressources hétérogènes. In P. Ducourthial, Bertrand et Felber, editor, Conférence : 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011.
  15. F. Alexandre and N. Shah. Apprentissage par renforcement et réduction de la dimensionnalité : une approche bio-inspirée. In Conférence francophone d'Apprentissage - CAP 2011, 2011.
  16. O. Beaumont, N. Bonichon, and H. Larchevêque. Modeling and practical evaluation of a service location problem in large scale networks. In Internation Conference on Parallel Computing 2011, page 10, 2011.
  17. L. Alecu, H. Frezza-Buet, and F. Alexandre. Can self-organization emerge through dynamic neural fields computation? Connection Science, 23(1):1-31, 2011.
  18. J. Fix, N. P. Rougier, and F. Alexandre. A dynamic neural field approach to the covert and overt deployment of spatial attention. Cognitive Computation, 3(1):279-293, 2011.
  19. E. Sopena. Cgt inspired tools for studying the game chromatic number of trees. In DIMAP Workshop on Combinatorics and Graph Theory 2011, 2011.
  20. M. Bousquet-Mélou. Enumeration with catalytic parameters (3 exposés). In Séminaire Lotharingien de Combinatoire, 2011.
  21. M. Bousquet-Mélou. Lattice paths everywhere. In Philippe Flajolet and Analytic Combinatorics, 2011.
  22. C. Gavoille. Dynamic algorithms via forbidden-set labeling. In First International Workshop on Dynamic Systems (DYNAM), 2011.
  23. D. Ilcinkas and A. Wade. On the power of waiting when exploring public transportation systems. In OPODIS 2011, volume 7109 of Lecture Notes in Computer Science, pages 451-464. Springer Berlin / Heidelberg, 2011.
  24. P. Duchon. Random generation of combinatorial structures: Boltzmann samplers and beyond. In S. Jain, R. Creasey, J. Himmelspach, K. White, and M. Fu, editors, Winter Simulation Conference, 2011.
  25. M. Bousquet-Mélou. Counting planar maps, coloured or uncoloured. In 23rd British Combinatorial Conference, volume 392 of London Math. Soc. Lecture Note Ser, pages 1-50, 2011.
  26. M. Bousquet-Mélou. Chemins dans un quart de plan. In ALEA, 2011.
  27. M. Bousquet-Mélou. The potts model on planar maps. In Stochastic analysis, 2011.
  28. A. Pêcher. The circular chromatic number of circular-perfect graphs is polytime. In 2011 Workshop on Graph Theory, 2011.
  29. C. Glacet, N. Hanusse, and D. Ilcinkas. The impact of edge deletions on the number of errors in networks. In OPODIS 2011, volume 7109 of Lecture Notes in Computer Science, pages 378-391. Springer Berlin / Heidelberg, 2011.
  30. C. Gavoille. Oracles pour les arbres et les graphes. In 10 ans du séminaire MaMux - Mathématiques, musique et relations avec d'autres disciplines, 2011.
  31. Y. Dieng and C. Gavoille. Routage compact optimal dans les (k,r)-constellations. Revue Technique et Science Informatiques (TSI), 30(05/2011):485-513, 2011.
  32. C. Gavoille and S. Chrisitan. Sparse spanners vs. compact routing. In 23<sup>rd</sup> Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 225-234. ACM, 2011.
  33. I. Abraham and C. Gavoille. On approximate distance labels and routing schemes with affine stretch. In 25<sup>th</sup> International Symposium on Distributed Computing (DISC), volume 6950 of Lecture Notes in Computer Science (ARCoSS), pages 404-415. Springer, 2011.
  34. C. Gavoille, Q. Godfroy, and L. Viennot. Node-disjoint multipath spanners and their relationship with fault-tolerant spanners. In G. L. Antonio Fernàndez Anta and M. Roy, editors, OPODIS'11 - 15th International Conference on Principles of Distributed Systems, volume 7109 of Lecture Notes in Computer Science, pages 143-158. Springer, 2011.
  35. J.-F. Marckert and N. Bonichon. Asymptotics of geometrical navigation on a random set of points of the plane. Advances in Applied Probability, 43(4):899-942, 2011.
  36. N. Bonichon, C. Gavoille, and N. Hanusse. An information-theoretic upper bound on planar graphs using well-orderly maps. In M. Dehmer, F. Emmert-Streib, and A. Mehler, editors, Towards an Information Theory of Complex Networks, pages 17-46. Birkhäuser Boston, 2011.
  37. F. Gilbert, O. Baudon, and M. Wozniak. Recursively arbitrarily vertex-decomposable suns. Opuscula Mathematica, 31(4):533-547, 2011.
  38. C. Johnen and F. Mekhaldi. Self-stabilizing computation and preservation of knowledge of neighbor clusters. In SASO 2011, pages 41-50. IEEE computer Society, 2011.
  39. P. Dorbec and M. Henning. Upper paired domination in claw-free graphs. Journal of Combinatorial Optimization, 22(2):235-251, 2011.
  40. C. Johnen and F. Mekhaldi. Self-stabilization versus robust self-stabilization for clustering in ad-hoc network. In J. R. Emmanuel Jeannot, Raymond Namyst, editor, Euro-Par 2011, volume 6852 of LNCS, pages 117-129. Springer, 2011.
  41. E. Bampas, D. Bilò, G. Drovandi, L. Gualà, R. Klasing, and G. Proietti. Network verification via routing table queries. In SIROCCO 2011, volume 6796 of Lecture Notes in Computer Science, pages 270-281, 2011.
  42. V. Féray and P. Sniady. Dual combinatorics of zonal polynomials. In Formal Power Series and Algebraic Combinatorics, volume AO, pages 317-328, 2011.
  43. J. Czyzowicz, L. Gasieniec, A. Kosowski, and E. Kranakis. Boundary patrolling by mobile agents with distinct maximal speeds. In C. Demetrescu and M. M. Halldórsson, editors, ESA 2011 - 19th Annual European Symposium on Algorithms, volume 6942 of Lecture Notes in Computer Science, pages 701-712. Springer, 2011.
  44. A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, and M. Russell. Synchronous rendezvous for location-aware agents. In D. Peleg, editor, DISC 2011 - 25th International Symposium on Distributed Computing, volume 6950 of Lecture Notes in Computer Science, pages 447-459. Springer, 2011.
  45. N. Hanusse, S. Maabout, and R. Tofan. Revisiting the partial data cube materialization. In Conference on Advances in Data Bases and Information Systems (ADBIS), number 6909 in LNCS, pages 70-83. Springer, 2011.
  46. N. Hanusse and S. Maabout. A parallel algorithm for computing borders. In International Conference on Information and Knowledge Managment (CIKM), pages 1639-1648. ACM, 2011.
  47. J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc. Asynchronous deterministic rendezvous in bounded terrains. Theoretical Computer Science, 412(50):6926-6937, 2011.
  48. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro. How many oblivious robots can explore a line. Information Processing Letters, 111(20):1027-1031, 2011.
  49. C. Cooper, D. Ilcinkas, R. Klasing, and A. Kosowski. Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing, 24(2):91-99, 2011.
  50. S. Sen. 2-dipath and oriented l(2,1)-labelings of some families of oriented planar graphs. In European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB'11, 2011.
  51. H. Hocquard and P. Valicov. Strong edge coloring of subcubic graphs. Discrete Applied Mathematics, 159(15):1650-1657, 2011.
  52. H. Hocquard, P. Ochem, and P. Valicov. Bounds and complexity results for strong edge colouring of subcubic graphs. In EuroComb'11, 2011.
  53. A. Pêcher and A. Wagler. Computing the clique number of a-perfect graphs in polynomial time. In Proceedings of Eurocomb'11, pages 705-710, 2011.
  54. A. Bacher and M. Bousquet-Mélou. Weakly directed self-avoiding walks. Journal of Combinatorial Theory, Series A, 118(8):2365-2391, 2011.
  55. M. H. Albert, M. D. Atkinson, M. Bouvel, A. Claesson, and M. Dukes. On the inverse image of pattern classes under bubble sort. Journal of Combinatorics, 2(2):231-244, 2011.
  56. Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. An optimal bit complexity randomized distributed mis algorithm. In Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, volume 5869 of Lecture Notes in Computer Science, pages 323-337. Springer, 2011.
  57. J.-C. Aval, J.-C. Novelli, and J.-Y. Thibon. The
  58. product in combinatorial hopf algebras. In FPSAC 2011, pages 75-86. DMTCS, 2011.
  59. M. Bousquet-Mélou. Counting permutations with no long monotone subsequence via generating trees and the kernel method. Journal of Algebraic Combinatorics, 33(4):571-608, 2011.
  60. V. Féray and P. Sniady. Zonal polynomials via stanley's coordinates and free cumulants. Journal of Algebra, 334:338-373, 2011.
  61. O. Delmas, S. Gravier, M. Montassier, and A. Parreau. On two variations of identifying codes. Discrete Mathematics, 311(17):1948-1956, 2011.
  62. F. Bassino, M. Bouvel, A. Pierrot, and D. Rossin. Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. Pure Mathematics and Applications, 21(2):119-135, 2011.
  63. V. Féray and P. Sniady. Asymptotics of characters of symmetric groups related to stanley character formula. Annals of Mathematics, 173(2):887-906, 2011.
  64. O. Bernardi and M. Bousquet-Mélou. Counting colored planar maps: algebraicity results. Journal of Combinatorial Theory, Series B, 101(5):315-377, 2011.
  65. Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. An optimal bit complexity randomised distributed mis algorithm. Distributed Computing, 23(5-6):331-340, 2011.
  66. F. Bassino, M. Bouvel, and D. Rossin. Enumeration of pin-permutations. Electronic Journal of Combinatorics, 18(1), 2011.
  67. B. Courcelle, C. Gavoille, and M. M. Kanté. Compact labelings for efficient first-order model-checking. Journal of Combinatorial Optimization, 21(1):19-46, 2011.

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

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