The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Manoel Lemos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manoel Lemos
    Non-binary matroids having four non-binary elements. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  2. Manoel Lemos
    Non-Binary Madroids Having At Most Three Non-Binary Elements. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:355-369 [Journal]
  3. Manoel Lemos
    On Mills's conjecture on matroids with many common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:271-276 [Journal]
  4. Manoel Lemos
    Uniqueness of the decomposition of the rank function of a 2-polymatroid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:161-179 [Journal]
  5. Manoel Lemos
    Matroids with many common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:192-204 [Journal]
  6. Manoel Lemos
    Elements belonging to triads in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:167-181 [Journal]
  7. Manoel Lemos
    Matroids with few non-common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:680-687 [Journal]
  8. Manoel Lemos, Sérgio Mota
    The reconstruction of a matroid from its connectivity function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:131-143 [Journal]
  9. Manoel Lemos, James G. Oxley
    On size, circumference and circuit removal in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:145-157 [Journal]
  10. Manoel Lemos, James G. Oxley
    On the 3-connected matroids that are minimal having a fixed spanning restriction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:131-165 [Journal]
  11. Manoel Lemos, James G. Oxley
    On the minor-minimal 2-connected graphs having a fixed minor. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:77-118 [Journal]
  12. Manoel Lemos
    Elements belonging to triangles in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:21, pp:2790-2797 [Journal]
  13. Manoel Lemos, James G. Oxley
    On the minor-minimal 3-connected matroids having a fixed minor. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:8, pp:1097-1123 [Journal]
  14. Manoel Lemos
    On the number of triangles in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:931-941 [Journal]
  15. Manoel Lemos
    Weight Distribution of the Bases of a Matroid. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:69-82 [Journal]
  16. Manoel Lemos
    On the Connectivity Function of a Binary Matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:114-132 [Journal]
  17. Manoel Lemos
    K-Elimination property for circuits of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:51, n:2, pp:211-226 [Journal]
  18. Manoel Lemos, James G. Oxley
    Matroid packing and covering with circuits through an element. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:135-158 [Journal]
  19. Manoel Lemos
    An extension of Lindström's result about characteristic sets of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:1, pp:85-101 [Journal]
  20. Manoel Lemos
    On 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:3, pp:273-283 [Journal]
  21. Manoel Lemos, James G. Oxley
    On packing minors into connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:189, n:1-3, pp:283-289 [Journal]
  22. Manoel Lemos
    Matroids having the same connectivity function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:153-161 [Journal]

  23. Non-separating cocircuits in matroids. [Citation Graph (, )][DBLP]


  24. Removing circuits in 3-connected binary matroids. [Citation Graph (, )][DBLP]


  25. The 3-connected matroids with circumference 6. [Citation Graph (, )][DBLP]


  26. The 3-connected binary matroids with circumference 6 or 7. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.027secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002