default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Préa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities. J. Classif. 41(3): 455-479 (2024)- [j11]Mikhael Carmona, Victor Chepoi, Guyslain Naves
, Pascal Préa:
Modules in Robinson Spaces. SIAM J. Discret. Math. 38(1): 190-224 (2024) - [i4]François Brucker, Pascal Préa, Christopher Thraves Caro:
Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces. CoRR abs/2412.04118 (2024) - 2023
- [j10]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A Simple and Optimal Algorithm for Strict Circular Seriation. SIAM J. Math. Data Sci. 5(1): 201-221 (2023) - [i3]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules and PQ-trees in Robinson spaces. CoRR abs/2306.08800 (2023) - 2022
- [i2]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. CoRR abs/2203.12386 (2022) - [i1]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A simple and optimal algorithm for strict circular seriation. CoRR abs/2205.04694 (2022) - 2021
- [j9]Célia Châtel, François Brucker, Pascal Préa:
Binary set systems and totally balanced hypergraphs. Discret. Appl. Math. 295: 120-133 (2021) - 2020
- [j8]François Brucker, Pascal Préa, Célia Châtel:
Totally Balanced Dissimilarities. J. Classif. 37(1): 203-222 (2020)
2010 – 2019
- 2018
- [c4]Célia Châtel, François Brucker, Pascal Préa:
Binary Lattices. FCA4AI@IJCAI 2018: 93-104 - 2017
- [j7]Pascal Préa, Mathieu Rouault, François Brucker:
An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension. Electron. Notes Discret. Math. 59: 37-50 (2017) - 2016
- [c3]François Brucker, Pascal Préa:
Approximate Seriation Problem in Formal Context Analysis. CLA 2016: 71-83 - 2015
- [c2]François Brucker, Pascal Préa:
Totally Balanced Formal Context Representation. ICFCA 2015: 169-182 - 2014
- [j6]Pascal Préa, Monique Rolbert:
Distinguishing and Classifying from n-ary Properties. J. Classif. 31(1): 28-48 (2014) - [j5]Pascal Préa, Dominique Fortin:
An Optimal Algorithm To Recognize Robinsonian Dissimilarities. J. Classif. 31(3): 351-385 (2014)
2000 – 2009
- 2009
- [c1]Monique Rolbert, Pascal Préa:
Distinguishable Entities: Definitions and Properties. ENLG 2009: 34-41
1990 – 1999
- 1997
- [j4]Pascal Préa:
About weak connectivity. Discret. Math. 165-166: 579-586 (1997) - 1995
- [j3]Pascal Préa:
Distance sequences in infinite regular tessellations. Discret. Math. 146(1-3): 211-233 (1995) - [j2]Pascal Préa:
Optimal Sensor Placement in Three Dimensions (Hong Zhang and Xiaohuan Wang). SIAM Rev. 37(1): 112-113 (1995) - 1992
- [j1]Pascal Préa:
Graphs and topologies on discrete sets. Discret. Math. 103(2): 189-197 (1992)
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 2025-01-21 00:01 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:
