The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Ille: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Ille, Jean-Xavier Rampon
    A Counting of the minimal realizations of the posets of dimension two. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2006, v:78, n:, pp:- [Journal]
  2. Youssef Boudabbous, Jamel Dammak, Pierre Ille
    Indecomposability and duality of tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:55-82 [Journal]
  3. Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé
    The C3-structure of the tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:29-43 [Journal]
  4. Gena Hahn, Pierre Ille, Stéphan Thomassé
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:1-0 [Journal]
  5. Gena Hahn, Pierre Ille, Robert E. Woodrow
    Absorbing sets in arc-coloured tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:93-99 [Journal]
  6. Pierre Ille
    The Reconstruction of Multirelations, at Least One Component of Which Is a Chain. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:279-291 [Journal]
  7. Pierre Ille, Jean-Xavier Rampon
    Reconstruction of Posets with the Same Comparability Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:368-377 [Journal]
  8. Alain Cournier, Pierre Ille
    Minimal indecomposable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:61-80 [Journal]
  9. Pierre Ille
    Indecomposable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:173, n:1-3, pp:71-78 [Journal]
  10. Imed Boudabbous, Pierre Ille
    Critical and infinite directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:19-20, pp:2415-2428 [Journal]

  11. Graph Reconstruction by Permutations. [Citation Graph (, )][DBLP]


  12. A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product. [Citation Graph (, )][DBLP]


  13. The recognition of the class of indecomposable digraphs under low hemimorphy. [Citation Graph (, )][DBLP]


  14. Indecomposability graph and critical vertices of an indecomposable graph. [Citation Graph (, )][DBLP]


  15. Cyclic Extensions of Order Varieties. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002