var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://busyweaver.github.io/bibs/biblio.bib\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"A lattice on Dyck paths close to the Tamari lattice\",\"author\":[{\"firstnames\":[\"Jean-Luc\"],\"propositions\":[],\"lastnames\":[\"Baril\"],\"suffixes\":[]},{\"firstnames\":[\"Sergey\"],\"propositions\":[],\"lastnames\":[\"Kirgizov\"],\"suffixes\":[]},{\"firstnames\":[\"Mehdi\"],\"propositions\":[],\"lastnames\":[\"Naima\"],\"suffixes\":[]}],\"year\":\"2023\",\"eprint\":\"2309.00426\",\"archiveprefix\":\"arXiv\",\"primaryclass\":\"math.CO\",\"bibtex\":\"@misc{baril2023lattice,\\n      title={A lattice on Dyck paths close to the Tamari lattice}, \\n      author={Jean-Luc Baril and Sergey Kirgizov and Mehdi Naima},\\n      year={2023},\\n      eprint={2309.00426},\\n      archivePrefix={arXiv},\\n      primaryClass={math.CO}\\n}\\n\\n\",\"author_short\":[\"Baril, J.\",\"Kirgizov, S.\",\"Naima, M.\"],\"key\":\"baril2023lattice\",\"id\":\"baril2023lattice\",\"bibbaseid\":\"baril-kirgizov-naima-alatticeondyckpathsclosetothetamarilattice-2023\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"booklet\",\"type\":\"booklet\",\"title\":\"Increasing Schröder trees and restricted permutations (Extended Abstract)\",\"author\":[{\"firstnames\":[\"Mehdi\"],\"propositions\":[],\"lastnames\":[\"Naima\"],\"suffixes\":[]}],\"howpublished\":\"Book of Abstracts - Permutation Patterns 2023\",\"month\":\"July\",\"url\":\"https://2023.permutationpatterns.com/booklet/bookletco.pdf\",\"year\":\"2023\",\"bibtex\":\"@booklet{naimapp23,\\n  title        = \\\"Increasing Schröder trees and restricted permutations (Extended Abstract)\\\",\\n  author       = \\\"Mehdi Naima\\\", \\n  howpublished = \\\"Book of Abstracts - Permutation Patterns 2023\\\",\\n  month        = jul,\\n  url={https://2023.permutationpatterns.com/booklet/bookletco.pdf},\\n  year         = 2023\\n}\\n\\n\",\"author_short\":[\"Naima, M.\"],\"key\":\"naimapp23\",\"id\":\"naimapp23\",\"bibbaseid\":\"naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://2023.permutationpatterns.com/booklet/bookletco.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"booklet\",\"type\":\"booklet\",\"title\":\"Temporal Betweenness Centrality on Shortest Paths (Extended Abstract)\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Latapy\"],\"firstnames\":[\"Matthieu\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Magnien\"],\"firstnames\":[\"Clémence\"],\"suffixes\":[]}],\"howpublished\":\"Book of Abstracts - FRCCS 2023\",\"month\":\"May\",\"url\":\"https://doi.org/10.5281/zenodo.7957531\",\"year\":\"2023\",\"bibtex\":\"@booklet{naimabetdisshor,\\n  title        = \\\"Temporal Betweenness Centrality on Shortest Paths (Extended Abstract)\\\",\\n  author       = \\\"Naima, Mehdi and Latapy, Matthieu and Magnien, Clémence\\\", \\n  howpublished = \\\"Book of Abstracts - FRCCS 2023\\\",\\n  month        = may,\\n    url={https://doi.org/10.5281/zenodo.7957531},\\n  year         = 2023\\n}\\n\\n\\n\\n\",\"author_short\":[\"Naima, M.\",\"Latapy, M.\",\"Magnien, C.\"],\"key\":\"naimabetdisshor\",\"id\":\"naimabetdisshor\",\"bibbaseid\":\"naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.5281/zenodo.7957531\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Ranked Schröder Trees\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bodini\"],\"firstnames\":[\"Olivier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Genitrini\"],\"firstnames\":[\"Antoine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]}],\"booktitle\":\"2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)\",\"pages\":\"13–26\",\"year\":\"2019\",\"organization\":\"SIAM\",\"bibtex\":\"@inproceedings{BGN19,\\n  title={{Ranked Schr{\\\\\\\"o}der Trees}},\\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi},\\n  booktitle={2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)},\\n  pages={13--26},\\n  year={2019},\\n  organization={SIAM}\\n}\\n\\n\",\"author_short\":[\"Bodini, O.\",\"Genitrini, A.\",\"Naima, M.\"],\"key\":\"BGN19\",\"id\":\"BGN19\",\"bibbaseid\":\"bodini-genitrini-naima-rankedschrdertrees-2019\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"bodini, o\":\"http://localhost:8000/pages/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bodini\"],\"firstnames\":[\"Olivier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Genitrini\"],\"firstnames\":[\"Antoine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Singh\"],\"firstnames\":[\"Alexandros\"],\"suffixes\":[]}],\"booktitle\":\"International Computer Science Symposium in Russia\",\"pages\":\"155–168\",\"year\":\"2020\",\"organization\":\"Springer\",\"bibtex\":\"@inproceedings{bodini2020families,\\n  title={Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics},\\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi and Singh, Alexandros},\\n  booktitle={International Computer Science Symposium in Russia},\\n  pages={155--168},\\n  year={2020},\\n  organization={Springer}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Bodini, O.\",\"Genitrini, A.\",\"Naima, M.\",\"Singh, A.\"],\"key\":\"bodini2020families\",\"id\":\"bodini2020families\",\"bibbaseid\":\"bodini-genitrini-naima-singh-familiesofmonotonictreescombinatorialenumerationandasymptotics-2020\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"bodini, o\":\"http://localhost:8000/pages/publications.html\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bodini\"],\"firstnames\":[\"Olivier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Genitrini\"],\"firstnames\":[\"Antoine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mailler\"],\"firstnames\":[\"Cécile\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]}],\"journal\":\"Advances in Applied Mathematics\",\"volume\":\"133\",\"pages\":\"102284\",\"year\":\"2022\",\"publisher\":\"Elsevier\",\"key\":\"bodini2022strict\",\"id\":\"bodini2022strict\",\"bibbaseid\":\"anonymous-strictmonotonictreesarisingfromevolutionaryprocessescombinatorialandprobabilisticstudy-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Compaction for two models of logarithmic-depth trees: Analysis and experiments\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bodini\"],\"firstnames\":[\"Olivier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Genitrini\"],\"firstnames\":[\"Antoine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gittenberger\"],\"firstnames\":[\"Bernhard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Larcher\"],\"firstnames\":[\"Isabella\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]}],\"journal\":\"Random Structures & Algorithms\",\"volume\":\"61\",\"number\":\"1\",\"pages\":\"31–61\",\"year\":\"2022\",\"publisher\":\"Wiley Online Library\",\"key\":\"bodini2022compaction\",\"id\":\"bodini2022compaction\",\"bibbaseid\":\"anonymous-compactionfortwomodelsoflogarithmicdepthtreesanalysisandexperiments-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"A combinatorial link between labelled graphs and increasingly labelled Schröder trees\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bodini\"],\"firstnames\":[\"Olivier\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Genitrini\"],\"firstnames\":[\"Antoine\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]}],\"booktitle\":\"LATIN 2022: Theoretical Informatics: 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings\",\"pages\":\"493–509\",\"year\":\"2022\",\"organization\":\"Springer\",\"bibtex\":\"@inproceedings{bodini2022combinatorial,\\n  title={A combinatorial link between labelled graphs and increasingly labelled Schr{\\\\\\\"o}der trees},\\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi},\\n  booktitle={LATIN 2022: Theoretical Informatics: 15th Latin American Symposium, Guanajuato, Mexico, November 7--11, 2022, Proceedings},\\n  pages={493--509},\\n  year={2022},\\n  organization={Springer}\\n}\\n\\n\\n\",\"author_short\":[\"Bodini, O.\",\"Genitrini, A.\",\"Naima, M.\"],\"key\":\"bodini2022combinatorial\",\"id\":\"bodini2022combinatorial\",\"bibbaseid\":\"bodini-genitrini-naima-acombinatoriallinkbetweenlabelledgraphsandincreasinglylabelledschrdertrees-2022\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"phdthesis\",\"type\":\"Theses\",\"title\":\"Combinatorics of trees under increasing labellings:Asymptotics, bijections and algorithms\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Naima\"],\"firstnames\":[\"Mehdi\"],\"suffixes\":[]}],\"url\":\"https://hal.archives-ouvertes.fr/tel-03160040\",\"school\":\"Université Sorbonne Paris Nord\",\"year\":\"2020\",\"month\":\"December\",\"keywords\":\"Bijections ; Analytic Combinatorics ; Random generation ; Increasing trees ; Compaction algorithm ; Asymptotic enumeration ; Evolution process ; Algorithme de compression ; Enumération asymptotique ; Arbres croissants ; Génération aléatoire de structures combinatoire ; Combinatoire Analytique ; Processus d'évolution ; Bijections\",\"pdf\":\"https://hal.archives-ouvertes.fr/tel-03160040/file/thesis.pdf\",\"hal_id\":\"tel-03160040\",\"hal_version\":\"v1\",\"bibtex\":\"@phdthesis{naima:tel-03160040,\\n  TITLE = {{Combinatorics of trees under increasing labellings:Asymptotics, bijections and algorithms}},\\n  AUTHOR = {Naima, Mehdi},\\n  URL = {https://hal.archives-ouvertes.fr/tel-03160040},\\n  SCHOOL = {{Universit{\\\\'e} Sorbonne Paris Nord}},\\n  YEAR = {2020},\\n  MONTH = Dec,\\n  KEYWORDS = {Bijections ; Analytic Combinatorics ; Random generation ; Increasing trees ; Compaction algorithm ; Asymptotic enumeration ; Evolution process ; Algorithme de compression ; Enum{\\\\'e}ration asymptotique ; Arbres croissants ; G{\\\\'e}n{\\\\'e}ration al{\\\\'e}atoire de structures combinatoire ; Combinatoire Analytique ; Processus d'{\\\\'e}volution ; Bijections},\\n  TYPE = {Theses},\\n  PDF = {https://hal.archives-ouvertes.fr/tel-03160040/file/thesis.pdf},\\n  HAL_ID = {tel-03160040},\\n  HAL_VERSION = {v1},\\n}\\n\",\"author_short\":[\"Naima, M.\"],\"key\":\"naima:tel-03160040\",\"id\":\"naima:tel-03160040\",\"bibbaseid\":\"naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://hal.archives-ouvertes.fr/tel-03160040\"},\"keyword\":[\"Bijections ; Analytic Combinatorics ; Random generation ; Increasing trees ; Compaction algorithm ; Asymptotic enumeration ; Evolution process ; Algorithme de compression ; Enumération asymptotique ; Arbres croissants ; Génération aléatoire de structures combinatoire ; Combinatoire Analytique ; Processus d'évolution ; Bijections\"],\"metadata\":{\"authorlinks\":{\"naima, m\":\"https://busyweaver.github.io/\"}},\"downloads\":1,\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"biblio.bib\" href=\"data:text/bibtex;base64,QG1pc2N7YmFyaWwyMDIzbGF0dGljZSwKICAgICAgdGl0bGU9e0EgbGF0dGljZSBvbiBEeWNrIHBhdGhzIGNsb3NlIHRvIHRoZSBUYW1hcmkgbGF0dGljZX0sIAogICAgICBhdXRob3I9e0plYW4tTHVjIEJhcmlsIGFuZCBTZXJnZXkgS2lyZ2l6b3YgYW5kIE1laGRpIE5haW1hfSwKICAgICAgeWVhcj17MjAyM30sCiAgICAgIGVwcmludD17MjMwOS4wMDQyNn0sCiAgICAgIGFyY2hpdmVQcmVmaXg9e2FyWGl2fSwKICAgICAgcHJpbWFyeUNsYXNzPXttYXRoLkNPfQp9CgoKCkBib29rbGV0e25haW1hcHAyMywKICB0aXRsZSAgICAgICAgPSAiSW5jcmVhc2luZyBTY2hyw7ZkZXIgdHJlZXMgYW5kIHJlc3RyaWN0ZWQgcGVybXV0YXRpb25zIChFeHRlbmRlZCBBYnN0cmFjdCkiLAogIGF1dGhvciAgICAgICA9ICJNZWhkaSBOYWltYSIsIAogIGhvd3B1Ymxpc2hlZCA9ICJCb29rIG9mIEFic3RyYWN0cyAtIFBlcm11dGF0aW9uIFBhdHRlcm5zIDIwMjMiLAogIG1vbnRoICAgICAgICA9IGp1bCwKICB1cmw9e2h0dHBzOi8vMjAyMy5wZXJtdXRhdGlvbnBhdHRlcm5zLmNvbS9ib29rbGV0L2Jvb2tsZXRjby5wZGZ9LAogIHllYXIgICAgICAgICA9IDIwMjMKfQoKCgpAYm9va2xldHtuYWltYWJldGRpc3Nob3IsCiAgdGl0bGUgICAgICAgID0gIlRlbXBvcmFsIEJldHdlZW5uZXNzIENlbnRyYWxpdHkgb24gU2hvcnRlc3QgUGF0aHMgKEV4dGVuZGVkIEFic3RyYWN0KSIsCiAgYXV0aG9yICAgICAgID0gIk5haW1hLCBNZWhkaSBhbmQgTGF0YXB5LCBNYXR0aGlldSBhbmQgTWFnbmllbiwgQ2zDqW1lbmNlIiwgCiAgaG93cHVibGlzaGVkID0gIkJvb2sgb2YgQWJzdHJhY3RzIC0gRlJDQ1MgMjAyMyIsCiAgbW9udGggICAgICAgID0gbWF5LAogICAgdXJsPXtodHRwczovL2RvaS5vcmcvMTAuNTI4MS96ZW5vZG8uNzk1NzUzMX0sCiAgeWVhciAgICAgICAgID0gMjAyMwp9CgoKCgoKQGlucHJvY2VlZGluZ3N7QkdOMTksCiAgdGl0bGU9e3tSYW5rZWQgU2NocntcIm99ZGVyIFRyZWVzfX0sCiAgYXV0aG9yPXtCb2RpbmksIE9saXZpZXIgYW5kIEdlbml0cmluaSwgQW50b2luZSBhbmQgTmFpbWEsIE1laGRpfSwKICBib29rdGl0bGU9ezIwMTkgUHJvY2VlZGluZ3Mgb2YgdGhlIFNpeHRlZW50aCBXb3Jrc2hvcCBvbiBBbmFseXRpYyBBbGdvcml0aG1pY3MgYW5kIENvbWJpbmF0b3JpY3MgKEFOQUxDTyl9LAogIHBhZ2VzPXsxMy0tMjZ9LAogIHllYXI9ezIwMTl9LAogIG9yZ2FuaXphdGlvbj17U0lBTX0KfQoKCgpAaW5wcm9jZWVkaW5nc3tib2RpbmkyMDIwZmFtaWxpZXMsCiAgdGl0bGU9e0ZhbWlsaWVzIG9mIE1vbm90b25pYyBUcmVlczogQ29tYmluYXRvcmlhbCBFbnVtZXJhdGlvbiBhbmQgQXN5bXB0b3RpY3N9LAogIGF1dGhvcj17Qm9kaW5pLCBPbGl2aWVyIGFuZCBHZW5pdHJpbmksIEFudG9pbmUgYW5kIE5haW1hLCBNZWhkaSBhbmQgU2luZ2gsIEFsZXhhbmRyb3N9LAogIGJvb2t0aXRsZT17SW50ZXJuYXRpb25hbCBDb21wdXRlciBTY2llbmNlIFN5bXBvc2l1bSBpbiBSdXNzaWF9LAogIHBhZ2VzPXsxNTUtLTE2OH0sCiAgeWVhcj17MjAyMH0sCiAgb3JnYW5pemF0aW9uPXtTcHJpbmdlcn0KfQoKCgoKCgoKCgpAaW5wcm9jZWVkaW5nc3tib2RpbmkyMDIyY29tYmluYXRvcmlhbCwKICB0aXRsZT17QSBjb21iaW5hdG9yaWFsIGxpbmsgYmV0d2VlbiBsYWJlbGxlZCBncmFwaHMgYW5kIGluY3JlYXNpbmdseSBsYWJlbGxlZCBTY2hye1wib31kZXIgdHJlZXN9LAogIGF1dGhvcj17Qm9kaW5pLCBPbGl2aWVyIGFuZCBHZW5pdHJpbmksIEFudG9pbmUgYW5kIE5haW1hLCBNZWhkaX0sCiAgYm9va3RpdGxlPXtMQVRJTiAyMDIyOiBUaGVvcmV0aWNhbCBJbmZvcm1hdGljczogMTV0aCBMYXRpbiBBbWVyaWNhbiBTeW1wb3NpdW0sIEd1YW5hanVhdG8sIE1leGljbywgTm92ZW1iZXIgNy0tMTEsIDIwMjIsIFByb2NlZWRpbmdzfSwKICBwYWdlcz17NDkzLS01MDl9LAogIHllYXI9ezIwMjJ9LAogIG9yZ2FuaXphdGlvbj17U3ByaW5nZXJ9Cn0KCgoKCkBwaGR0aGVzaXN7bmFpbWE6dGVsLTAzMTYwMDQwLAogIFRJVExFID0ge3tDb21iaW5hdG9yaWNzIG9mIHRyZWVzIHVuZGVyIGluY3JlYXNpbmcgbGFiZWxsaW5nczpBc3ltcHRvdGljcywgYmlqZWN0aW9ucyBhbmQgYWxnb3JpdGhtc319LAogIEFVVEhPUiA9IHtOYWltYSwgTWVoZGl9LAogIFVSTCA9IHtodHRwczovL2hhbC5hcmNoaXZlcy1vdXZlcnRlcy5mci90ZWwtMDMxNjAwNDB9LAogIFNDSE9PTCA9IHt7VW5pdmVyc2l0e1wnZX0gU29yYm9ubmUgUGFyaXMgTm9yZH19LAogIFlFQVIgPSB7MjAyMH0sCiAgTU9OVEggPSBEZWMsCiAgS0VZV09SRFMgPSB7QmlqZWN0aW9ucyA7IEFuYWx5dGljIENvbWJpbmF0b3JpY3MgOyBSYW5kb20gZ2VuZXJhdGlvbiA7IEluY3JlYXNpbmcgdHJlZXMgOyBDb21wYWN0aW9uIGFsZ29yaXRobSA7IEFzeW1wdG90aWMgZW51bWVyYXRpb24gOyBFdm9sdXRpb24gcHJvY2VzcyA7IEFsZ29yaXRobWUgZGUgY29tcHJlc3Npb24gOyBFbnVte1wnZX1yYXRpb24gYXN5bXB0b3RpcXVlIDsgQXJicmVzIGNyb2lzc2FudHMgOyBHe1wnZX1ue1wnZX1yYXRpb24gYWx7XCdlfWF0b2lyZSBkZSBzdHJ1Y3R1cmVzIGNvbWJpbmF0b2lyZSA7IENvbWJpbmF0b2lyZSBBbmFseXRpcXVlIDsgUHJvY2Vzc3VzIGQne1wnZX12b2x1dGlvbiA7IEJpamVjdGlvbnN9LAogIFRZUEUgPSB7VGhlc2VzfSwKICBQREYgPSB7aHR0cHM6Ly9oYWwuYXJjaGl2ZXMtb3V2ZXJ0ZXMuZnIvdGVsLTAzMTYwMDQwL2ZpbGUvdGhlc2lzLnBkZn0sCiAgSEFMX0lEID0ge3RlbC0wMzE2MDA0MH0sCiAgSEFMX1ZFUlNJT04gPSB7djF9LAp9Cg==\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://busyweaver.github.io/bibs/biblio.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://busyweaver.github.io/bibs/biblio.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbusyweaver.github.io%2Fbibs%2Fbiblio.bib&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbusyweaver.github.io%2Fbibs%2Fbiblio.bib&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbusyweaver.github.io%2Fbibs%2Fbiblio.bib&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"baril-kirgizov-naima-alatticeondyckpathsclosetothetamarilattice-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A lattice on Dyck paths close to the Tamari lattice.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Baril, J.; Kirgizov, S.;  and Naima, M.\n</span>\n\n  \n\n</span>\n\n   2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/baril-kirgizov-naima-alatticeondyckpathsclosetothetamarilattice-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('baril-kirgizov-naima-alatticeondyckpathsclosetothetamarilattice-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{baril2023lattice,\n      title={A lattice on Dyck paths close to the Tamari lattice}, \n      author={Jean-Luc Baril and Sergey Kirgizov and Mehdi Naima},\n      year={2023},\n      eprint={2309.00426},\n      archivePrefix={arXiv},\n      primaryClass={math.CO}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://2023.permutationpatterns.com/booklet/bookletco.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023', 'https://2023.permutationpatterns.com/booklet/bookletco.pdf', event);\">\n    Increasing Schröder trees and restricted permutations (Extended Abstract).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naima, M.\n</span>\n\n  \n\n</span>\n\n  Book of Abstracts - Permutation Patterns 2023, July 2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://2023.permutationpatterns.com/booklet/bookletco.pdf\"\n     onclick=\"log_download('naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023', 'https://2023.permutationpatterns.com/booklet/bookletco.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Increasing Schröder trees and restricted permutations (Extended Abstract) [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naima-increasingschrdertreesandrestrictedpermutationsextendedabstract-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@booklet{naimapp23,\n  title        = &quot;Increasing Schröder trees and restricted permutations (Extended Abstract)&quot;,\n  author       = &quot;Mehdi Naima&quot;, \n  howpublished = &quot;Book of Abstracts - Permutation Patterns 2023&quot;,\n  month        = jul,\n  url={https://2023.permutationpatterns.com/booklet/bookletco.pdf},\n  year         = 2023\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.5281/zenodo.7957531\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023', 'https://doi.org/10.5281/zenodo.7957531', event);\">\n    Temporal Betweenness Centrality on Shortest Paths (Extended Abstract).\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naima, M.; Latapy, M.;  and Magnien, C.\n</span>\n\n  \n\n</span>\n\n  Book of Abstracts - FRCCS 2023, May 2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.5281/zenodo.7957531\"\n     onclick=\"log_download('naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023', 'https://doi.org/10.5281/zenodo.7957531', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Temporal Betweenness Centrality on Shortest Paths (Extended Abstract) [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naima-latapy-magnien-temporalbetweennesscentralityonshortestpathsextendedabstract-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@booklet{naimabetdisshor,\n  title        = &quot;Temporal Betweenness Centrality on Shortest Paths (Extended Abstract)&quot;,\n  author       = &quot;Naima, Mehdi and Latapy, Matthieu and Magnien, Clémence&quot;, \n  howpublished = &quot;Book of Abstracts - FRCCS 2023&quot;,\n  month        = may,\n    url={https://doi.org/10.5281/zenodo.7957531},\n  year         = 2023\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"anonymous-strictmonotonictreesarisingfromevolutionaryprocessescombinatorialandprobabilisticstudy-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \n</span>\n\n  \n\n</span>\n\n  <i>Advances in Applied Mathematics</i>, 133: 102284.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/anonymous-strictmonotonictreesarisingfromevolutionaryprocessescombinatorialandprobabilisticstudy-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('anonymous-strictmonotonictreesarisingfromevolutionaryprocessescombinatorialandprobabilisticstudy-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\"></pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"anonymous-compactionfortwomodelsoflogarithmicdepthtreesanalysisandexperiments-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Compaction for two models of logarithmic-depth trees: Analysis and experiments.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \n</span>\n\n  \n\n</span>\n\n  <i>Random Structures & Algorithms</i>, 61(1): 31–61.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/anonymous-compactionfortwomodelsoflogarithmicdepthtreesanalysisandexperiments-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('anonymous-compactionfortwomodelsoflogarithmicdepthtreesanalysisandexperiments-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\"></pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"bodini-genitrini-naima-acombinatoriallinkbetweenlabelledgraphsandincreasinglylabelledschrdertrees-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A combinatorial link between labelled graphs and increasingly labelled Schröder trees.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bodini, O.; Genitrini, A.;  and Naima, M.\n</span>\n\n  \n\n</span>\n\n  In <i>LATIN 2022: Theoretical Informatics: 15th Latin American Symposium, Guanajuato, Mexico, November 7–11, 2022, Proceedings</i>, pages 493–509,  2022. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bodini-genitrini-naima-acombinatoriallinkbetweenlabelledgraphsandincreasinglylabelledschrdertrees-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bodini-genitrini-naima-acombinatoriallinkbetweenlabelledgraphsandincreasinglylabelledschrdertrees-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{bodini2022combinatorial,\n  title={A combinatorial link between labelled graphs and increasingly labelled Schr{\\&quot;o}der trees},\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi},\n  booktitle={LATIN 2022: Theoretical Informatics: 15th Latin American Symposium, Guanajuato, Mexico, November 7--11, 2022, Proceedings},\n  pages={493--509},\n  year={2022},\n  organization={Springer}\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bodini-genitrini-naima-singh-familiesofmonotonictreescombinatorialenumerationandasymptotics-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://localhost:8000/pages/publications.html\">Bodini, O.</a>; Genitrini, A.; Naima, M.;  and Singh, A.\n</span>\n\n  \n\n</span>\n\n  In <i>International Computer Science Symposium in Russia</i>, pages 155–168,  2020. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bodini-genitrini-naima-singh-familiesofmonotonictreescombinatorialenumerationandasymptotics-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bodini-genitrini-naima-singh-familiesofmonotonictreescombinatorialenumerationandasymptotics-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{bodini2020families,\n  title={Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics},\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi and Singh, Alexandros},\n  booktitle={International Computer Science Symposium in Russia},\n  pages={155--168},\n  year={2020},\n  organization={Springer}\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://hal.archives-ouvertes.fr/tel-03160040\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020', 'https://hal.archives-ouvertes.fr/tel-03160040', event);\">\n    Combinatorics of trees under increasing labellings:Asymptotics, bijections and algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://busyweaver.github.io/\">Naima, M.</a>\n</span>\n\n  \n\n</span>\n\n  Ph.D. Thesis, Université Sorbonne Paris Nord, December 2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://hal.archives-ouvertes.fr/tel-03160040\"\n     onclick=\"log_download('naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020', 'https://hal.archives-ouvertes.fr/tel-03160040', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Combinatorics of trees under increasing labellings:Asymptotics, bijections and algorithms [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naima-combinatoricsoftreesunderincreasinglabellingsasymptoticsbijectionsandalgorithms-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@phdthesis{naima:tel-03160040,\n  TITLE = {{Combinatorics of trees under increasing labellings:Asymptotics, bijections and algorithms}},\n  AUTHOR = {Naima, Mehdi},\n  URL = {https://hal.archives-ouvertes.fr/tel-03160040},\n  SCHOOL = {{Universit{\\&#x27;e} Sorbonne Paris Nord}},\n  YEAR = {2020},\n  MONTH = Dec,\n  KEYWORDS = {Bijections ; Analytic Combinatorics ; Random generation ; Increasing trees ; Compaction algorithm ; Asymptotic enumeration ; Evolution process ; Algorithme de compression ; Enum{\\&#x27;e}ration asymptotique ; Arbres croissants ; G{\\&#x27;e}n{\\&#x27;e}ration al{\\&#x27;e}atoire de structures combinatoire ; Combinatoire Analytique ; Processus d&#x27;{\\&#x27;e}volution ; Bijections},\n  TYPE = {Theses},\n  PDF = {https://hal.archives-ouvertes.fr/tel-03160040/file/thesis.pdf},\n  HAL_ID = {tel-03160040},\n  HAL_VERSION = {v1},\n}\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bodini-genitrini-naima-rankedschrdertrees-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Ranked Schröder Trees.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"http://localhost:8000/pages/publications.html\">Bodini, O.</a>; Genitrini, A.;  and Naima, M.\n</span>\n\n  \n\n</span>\n\n  In <i>2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)</i>, pages 13–26,  2019. SIAM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bodini-genitrini-naima-rankedschrdertrees-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bodini-genitrini-naima-rankedschrdertrees-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{BGN19,\n  title={{Ranked Schr{\\&quot;o}der Trees}},\n  author={Bodini, Olivier and Genitrini, Antoine and Naima, Mehdi},\n  booktitle={2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)},\n  pages={13--26},\n  year={2019},\n  organization={SIAM}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);