Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella On dynamic threshold graphs and related classes. (English) Zbl 1388.68212 Theor. Comput. Sci. 718, 46-57 (2018). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{T. Calamoneri} et al., Theor. Comput. Sci. 718, 46--57 (2018; Zbl 1388.68212) Full Text: DOI Link
Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella Fully dynamically maintaining minimal integral separator for threshold and difference graphs. (English) Zbl 1475.68232 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 313-324 (2016). MSC: 68R10 68P05 PDFBibTeX XMLCite \textit{T. Calamoneri} et al., Lect. Notes Comput. Sci. 9627, 313--324 (2016; Zbl 1475.68232) Full Text: DOI Link
Calamoneri, T.; Petreschi, R. Corrigendum to: “On pairwise compatibility graphs having Dilworth number two”. (English) Zbl 1330.05086 Theor. Comput. Sci. 602, 158-159 (2015). MSC: 05C35 05C05 05C07 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Theor. Comput. Sci. 602, 158--159 (2015; Zbl 1330.05086) Full Text: DOI
Calamoneri, Tiziana; Petreschi, Rossella On pairwise compatibility graphs having Dilworth number \(k\). (English) Zbl 1420.05046 Theor. Comput. Sci. 547, 82-89 (2014). MSC: 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Theor. Comput. Sci. 547, 82--89 (2014; Zbl 1420.05046) Full Text: DOI
Calamoneri, T.; Petreschi, R. On pairwise compatibility graphs having Dilworth number two. (English) Zbl 1283.05142 Theor. Comput. Sci. 524, 34-40 (2014); corrigendum ibid. 602, 158-159 (2015). MSC: 05C35 05C05 05C07 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Theor. Comput. Sci. 524, 34--40 (2014; Zbl 1283.05142) Full Text: DOI
Borri, Alessandro; Calamoneri, Tiziana; Petreschi, Rossella Recognition of unigraphs through superposition of graphs (extended abstract). (English) Zbl 1211.05160 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 165-176 (2009). MSC: 05C85 05C75 PDFBibTeX XMLCite \textit{A. Borri} et al., Lect. Notes Comput. Sci. 5431, 165--176 (2009; Zbl 1211.05160) Full Text: DOI
Calamoneri, Tiziana; Petreschi, Rossella \(\lambda\)-coloring matrogenic graphs. (English) Zbl 1107.05087 Discrete Appl. Math. 154, No. 17, 2445-2457 (2006). MSC: 05C90 05C15 68R10 05B35 05C85 94A05 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Discrete Appl. Math. 154, No. 17, 2445--2457 (2006; Zbl 1107.05087) Full Text: DOI
De Agostino, S.; Petreschi, R.; Sterbini, A. An \(O(n^ 3)\) recognition algorithm for bithreshold graphs. (English) Zbl 0869.68068 Algorithmica 17, No. 4, 416-425 (1997). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{S. De Agostino} et al., Algorithmica 17, No. 4, 416--425 (1997; Zbl 0869.68068) Full Text: DOI
Petreschim, Rossella; Sterbini, Andrea Recognizing strict 2-threshold graphs in O(m) time. (English) Zbl 0875.68453 Inf. Process. Lett. 54, No. 4, 193-198 (1995). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{R. Petreschim} and \textit{A. Sterbini}, Inf. Process. Lett. 54, No. 4, 193--198 (1995; Zbl 0875.68453) Full Text: DOI
Marchioro, P.; Morgana, A.; Petreschi, R.; Simeone, B. Degree sequences of matrogenic graphs. (English) Zbl 0545.05054 Discrete Math. 51, 47-61 (1984). Reviewer: R.Tyshkevich MSC: 05C99 PDFBibTeX XMLCite \textit{P. Marchioro} et al., Discrete Math. 51, 47--61 (1984; Zbl 0545.05054) Full Text: DOI
Petreschi, Rossella; Simeone, Bruno A switching algorithm for the solution of quadratic Boolean equations. (English) Zbl 0461.94015 Inf. Process. Lett. 11, 193-198 (1980). MSC: 94C10 94-04 68R10 94C15 PDFBibTeX XMLCite \textit{R. Petreschi} and \textit{B. Simeone}, Inf. Process. Lett. 11, 193--198 (1980; Zbl 0461.94015) Full Text: DOI