A Linear-Time Algorithm for Proper Interval Graph Recognition. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1995)

On Edge-Colouring Indifference Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Theor. Comput. Sci., 1997)

On clique-complete graphs. - Cláudio Leonardo Lucchesi; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Math., 1998)

Even and Odd Pairs in Comparability and in P4-comparability Graphs. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1999)

Linear-time Algorithms for Maximum Sets of Sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 1999)

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1999)

Edge Colouring Reduced Indifference Graphs. - Celina M. H. de Figueiredo; Célia Picinin de Mello; Carmen Ortiz (LATIN, 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)

A note on transitive orientations with maximum sets of sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2002)

Decompositions for the edge colouring of reduced indifference graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello; Carmen Ortiz (Theor. Comput. Sci., 2003)

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)

Edge-colouring of join graphs. - Caterina De Simone; Célia Picinin de Mello (Theor. Comput. Sci., 2006)

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

A result on the total colouring of powers of cycles. - C. N. Campos; Célia Picinin de Mello (Discret. Appl. Math., 2007)

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

The total chromatic number of some bipartite graphs. - C. N. Campos; Célia Picinin de Mello (Ars Comb., 2008)

Colouring clique-hypergraphs of circulant graphs. - C. N. Campos; Simone Dantas; Célia Picinin de Mello (Electron. Notes Discret. Math., 2008)

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

Minimal separators in P4-tidy graphs. - Vagner Pedrotti; Célia Picinin de Mello (Electron. Notes Discret. Math., 2009)

The total-chromatic number of some families of snarks. - C. N. Campos; Simone Dantas; Célia Picinin de Mello (Discret. Math., 2011)

Minimal separators in extended P4-laden graphs. - Vagner Pedrotti; Célia Picinin de Mello (Discret. Appl. Math., 2012)

The total chromatic number of split-indifference graphs. - C. N. Campos; Celina M. H. de Figueiredo; Raphael Machado; Célia Picinin de Mello (Discret. Math., 2012)

On the classification problem for split graphs. - Sheila Morais de Almeida; Célia Picinin de Mello; 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)

AVD-total-colouring of complete equipartite graphs. - Atílio G. Luiz; C. N. Campos; Célia Picinin de Mello (Discret. Appl. Math., 2015)

AVD-total-chromatic number of some families of graphs with Δ(G)=3. - Atílio G. Luiz; C. N. Campos; Célia Picinin de Mello (Discret. Appl. Math., 2017)