default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurora Morgana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j27]Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
Edge-Coloring of Split Graphs. Ars Comb. 119: 363-375 (2015)- 2013
- [j26]Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
Recognizing Well Covered Graphs of Families with Special P 4-Components. Graphs Comb. 29(3): 553-567 (2013) - 2012
- [j25]Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
On the classification problem for split graphs. J. Braz. Comput. Soc. 18(2): 95-101 (2012) - [j24]Sulamita Klein, Aurora Morgana:
On clique-colouring of graphs with few P 4's. J. Braz. Comput. Soc. 18(2): 113-119 (2012)
2000 – 2009
- 2009
- [j23]Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The Graph Sandwich Problem for P4-sparse graphs. Discret. Math. 309(11): 3664-3673 (2009) - 2008
- [j22]Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
Edge Coloring of Split Graphs. Electron. Notes Discret. Math. 30: 21-26 (2008) - [c1]Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
Using Latin Squares to Color Split Graphs. CTW 2008: 123-126 - 2007
- [j21]Marco Liverani, Aurora Morgana, Célia Picinin de Mello:
The K-behaviour of p-trees. Ars Comb. 83 (2007) - [j20]Douglas Bauer
, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155(10): 1336-1343 (2007) - [j19]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55(4): 343-358 (2007) - 2006
- [j18]Célia Picinin de Mello, Aurora Morgana, Marco Liverani:
The clique operator on graphs with few P4's. Discret. Appl. Math. 154(3): 485-492 (2006) - 2005
- [j17]Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The P4-sparse Graph Sandwich Problem. Electron. Notes Discret. Math. 22: 185-188 (2005) - 2004
- [j16]Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi:
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. Discret. Appl. Math. 141(1-3): 225-241 (2004) - [j15]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. Discret. Math. 282(1-3): 183-191 (2004) - 2002
- [j14]María Ángeles Garrido, Alberto Márquez, Aurora Morgana, José Ramón Portillo:
Single bend wiring on surfaces. Discret. Appl. Math. 117(1-3): 27-40 (2002) - [j13]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002) - [j12]Aurora Morgana, Henry Martyn Mulder:
The induced path convexity, betweenness, and svelte graphs. Discret. Math. 254(1-3): 349-370 (2002) - 2001
- [j11]Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi:
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid. Electron. Notes Discret. Math. 7: 38-41 (2001) - 2000
- [j10]Marco Liverani, Aurora Morgana, Bruno Simeone, Giovanni Storchi:
Path equipartition in the Chebyshev norm. Eur. J. Oper. Res. 123(2): 428-435 (2000)
1990 – 1999
- 1998
- [j9]Yanpei Liu, Aurora Morgana, Bruno Simeone:
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. Discret. Appl. Math. 81(1-3): 69-91 (1998) - 1997
- [j8]Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79(1-3): 35-44 (1997) - 1994
- [j7]Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
On the complexity of recognizing tough graphs. Discret. Math. 124(1-3): 13-17 (1994) - 1990
- [j6]Brigitte Jaumard, P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
On Line 2-Satisfiability. Ann. Math. Artif. Intell. 1: 155-165 (1990) - [j5]Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel:
Long cycles in graphs with large degree sums. Discret. Math. 79(1): 59-70 (1990) - [j4]Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
A simple proof of a theorem of Jung. Discret. Math. 79(2): 147-152 (1990)
1980 – 1989
- 1988
- [j3]P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
Adamant digraphs. Discret. Math. 69(3): 253-261 (1988) - 1984
- [j2]P. Marchioro, Aurora Morgana:
Structure and recognition of domishold graphs. Discret. Math. 50: 239-251 (1984) - [j1]P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone:
Degree sequences of matrogenic graphs. Discret. Math. 51(1): 47-61 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
