default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Queyroi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Gabriel Ferrettini, François Queyroi, Mounira Harzallah:
Prédiction de temps de parcours de bus par chaînage des données d'entraînement. EGC 2023: 273-280- 2022
- [j4]Julie Queiros, Célestin Coquidé, François Queyroi
:
Toward random walk-based clustering of variable-order networks. Netw. Sci. 10(4): 381-399 (2022) - 2021
- [c8]Célestin Coquidé, Julie Queiros, François Queyroi:
PageRank Computation for Higher-Order Networks. COMPLEX NETWORKS 2021: 183-193 - [c7]Lysa Corcuff, François Queyroi:
Modélisations de séquences spatialisées dans les réseaux d'ordre supérieur. EGC 2021: 253-260 - [i2]Célestin Coquidé, Julie Queiros, François Queyroi:
PageRank computation for Higher-Order Networks. CoRR abs/2109.03065 (2021)
2010 – 2019
- 2018
- [i1]François Queyroi:
Biological and Shortest-Path Routing Procedures for Transportation Network Design. CoRR abs/1803.03528 (2018) - 2015
- [j3]François Queyroi, Sergey Kirgizov:
Suppression distance computation for hierarchical clusterings. Inf. Process. Lett. 115(9): 689-693 (2015) - [c6]François Queyroi, Yves Chiricota:
Visualization-based communities discovering in commuting networks : a case study. Symbolic Data Analysis and Visualization 2015: 1-14 - [c5]Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy:
Expected Nodes: A Quality Function for the Detection of Link Communities. CompleNet 2015: 57-64 - 2014
- [j2]François Queyroi, Maylis Delest, Jean-Marc Fedou, Guy Melançon:
Assessing the quality of multilevel graph clustering. Data Min. Knowl. Discov. 28(4): 1107-1128 (2014) - [j1]James Abello, François Queyroi:
Network decomposition into fixed points of degree peeling. Soc. Netw. Anal. Min. 4(1): 191 (2014) - 2013
- [b1]François Queyroi:
Partitionnement de grands graphes : mesures, algorithmes et visualisation. (Graph Partitioning : measures, algorithms and visualization). University of Bordeaux, France, 2013 - [c4]James Abello, François Queyroi:
Fixed points of graph peeling. ASONAM 2013: 256-263 - 2012
- [c3]François Queyroi:
Optimizing a Hierarchical Community Structure of a Complex Network. EGC (best of volume) 2012: 3-14 - [c2]François Queyroi:
Validation et optimisation d'une décomposition hiérarchique de graphes. EGC 2012: 429-440 - [c1]Antoine Lambert, François Queyroi, Romain Bourqui:
Visualizing Patterns in Node-link Diagrams. IV 2012: 48-53
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-11-07 21:31 CET 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:
