| 2008 |
|---|
| 21 | | Sheila Morais de Almeida,
Célia Picinin de Mello,
Aurora Morgana:
Using Latin Squares to Color Split Graphs.
CTW 2008: 123-126 |
| 20 | EE | Sheila Morais de Almeida,
Célia Picinin de Mello,
Aurora Morgana:
Edge Coloring of Split Graphs.
Electronic Notes in Discrete Mathematics 30: 21-26 (2008) |
| 2007 |
|---|
| 19 | | M. Liverani,
Aurora Morgana,
Célia Picinin de Mello:
The K-behaviour of p-trees.
Ars Comb. 83: (2007) |
| 18 | EE | Douglas Bauer,
Hajo Broersma,
Nathan Kahl,
Aurora Morgana,
Edward F. Schmeichel,
T. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discrete Applied Mathematics 155(10): 1336-1343 (2007) |
| 17 | EE | Douglas Bauer,
Hajo Broersma,
Aurora Morgana,
Edward F. Schmeichel:
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
Journal of Graph Theory 55(4): 343-358 (2007) |
| 2006 |
|---|
| 16 | EE | Célia Picinin de Mello,
Aurora Morgana,
M. Liverani:
The clique operator on graphs with few P4's.
Discrete Applied Mathematics 154(3): 485-492 (2006) |
| 2005 |
|---|
| 15 | EE | Simone Dantas,
Sulamita Klein,
Célia Picinin de Mello,
Aurora Morgana:
The P4-sparse Graph Sandwich Problem.
Electronic Notes in Discrete Mathematics 22: 185-188 (2005) |
| 2004 |
|---|
| 14 | EE | Aurora Morgana,
Célia Picinin de Mello,
Giovanna Sontacchi:
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid.
Discrete Applied Mathematics 141(1-3): 225-241 (2004) |
| 13 | EE | 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.
Discrete Mathematics 282(1-3): 183-191 (2004) |
| 2002 |
|---|
| 12 | | Douglas Bauer,
Hajo Broersma,
Aurora Morgana,
Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discrete Applied Mathematics 120(1-3): 13-23 (2002) |
| 11 | EE | Aurora Morgana,
Henry Martyn Mulder:
The induced path convexity, betweenness, and svelte graphs.
Discrete Mathematics 254(1-3): 349-370 (2002) |
| 2001 |
|---|
| 10 | EE | Aurora Morgana,
Célia Picinin de Mello,
Giovanna Sontacchi:
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid.
Electronic Notes in Discrete Mathematics 7: 38-41 (2001) |
| 1998 |
|---|
| 9 | EE | Yanpei Liu,
Aurora Morgana,
Bruno Simeone:
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid.
Discrete Applied Mathematics 81(1-3): 69-91 (1998) |
| 1997 |
|---|
| 8 | EE | Douglas Bauer,
Willem-Jan van den Heuvel,
Aurora Morgana,
Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs.
Discrete Applied Mathematics 79(1-3): 35-44 (1997) |
| 1994 |
|---|
| 7 | EE | Douglas Bauer,
Aurora Morgana,
Edward F. Schmeichel:
On the complexity of recognizing tough graphs.
Discrete Mathematics 124(1-3): 13-17 (1994) |
| 1990 |
|---|
| 6 | | Brigitte Jaumard,
P. Marchioro,
Aurora Morgana,
Rossella Petreschi,
Bruno Simeone:
On Line 2-Satisfiability.
Ann. Math. Artif. Intell. 1: (1990) |
| 5 | EE | Douglas Bauer,
Henk Jan Veldman,
Aurora Morgana,
Edward F. Schmeichel:
Long cycles in graphs with large degree sums.
Discrete Mathematics 79(1): 59-70 (1990) |
| 4 | EE | Douglas Bauer,
Aurora Morgana,
Edward F. Schmeichel:
A simple proof of a theorem of Jung.
Discrete Mathematics 79(2): 147-152 (1990) |
| 1988 |
|---|
| 3 | EE | P. Marchioro,
Aurora Morgana,
Rossella Petreschi,
Bruno Simeone:
Adamant digraphs.
Discrete Mathematics 69(3): 253-261 (1988) |
| 1984 |
|---|
| 2 | EE | P. Marchioro,
Aurora Morgana:
Structure and recognition of domishold graphs.
Discrete Mathematics 50: 239-251 (1984) |
| 1 | EE | P. Marchioro,
Aurora Morgana,
Rossella Petreschi,
Bruno Simeone:
Degree sequences of matrogenic graphs.
Discrete Mathematics 51(1): 47-61 (1984) |
