default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Courtiel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Julien Courtiel, Paul Dorbec, Romain Lecoq:
Theoretical Analysis of Git Bisect. Algorithmica 86(5): 1365-1399 (2024)- [c5]Julien Courtiel
, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. WALCOM 2024: 377-391 - [c4]Julien Courtiel, Martin Pépin:
Random Generation of Git Graphs. GASCom 2024: 79-86 - 2023
- [i4]Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. CoRR abs/2311.13132 (2023) - [i3]Paul Dorbec, Julien Courtiel, Romain Lecoq:
Theoretical analysis of git bisect. CoRR abs/2312.13644 (2023) - 2022
- [c3]Julien Courtiel, Paul Dorbec, Romain Lecoq:
Theoretical Analysis of git bisect. LATIN 2022: 157-171 - 2021
- [j8]Julien Courtiel, Andrew Elvey Price, Irène Marcovici:
Bijections Between Walks Inside a Triangular Domain and Motzkin Paths of Bounded Amplitude. Electron. J. Comb. 28(2): 2 (2021)
2010 – 2019
- 2019
- [j7]Julien Courtiel, Karen A. Yeats, Noam Zeilberger:
Connected Chord Diagrams and Bridgeless Maps. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j6]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods. Eur. J. Comb. 69: 126-142 (2018) - [j5]Cédric Chauve, Julien Courtiel, Yann Ponty:
Counting, Generating, Analyzing and Sampling Tree Alignments. Int. J. Found. Comput. Sci. 29(5): 741-767 (2018) - [c2]Olivier Bodini, Julien Courtiel, Sergey Dovgal, Hsien-Kuei Hwang:
Asymptotic Distribution of Parameters in Random Maps. AofA 2018: 13:1-13:12 - 2017
- [j4]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for walks ending on an axis, using open arc diagrams. Electron. Notes Discret. Math. 61: 301-307 (2017) - [j3]Julien Courtiel, Stephen Melczer, Marni Mishna, Kilian Raschel:
Weighted lattice walks and universality classes. J. Comb. Theory A 152: 255-302 (2017) - 2016
- [j2]Sophie Burrill, Julien Courtiel, Éric Fusy, Stephen Melczer, Marni Mishna:
Tableau sequences, open diagrams, and Baxter families. Eur. J. Comb. 58: 144-165 (2016) - [c1]Cédric Chauve, Julien Courtiel, Yann Ponty:
Counting, Generating and Sampling Tree Alignments. AlCoB 2016: 53-64 - [i2]Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams. CoRR abs/1611.04489 (2016) - 2015
- [j1]Mireille Bousquet-Mélou, Julien Courtiel:
Spanning forests in regular planar maps. J. Comb. Theory A 135: 1-59 (2015) - [i1]Cédric Chauve, Julien Courtiel, Yann Ponty:
An Unambiguous And Complete Dynamic Programming Algorithm For Tree Alignment. CoRR abs/1505.05983 (2015) - 2014
- [b1]Julien Courtiel:
Combinatoire du polynôme de Tutte et des cartes planaires. (Combinatorics of the Tutte polynomial and planar maps). University of Bordeaux, France, 2014
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
