default search action
Márcia R. Cerioli
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j31]Márcia R. Cerioli, Taísa Martins
:
Short proofs on the structure of general partition, equistable and triangle graphs. Discret. Appl. Math. 303: 8-13 (2021) - [c4]Márcia R. Cerioli
Presenting Basic Graph Logic. Diagrams 2021: 132-148 - 2020
- [j30]Márcia R. Cerioli, Paloma T. Lima
Intersection of longest paths in graph classes. Discret. Appl. Math. 281: 96-105 (2020) - [j29]Márcia R. Cerioli, Cristina G. Fernandes
Transversals of longest paths. Discret. Math. 343(3): 111717 (2020)
2010 – 2019
- 2019
- [c3]Márcia R. Cerioli, Cristina G. Fernandes
On Edge-magic Labelings of Forests. LAGOS 2019: 299-307 - 2017
- [j28]Márcia R. Cerioli, Cristina G. Fernandes
Transversals of Longest Paths. Electron. Notes Discret. Math. 62: 135-140 (2017) - [i2]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. CoRR abs/1712.07086 (2017) - 2016
- [j27]Márcia R. Cerioli, Nicolas Almeida Martins, Daniel F. D. Posner, Rudini M. Sampaio
L(2, 1)-labelling of graphs with few P4's. Discret. Optim. 20: 1-10 (2016) - [j26]Márcia R. Cerioli, Paloma T. Lima:
Intersection of Longest Paths in Graph Classes. Electron. Notes Discret. Math. 55: 139-142 (2016) - 2015
- [j25]Márcia R. Cerioli, Taísa L. Martins:
Structural Results for General Partition, Equistable and Triangle graphs. Electron. Notes Discret. Math. 49: 713-718 (2015) - 2014
- [j24]Márcia R. Cerioli, Hugo Nobrega
Decomposition by maxclique separators. Discret. Math. 337: 119-126 (2014) - 2013
- [i1]Márcia R. Cerioli, Daniel F. D. Posner:
Total L(2, 1)-coloring of graphs. CTW 2013: 43-46 - 2012
- [j23]Márcia R. Cerioli, Daniel F. D. Posner:
On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs. Discret. Appl. Math. 160(18): 2655-2661 (2012) - [j22]Márcia R. Cerioli, Fabiano de S. Oliveira
The interval count of interval graphs and orders: a short survey. J. Braz. Comput. Soc. 18(2): 103-112 (2012) - [c2]Márcia R. Cerioli, Lucas Pierezan:
On b-continuity of Distance-Hereditary Graphs. CTW 2012: 67-70 - 2011
- [j21]Márcia R. Cerioli, Fabiano de S. Oliveira
On counting interval lengths of interval graphs. Discret. Appl. Math. 159(7): 532-543 (2011) - [j20]Márcia R. Cerioli, Hugo Nobrega
On characterizations by nice forbidding sets. Electron. Notes Discret. Math. 38: 233-238 (2011) - [j19]Flavia Bonomo
On the L(2, 1)-labelling of block graphs. Int. J. Comput. Math. 88(3): 468-475 (2011) - [j18]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO Theor. Informatics Appl. 45(3): 331-346 (2011) - [c1]Márcia R. Cerioli, Hugo Nobrega, Petrucio Viana:
A partial characterization by forbidden subgraphs of edge path graphs. CTW 2011: 109-112 - 2010
- [j17]Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
Extreme Cliques in Interval Graphs. Ars Comb. 94 (2010)
2000 – 2009
- 2009
- [j16]Márcia R. Cerioli, André L. Korenchendler:
Clique-Coloring Circular-Arc Graphs. Electron. Notes Discret. Math. 35: 287-292 (2009) - [j15]Márcia R. Cerioli, Daniel F. D. Posner:
On lambda-coloring split, chordal bipartite and weakly chordal graphs. Electron. Notes Discret. Math. 35: 299-304 (2009) - 2008
- [j14]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. 156(12): 2270-2278 (2008) - [j13]Márcia R. Cerioli, Fabiano de S. Oliveira
Linear-Interval Dimension and PI Orders. Electron. Notes Discret. Math. 30: 111-116 (2008) - [j12]Márcia R. Cerioli, Priscila Petito:
Clique-coloring UE and UEH graphs. Electron. Notes Discret. Math. 30: 201-206 (2008) - 2007
- [j11]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo
Tree loop graphs. Discret. Appl. Math. 155(6-7): 686-694 (2007) - 2006
- [j10]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
Characterizing Intersection Graphs of Substars of a Star. Ars Comb. 79 (2006) - 2005
- [j9]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Non loop graphs with induced cycles. Electron. Notes Discret. Math. 19: 289-295 (2005) - [j8]Márcia R. Cerioli, Priscila Petito:
Forbidden subgraph characterization of split graphs that are UEH. Electron. Notes Discret. Math. 19: 305-311 (2005) - [j7]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo
Loop Graphs and Asteroidal Sets. Electron. Notes Discret. Math. 22: 179-183 (2005) - 2004
- [j6]Liliana Alcón, Celina M. H. de Figueiredo
Tree Loop Graphs. Electron. Notes Discret. Math. 18: 17-23 (2004) - [j5]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electron. Notes Discret. Math. 18: 73-79 (2004) - 2003
- [j4]Márcia R. Cerioli:
Clique Graphs and Edge-clique graphs. Electron. Notes Discret. Math. 13: 34-37 (2003) - 2002
- [j3]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
Edge clique graphs and some classes of chordal graphs. Discret. Math. 242(1-3): 31-39 (2002) - 2001
- [j2]Márcia R. Cerioli, Jayme Luiz Szwarcfiter:
A Characterization of Edge Clique Graphs. Ars Comb. 60 (2001)
1990 – 1999
- 1998
- [j1]Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein:
The Homogeneous Set Sandwich Problem. Inf. Process. Lett. 67(1): 31-35 (1998)
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:23 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: