PAnDAG

Publications list


20 documents

Journal articles2 document


Conference papers8 document

  • Nadja Azzouz, Olivier Bodini, Francis Durand, Bernhard Gittenberger. Asymptotic Analysis of Generating Functions Arising from Dynamic Graphs. 37th International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2026, Munich, France. ⟨10.4230/LIPIcs.AofA.2026.30⟩. ⟨hal-05727365⟩
  • Nadja Azzouz, Olivier Bodini, Francis Durand, Bernhard Gittenberger. Efficient Sampling of Increasing Trees. 37th International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2026, Munich, Germany. ⟨10.4230/LIPIcs.AofA.2026.3⟩. ⟨hal-05727359⟩
  • Olivier Bodini, Antoine Genitrini, Khaydar Nurligareev. Growing binary trees. GASCom on random generation of combinatorial structures, Jun 2026, Malosco, Italy. ⟨hal-05562485⟩
  • Olivier Bodini, Francis Durand. Entropic Generation of Binary Words. Random Generation of Combinatorial Structures 2026, Jun 2026, Malosco, Italy. pp.38 – 46, ⟨10.48550/arXiv.2606.13157⟩. ⟨hal-05727380⟩
  • Olivier Bodini, Francis Durand. Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures. International Workshop on Combinatorial Algorithms 2025, Jul 2025, Bozeman, MT., United States. pp.405-417, ⟨10.1007/978-3-031-98740-3_29⟩. ⟨hal-05727328⟩
  • Simon Dreyer, Antoine Genitrini, Mehdi Naima. Optimal Uniform Shortest Path Sampling. 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Feb 2025, Chengdu, China. pp.160-179, ⟨10.1007/978-981-96-2845-2_11⟩. ⟨hal-04669060v3⟩
  • Julien Courtiel, Martin Pépin. Random Generation of Git Graphs. GASCom 2024, Jun 2024, Talence, France, France. pp.79-86, ⟨10.4204/EPTCS.403.18⟩. ⟨hal-04487862v2⟩
  • Amaury Curiel, Antoine Genitrini. Lexicographic Unranking Algorithms for the Twelvefold Way. 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), Jun 2024, Bath, United Kingdom. pp.17:1–17:14, ⟨10.4230/LIPIcs.AofA.2024.17⟩. ⟨hal-04411470v3⟩

Books1 document

  • Pascal Vanier (Dir.). Informatique Fondamentale et ses Mathématiques : Une photographie en 2025. CNRS Éditions, 2025, Informatique Fondamentale et ses Mathématiques, 978-2-271-15855-0. ⟨hal-05365250⟩

Preprints, Working Papers7 document

  • Khaydar Nurligareev, Thierry Monteil. Asymptotic probability of irreducibles III: Anti-SEQ. 2026. ⟨hal-05633763⟩
  • Sergey Kirgizov, Khaydar Nurligareev, Michael Wallner. Brick Wall Excursions: Combinatorial Interpretation of Random Flight Moments. 2026. ⟨hal-05633765⟩
  • Wojciech Gabryelski, Zbigniew Gołȩbiewski, Martin Pépin. Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs. 2026. ⟨hal-05503168⟩
  • Amaury Curiel, Antoine Genitrini. Lexicographic unranking algorithms for the Twentyfold Way. 2026. ⟨hal-05486059⟩
  • Simon Dreyer, Antoine Genitrini, Mehdi Naima. Asymptotic Enumeration of Labeled Triangle-Free Graphs through the Combinatorics of Directed Acyclic Graphs of Shortest Paths. 2026. ⟨hal-05609965v5⟩
  • Olivier Bodini, Antoine Genitrini, Khaydar Nurligareev. The Distribution of the Deepest Leaves in Binary Trees. 2026. ⟨hal-05606073v2⟩
  • Sergey Dovgal, Khaydar Nurligareev. Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae. 2024. ⟨hal-04814830⟩

Logiciel2 document


Powered by HAL logo