BibTeX records: Rossella Petreschi

download as .bib file

@article{DBLP:journals/tcs/BaiocchiCMP19,
  author       = {Pierluigi Baiocchi and
                  Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  title        = {Some classes of graphs that are not PCGs},
  journal      = {Theor. Comput. Sci.},
  volume       = {791},
  pages        = {62--75},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.05.017},
  doi          = {10.1016/J.TCS.2019.05.017},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BaiocchiCMP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PetreschiK18,
  author       = {Rossella Petreschi and
                  Mohammad Kaykobad},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {718},
  pages        = {1},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.02.018},
  doi          = {10.1016/J.TCS.2018.02.018},
  timestamp    = {Thu, 22 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PetreschiK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalamoneriMP18,
  author       = {Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  title        = {On dynamic threshold graphs and related classes},
  journal      = {Theor. Comput. Sci.},
  volume       = {718},
  pages        = {46--57},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.01.007},
  doi          = {10.1016/J.TCS.2017.01.007},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CalamoneriMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BaiocchiCMP18,
  author       = {Pierluigi Baiocchi and
                  Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  editor       = {Costas S. Iliopoulos and
                  Hon Wai Leong and
                  Wing{-}Kin Sung},
  title        = {Graphs that Are Not Pairwise Compatible: {A} New Proof Technique (Extended
                  Abstract)},
  booktitle    = {Combinatorial Algorithms - 29th International Workshop, {IWOCA} 2018,
                  Singapore, July 16-19, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10979},
  pages        = {39--51},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-94667-2\_4},
  doi          = {10.1007/978-3-319-94667-2\_4},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BaiocchiCMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaykobadP17,
  author       = {Mohammad Kaykobad and
                  Rossella Petreschi},
  title        = {Guest Editors' Foreword},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {21},
  number       = {3},
  pages        = {245--246},
  year         = {2017},
  url          = {https://doi.org/10.7155/jgaa.00414},
  doi          = {10.7155/JGAA.00414},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/KaykobadP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaiocchiCMP17,
  author       = {Pierluigi Baiocchi and
                  Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  title        = {Some classes of graphs that are not PCGs},
  journal      = {CoRR},
  volume       = {abs/1707.07436},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.07436},
  eprinttype    = {arXiv},
  eprint       = {1707.07436},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BaiocchiCMP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/AusielloP16,
  author       = {Giorgio Ausiello and
                  Rossella Petreschi},
  title        = {Presentation of the book: The Power of Algorithms Inspiration and
                  Examples in Everyday Life},
  journal      = {Bull. {EATCS}},
  volume       = {118},
  year         = {2016},
  url          = {http://eatcs.org/beatcs/index.php/beatcs/article/view/387},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eatcs/AusielloP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FuscoPP16,
  author       = {Emanuele G. Fusco and
                  Andrzej Pelc and
                  Rossella Petreschi},
  title        = {Topology recognition with advice},
  journal      = {Inf. Comput.},
  volume       = {247},
  pages        = {254--265},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ic.2016.01.005},
  doi          = {10.1016/J.IC.2016.01.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FuscoPP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CalamoneriMP16,
  author       = {Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  editor       = {Mohammad Kaykobad and
                  Rossella Petreschi},
  title        = {Fully Dynamically Maintaining Minimal Integral Separator for Threshold
                  and Difference Graphs},
  booktitle    = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
                  {WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9627},
  pages        = {313--324},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-30139-6\_25},
  doi          = {10.1007/978-3-319-30139-6\_25},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/CalamoneriMP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/walcom/2016,
  editor       = {Mohammad Kaykobad and
                  Rossella Petreschi},
  title        = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
                  {WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9627},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-30139-6},
  doi          = {10.1007/978-3-319-30139-6},
  isbn         = {978-3-319-30138-9},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/2016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FuscoPP16,
  author       = {Emanuele Guido Fusco and
                  Andrzej Pelc and
                  Rossella Petreschi},
  title        = {Topology recognition with advice},
  journal      = {CoRR},
  volume       = {abs/1601.06040},
  year         = {2016},
  url          = {http://arxiv.org/abs/1601.06040},
  eprinttype    = {arXiv},
  eprint       = {1601.06040},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FuscoPP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalamoneriP15,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Corrigendum to "On pairwise compatibility graphs having Dilworth
                  number two" [Theoret. Comput. Science {(2014)} 34-40]},
  journal      = {Theor. Comput. Sci.},
  volume       = {602},
  pages        = {524},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.020},
  doi          = {10.1016/J.TCS.2015.08.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CalamoneriP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CalamoneriMP15,
  author       = {Tiziana Calamoneri and
                  Angelo Monti and
                  Rossella Petreschi},
  editor       = {Ekrem Duman and
                  Ali Fuat Alkaya},
  title        = {Dynamically Operating on Threshold Graphs and Related Classes (Extended
                  Abstract)},
  booktitle    = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
                  Istanbul, Turkey, May 26-28, 2015},
  pages        = {20--23},
  year         = {2015},
  timestamp    = {Thu, 02 Feb 2017 18:00:28 +0100},
  biburl       = {https://dblp.org/rec/conf/colognetwente/CalamoneriMP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalamoneriP14,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {On pairwise compatibility graphs having Dilworth number two},
  journal      = {Theor. Comput. Sci.},
  volume       = {524},
  pages        = {34--40},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.12.015},
  doi          = {10.1016/J.TCS.2013.12.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CalamoneriP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalamoneriP14a,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {On pairwise compatibility graphs having Dilworth number k},
  journal      = {Theor. Comput. Sci.},
  volume       = {547},
  pages        = {82--89},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.06.024},
  doi          = {10.1016/J.TCS.2014.06.024},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CalamoneriP14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CalamoneriP14,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Sudebkumar Prasant Pal and
                  Kunihiko Sadakane},
  title        = {On Dilworth k Graphs and Their Pairwise Compatibility},
  booktitle    = {Algorithms and Computation - 8th International Workshop, {WALCOM}
                  2014, Chennai, India, February 13-15, 2014, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8344},
  pages        = {213--224},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-04657-0\_21},
  doi          = {10.1007/978-3-319-04657-0\_21},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/CalamoneriP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/CalamoneriPS13,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi and
                  Blerina Sinaimeri},
  title        = {On the Pairwise Compatibility Property of some Superclasses of Threshold
                  Graphs},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {5},
  number       = {2},
  year         = {2013},
  url          = {https://doi.org/10.1142/S1793830913600021},
  doi          = {10.1142/S1793830913600021},
  timestamp    = {Wed, 12 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmaa/CalamoneriPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalamoneriP13,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Graphs with Dilworth Number Two are Pairwise Compatibility Graphs},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {44},
  pages        = {31--38},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.endm.2013.10.006},
  doi          = {10.1016/J.ENDM.2013.10.006},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/CalamoneriP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalamoneriMPS13,
  author       = {Tiziana Calamoneri and
                  Eugenio Montefusco and
                  Rossella Petreschi and
                  Blerina Sinaimeri},
  title        = {Exploring pairwise compatibility graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {468},
  pages        = {23--36},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.11.015},
  doi          = {10.1016/J.TCS.2012.11.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CalamoneriMPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FuscoPP13,
  author       = {Emanuele G. Fusco and
                  Andrzej Pelc and
                  Rossella Petreschi},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {Learning a Ring Cheaply and Fast},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7966},
  pages        = {557--568},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39212-2\_49},
  doi          = {10.1007/978-3-642-39212-2\_49},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/FuscoPP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FuscoPP13,
  author       = {Emanuele Guido Fusco and
                  Andrzej Pelc and
                  Rossella Petreschi},
  editor       = {Yehuda Afek},
  title        = {Use Knowledge to Learn Faster: Topology Recognition with Advice},
  booktitle    = {Distributed Computing - 27th International Symposium, {DISC} 2013,
                  Jerusalem, Israel, October 14-18, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8205},
  pages        = {31--45},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-41527-2\_3},
  doi          = {10.1007/978-3-642-41527-2\_3},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/FuscoPP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/13/Petreschi13,
  author       = {Rossella Petreschi},
  editor       = {Giorgio Ausiello and
                  Rossella Petreschi},
  title        = {How to Design an Algorithm},
  booktitle    = {The Power of Algorithms - Inspiration and Examples in Everyday Life},
  pages        = {27--57},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39652-6\_2},
  doi          = {10.1007/978-3-642-39652-6\_2},
  timestamp    = {Tue, 16 May 2017 14:01:46 +0200},
  biburl       = {https://dblp.org/rec/books/sp/13/Petreschi13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/2013AP,
  editor       = {Giorgio Ausiello and
                  Rossella Petreschi},
  title        = {The Power of Algorithms - Inspiration and Examples in Everyday Life},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39652-6},
  doi          = {10.1007/978-3-642-39652-6},
  isbn         = {978-3-642-39651-9},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/sp/2013AP.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CalamoneriPS12,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi and
                  Blerina Sinaimeri},
  editor       = {Md. Saidur Rahman and
                  Shin{-}Ichi Nakano},
  title        = {On Relaxing the Constraints in Pairwise Compatibility Graphs},
  booktitle    = {{WALCOM:} Algorithms and Computation - 6th International Workshop,
                  {WALCOM} 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7157},
  pages        = {124--135},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-28076-4\_14},
  doi          = {10.1007/978-3-642-28076-4\_14},
  timestamp    = {Tue, 21 Mar 2023 20:55:51 +0100},
  biburl       = {https://dblp.org/rec/conf/walcom/CalamoneriPS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CalamoneriP11,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {The L(2, 1)-labeling of unigraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {159},
  number       = {12},
  pages        = {1196--1206},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.dam.2011.04.015},
  doi          = {10.1016/J.DAM.2011.04.015},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CalamoneriP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorriCP11,
  author       = {Alessandro Borri and
                  Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Recognition of Unigraphs through Superposition of Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {15},
  number       = {3},
  pages        = {323--343},
  year         = {2011},
  url          = {https://doi.org/10.7155/jgaa.00229},
  doi          = {10.7155/JGAA.00229},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/BorriCP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/CalamoneriP11,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Alberto Marchetti{-}Spaccamela and
                  Michael Segal},
  title        = {\emph{L}(2, 1)-Labeling of Unigraphs - (Extended Abstract)},
  booktitle    = {Theory and Practice of Algorithms in (Computer) Systems - First International
                  {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6595},
  pages        = {57--68},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-19754-3\_8},
  doi          = {10.1007/978-3-642-19754-3\_8},
  timestamp    = {Tue, 14 May 2019 10:00:49 +0200},
  biburl       = {https://dblp.org/rec/conf/tapas/CalamoneriP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2171,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi and
                  Blerina Sinaimeri},
  title        = {On relaxing the constraints in pairwise compatibility graphs},
  journal      = {CoRR},
  volume       = {abs/1105.2171},
  year         = {2011},
  url          = {http://arxiv.org/abs/1105.2171},
  eprinttype    = {arXiv},
  eprint       = {1105.2171},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-2171.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/CaminitiP10,
  author       = {Saverio Caminiti and
                  Rossella Petreschi},
  title        = {Unified parallel encoding and decoding algorithms for Dandelion-like
                  codes},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {70},
  number       = {11},
  pages        = {1119--1127},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.jpdc.2010.07.003},
  doi          = {10.1016/J.JPDC.2010.07.003},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/CaminitiP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaminitiFP10,
  author       = {Saverio Caminiti and
                  Emanuele G. Fusco and
                  Rossella Petreschi},
  title        = {Bijective Linear Time Coding and Decoding for \emph{k}-Trees},
  journal      = {Theory Comput. Syst.},
  volume       = {46},
  number       = {2},
  pages        = {284--300},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00224-008-9131-0},
  doi          = {10.1007/S00224-008-9131-0},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CaminitiFP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CaminitiP10,
  author       = {Saverio Caminiti and
                  Rossella Petreschi},
  editor       = {Md. Saidur Rahman and
                  Satoshi Fujita},
  title        = {Parallel Algorithms for Encoding and Decoding Blob Code},
  booktitle    = {{WALCOM:} Algorithms and Computation, 4th International Workshop,
                  {WALCOM} 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5942},
  pages        = {167--178},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-11440-3\_16},
  doi          = {10.1007/978-3-642-11440-3\_16},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/CaminitiP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ItalianoP09,
  author       = {Giuseppe F. Italiano and
                  Rossella Petreschi},
  title        = {Preface},
  journal      = {J. Discrete Algorithms},
  volume       = {7},
  number       = {3},
  pages        = {279},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jda.2009.02.003},
  doi          = {10.1016/J.JDA.2009.02.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/ItalianoP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CalamoneriCPO09,
  author       = {Tiziana Calamoneri and
                  Saverio Caminiti and
                  Rossella Petreschi and
                  Stephan Olariu},
  title        = {On the \emph{L}(\emph{h}, \emph{k})-labeling of co-comparability graphs
                  and circular-arc graphs},
  journal      = {Networks},
  volume       = {53},
  number       = {1},
  pages        = {27--34},
  year         = {2009},
  url          = {https://doi.org/10.1002/net.20257},
  doi          = {10.1002/NET.20257},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/CalamoneriCPO09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/CaminitiP09,
  author       = {Saverio Caminiti and
                  Rossella Petreschi},
  editor       = {Gabrielle Allen and
                  Jaroslaw Nabrzyski and
                  Edward Seidel and
                  G. Dick van Albada and
                  Jack J. Dongarra and
                  Peter M. A. Sloot},
  title        = {Parallel Algorithms for Dandelion-Like Codes},
  booktitle    = {Computational Science - {ICCS} 2009, 9th International Conference,
                  Baton Rouge, LA, USA, May 25-27, 2009, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5544},
  pages        = {611--620},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-01970-8\_60},
  doi          = {10.1007/978-3-642-01970-8\_60},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/iccS/CaminitiP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/CaminitiFP09,
  author       = {Saverio Caminiti and
                  Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Alessandra Cherubini and
                  Mario Coppo and
                  Giuseppe Persiano},
  title        = {Informative Labeling Schemes for the Least Common Ancestor Problem},
  booktitle    = {Theoretical Computer Science, 11th Italian Conference, {ICTCS} 2009,
                  Cremona, Italy, September 28-30, 2009, Proceedings},
  pages        = {66--70},
  year         = {2009},
  timestamp    = {Tue, 28 May 2013 14:21:59 +0200},
  biburl       = {https://dblp.org/rec/conf/ictcs/CaminitiFP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BorriCP09,
  author       = {Alessandro Borri and
                  Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Sandip Das and
                  Ryuhei Uehara},
  title        = {Recognition of Unigraphs through Superposition of Graphs (Extended
                  Abstract)},
  booktitle    = {{WALCOM:} Algorithms and Computation, Third International Workshop,
                  {WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5431},
  pages        = {165--176},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-00202-1\_15},
  doi          = {10.1007/978-3-642-00202-1\_15},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/BorriCP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/CalamoneriCP08,
  author       = {Tiziana Calamoneri and
                  Saverio Caminiti and
                  Rossella Petreschi},
  title        = {A General Approach to \emph{L} {(} \emph{h, k} )-Label Interconnection
                  Networks},
  journal      = {J. Comput. Sci. Technol.},
  volume       = {23},
  number       = {4},
  pages        = {652--659},
  year         = {2008},
  url          = {https://doi.org/10.1007/s11390-008-9161-8},
  doi          = {10.1007/S11390-008-9161-8},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcst/CalamoneriCP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CaminitiFP08,
  author       = {Saverio Caminiti and
                  Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Dan Halperin and
                  Kurt Mehlhorn},
  title        = {Engineering Tree Labeling Schemes: {A} Case Study on Least Common
                  Ancestors},
  booktitle    = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
                  Germany, September 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5193},
  pages        = {234--245},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87744-8\_20},
  doi          = {10.1007/978-3-540-87744-8\_20},
  timestamp    = {Sun, 02 Jun 2019 21:14:36 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/CaminitiFP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itng/FinocchiFP08,
  author       = {Irene Finocchi and
                  Emanuele G. Fusco and
                  Rossella Petreschi},
  editor       = {Shahram Latifi},
  title        = {A Note on Algebraic Hypercube Colorings},
  booktitle    = {Fifth International Conference on Information Technology: New Generations
                  {(ITNG} 2008), 7-8 April 2008, Las Vegas, Nevada, {USA}},
  pages        = {869--874},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/ITNG.2008.173},
  doi          = {10.1109/ITNG.2008.173},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/itng/FinocchiFP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaminitiFP07,
  author       = {Saverio Caminiti and
                  Irene Finocchi and
                  Rossella Petreschi},
  title        = {On coding labeled trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {382},
  number       = {2},
  pages        = {97--108},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2007.03.009},
  doi          = {10.1016/J.TCS.2007.03.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaminitiFP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/escape/CalamoneriCOP07,
  author       = {Tiziana Calamoneri and
                  Saverio Caminiti and
                  Stephan Olariu and
                  Rossella Petreschi},
  editor       = {Bo Chen and
                  Mike Paterson and
                  Guochuan Zhang},
  title        = {On the L(h, k)-Labeling of Co-comparability Graphs},
  booktitle    = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
                  First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
                  7-9, 2007, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4614},
  pages        = {116--127},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74450-4\_11},
  doi          = {10.1007/978-3-540-74450-4\_11},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/escape/CalamoneriCOP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/escape/CaminitiFP07,
  author       = {Saverio Caminiti and
                  Emanuele G. Fusco and
                  Rossella Petreschi},
  editor       = {Bo Chen and
                  Mike Paterson and
                  Guochuan Zhang},
  title        = {A Bijective Code for \emph{k} -Trees with Linear Time Encoding and
                  Decoding},
  booktitle    = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
                  First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
                  7-9, 2007, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4614},
  pages        = {408--420},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74450-4\_37},
  doi          = {10.1007/978-3-540-74450-4\_37},
  timestamp    = {Sun, 21 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/escape/CaminitiFP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CalamoneriP06,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {lambda-Coloring matrogenic graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {154},
  number       = {17},
  pages        = {2445--2457},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.dam.2006.03.036},
  doi          = {10.1016/J.DAM.2006.03.036},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CalamoneriP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CalamoneriPP06,
  author       = {Tiziana Calamoneri and
                  Andrzej Pelc and
                  Rossella Petreschi},
  title        = {Labeling trees with a condition at distance two},
  journal      = {Discret. Math.},
  volume       = {306},
  number       = {14},
  pages        = {1534--1539},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disc.2005.04.024},
  doi          = {10.1016/J.DISC.2005.04.024},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CalamoneriPP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DasFP06,
  author       = {Sajal K. Das and
                  Irene Finocchi and
                  Rossella Petreschi},
  title        = {Conflict-free star-access in parallel memory systems},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {66},
  number       = {11},
  pages        = {1431--1441},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jpdc.2006.06.004},
  doi          = {10.1016/J.JPDC.2006.06.004},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/DasFP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalamoneriCP05,
  author       = {Tiziana Calamoneri and
                  Saverio Caminiti and
                  Rossella Petreschi},
  title        = {A general approach to L(h, k)-label interconnection networks},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {19},
  pages        = {211--217},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.endm.2005.05.029},
  doi          = {10.1016/J.ENDM.2005.05.029},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/CalamoneriCP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FinocchiP05,
  author       = {Irene Finocchi and
                  Rossella Petreschi},
  title        = {Structure-Preserving Hierarchical Decompositions},
  journal      = {Theory Comput. Syst.},
  volume       = {38},
  number       = {6},
  pages        = {687--700},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00224-004-1132-z},
  doi          = {10.1007/S00224-004-1132-Z},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/FinocchiP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CaminitiP05,
  author       = {Saverio Caminiti and
                  Rossella Petreschi},
  editor       = {Lusheng Wang},
  title        = {String Coding of Trees with Locality and Heritability},
  booktitle    = {Computing and Combinatorics, 11th Annual International Conference,
                  {COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3595},
  pages        = {251--262},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11533719\_27},
  doi          = {10.1007/11533719\_27},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/CaminitiP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdpta/CalamoneriFP05,
  author       = {Tiziana Calamoneri and
                  Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Hamid R. Arabnia},
  title        = {Graph Coloring with Distance Constraints},
  booktitle    = {Proceedings of the International Conference on Parallel and Distributed
                  Processing Techniques and Applications, {PDPTA} 2005, Las Vegas, Nevada,
                  USA, June 27-30, 2005, Volume 1},
  pages        = {131--140},
  publisher    = {{CSREA} Press},
  year         = {2005},
  timestamp    = {Wed, 25 Jan 2006 09:49:27 +0100},
  biburl       = {https://dblp.org/rec/conf/pdpta/CalamoneriFP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FinocchiP04,
  author       = {Irene Finocchi and
                  Rossella Petreschi},
  title        = {Divider-based algorithms for hierarchical tree partitioning},
  journal      = {Discret. Appl. Math.},
  volume       = {136},
  number       = {2-3},
  pages        = {227--247},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0166-218X(03)00443-8},
  doi          = {10.1016/S0166-218X(03)00443-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FinocchiP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/CalamoneriP04,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {L(h, 1)-labeling subclasses of planar graphs},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {64},
  number       = {3},
  pages        = {414--426},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jpdc.2003.11.005},
  doi          = {10.1016/J.JPDC.2003.11.005},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/CalamoneriP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/DasFP04,
  author       = {Sajal K. Das and
                  Irene Finocchi and
                  Rossella Petreschi},
  title        = {Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory
                  Systems},
  booktitle    = {18th International Parallel and Distributed Processing Symposium {(IPDPS}
                  2004), {CD-ROM} / Abstracts Proceedings, 26-30 April 2004, Santa Fe,
                  New Mexico, {USA}},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/IPDPS.2004.1302970},
  doi          = {10.1109/IPDPS.2004.1302970},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/DasFP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CaminitiFP04,
  author       = {Saverio Caminiti and
                  Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Martin Farach{-}Colton},
  title        = {A Unified Approach to Coding Labeled Trees},
  booktitle    = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
                  Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2976},
  pages        = {339--348},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-24698-5\_38},
  doi          = {10.1007/978-3-540-24698-5\_38},
  timestamp    = {Fri, 09 Apr 2021 18:42:35 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/CaminitiFP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalamoneriPP03,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi and
                  Andrzej Pelc},
  title        = {Labeling trees with a condition at distance two},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {15},
  pages        = {55--58},
  year         = {2003},
  url          = {https://doi.org/10.1016/S1571-0653(04)00529-3},
  doi          = {10.1016/S1571-0653(04)00529-3},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/CalamoneriPP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2003,
  editor       = {Rossella Petreschi and
                  Giuseppe Persiano and
                  Riccardo Silvestri},
  title        = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
                  Italy, May 28-30, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2653},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-44849-7},
  doi          = {10.1007/3-540-44849-7},
  isbn         = {3-540-40176-8},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/2003.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/paapp/CalamoneriFMP02,
  author       = {Tiziana Calamoneri and
                  Irene Finocchi and
                  Yannis Manoussakis and
                  Rossella Petreschi},
  title        = {On max cut in cubic graphs},
  journal      = {Parallel Algorithms Appl.},
  volume       = {17},
  number       = {3},
  pages        = {165--183},
  year         = {2002},
  url          = {https://doi.org/10.1080/10637190127724},
  doi          = {10.1080/10637190127724},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/paapp/CalamoneriFMP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BongiovanniGP02,
  author       = {Gian Carlo Bongiovanni and
                  Giorgio Gambosi and
                  Rossella Petreschi},
  title        = {Foreword},
  journal      = {Theor. Comput. Sci.},
  volume       = {285},
  number       = {1},
  pages        = {1},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0304-3975(01)00286-9},
  doi          = {10.1016/S0304-3975(01)00286-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BongiovanniGP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwdc/CalamoneriP02,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Sajal K. Das and
                  Swapan Bhattacharya},
  title        = {On the Radiocoloring Problem},
  booktitle    = {Distributed Computing, Mobile and Wireless Computing 4th International
                  Workshop, {IWDC} 2002, Calcutta, India, December 28-31, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2571},
  pages        = {118--127},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36385-8\_12},
  doi          = {10.1007/3-540-36385-8\_12},
  timestamp    = {Tue, 10 Sep 2019 13:47:28 +0200},
  biburl       = {https://dblp.org/rec/conf/iwdc/CalamoneriP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CalamoneriP02,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Sergio Rajsbaum},
  title        = {L(2, 1)-Coloring Matrogenic Graphs},
  booktitle    = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
                  Cancun, Mexico, April 3-6, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2286},
  pages        = {236--247},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45995-2\_24},
  doi          = {10.1007/3-540-45995-2\_24},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/CalamoneriP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CalamoneriP01,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {LD-Coloring of Regular Tiling (Extended Abstract)},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {8},
  pages        = {18--21},
  year         = {2001},
  url          = {https://doi.org/10.1016/S1571-0653(05)80068-X},
  doi          = {10.1016/S1571-0653(05)80068-X},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/CalamoneriP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FinocchiP01,
  author       = {Irene Finocchi and
                  Rossella Petreschi},
  title        = {Tree partitioning via vertex deletion},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {8},
  pages        = {38--41},
  year         = {2001},
  url          = {https://doi.org/10.1016/S1571-0653(05)80074-5},
  doi          = {10.1016/S1571-0653(05)80074-5},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/FinocchiP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcs/CalamoneriP01,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Edge-clique graphs and the l-coloring problem},
  journal      = {J. Braz. Comput. Soc.},
  volume       = {7},
  number       = {3},
  pages        = {38--47},
  year         = {2001},
  timestamp    = {Wed, 20 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jbcs/CalamoneriP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FinocchiP01,
  author       = {Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Adam L. Buchsbaum and
                  Jack Snoeyink},
  title        = {Hierarchical Clustering of Trees: Algorithms and Experiments},
  booktitle    = {Algorithm Engineering and Experimentation, Third International Workshop,
                  {ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2153},
  pages        = {117--131},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44808-X\_9},
  doi          = {10.1007/3-540-44808-X\_9},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/alenex/FinocchiP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FinocchiP01,
  author       = {Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Jie Wang},
  title        = {On the Validity of Hierarchical Decompositions},
  booktitle    = {Computing and Combinatorics, 7th Annual International Conference,
                  {COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2108},
  pages        = {368--374},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44679-6\_40},
  doi          = {10.1007/3-540-44679-6\_40},
  timestamp    = {Mon, 03 Aug 2020 14:08:01 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/FinocchiP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/CalamoneriP01,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {L(2, 1)-labeling of planar graphs},
  booktitle    = {Proceedings of the 5th International Workshop on Discrete Algorithms
                  and Methods for Mobile Computing and Communications {(DIAL-M} 2001),
                  Rome, Italy, July 21, 2001},
  pages        = {28--33},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/381448.381452},
  doi          = {10.1145/381448.381452},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/dialm/CalamoneriP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GreenlawP00,
  author       = {Raymond Greenlaw and
                  Rossella Petreschi},
  title        = {Computing Pr{\"{u}}fer codes efficiently in parallel},
  journal      = {Discret. Appl. Math.},
  volume       = {102},
  number       = {3},
  pages        = {205--222},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00221-8},
  doi          = {10.1016/S0166-218X(99)00221-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GreenlawP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/CalamoneriOP00,
  author       = {Tiziana Calamoneri and
                  Stephan Olariu and
                  Rossella Petreschi},
  title        = {A Simple Parallel Algorithm to Draw Cubic Graphs},
  journal      = {{IEEE} Trans. Parallel Distributed Syst.},
  volume       = {11},
  number       = {10},
  pages        = {1009--1018},
  year         = {2000},
  url          = {https://doi.org/10.1109/71.888641},
  doi          = {10.1109/71.888641},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tpds/CalamoneriOP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vlc/CrescenziDFP00,
  author       = {Pierluigi Crescenzi and
                  Camil Demetrescu and
                  Irene Finocchi and
                  Rossella Petreschi},
  title        = {Reversible Execution and Visualization of Programs with {LEONARDO}},
  journal      = {J. Vis. Lang. Comput.},
  volume       = {11},
  number       = {2},
  pages        = {125--150},
  year         = {2000},
  url          = {https://doi.org/10.1006/jvlc.1999.0143},
  doi          = {10.1006/JVLC.1999.0143},
  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/vlc/CrescenziDFP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2000,
  editor       = {Gian Carlo Bongiovanni and
                  Giorgio Gambosi and
                  Rossella Petreschi},
  title        = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
                  Italy, March 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1767},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-46521-9},
  doi          = {10.1007/3-540-46521-9},
  isbn         = {3-540-67159-5},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/2000.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CalamoneriP99,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Optimal Layout of Trivalent Cayley Interconnection Networks},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {10},
  number       = {3},
  pages        = {277--288},
  year         = {1999},
  url          = {https://doi.org/10.1142/S0129054199000204},
  doi          = {10.1142/S0129054199000204},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/CalamoneriP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CalamoneriJP99,
  author       = {Tiziana Calamoneri and
                  Simone Jannelli and
                  Rossella Petreschi},
  title        = {Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {3},
  number       = {2},
  pages        = {1--23},
  year         = {1999},
  url          = {https://doi.org/10.7155/jgaa.00013},
  doi          = {10.7155/JGAA.00013},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/CalamoneriJP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PeledPS99,
  author       = {Uri N. Peled and
                  Rossella Petreschi and
                  Andrea Sterbini},
  title        = {(n, e)-Graphs with maximum sum of squares of degrees},
  journal      = {J. Graph Theory},
  volume       = {31},
  number       = {4},
  pages        = {283--295},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199908)31:4\&\#60;283::AID-JGT3\&\#62;3.0.CO;2-H},
  doi          = {10.1002/(SICI)1097-0118(199908)31:4\&\#60;283::AID-JGT3\&\#62;3.0.CO;2-H},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/PeledPS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asian/CalamoneriFMP99,
  author       = {Tiziana Calamoneri and
                  Irene Finocchi and
                  Yannis Manoussakis and
                  Rossella Petreschi},
  editor       = {P. S. Thiagarajan and
                  Roland H. C. Yap},
  title        = {A Parallel Approximation Algorithm for the Max Cut Problem on Cubic
                  Graphs},
  booktitle    = {Advances in Computing Science - ASIAN'99, 5th Asian Computing Science
                  Conference, Phuket, Thailand, December 10-12, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1742},
  pages        = {27--36},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46674-6\_4},
  doi          = {10.1007/3-540-46674-6\_4},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/asian/CalamoneriFMP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/CalamoneriP98,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {Orthogonally Drawing Cubic Graphs in Parallel},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {55},
  number       = {1},
  pages        = {94--108},
  year         = {1998},
  url          = {https://doi.org/10.1006/jpdc.1998.1495},
  doi          = {10.1006/JPDC.1998.1495},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/CalamoneriP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgostinoPS97,
  author       = {Sergio De Agostino and
                  Rossella Petreschi and
                  Andrea Sterbini},
  title        = {An O(n{\({^3}\)}) Recognition Algorithm for Bithreshold Graphs},
  journal      = {Algorithmica},
  volume       = {17},
  number       = {4},
  pages        = {416--425},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF02523681},
  doi          = {10.1007/BF02523681},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AgostinoPS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CalamoneriP97,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  title        = {A New 3D Representation of Trivalent Cayley Networks},
  journal      = {Inf. Process. Lett.},
  volume       = {61},
  number       = {5},
  pages        = {247--252},
  year         = {1997},
  url          = {https://doi.org/10.1016/S0020-0190(97)00027-6},
  doi          = {10.1016/S0020-0190(97)00027-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CalamoneriP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/CrescenziDFP97,
  author       = {Pierluigi Crescenzi and
                  Camil Demetrescu and
                  Irene Finocchi and
                  Rossella Petreschi},
  editor       = {Giuseppe F. Italiano and
                  Salvatore Orlando},
  title        = {{LEONARDO:} a software visualization system},
  booktitle    = {Workshop on Algorithm Engineering, {WAE} '97, Venezia, Italy, September
                  11-13, 1997. Proceedings},
  pages        = {146--155},
  publisher    = {Universit{\`{a}} Ca' Foscari di Venezia},
  year         = {1997},
  timestamp    = {Mon, 10 May 2021 14:20:29 +0200},
  biburl       = {https://dblp.org/rec/conf/wae/CrescenziDFP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/GreenlawP95,
  author       = {Raymond Greenlaw and
                  Rossella Petreschi},
  title        = {Cubic Graphs},
  journal      = {{ACM} Comput. Surv.},
  volume       = {27},
  number       = {4},
  pages        = {471--495},
  year         = {1995},
  url          = {https://doi.org/10.1145/234782.234783},
  doi          = {10.1145/234782.234783},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/csur/GreenlawP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PetreschiS95a,
  author       = {Rossella Petreschi and
                  Andrea Sterbini},
  title        = {Recognizing Strict 2-Threshold Graphs in O(m) Time},
  journal      = {Inf. Process. Lett.},
  volume       = {54},
  number       = {4},
  pages        = {193--198},
  year         = {1995},
  url          = {https://doi.org/10.1016/0020-0190(95)00030-G},
  doi          = {10.1016/0020-0190(95)00030-G},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PetreschiS95a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PetreschiS95,
  author       = {Rossella Petreschi and
                  Andrea Sterbini},
  title        = {Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time},
  journal      = {Inf. Process. Lett.},
  volume       = {56},
  number       = {1},
  pages        = {65},
  year         = {1995},
  url          = {https://doi.org/10.1016/0020-0190(95)00143-Z},
  doi          = {10.1016/0020-0190(95)00143-Z},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PetreschiS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asian/BaffiP95,
  author       = {Luca Baffi and
                  Rossella Petreschi},
  editor       = {Kanchana Kanchanasut and
                  Jean{-}Jacques L{\'{e}}vy},
  title        = {Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs},
  booktitle    = {Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science
                  Conference, {ACSC} '95, Pathumthani, Thailand, December 11-13, 1995,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1023},
  pages        = {34--47},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60688-2\_33},
  doi          = {10.1007/3-540-60688-2\_33},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/asian/BaffiP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cococ/PetreschiS95,
  author       = {Rossella Petreschi and
                  Andrea Sterbini},
  editor       = {Michel Deza and
                  Reinhardt Euler and
                  Yannis Manoussakis},
  title        = {Threshold Graphs and Synchronization Protocols},
  booktitle    = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese
                  Conference, Brest, France, July 3-5, 1995, Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {1120},
  pages        = {378--395},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-61576-8\_97},
  doi          = {10.1007/3-540-61576-8\_97},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/cococ/PetreschiS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CalamoneriP95,
  author       = {Tiziana Calamoneri and
                  Rossella Petreschi},
  editor       = {Ding{-}Zhu Du and
                  Ming Li},
  title        = {An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs},
  booktitle    = {Computing and Combinatorics, First Annual International Conference,
                  {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {959},
  pages        = {31--40},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/BFb0030817},
  doi          = {10.1007/BFB0030817},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/CalamoneriP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/1994,
  editor       = {Maurizio A. Bonuccelli and
                  Pierluigi Crescenzi and
                  Rossella Petreschi},
  title        = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
                  Rome, Italy, February 23-25, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {778},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-57811-0},
  doi          = {10.1007/3-540-57811-0},
  isbn         = {3-540-57811-0},
  timestamp    = {Fri, 17 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/1994.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AgostinoP92,
  author       = {Sergio De Agostino and
                  Rossella Petreschi},
  title        = {On PV\({}_{\mbox{chunk}}\) Operations and Matrogenic Graphs},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {3},
  number       = {1},
  pages        = {11--20},
  year         = {1992},
  url          = {https://doi.org/10.1142/S0129054192000036},
  doi          = {10.1142/S0129054192000036},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/AgostinoP92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/JaumardMMPS90,
  author       = {Brigitte Jaumard and
                  P. Marchioro and
                  Aurora Morgana and
                  Rossella Petreschi and
                  Bruno Simeone},
  title        = {On Line 2-Satisfiability},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {1},
  pages        = {155--165},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF01531076},
  doi          = {10.1007/BF01531076},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/JaumardMMPS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AgostinoP90,
  author       = {Sergio De Agostino and
                  Rossella Petreschi},
  title        = {Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {123--130},
  year         = {1990},
  url          = {https://doi.org/10.1142/S0129054190000102},
  doi          = {10.1142/S0129054190000102},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/AgostinoP90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/BongiovanniP89,
  author       = {Gian Carlo Bongiovanni and
                  Rossella Petreschi},
  title        = {Parallel-Depth Search for Acyclic Digraphs},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {7},
  number       = {2},
  pages        = {383--390},
  year         = {1989},
  url          = {https://doi.org/10.1016/0743-7315(89)90027-0},
  doi          = {10.1016/0743-7315(89)90027-0},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/BongiovanniP89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MarchioroMPS88,
  author       = {P. Marchioro and
                  Aurora Morgana and
                  Rossella Petreschi and
                  Bruno Simeone},
  title        = {Adamant digraphs},
  journal      = {Discret. Math.},
  volume       = {69},
  number       = {3},
  pages        = {253--261},
  year         = {1988},
  url          = {https://doi.org/10.1016/0012-365X(88)90054-4},
  doi          = {10.1016/0012-365X(88)90054-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MarchioroMPS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BovetAP88,
  author       = {Daniel P. Bovet and
                  Sergio De Agostino and
                  Rossella Petreschi},
  title        = {Parallelism and the Feedback Vertex Set Problem},
  journal      = {Inf. Process. Lett.},
  volume       = {28},
  number       = {2},
  pages        = {81--85},
  year         = {1988},
  url          = {https://doi.org/10.1016/0020-0190(88)90168-8},
  doi          = {10.1016/0020-0190(88)90168-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BovetAP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MarchioroMPS84,
  author       = {P. Marchioro and
                  Aurora Morgana and
                  Rossella Petreschi and
                  Bruno Simeone},
  title        = {Degree sequences of matrogenic graphs},
  journal      = {Discret. Math.},
  volume       = {51},
  number       = {1},
  pages        = {47--61},
  year         = {1984},
  url          = {https://doi.org/10.1016/0012-365X(84)90023-2},
  doi          = {10.1016/0012-365X(84)90023-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MarchioroMPS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PetreschiS80,
  author       = {Rossella Petreschi and
                  Bruno Simeone},
  title        = {A Switching Algorithm for the Solution of Quadratic Boolean Equations},
  journal      = {Inf. Process. Lett.},
  volume       = {11},
  number       = {4/5},
  pages        = {193--198},
  year         = {1980},
  url          = {https://doi.org/10.1016/0020-0190(80)90049-6},
  doi          = {10.1016/0020-0190(80)90049-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PetreschiS80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics