default search action
BibTeX records: María Pía Mazzoleni
@article{DBLP:journals/dmgt/AlconMS23, author = {Liliana Alc{\'{o}}n and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Tanilson D. Santos}, title = {Relationship among B\({}_{\mbox{1}}\)-EPG, {VPT} and {EPT} graphs classes}, journal = {Discuss. Math. Graph Theory}, volume = {43}, number = {3}, pages = {841--858}, year = {2023}, url = {https://doi.org/10.7151/dmgt.2408}, doi = {10.7151/DMGT.2408}, timestamp = {Thu, 11 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/AlconMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Bonomo-Braberman22, author = {Flavia Bonomo{-}Braberman and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Mariano Leonardo Rean and Bernard Ries}, title = {On some special classes of contact {B0-VPG} graphs}, journal = {Discret. Appl. Math.}, volume = {308}, pages = {111--129}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2019.10.008}, doi = {10.1016/J.DAM.2019.10.008}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Bonomo-Braberman22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2203-04250, author = {Vitor Tocci Ferreira de Luca and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Fabiano de S. Oliveira and Tanilson D. Santos and Jayme Luiz Szwarcfiter}, title = {Edge Intersection Graphs of Paths on a Triangular Grid}, journal = {CoRR}, volume = {abs/2203.04250}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2203.04250}, doi = {10.48550/ARXIV.2203.04250}, eprinttype = {arXiv}, eprint = {2203.04250}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2203-04250.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-02755, author = {Liliana Alc{\'{o}}n and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Tanilson Dias dos Santos}, title = {On B\({}_{\mbox{1}}\)-EPG and {EPT} graphs}, journal = {CoRR}, volume = {abs/2007.02755}, year = {2020}, url = {https://arxiv.org/abs/2007.02755}, eprinttype = {arXiv}, eprint = {2007.02755}, timestamp = {Sat, 18 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-02755.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GalbyMR19, author = {Esther Galby and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Bernard Ries}, title = {Proper circular arc graphs as intersection graphs of pathson a grid}, journal = {Discret. Appl. Math.}, volume = {262}, pages = {195--202}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.02.010}, doi = {10.1016/J.DAM.2019.02.010}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GalbyMR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AlconBDGMRV18, author = {Liliana Alc{\'{o}}n and Flavia Bonomo and Guillermo Dur{\'{a}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Bernard Ries and Mario Valencia{-}Pabon}, title = {On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid}, journal = {Discret. Appl. Math.}, volume = {234}, pages = {12--21}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2016.08.004}, doi = {10.1016/J.DAM.2016.08.004}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AlconBDGMRV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/BonomoMRR18, author = {Flavia Bonomo and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Mariano Leonardo Rean and Bernard Ries}, editor = {Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub}, title = {Characterising Chordal Contact B{\_}0 -VPG Graphs}, booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10856}, pages = {89--100}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-96151-4\_8}, doi = {10.1007/978-3-319-96151-4\_8}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iscopt/BonomoMRR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-07372, author = {Flavia Bonomo and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Mariano Leonardo Rean and Bernard Ries}, title = {On some special classes of contact B\({}^{\mbox{0}}\)-VPG graphs}, journal = {CoRR}, volume = {abs/1807.07372}, year = {2018}, url = {http://arxiv.org/abs/1807.07372}, eprinttype = {arXiv}, eprint = {1807.07372}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-07372.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-09344, author = {Esther Galby and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Bernard Ries}, title = {Proper circular arc graphs as intersection graphs of paths on a grid}, journal = {CoRR}, volume = {abs/1808.09344}, year = {2018}, url = {http://arxiv.org/abs/1808.09344}, eprinttype = {arXiv}, eprint = {1808.09344}, timestamp = {Tue, 04 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-09344.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BonomoMS17, author = {Flavia Bonomo and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Maya Stein}, title = {Clique coloring B\({}_{\mbox{1}}\)-EPG graphs}, journal = {Discret. Math.}, volume = {340}, number = {5}, pages = {1008--1011}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.01.019}, doi = {10.1016/J.DISC.2017.01.019}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BonomoMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/AlconGM17, author = {Liliana Alc{\'{o}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {Helly {EPT} graphs on bounded degree trees: Characterization and recognition}, journal = {Discret. Math.}, volume = {340}, number = {12}, pages = {2798--2806}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.08.011}, doi = {10.1016/J.DISC.2017.08.011}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AlconGM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/AlconBM17, author = {Liliana Alc{\'{o}}n and Flavia Bonomo and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs}, journal = {Graphs Comb.}, volume = {33}, number = {4}, pages = {653--664}, year = {2017}, url = {https://doi.org/10.1007/s00373-017-1791-6}, doi = {10.1007/S00373-017-1791-6}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/AlconBM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AlconGM16, author = {Liliana Alc{\'{o}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {Helly \emph{EPT} graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition}, journal = {CoRR}, volume = {abs/1604.08775}, year = {2016}, url = {http://arxiv.org/abs/1604.08775}, eprinttype = {arXiv}, eprint = {1604.08775}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AlconGM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/AlconGM15, author = {Liliana Alc{\'{o}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs}, journal = {Discret. Math.}, volume = {338}, number = {1}, pages = {103--110}, year = {2015}, url = {https://doi.org/10.1016/j.disc.2014.08.020}, doi = {10.1016/J.DISC.2014.08.020}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AlconGM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AlconBDGMRV15, author = {Liliana Alc{\'{o}}n and Flavia Bonomo and Guillermo Dur{\'{a}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and Bernard Ries and Mario Valencia{-}Pabon}, title = {On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid}, journal = {Electron. Notes Discret. Math.}, volume = {50}, pages = {249--254}, year = {2015}, url = {https://doi.org/10.1016/j.endm.2015.07.042}, doi = {10.1016/J.ENDM.2015.07.042}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AlconBDGMRV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AlconGM14, author = {Liliana Alc{\'{o}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {Recognizing vertex intersection graphs of paths on bounded degree trees}, journal = {Discret. Appl. Math.}, volume = {162}, pages = {70--77}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.08.004}, doi = {10.1016/J.DAM.2013.08.004}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AlconGM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AlconGM13, author = {Liliana Alc{\'{o}}n and Marisa Gutierrez and Mar{\'{\i}}a P{\'{\i}}a Mazzoleni}, title = {On minimal non [h, 2, 1] graphs}, journal = {Electron. Notes Discret. Math.}, volume = {44}, pages = {115--120}, year = {2013}, url = {https://doi.org/10.1016/j.endm.2013.10.018}, doi = {10.1016/J.ENDM.2013.10.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AlconGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.