Alexandru I. Tomescu

1. TOMESCU, Alexandru I., MILANIČ, Martin, RIZZI, Romeo. Extensional acyclic orientations and set graphs. In: KUTNAR, Klavdija (ed.), ŠPARL, Primož (ed.), KUZMAN, Boštjan (ed.). Abstracts of the 7th Slovenian international conference on graph theory, Bled, Slovenia, 19-25 June 2011. Koper: UP FAMNIT: UP PINT, 2011. Str. 44. [COBISS.SI-ID 1024357716]

2. POLICRITI, Alberto, TOMESCU, Alexandru I. Markov chain algorithms for generating sets uniformly at random. In: Ars mathematica contemporanea : special issue Bled'11. Bled'11 - 7th Slovenian International Conference on Graph Theory, 19-25 June 2011, Bled, Slovenia. Ljubljana: DMFA Slovenije, 2013. Vol. 6, no. 1, str. 57-68. Ars mathematica contemporanea, Vol. 6, no. 1, 2013. ISSN 1855-3966. http://amc.imfm.si/index.php/amc/article/view/286/185, Digitalna knjižnica Slovenije - dLib.si. [COBISS.SI-ID 16468569]

3. MILANIČ, Martin, TOMESCU, Alexandru I. Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. In: DEMANGE, Marc (ed.), et al. Seventh International Conference on Graphs and Optimization. Amsterdam: Elsevier, 2013. Str. 677-690. Discrete applied mathematics, Vol. 161, iss. 4/5. ISSN 0166-218X. DOI: 10.1016/j.dam.2011.11.027. [COBISS.SI-ID 1024382548]

4. MILANIČ, Martin, RIZZI, Romeo, TOMESCU, Alexandru I. Set graphs. II. Complexity of set graph recognition and similar problems. Theoretical computer science. 2014, vol. 547, str. 70-81. ISSN 0304-3975. Repozitorij Univerze na Primorskem - RUP, DOI: 10.1016/j.tcs.2014.06.017. [COBISS.SI-ID 1537143492]

5. MILANIČ, Martin, TOMESCU, Alexandru I. Set graphs. IV, Further connections with claw-freeness. Discrete applied mathematics. [Print ed.]. 2014, vol. 174, str. 113-121. ISSN 0166-218X. http://dx.doi.org/10.1016/j.dam.2014.05.011. [COBISS.SI-ID 17070169]

6. HUJDUROVIĆ, Ademir, KAČAR, Urša, MILANIČ, Martin, RIES, Bernard, TOMESCU, Alexandru I. Finding a perfect phylogeny from mixed tumor samples. In: POP, Mihai (ed.), TOUZET, Hélène (ed.). Algorithms in bioinformatics : proceedings : 15th International Workshop, WABI 2015 Atlanta, GA, USA, September 10-12, 2015. Berlin; New York: Springer, cop. 2015. Str. 80-92, ilustr. Lecture notes in computer science, 9289. ISBN 978-3-662-48220-9, ISBN 978-3-662-48221-6. ISSN 0302-9743. http://www.springer.com/us/book/9783662482209, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1537882564]

7. MÄKINEN, Veli, BELAZZOUGUI, Djamal, CUNIAL, Fabio, TOMESCU, Alexandru I. Genome-scale algorithm design : biological sequence analysis in the era of high-throughput sequencing. Cambridge: Cambridge University Press, 2015. XXII, 391 str., ilustr. ISBN 978-1-107-07853-6. [COBISS.SI-ID 1536817859]

8. HUJDUROVIĆ, Ademir, HUSIĆ, Edin, MILANIČ, Martin, RIZZI, Romeo, TOMESCU, Alexandru I. The minimum conflict-free row split problem revisited. In: BODLAENDER, Hans L. (ed.), WOEGINGER, Gerhard J. (ed.). Graph-theoretic concepts in computer science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017 : revised selected papers. WG 2075, 31th International Workshop on Graph-Theoretic Concepts in Computer Science, Eindhoven, The Netherlands, June 21-23, 2017. Berlin; Heidelberg: Springer, cop. 2017. Str. 303-315. Lecture notes in computer science, 10520. ISBN 978-3-319-68704-9, ISBN 978-3-319-68705-6. ISSN 0302-9743. https://doi.org/10.1007/978-3-319-68705-6_23, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1007/978-3-319-68705-6_23. [COBISS.SI-ID 1539850692]

9. HUJDUROVIĆ, Ademir, MILANIČ, Martin, HUSIĆ, Edin, RIZZI, Romeo, TOMESCU, Alexandru I. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem. In: Workshop on Discrete and Computational Biomathematics and Mathematical Chemistry 2017, 15-17 November 2017, UP FAMNIT, Koper, Slovenia. Koper: UP FAMNIT, 2017. Str. 1. https://conferences.famnit.upr.si/event/5/page/0, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1540528836]

10. HUJDUROVIĆ, Ademir, HUSIĆ, Edin, LI, Xinyue, MILANIČ, Martin, RIZZI, Romeo, TOMESCU, Alexandru I. Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing : EURO/ALIO, 25-27 June 2018, Bologne. Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1540527812]

11. HUJDUROVIĆ, Ademir, KAČAR, Urša, MILANIČ, Martin, RIES, Bernard, TOMESCU, Alexandru I. Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples. IEEE/ACM transactions on computational biology and bioinformatics. [Print ed.]. 2018, vol. 15, no. 1, str. 96-108, ilustr. ISSN 1545-5963. DOI: 10.1109/TCBB.2016.2606620. [COBISS.SI-ID 1538780868]

12. HUJDUROVIĆ, Ademir, HUSIĆ, Edin, MILANIČ, Martin, RIZZI, Romeo, TOMESCU, Alexandru I. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem. ACM transactions on algorithms. 2018, vol. 14, no. 2, article 20 (26 str.). ISSN 1549-6325. https://doi.org/10.1145/3182178, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1145/3182178. [COBISS.SI-ID 1540282052]

13. HUJDUROVIĆ, Ademir, MILANIČ, Martin, HUSIĆ, Edin, RIZZI, Romeo, TOMESCU, Alexandru I. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem. In: 7th PhD Summer School in Discrete Mathematics : Rogla, July 23-29, 2017. Koper: Univerza na Primorskem: Fakulteta za matematiko, naravoslovje in informacijske tehnologije: Inštitut Andrej Marušič, 2017. Str. 13. https://conferences.famnit.upr.si/indico/event/2/material/0/4.pdf, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1540527556]

14. HUSIĆ, Edin, LI, Xinyue, HUJDUROVIĆ, Ademir, MEHINE, Miika, RIZZI, Romeo, MÄKINEN, Veli, MILANIČ, Martin, TOMESCU, Alexandru I. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinformatics. [Print ed.]. 2019, vol. 35, iss. 5, str. 769-777. ISSN 1367-4803. https://doi.org/10.1093/bioinformatics/bty683, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1093/bioinformatics/bty683. [COBISS.SI-ID 1540524484]