Foto av Alexandru Tomescu
  • PL 68 (Pietari Kalmin katu 5)

    00014

    Finland

20072019

Research output per year

Om du gjort några ändringar i Pure kommer de visas här snart.

Publikationer

Set-syllogistics meet combinatorics

Omodeo, E., Policriti, A. & Tomescu, A. I., feb 2017, I : MSCS : mathematical structures in computer science.. 27, 2 (Special Issue: XIV ICTCS), s. 296-310 15 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Fil

Simulating the bitonic sort using P systems

Ceterchi, R., Perez-Jimenez, M. J. & Tomescu, A. I., 2007, Membrane Computing: 8th International Workshop, WMC 2007 Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers. Eleftherakis, G., Kefalas, P., Paun, G., Rozenberg, G. & Salomaa, A. (red.). Springer-Verlag, s. 172-192 21 s. (Lecture Notes in Computer Science; vol. 4860).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

SNV-PPILP

van Rens, K., Mäkinen, V. A. T. & Tomescu, A. I., 2015

Forskningsoutput: Icke-textbaserad outputProgramvaraVetenskaplig

SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP

van Rens, K. E., Mäkinen, V. & Tomescu, A. I., 1 apr 2015, I : Bioinformatics. 31, 7, s. 1133-1135 3 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Sorting with P Systems: A Biological Perspective

Ardelean, I. I., Ceterchi, R. & Tomescu, A. I., 2008, I : Romanian journal of information science and technology. 11, 3, s. 243-252 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Sparse Dynamic Programming on DAGs with Small Width

Mäkinen, V., Tomescu, A. I., Kuosmanen, A., Paavilainen, T., Gagie, T. & Chikhi, R., maj 2019, I : ACM Transactions on Algorithms. 15, 2, 21 s., 29.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

The Minimum Conflict-Free Row Split Problem Revisited

Hujdurović, A., Husić, E., Milanič, M., Rizzi, R. & Tomescu, A. I., 2 nov 2017, Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Bodlaender, H. L. & Woeginger, G. J. (red.). Cham: Springer, s. 303-315 13 s. (Lecture Notes in Computer Science; vol. 10520).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

The representation of Boolean algebras in the spotlight of a proof checker

Ceterchi, R., Omodeo, E. G. & Tomescu, A. I., 2014, Proceedings of the 29th Italian Conference on Computational Logic: Torino, Italy, June 16-18, 2014. Giordano, L., Gliozzi, V. & Pozzato, G. L. (red.). CEUR Workshop Proceedings, s. 287-301 15 s. (CEUR Workshop Proceedings; vol. 1195).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Unicyclic and bicyclic graphs having minimum degree distance

Tomescu, A. I., 1 jan 2008, I : Discrete Applied Mathematics. 156, 1, s. 125-130 6 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended

Kuosmanen, A., Paavilainen, T., Gagie, T., Chikhi, R., Tomescu, A. & Mäkinen, V., apr 2018, Research in Computational Molecular Biology : 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings. Raphael, B. J. (red.). Cham: Springer International Publishing AG, s. 105-121 17 s. (Lecture Notes in Bioinformatics; vol. 10812).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil

Well-quasi-ordering hereditarily finite sets

Policriti, A. & Tomescu, A. I., 1 jun 2013, I : International Journal of Computer Mathematics. 90, 6, s. 1278-1291 14 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Well-Quasi-Ordering Hereditarily Finite Sets

Policriti, A. & Tomescu, A. I., 2011, Language and Automata Theory and Applications (LATA). Dediu, AH., Inenaga, S. & MartinVide, C. (red.). Springer-Verlag, s. 440-451 12 s. (Lecture Notes in Computer Science; vol. 6638).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review