default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Ille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Abderrahim Boussaïri
, Pierre Ille:
The 3-forced 2-structures. Discret. Math. Algorithms Appl. 16(7): 2350086:1-2350086:18 (2024)- [j36]Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
The primality graph of critical 3-hypergraphs. Graphs Comb. 40(3): 49 (2024) - 2023
- [j35]Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
Critical 3-Hypergraphs. Graphs Comb. 39(1): 3 (2023) - 2022
- [j34]Houmem Belkhechine, Cherifa Ben Salha, Pierre Ille:
Birecognition of prime graphs, and minimal prime graphs. Discret. Math. Algorithms Appl. 14(8): 2250038:1-2250038:30 (2022) - 2021
- [j33]Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
Prime 3-Uniform Hypergraphs. Graphs Comb. 37(6): 2737-2760 (2021) - 2020
- [j32]Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
3-uniform hypergraphs: modular decomposition and realization by tournaments. Contributions Discret. Math. 15(1): 121-153 (2020)
2010 – 2019
- 2019
- [j31]Pierre Ille, Robert E. Woodrow:
Fractal graphs. J. Graph Theory 91(1): 53-72 (2019) - 2018
- [j30]Youssef Boudabbous, Pierre Ille:
The {-2, -1}-selfdual and decomposable tournaments. Discuss. Math. Graph Theory 38(3): 743-789 (2018) - 2017
- [j29]Houmem Belkhechine, Pierre Ille, Robert E. Woodrow:
Criticality of switching classes of reversible 2-structures labeled by an Abelian group. Discuss. Math. Graph Theory 37(1): 175-209 (2017) - 2015
- [j28]Youssef Boudabbous, Pierre Ille, Bertrand Jouve, Abdeljelil Salhi:
Critically Twin Primitive 2-Structures. Graphs Comb. 31(5): 1223-1247 (2015) - 2014
- [j27]Abderrahim Boussaïri, Pierre Ille:
Determination of the prime bound of a graph. Contributions Discret. Math. 9(1) (2014) - [j26]Pierre Ille, Roger Villemaire:
Recognition of prime graphs from a prime subgraph. Discret. Math. 327: 76-90 (2014) - [j25]Abderrahim Boussaïri, Abdelhak Chaïchaâ, Pierre Ille:
Indecomposability graph and indecomposability recognition. Eur. J. Comb. 37: 32-42 (2014) - 2013
- [j24]Abderrahim Boussaïri, Pierre Ille:
Different duality theorems. Ars Comb. 112: 33-54 (2013) - 2011
- [j23]Imed Boudabbous, Pierre Ille:
Ultracritical and hypercritical binary structures. Discret. Math. 311(15): 1397-1409 (2011) - [j22]Pierre Ille, Robert E. Woodrow:
Decomposition tree of a lexicographic product of binary structures. Discret. Math. 311(21): 2346-2358 (2011) - [j21]Andrew Breiner, Jitender S. Deogun, Pierre Ille:
Decomposition tree and indecomposable coverings. Discuss. Math. Graph Theory 31(1): 37-44 (2011)
2000 – 2009
- 2009
- [j20]Pierre Ille, Robert E. Woodrow:
Weakly partitive families on infinite sets. Contributions Discret. Math. 4(1) (2009) - [j19]Youssef Boudabbous, Pierre Ille:
Indecomposability graph and critical vertices of an indecomposable graph. Discret. Math. 309(9): 2839-2846 (2009) - [j18]Abderrahim Boussaïri, Pierre Ille:
The recognition of the class of indecomposable digraphs under low hemimorphy. Discret. Math. 309(10): 3404-3407 (2009) - [j17]Pierre Ille:
A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product. Discret. Math. 309(11): 3518-3522 (2009) - 2008
- [j16]Pierre Ille, William L. Kocay:
Graph Reconstruction by Permutations. Ars Comb. 86 (2008) - [j15]Andrew Breiner, Jitender S. Deogun, Pierre Ille:
Partially critical indecomposable graphs. Contributions Discret. Math. 3(2) (2008) - [c1]Pierre Ille, Paul Ruet:
Cyclic Extensions of Order Varieties. FICS 2008: 119-132 - 2007
- [j14]Imed Boudabbous, Pierre Ille:
Critical and infinite directed graphs. Discret. Math. 307(19-20): 2415-2428 (2007) - 2006
- [j13]Pierre Ille, Jean-Xavier Rampon:
A Counting of the minimal realizations of the posets of dimension two. Ars Comb. 78 (2006) - 2005
- [j12]Gena Hahn, Pierre Ille, Stéphan Thomassé:
Preface. Discret. Math. 291(1-3): 1- (2005) - [j11]Pierre Ille:
A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product. Electron. Notes Discret. Math. 22: 91-92 (2005) - 2004
- [j10]Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé:
The C3-structure of the tournaments. Discret. Math. 277(1-3): 29-43 (2004) - [j9]Gena Hahn, Pierre Ille, Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments. Discret. Math. 283(1-3): 93-99 (2004) - 2000
- [j8]Youssef Boudabbous, Jamel Dammak, Pierre Ille:
Indecomposability and duality of tournaments. Discret. Math. 223(1-3): 55-82 (2000)
1990 – 1999
- 1998
- [j7]Alain Cournier, Pierre Ille:
Minimal indecomposable graphs. Discret. Math. 183(1-3): 61-80 (1998) - [j6]Pierre Ille, Jean-Xavier Rampon:
Reconstruction of Posets with the Same Comparability Graph. J. Comb. Theory B 74(2): 368-377 (1998) - 1997
- [j5]Pierre Ille:
Indecomposable graphs. Discret. Math. 173(1-3): 71-78 (1997) - 1992
- [j4]Pierre Ille:
The Reconstruction of Multirelations, at Least One Component of Which Is a Chain. J. Comb. Theory A 61(2): 279-291 (1992) - [j3]Cyprien Gnanvo, Pierre Ille:
La Reconstruction des tournois sans Diamant. Math. Log. Q. 38(1): 283-291 (1992) - 1991
- [j2]Pierre Ille:
L'ensemble des Intervalles d'une Multirelation Binaire et Reflexive. Math. Log. Q. 37(13-16): 227-256 (1991) - 1990
- [j1]Pierre Ille:
Cloture intervallaire et extension logique d'une relation. Math. Log. Q. 36(3): 217-227 (1990)
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-23 20:31 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:
