O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency”, Discrete Mathematics and Theoretical Computer Science, vol. vol. 22 no. 3, Computational Logic and Applications (CLA'19) (3), Computational Logic and Applications (CLA'19), (DMTCS) (2021)
O. Bodini, A. Genitrini, M. Naima, A. Singh : “Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics”, Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings, vol. 12159, Lecture Notes in Computer Science, Yekaterinburg, Russian Federation, pp. 155-168, (Springer), (ISBN: 978-3-030-50025-2) (2020)
2019
O. Bodini, A. Genitrini, M. Naima : “Ranked Schröder Trees”, ANALCO 2019 - 16th Workshop on Analytic Algorithmics and Combinatorics, San Diego, CA, United States, pp. 13-26, (Society for Industrial and Applied Mathematics) (2019)
O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Combinatorics of Barrier Synchronization”, PETRI NETS 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, vol. 11522, Lecture Notes in Computer Science, Aachen, Germany, pp. 386-405 (2019)
2018
O. Bodini, A. Genitrini, M. Dien, A. Viola : “Beyond series-parallel concurrent systems: the case of arch processes”, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), vol. 110, Leibniz International Proceedings in Informatics (LIPIcs), Uppsala, Sweden, pp. 14:1-14:14 (2018)
O. Bodini, M. Dien, X. Fontaine, A. Genitrini, H.‑K. Hwang : “Increasing Diamonds”, 12th. Latin American Theoretical INformatics Symposium, Ensenada, Mexico (2016)
O. Bodini, A. Genitrini : “Cuts in Increasing Trees”, 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), San Diego, CA, United States, pp. 66-77 (2015)
O. Bodini, A. Genitrini, N. Rolin : “Pointed versus Singular Boltzmann Samplers”, 9th edition of the conference GASCom on random generation of combinatorial structures (GASCom'14), Bertinoro, Italy (2014)
2013
O. Bodini, A. Genitrini, F. Peschanski : “The Combinatorics of Non-determinism”, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 24, Leibniz International Proceedings in Informatics, Guwahati, India, pp. 425-436 (2013)
O. Bodini, A. Genitrini, F. Peschanski : “Enumeration and Random Generation of Concurrent Computations”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 83-96, (Discrete Mathematics and Theoretical Computer Science) (2012)
O. Bodini, Th. Fernique, M. Rao, É. Rémila : “Distances on rhombus tilings”, Theoretical Computer Science, vol. 412 (36), pp. 4787-4794, (Elsevier) (2011)
O. Bodini, D. Gardy, O. Roussel : “Boys-and-girls birthdays and Hadamard products”, 7th International Conference on Lattice Path Combinatorics and Applications, vol. 117 (1-4), Fundamenta Informaticae, Siena, Italy, pp. 85-101, (IOS Press) (2011)
O. Bodini, Y. Ponty : “Multi-dimensional Boltzmann Sampling of Languages”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings, Vienna, Austria, pp. 49-64, (Discrete Mathematics and Theoretical Computer Science) (2010)
O. Bodini, Th. Fernique, D. Regnault : “Stochastic Flips on Two-letter Words”, ANALCO 2010 - 7th Workshop on Analytic Algorithmics and Combinatorics, Austin, TX, United States, pp. 48-55, (SIAM) (2010)
A. Darrasse, H.‑K. Hwang, O. Bodini, M. Soria : “The connectivity-profile of random increasing k-trees”, Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Austin, United States, pp. 99-106, (Society for Industrial and Applied Mathematics) (2010)
O. Bodini, E. Fusy, C. Pivoteau : “Random sampling of plane partitions”, Combinatorics, Probability and Computing, vol. 19 (2), pp. 201-226, (Cambridge University Press (CUP)) (2010)
2009
O. Bodini, Th. Fernique, É. Rémila : “Distances on Lozenge Tilings”, DGCI 2009 - 15th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 5810, Lecture Notes in Computer Science, Montreal, Canada, pp. 240-251, (Springer) (2009)
O. Bodini, J. Lumbroso : “Optimal Partial Tiling of Manhattan Polyominoes”, DGCI 2009 - 15th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 5810, Lecture Notes in Computer Science, Montreal, Canada, pp. 79-91, (Springer) (2009)
O. Bodini, Th. Fernique, D. Regnault : “Cristallization by stochastic flips”, 6th International Conference on Aperiodic Crystals (APERIODIC'09), vol. 226 (1), Journal of Physics : Conference Series, Owford, United Kingdom, pp. 1-6, (IOP Sciences) (2009)
O. Bodini, A. Darrasse, M. Soria : “Distances in random Apollonian network structures”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), DMTCS Proceedings, Viña del Mar, Chile, pp. 307-318, (Discrete Mathematics and Theoretical Computer Science) (2008)
O. Bodini, S. Lefranc : “How to Tile by Dominoes the Boundary of a Polycube”, DGCI Discrete Geometry for Computer Imagery 2006, vol. 4245, Lecture Notes in Computer Science, Szeged, Hungary, pp. 630-638, (Elsevier) (2006)
O. Bodini, C. Pivoteau, E. Fusy : “Random Sampling of Plane Partitions”, Génération Aléatoire de structures COMbinatoires, GASCOM, Dijon, France, pp. 124-135 (2006)
O. Bodini, Th. Fernique : “Planar Dimer Tilings”, 1st International Computer Science Symposium in Russia, vol. 3967, Lecture Notes in Computer Science, St. Petersburg, Russian Federation, pp. 104-113, (Springer) (2006)