default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Talon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Fabrício Siqueira Benevides, Arthur Lima Quintino, Alexandre Talon:
Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles. CoRR abs/2409.03394 (2024)- 2023
- [j7]Timothée Corsini, Quentin Deschamps, Carl Feghali
, Daniel Gonçalves, Hélène Langlois, Alexandre Talon:
Partitioning into degenerate graphs in linear time. Eur. J. Comb. 114: 103771 (2023) - 2022
- [i6]Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon:
Partitioning into degenerate graphs in linear time. CoRR abs/2204.11100 (2022) - 2021
- [c2]Guillaume Bonfante, Alexandre Talon:
At the Bottom of Binary Analysis: Instructions. FPS 2021: 311-320 - 2020
- [j6]Silvère Gangloff, Alexandre Talon:
Asymptotic growth rate of square grids dominating sets: A symbolic dynamics approach. Theor. Comput. Sci. 821: 87-101 (2020) - [i5]Alexandre Talon:
Intensive use of computing resources for dominations in grids and other combinatorial problems. CoRR abs/2002.11615 (2020)
2010 – 2019
- 2019
- [b1]Alexandre Talon:
Intensive use of computing resources for dominations in grids and other combinatorial problems. (Utilisation intensive de l'ordinateur : dominations dans les grilles et autres problèmes combinatoires). University of Lyon, France, 2019 - [j5]Michaël Rao, Alexandre Talon:
The 2-domination and Roman domination numbers of grid graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [i4]Silvère Gangloff, Alexandre Talon:
Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach. CoRR abs/1906.10779 (2019) - 2018
- [j4]Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon:
Old and new results on packing arborescences in directed hypergraphs. Discret. Appl. Math. 242: 26-33 (2018) - [j3]Alexandre Talon, Jan Kratochvíl:
Completion of the mixed unit interval graphs hierarchy. J. Graph Theory 87(3): 317-332 (2018) - [i3]Michaël Rao, Alexandre Talon:
The 2-domination and Roman domination numbers of grid graphs. CoRR abs/1810.12896 (2018) - 2017
- [j2]Fábio Botler, Alexandre Talon:
Decomposing 8-regular graphs into paths of length 4. Discret. Math. 340(9): 2275-2285 (2017) - [j1]Fábio Botler, Alexandre Talon:
Decomposition of 8-regular graphs into paths of length 4. Electron. Notes Discret. Math. 61: 147-153 (2017) - 2016
- [i2]Fábio Botler, Alexandre Talon:
Decomposing 8-regular graphs into paths of length 4. CoRR abs/1607.01456 (2016) - 2015
- [c1]Alexandre Talon, Jan Kratochvíl:
Completion of the Mixed Unit Interval Graphs Hierarchy. TAMC 2015: 284-296 - 2014
- [i1]Alexandre Talon, Jan Kratochvíl:
Completion of the mixed unit interval graphs hierarchy. CoRR abs/1412.0540 (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-10-22 21:15 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:
