default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaría Pía Mazzoleni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Liliana Alcón, María Pía Mazzoleni, Tanilson D. Santos:
Relationship among B1-EPG, VPT and EPT graphs classes. Discuss. Math. Graph Theory 43(3): 841-858 (2023)- 2022
- [j10]Flavia Bonomo-Braberman
, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. Discret. Appl. Math. 308: 111-129 (2022) - [i5]Vitor Tocci Ferreira de Luca, María Pía Mazzoleni, Fabiano de S. Oliveira, Tanilson D. Santos, Jayme Luiz Szwarcfiter:
Edge Intersection Graphs of Paths on a Triangular Grid. CoRR abs/2203.04250 (2022) - 2020
- [i4]Liliana Alcón, María Pía Mazzoleni, Tanilson Dias dos Santos:
On B1-EPG and EPT graphs. CoRR abs/2007.02755 (2020)
2010 – 2019
- 2019
- [j9]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. 262: 195-202 (2019) - 2018
- [j8]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234: 12-21 (2018) - [c1]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
Characterising Chordal Contact B_0 -VPG Graphs. ISCO 2018: 89-100 - [i3]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. CoRR abs/1807.07372 (2018) - [i2]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of paths on a grid. CoRR abs/1808.09344 (2018) - 2017
- [j7]Flavia Bonomo, María Pía Mazzoleni, Maya Stein:
Clique coloring B1-EPG graphs. Discret. Math. 340(5): 1008-1011 (2017) - [j6]Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Helly EPT graphs on bounded degree trees: Characterization and recognition. Discret. Math. 340(12): 2798-2806 (2017) - [j5]Liliana Alcón, Flavia Bonomo, María Pía Mazzoleni:
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. Graphs Comb. 33(4): 653-664 (2017) - 2016
- [i1]Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Helly EPT graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition. CoRR abs/1604.08775 (2016) - 2015
- [j4]Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs. Discret. Math. 338(1): 103-110 (2015) - [j3]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50: 249-254 (2015) - 2014
- [j2]Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Recognizing vertex intersection graphs of paths on bounded degree trees. Discret. Appl. Math. 162: 70-77 (2014) - 2013
- [j1]Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
On minimal non [h, 2, 1] graphs. Electron. Notes Discret. Math. 44: 115-120 (2013)
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-04-24 23:16 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:
