Structure and recognition of domishold graphs. - P. Marchioro; Aurora Morgana (Discret. Math., 1984)

Degree sequences of matrogenic graphs. - P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Discret. Math., 1984)

Adamant digraphs. - P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Discret. Math., 1988)

On Line 2-Satisfiability. - Brigitte Jaumard; P. Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone (Ann. Math. Artif. Intell., 1990)

A simple proof of a theorem of Jung. - Douglas Bauer; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1990)

Long cycles in graphs with large degree sums. - Douglas Bauer; Henk Jan Veldman; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1990)

On the complexity of recognizing tough graphs. - Douglas Bauer; Aurora Morgana; Edward F. Schmeichel (Discret. Math., 1994)

The Complexity of Recognizing Tough Cubic Graphs. - Douglas Bauer; Jan van den Heuvel; Aurora Morgana; Edward F. Schmeichel (Discret. Appl. Math., 1997)

A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. - Yanpei Liu; Aurora Morgana; Bruno Simeone (Discret. Appl. Math., 1998)

Path equipartition in the Chebyshev norm. - Marco Liverani; Aurora Morgana; Bruno Simeone; Giovanni Storchi (Eur. J. Oper. Res., 2000)

An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid. - Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi (Electron. Notes Discret. Math., 2001)

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. - Douglas Bauer; Hajo Broersma; Aurora Morgana; Edward F. Schmeichel (Discret. Appl. Math., 2002)

Single bend wiring on surfaces. - María Ángeles Garrido 001; Alberto Márquez 001; Aurora Morgana; José Ramón Portillo (Discret. Appl. Math., 2002)

The induced path convexity, betweenness, and svelte graphs. - Aurora Morgana; Henry Martyn Mulder (Discret. Math., 2002)

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. - Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi (Discret. Appl. Math., 2004)

The clique operator on cographs and serial graphs. - Francisco Larrión; Célia Picinin de Mello; Aurora Morgana; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Math., 2004)

The P4-sparse Graph Sandwich Problem. - Simone Dantas; Sulamita Klein; Célia Picinin de Mello; Aurora Morgana (Electron. Notes Discret. Math., 2005)

The clique operator on graphs with few P4's. - Célia Picinin de Mello; Aurora Morgana; Marco Liverani (Discret. Appl. Math., 2006)

The K-behaviour of p-trees. - Marco Liverani; Aurora Morgana; Célia Picinin de Mello (Ars Comb., 2007)

Tutte sets in graphs II: The complexity of finding maximum Tutte sets. - Douglas Bauer; Hajo Broersma; Nathan Kahl; Aurora Morgana; Edward F. Schmeichel; Thomas M. Surowiec (Discret. Appl. Math., 2007)

Tutte sets in graphs I: Maximal tutte sets and D-graphs. - Douglas Bauer; Hajo Broersma; Aurora Morgana; Edward F. Schmeichel (J. Graph Theory, 2007)

Using Latin Squares to Color Split Graphs. - Sheila Morais de Almeida; Célia Picinin de Mello; Aurora Morgana (CTW, 2008)

The Graph Sandwich Problem for P4-sparse graphs. - Simone Dantas; Sulamita Klein; Célia Picinin de Mello; Aurora Morgana (Discret. Math., 2009)

On the classification problem for split graphs. - Sheila Morais de Almeida; Célia Picinin de Mello; Aurora Morgana (J. Braz. Comput. Soc., 2012)

On clique-colouring of graphs with few P 4's. - Sulamita Klein; Aurora Morgana (J. Braz. Comput. Soc., 2012)

Recognizing Well Covered Graphs of Families with Special P 4-Components. - Sulamita Klein; Célia Picinin de Mello; Aurora Morgana (Graphs Comb., 2013)

Edge-Coloring of Split Graphs. - Sheila Morais de Almeida; Célia Picinin de Mello; Aurora Morgana (Ars Comb., 2015)