The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aurora Morgana: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    On Line 2-Satisfiability. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  2. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
    Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal]
  3. Douglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
    The Complexity of Recognizing Tough Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:35-44 [Journal]
  4. Yanpei Liu, Aurora Morgana, Bruno Simeone
    A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:69-91 [Journal]
  5. Célia Picinin de Mello, Aurora Morgana, M. Liverani
    The clique operator on graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:3, pp:485-492 [Journal]
  6. Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi
    An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:225-241 [Journal]
  7. Douglas Bauer, Hajo Broersma, N. Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec
    Tutte sets in graphs II: The complexity of finding maximum Tutte sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1336-1343 [Journal]
  8. Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña
    The clique operator on cographs and serial graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:183-191 [Journal]
  9. Maria Aurora Morgana, Henry Martyn Mulder
    The induced path convexity, betweenness, and svelte graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:349-370 [Journal]
  10. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Degree sequences of matrogenic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:47-61 [Journal]
  11. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
    Adamant digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:3, pp:253-261 [Journal]
  12. P. Marchioro, Aurora Morgana
    Structure and recognition of domishold graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:239-251 [Journal]
  13. Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
    Long cycles in graphs with large degree sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:1, pp:59-70 [Journal]
  14. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    A simple proof of a theorem of Jung. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:2, pp:147-152 [Journal]
  15. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    On the complexity of recognizing tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:124, n:1-3, pp:13-17 [Journal]

  16. Using Latin Squares to Color Split Graphs. [Citation Graph (, )][DBLP]


  17. The K-behaviour of p-trees. [Citation Graph (, )][DBLP]


  18. The Graph Sandwich Problem for P4-sparse graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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