From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: CombAlg2012

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

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

  1. H. Hocquard and M. Montassier. Adjacent vertex-distinguishing edge coloring of graphs with maximum degree δ. Journal of Combinatorial Optimization, page 9, 2012.
  2. M. Chen, M. Montassier, and A. Raspaud. Some structural properties of planar graphs and their applications to 3-choosability. Discrete Mathematics, 312(2):362-373, 2012.
  3. O. Borodin, A. Ivanova, M. Montassier, and A. Raspaud. (k,1)-coloring of sparse graphs. Discrete Mathematics, 312(6):1128-1135, 2012.
  4. Y. Bu, M. Montassier, A. Raspaud, and W. Wang. On backbone coloring of graphs. Journal of Combinatorial Optimization, 23:79-93, 2012.
  5. C. Charpentier, M. Montassier, and A. Raspaud. L(p,q)-labeling of sparse graphs. Journal of Combinatorial Optimization, pages 001-015, 2012.
  6. W. Taouali, N. P. Rougier, and F. Alexandre. Visual target selection emerges from a bio-inspired network topology. In J. Kacprzyk, editor, Studies in Computational Intelligence. Springer Verlag, 2012.
  7. O. Beaumont, N. Bonichon, L. Eyraud-Dubois, and L. Marchal. Minimizing weighted mean completion time for malleable tasks scheduling. In IEEE, editor, IPDPS 2012, 26th IEEE International Parallel & Distributed Processing Symposium, 2012.
  8. A. Pêcher and A. Wagler. Polynomial time computability of some graph parameters for superclasses of perfect graphs. International Journal of Mathematics in Operational Research, 4(3):263-275, 2012.
  9. C. Johnen and F. Mekhaldi. From self- to self-stabilizing with service guarantee 1-hop weight-based clustering. In 4th International Symposium Stabilization, Safety, and Security of Distributed Systems (SSS 2012), volume 7596 of LNCS, pages 163-178. Springer, 2012.
  10. W. Taouali, N. P. Rougier, and F. Alexandre. A basic model of saccades encoding. In The NeuroComp/KEOpS'12 workshop, 2012.
  11. V. Vèque and C. Johnen. Hiérarchisation dans les réseaux ad hoc de véhicules. In R.-C. N. . a. Roose Ph., editor, 8èmes journées francophones Mobilité et Ubiquité, UBIMOB 2012, Données - informatique - I.A. - IHM, pages 45-52. CEPADUES, 2012.
  12. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves-Caro. Heterogeneous resource allocation under degree constraints. IEEE Transactions on Parallel and Distributed Systems, 2012.
  13. G. Chapuy, V. Féray, and E. Fusy. A simple tree model for unicellular maps. In FPSAC 2012, pages 215-226, 2012.
  14. V. Féray. Asymptotic behavior of some statistics in ewens random permutations. In AofA'12, volume AQ, pages 43-54, 2012.
  15. A. Benoit, H. Larchevêque, and P. Renaud-Goud. Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks. In Proceedings of IPDPS 2012. IEEE, 2012.
  16. A. Benoit, R. Melhem, P. Renaud-Goud, and Y. Robert. Power-aware manhattan routing on chip multiprocessors. In IPDPS'2012, the 26th IEEE International Parallel and Distributed Processing Symposium. IEEE Computer Society Press, 2012.
  17. P. Dorbec, B. Hartnell, and M. Henning. Paired versus double domination in k 1,r -free graphs. Journal of Combinatorial Optimization, pages 10.1007/s10878-012-9547-y, 2012.
  18. A. Pêcher. How unique is lovasz's theta function?,. In 2012 International Conference on Graph Theory, Combinatorics and Applications, 2012.
  19. A. Pêcher and A. Wagler. Computing clique and chromatic number of circular-perfect graphs in polynomial time. Mathematical Programming A, 2012.
  20. C. Carvajal, T. Viéville, and F. Alexandre. Konio pathway: An instinctive visual mechanism for survival and decision making? In NeuroComp/KEOpS'12 workshop beyond the retina: from computational models to outcomes in bioengineering. Focus on architecture and dynamics sustaining information flows in the visuomotor system., 2012.
  21. M. Bouvel and O. Guibert. Refined enumeration of permutations sorted with two stacks and a d_8-symmetry. In FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics), volume AR, pages 757-768, 2012.
  22. A. O. Ardiles, C. C. Tapia-Rojas, M. Mandal, F. Alexandre, A. Kirkwood, N. C. Inestrosa, and A. G. Palacios. Postsynaptic dysfunction is associated with spatial and object recognition memory loss in a natural model of alzheimer's disease. Proceedings of the National Academy of Sciences, 109(34):13835-40, 2012.
  23. F. Alexandre. Une approche systémique du réseau cérébral. In E. Letonturier, editor, Les Réseaux, pages 129-140. CNRS Editions, 2012.
  24. G. D'Angelo, G. Di Stefano, R. Klasing, and A. Navarra. Gathering of robots on anonymous grids without multiplicity detection. In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), volume 7355 of Lecture Notes in Computer Science, pages 327-338. Springer, 2012.
  25. P. Flocchini, D. Ilcinkas, and N. Santoro. Ping pong in dangerous graphs: Optimal black hole search with pebbles. Algorithmica, 62(3-4), 2012.
  26. J. Czyzowicz, S. Dobrev, L. Gąsieniec, D. Ilcinkas, J. Jansson, R. Klasing, I. Lignos, R. Martin, K. Sadakane, and W.-K. Sung. More efficient periodic traversal in anonymous undirected graphs. Theoretical Computer Science, 444, 2012.
  27. A. Kosowski, A. Navarra, D. Pajak, and C. Pinotti. Maximum matching in multi-interface networks. In COCOA - 6th Conference on Combinatorial Optimization and Applications - 2012, volume 7402 of Lecture Notes in Computer Science, pages 13-24. Springer, 2012.
  28. J. Czyzowicz, A. Kosowski, and A. Pelc. Time vs. space trade-offs for rendezvous in trees. In SPAA - 24th Symposium on Parallelism in Algorithms and Architectures - 2012, pages 1-10, 2012.
  29. A. Kosowski and A. Navarra. Graph decomposition for memoryless periodic exploration. Algorithmica, 63(1-2):26-38, 2012.
  30. J. Czyzowicz, A. Kosowski, and A. Pelc. How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Computing, 25(2):165-178, 2012.
  31. N. Bonichon, C. Gavoille, N. Hanusse, and L. Perkovic. The stretch factor of L<sub>1</sub>- and L<sub></sub>-Delaunay triangulations. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 205-216, 2012.
  32. I. Abraham, S. Chechik, and C. Gavoille. Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In ACM, editor, 44th Annual ACM Symposium on Theory of Computing (STOC), pages 1199-1217, 2012.
  33. M. Bousquet-Mélou, G. Chapuy, and L.-F. Préville-Ratelle. The representation of the symmetric group on m-tamari interval. In FPSAC (Formal Power Series and Algebraic Combinatorics), pages 351-353, 2012.
  34. M. Bousquet-Mélou. Philippe flajolet, founder of analytic combinatorics. In Program 'Random spatial processes', Atelier 'Lattice Models and Combinatorics', 2012.
  35. M. Bousquet-Mélou. Exactly solvable models of self-avoiding walks. In Program 'Random spatial processes', Atelier 'Connections for Women', 2012.
  36. M. Bousquet-Mélou. Le modèle de potts sur les cartes planaires. In Journées de Combinatoire de Bordeaux, 2012.
  37. M. Bousquet-Mélou. The number of inversions after n adjacent transpositions. In Algorithms and Permutations, 2012.
  38. O. Baudon, J. Przybylo, and M. Wozniak. On minimal arbitrarily partitionable graphs. Information Processing Letters, 112:697-700, 2012.
  39. J. Chalopin, Y. Métivier, and T. Morsellino. Enumeration and leader election in partially anonymous and multi-hop broadcast networks. Fundamenta Informaticae, 120(1):1-27, 2012.
  40. A. Kosowski, B. Li, N. Nisse, and K. Suchan. k-chordal graphs: from cops and robber to compact routing via treewidth. In 39th International Colloquium on Automata, Languages and Programming (ICALP), track C, pages 610-622, 2012.
  41. F. Becker, A. Kosowski, N. Nisse, I. Rapaport, and K. Suchan. Allowing each node to communicate only once in a distributed system: Shared whiteboard models. In Symposium on Parallelism in Algorithms and Architectures, page 7, 2012.
  42. Y. Métivier, J. Robson, N. Saheb-Djahromi, and A. Zemmari. On the time and the bit complexity of distributed randomised anonymous ring colouring. Theoretical Computer Science, 445:1-12, 2012.
  43. J. Chalopin, E. Godard, and Y. Métivier. Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Computing, 25(4):297-311, 2012.
  44. J. Chalopin, Y. Métivier, and T. Morsellino. On snapshots and stable properties detection in anonymous fully distributed systems (extended abstract). In G. Even and M. M. Halldorsson, editors, 19th International Colloquium on Structural Information and Communication Complexity, volume 7355 of Lecture notes in computer science, pages 207-218. Springer-Verlag, 2012.
  45. D. Ilcinkas and A. Wade. Puissance de l'attente aux stations pour l'exploration des réseaux de transport public