default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Théberge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Stan Matwin
, Aristides Milios, Pawel Pralat, Amílcar Soares, François Théberge:
Generative Methods for Social Media Analysis. Springer Briefs in Computer Science, Springer 2023, ISBN 978-3-031-33616-4, pp. 1-67
Journal Articles
- 2024
- [j13]Bogumil Kaminski, Pawel Pralat, François Théberge, Sebastian Zajac:
Predicting properties of nodes via community-aware features. Soc. Netw. Anal. Min. 14(1): 117 (2024) - 2023
- [j12]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial benchmark for community detection with outliers (ABCD+o). Appl. Netw. Sci. 8(1): 25 (2023) - [j11]Bogumil Kaminski, Pawel Pralat, François Théberge:
Hypergraph Artificial Benchmark for Community Detection (h-ABCD). J. Complex Networks 11(4) (2023) - 2022
- [j10]Bogumil Kaminski, Tomasz Olczak, Bartosz Pankratz, Pawel Pralat, François Théberge:
Properties and Performance of the ABCDe Random Graph Model with Community Structure. Big Data Res. 30: 100348 (2022) - [j9]Arash Dehghan-Kooshkghazi, Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
Evaluating node embeddings of complex networks. J. Complex Networks 10(4) (2022) - [j8]Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat, François Théberge:
Modularity of the ABCD random graph model with community structure. J. Complex Networks 10(6) (2022) - [j7]Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs. Netw. Sci. 10(4): 323-346 (2022) - 2021
- [j6]Bogumil Kaminski, Pawel Pralat, François Théberge:
An unsupervised framework for comparing graph embeddings. J. Complex Networks 8(5) (2021) - [j5]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial Benchmark for Community Detection (ABCD) - Fast random graph model with community structure. Netw. Sci. 9(2): 153-178 (2021) - [j4]Valérie Poulin, François Théberge:
Comparing Graph Clusterings: Set Partition Measures vs. Graph-Aware Measures. IEEE Trans. Pattern Anal. Mach. Intell. 43(6): 2127-2132 (2021) - 2019
- [j3]Valérie Poulin, François Théberge:
Ensemble clustering for graphs: comparisons and applications. Appl. Netw. Sci. 4(1): 51:1-51:13 (2019) - 2003
- [j2]Christopher F. Freiling, Douglas S. Jungreis, François Théberge, Kenneth Zeger:
Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inf. Theory 49(9): 2219-2225 (2003) - 1998
- [j1]François Théberge, Alain Simonian, Ravi Mazumdar:
Upper bounds for blocking probabilities in large multi-rate loss networks. Telecommun. Syst. 9(1): 23-39 (1998)
Conference and Workshop Papers
- 2024
- [c11]Jordan Barrett, Bogumil Kaminski, Pawel Pralat, François Théberge:
Self-similarity of Communities of the ABCD Model. WAW 2024: 17-31 - [c10]Ashkan Dehghan, Pawel Pralat, François Théberge:
Network Embedding Exploration Tool (NEExT). WAW 2024: 65-79 - 2023
- [c9]Bogumil Kaminski, Pawel Pralat, François Théberge, Sebastian Zajac:
Classification Supported by Community-Aware Node Features. COMPLEX NETWORKS (2) 2023: 133-145 - [c8]Bogumil Kaminski, Pawel Misiorek, Pawel Pralat, François Théberge:
Modularity Based Community Detection in Hypergraphs. WAW 2023: 52-67 - 2022
- [c7]Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat, François Théberge:
Modularity of the ABCD Random Graph Model with Community Structure. COMPLEX NETWORKS (2) 2022: 3-15 - [c6]Bogumil Kaminski, Pawel Pralat, François Théberge:
Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o). COMPLEX NETWORKS (2) 2022: 163-174 - 2020
- [c5]Bogumil Kaminski, Pawel Pralat, François Théberge:
Community Detection Algorithm Using Hypergraph Modularity. COMPLEX NETWORKS (1) 2020: 152-163 - [c4]Bogumil Kaminski, Pawel Pralat, François Théberge:
A Scalable Unsupervised Framework for Comparing Graph Embeddings. WAW 2020: 52-67 - 2018
- [c3]Valérie Poulin, François Théberge:
Ensemble Clustering for Graphs. COMPLEX NETWORKS (1) 2018: 231-243 - 1997
- [c2]Nikolay B. Likhanov, Ravi Mazumdar, François Théberge:
Calculating Cell Loss Probabilities for ON-OFF Sources in Large Unbuffered Systems. ICC (2) 1997: 560-564 - 1995
- [c1]François Théberge, Ravi Mazumdar:
Approximation Formulae for Blocking Probabilities in a Large Erlang Loss System: A Probabilistic Approach. INFOCOM 1995: 804-809
Editorship
- 2024
- [e2]Megan Dewar, Bogumil Kaminski, Daniel Kaszynski, Lukasz Krainski, Pawel Pralat, François Théberge, Malgorzata Wrzosek:
Modelling and Mining Networks - 19th International Workshop, WAW 2024, Warsaw, Poland, June 3-6, 2024, Proceedings. Lecture Notes in Computer Science 14671, Springer 2024, ISBN 978-3-031-59204-1 [contents] - 2023
- [e1]Megan Dewar, Pawel Pralat, Przemyslaw Szufel, François Théberge, Malgorzata Wrzosek:
Algorithms and Models for the Web Graph - 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23-26, 2023, Proceedings. Lecture Notes in Computer Science 13894, Springer 2023, ISBN 978-3-031-32295-2 [contents]
Informal and Other Publications
- 2024
- [i16]Bogumil Kaminski, Pawel Misiorek, Pawel Pralat, François Théberge:
Modularity Based Community Detection in Hypergraphs. CoRR abs/2406.17556 (2024) - [i15]Jordan Barrett, Pawel Pralat, Aaron Smith, François Théberge:
Counting simplicial pairs in hypergraphs. CoRR abs/2408.11806 (2024) - 2023
- [i14]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial Benchmark for Community Detection with Outliers (ABCD+o). CoRR abs/2301.05749 (2023) - [i13]Bogumil Kaminski, Pawel Pralat, François Théberge, Sebastian Zajac:
Predicting Properties of Nodes via Community-Aware Features. CoRR abs/2311.04730 (2023) - [i12]Jordan Barrett, Bogumil Kaminski, Pawel Pralat, François Théberge:
Self-similarity of Communities of the ABCD Model. CoRR abs/2312.00238 (2023) - 2022
- [i11]Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat, François Théberge:
Modularity of the ABCD Random Graph Model with Community Structure. CoRR abs/2203.01480 (2022) - [i10]Bogumil Kaminski, Tomasz Olczak, Bartosz Pankratz, Pawel Pralat, François Théberge:
Properties and Performance of the ABCDe Random Graph Model with Community Structure. CoRR abs/2203.14899 (2022) - [i9]Bogumil Kaminski, Pawel Pralat, François Théberge:
Hypergraph Artificial Benchmark for Community Detection (h-ABCD). CoRR abs/2210.15009 (2022) - 2021
- [i8]Arash Dehghan-Kooshkghazi, Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
Evaluating Node Embeddings of Complex Networks. CoRR abs/2102.08275 (2021) - [i7]Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs. CoRR abs/2112.00075 (2021) - [i6]Stan Matwin, Aristides Milios, Pawel Pralat, Amílcar Soares, François Théberge:
Survey of Generative Methods for Social Media Analysis. CoRR abs/2112.07041 (2021) - 2020
- [i5]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure. CoRR abs/2002.00843 (2020) - 2019
- [i4]Valérie Poulin, François Théberge:
Ensemble Clustering for Graphs: Comparisons and Applications. CoRR abs/1903.08012 (2019) - [i3]Bogumil Kaminski, Pawel Pralat, François Théberge:
An Unsupervised Framework for Comparing Graph Embeddings. CoRR abs/1906.04562 (2019) - 2018
- [i2]Valérie Poulin, François Théberge:
Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures. CoRR abs/1806.11494 (2018) - [i1]Valérie Poulin, François Théberge:
Ensemble Clustering for Graphs. CoRR abs/1809.05578 (2018)
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-07 22:06 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:
