×

Tomescu, Alexandru Ioan

Author ID: tomescu.alexandru-ioan Recent zbMATH articles by "Tomescu, Alexandru Ioan"
Published as: Tomescu, Alexandru I.; Tomescu, Alexandru Ioan; Tomescu, Alexandru
External Links: MGP · ORCID
Documents Indexed: 63 Publications since 2007, including 2 Books and 5 Additional arXiv Preprints
Co-Authors: 49 Co-Authors with 60 Joint Publications
968 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

38 Publications have been cited 150 times in 104 Documents Cited by Year
Unicyclic and bicyclic graphs having minimum degree distance. Zbl 1132.05018
Tomescu, Alexandru Ioan
35
2008
On the complexity of string matching for graphs. Zbl 07561548
Equi, Massimo; Grossi, Roberto; Mäkinen, Veli; Tomescu, Alexandru I.
18
2019
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Zbl 1490.68151
Equi, Massimo; Mäkinen, Veli; Tomescu, Alexandru I.
9
2021
Safe and complete contig assembly via omnitigs. Zbl 1355.92070
Tomescu, Alexandru I.; Medvedev, Paul
7
2016
Linear time construction of indexable founder block graphs. Zbl 1515.92048
Mäkinen, Veli; Cazaux, Bastien; Equi, Massimo; Norri, Tuukka; Tomescu, Alexandru I.
6
2020
Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets. Zbl 1315.68223
Omodeo, Eugenio G.; Tomescu, Alexandru I.
5
2014
On sets and graphs. Perspectives on logic and combinatorics. Zbl 1382.05002
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
5
2017
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Zbl 1259.05143
Milanič, Martin; Tomescu, Alexandru I.
5
2013
Counting extensional acyclic digraphs. Zbl 1260.05077
Policriti, Alberto; Tomescu, Alexandru I.
5
2011
Simulating the bitonic sort using P systems. Zbl 1137.68378
Ceterchi, Rodica; Pérez-Jiménez, Mario J.; Tomescu, Alexandru Ioan
4
2007
Implementing sorting networks with spiking neural P systems. Zbl 1154.68049
Ceterchi, Rodica; Tomescu, Alexandru Ioan
4
2008
Faster FPTASes for counting and random generation of knapsack solutions. Zbl 1425.68459
Rizzi, Romeo; Tomescu, Alexandru I.
4
2014
Sparse dynamic programming on DAGs with small width. Zbl 1454.68112
Mäkinen, Veli; Tomescu, Alexandru I.; Kuosmanen, Anna; Paavilainen, Topi; Gagie, Travis; Chikhi, Rayan
4
2019
An optimal \(O(nm)\) algorithm for enumerating all walks common to all closed edge-covering walks of a graph. Zbl 1454.92021
Cairo, Massimo; Medvedev, Paul; Acosta, Nidia Obscura; Rizzi, Romeo; Tomescu, Alexandru I.
4
2019
Faster FPTASes for counting and random generation of knapsack solutions. Zbl 1423.68600
Rizzi, Romeo; Tomescu, Alexandru I.
4
2019
Using minimum path cover to boost dynamic programming on DAGs: co-linear chaining extended. Zbl 1510.92142
Kuosmanen, Anna; Paavilainen, Topi; Gagie, Travis; Chikhi, Rayan; Tomescu, Alexandru; Mäkinen, Veli
3
2018
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth’s theorem. Zbl 1454.92023
Hujdurović, Ademir; Husić, Edin; Milanić, Martin; Rizzi, Romeo; Tomescu, Alexandru I.
3
2018
Well-quasi-ordering hereditarily finite sets. Zbl 1333.03111
Policriti, Alberto; Tomescu, Alexandru I.
2
2011
Graph operations on parity games and polynomial-time algorithms. Zbl 1334.05088
Dittmann, Christoph; Kreutzer, Stephan; Tomescu, Alexandru I.
2
2016
Flow decomposition with subpath constraints. Zbl 1519.92176
Williams, Lucia; Tomescu, Alexandru I.; Mumey, Brendan
2
2021
Algorithms and complexity on indexing founder graphs. Zbl 07691814
Equi, Massimo; Norri, Tuukka; Alanko, Jarno; Cazaux, Bastien; Tomescu, Alexandru I.; Mäkinen, Veli
2
2023
Statements of ill-founded infinity in set theory. Zbl 1244.03136
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2010
Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct. Zbl 1180.03015
Omodeo, Eugenio G.; Tomescu, Alexandru I.
1
2008
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs. Zbl 1246.05088
Tomescu, Alexandru I.
1
2012
Set graphs. IV. Further connections with claw-freeness. Zbl 1298.05147
Milanič, Martin; Tomescu, Alexandru I.
1
2014
Motif matching using gapped patterns. Zbl 1314.68418
Giaquinta, Emanuele; Fredriksson, Kimmo; Grabowski, Szymon; Tomescu, Alexandru I.; Ukkonen, Esko
1
2014
Markov chain algorithms for generating sets uniformly at random. Zbl 1341.68138
Policriti, Alberto; Tomescu, Alexandru I.
1
2013
Mapping sets and hypersets into numbers. Zbl 1371.03060
D’Agostino, Giovanna; Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2015
Interval scheduling maximizing minimum coverage. Zbl 1370.68040
Mäkinen, Veli; Staneva, Valeria; Tomescu, Alexandru I.; Valenzuela, Daniel; Wilzbach, Sebastian
1
2017
Finding a perfect phylogeny from mixed tumor samples. Zbl 1367.92083
Hujdurović, Ademir; Kačar, Urša; Milanič, Martin; Ries, Bernard; Tomescu, Alexandru I.
1
2015
Gap filling as exact path length problem. Zbl 1355.92033
Salmela, Leena; Sahlin, Kristoffer; Mäkinen, Veli; Tomescu, Alexandru
1
2015
Set graphs. V. on representing graphs as membership digraphs. Zbl 1331.68203
Omodeo, Eugenio G.; Tomescu, Alexandru I.
1
2015
On the complexity of string matching for graphs. Zbl 07753172
Equi, Massimo; Mäkinen, Veli; Tomescu, Alexandru I.; Grossi, Roberto
1
2023
Well-quasi-ordering hereditarily finite sets. Zbl 1273.05091
Policriti, Alberto; Tomescu, Alexandru I.
1
2013
Safety and completeness in flow decompositions for RNA assembly. Zbl 1494.92088
Khan, Shahbaz; Kortelainen, Milla; Cáceres, Manuel; Williams, Lucia; Tomescu, Alexandru I.
1
2022
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points. Zbl 1523.68047
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I.; Zirondelli, Elia C.
1
2021
Infinity, in short. Zbl 1284.03231
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2012
Ranking, unranking and random generation of extensional acyclic digraphs. Zbl 1259.05172
Rizzi, Romeo; Tomescu, Alexandru I.
1
2013
Algorithms and complexity on indexing founder graphs. Zbl 07691814
Equi, Massimo; Norri, Tuukka; Alanko, Jarno; Cazaux, Bastien; Tomescu, Alexandru I.; Mäkinen, Veli
2
2023
On the complexity of string matching for graphs. Zbl 07753172
Equi, Massimo; Mäkinen, Veli; Tomescu, Alexandru I.; Grossi, Roberto
1
2023
Safety and completeness in flow decompositions for RNA assembly. Zbl 1494.92088
Khan, Shahbaz; Kortelainen, Milla; Cáceres, Manuel; Williams, Lucia; Tomescu, Alexandru I.
1
2022
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Zbl 1490.68151
Equi, Massimo; Mäkinen, Veli; Tomescu, Alexandru I.
9
2021
Flow decomposition with subpath constraints. Zbl 1519.92176
Williams, Lucia; Tomescu, Alexandru I.; Mumey, Brendan
2
2021
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points. Zbl 1523.68047
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I.; Zirondelli, Elia C.
1
2021
Linear time construction of indexable founder block graphs. Zbl 1515.92048
Mäkinen, Veli; Cazaux, Bastien; Equi, Massimo; Norri, Tuukka; Tomescu, Alexandru I.
6
2020
On the complexity of string matching for graphs. Zbl 07561548
Equi, Massimo; Grossi, Roberto; Mäkinen, Veli; Tomescu, Alexandru I.
18
2019
Sparse dynamic programming on DAGs with small width. Zbl 1454.68112
Mäkinen, Veli; Tomescu, Alexandru I.; Kuosmanen, Anna; Paavilainen, Topi; Gagie, Travis; Chikhi, Rayan
4
2019
An optimal \(O(nm)\) algorithm for enumerating all walks common to all closed edge-covering walks of a graph. Zbl 1454.92021
Cairo, Massimo; Medvedev, Paul; Acosta, Nidia Obscura; Rizzi, Romeo; Tomescu, Alexandru I.
4
2019
Faster FPTASes for counting and random generation of knapsack solutions. Zbl 1423.68600
Rizzi, Romeo; Tomescu, Alexandru I.
4
2019
Using minimum path cover to boost dynamic programming on DAGs: co-linear chaining extended. Zbl 1510.92142
Kuosmanen, Anna; Paavilainen, Topi; Gagie, Travis; Chikhi, Rayan; Tomescu, Alexandru; Mäkinen, Veli
3
2018
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth’s theorem. Zbl 1454.92023
Hujdurović, Ademir; Husić, Edin; Milanić, Martin; Rizzi, Romeo; Tomescu, Alexandru I.
3
2018
On sets and graphs. Perspectives on logic and combinatorics. Zbl 1382.05002
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
5
2017
Interval scheduling maximizing minimum coverage. Zbl 1370.68040
Mäkinen, Veli; Staneva, Valeria; Tomescu, Alexandru I.; Valenzuela, Daniel; Wilzbach, Sebastian
1
2017
Safe and complete contig assembly via omnitigs. Zbl 1355.92070
Tomescu, Alexandru I.; Medvedev, Paul
7
2016
Graph operations on parity games and polynomial-time algorithms. Zbl 1334.05088
Dittmann, Christoph; Kreutzer, Stephan; Tomescu, Alexandru I.
2
2016
Mapping sets and hypersets into numbers. Zbl 1371.03060
D’Agostino, Giovanna; Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2015
Finding a perfect phylogeny from mixed tumor samples. Zbl 1367.92083
Hujdurović, Ademir; Kačar, Urša; Milanič, Martin; Ries, Bernard; Tomescu, Alexandru I.
1
2015
Gap filling as exact path length problem. Zbl 1355.92033
Salmela, Leena; Sahlin, Kristoffer; Mäkinen, Veli; Tomescu, Alexandru
1
2015
Set graphs. V. on representing graphs as membership digraphs. Zbl 1331.68203
Omodeo, Eugenio G.; Tomescu, Alexandru I.
1
2015
Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets. Zbl 1315.68223
Omodeo, Eugenio G.; Tomescu, Alexandru I.
5
2014
Faster FPTASes for counting and random generation of knapsack solutions. Zbl 1425.68459
Rizzi, Romeo; Tomescu, Alexandru I.
4
2014
Set graphs. IV. Further connections with claw-freeness. Zbl 1298.05147
Milanič, Martin; Tomescu, Alexandru I.
1
2014
Motif matching using gapped patterns. Zbl 1314.68418
Giaquinta, Emanuele; Fredriksson, Kimmo; Grabowski, Szymon; Tomescu, Alexandru I.; Ukkonen, Esko
1
2014
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Zbl 1259.05143
Milanič, Martin; Tomescu, Alexandru I.
5
2013
Markov chain algorithms for generating sets uniformly at random. Zbl 1341.68138
Policriti, Alberto; Tomescu, Alexandru I.
1
2013
Well-quasi-ordering hereditarily finite sets. Zbl 1273.05091
Policriti, Alberto; Tomescu, Alexandru I.
1
2013
Ranking, unranking and random generation of extensional acyclic digraphs. Zbl 1259.05172
Rizzi, Romeo; Tomescu, Alexandru I.
1
2013
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs. Zbl 1246.05088
Tomescu, Alexandru I.
1
2012
Infinity, in short. Zbl 1284.03231
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2012
Counting extensional acyclic digraphs. Zbl 1260.05077
Policriti, Alberto; Tomescu, Alexandru I.
5
2011
Well-quasi-ordering hereditarily finite sets. Zbl 1333.03111
Policriti, Alberto; Tomescu, Alexandru I.
2
2011
Statements of ill-founded infinity in set theory. Zbl 1244.03136
Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I.
1
2010
Unicyclic and bicyclic graphs having minimum degree distance. Zbl 1132.05018
Tomescu, Alexandru Ioan
35
2008
Implementing sorting networks with spiking neural P systems. Zbl 1154.68049
Ceterchi, Rodica; Tomescu, Alexandru Ioan
4
2008
Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct. Zbl 1180.03015
Omodeo, Eugenio G.; Tomescu, Alexandru I.
1
2008
Simulating the bitonic sort using P systems. Zbl 1137.68378
Ceterchi, Rodica; Pérez-Jiménez, Mario J.; Tomescu, Alexandru Ioan
4
2007
all top 5

Cited by 190 Authors

24 Tomescu, Alexandru Ioan
9 Policriti, Alberto
8 Mäkinen, Veli
6 Equi, Massimo
5 Gibney, Daniel
5 Omodeo, Eugenio Giovanni
5 Rizzi, Romeo
5 Thankachan, Sharma V.
4 Cantone, Domenico
4 Halman, Nir
4 Mukwembi, Simon
3 Alon, Tzvi
3 Ceterchi, Rodica
3 Feng, Lihua
3 Hua, Hongbo
3 Ipate, Florentin
3 Norri, Tuukka
3 Rizzo, Nicola
2 Alanko, Jarno
2 Cáceres, Manuel Osvaldo
2 Cairo, Massimo
2 Cazaux, Bastien
2 Dankelmann, Peter
2 Du, Junfeng
2 Gawrychowski, Paweł
2 Gheorghe, Marian
2 Grossi, Roberto
2 Gutman, Ivan M.
2 Ilić, Aleksandar
2 Jain, Chirag
2 Khan, Shahbaz
2 Kirby, Laurence
2 Konur, Savas
2 Mafuta, Phillip
2 Maugeri, Pietro
2 Milanič, Martin
2 Mumey, Brendan
2 Munyira, Sheunesu
2 Ortali, Giacomo
2 Ramane, Harishchandra S.
2 Sharafdini, Reza
2 Su, Guifu
2 Tollis, Ioannis G.
2 Tomescu, Ioan
2 Tu, Jianhua
2 Wang, Hongzhuan
2 Williams, Lucia
2 Yu, Guihai
2 Zhu, Zhongxun
1 Abebe Ashebo, Mamo
1 Acosta, Nidia Obscura
1 Afzal Siddiqui, Hafiz Muhammad
1 Ali, Bahadur
1 Ali, Patrick
1 Alizadeh, Yaser
1 Aluru, Srinivas
1 Aslam, Muhammad Kamran
1 Astorino, Silvia
1 Balachandran, Selvaraj
1 Bentley, Jason W.
1 Bernardini, Giulia
1 Bianchi, Monica
1 Bichsel, Benjamin
1 Bilal, Ahsan
1 Bonnici, Vincenzo
1 Branda, Martin
1 Bucicovschi, Orest
1 Calude, Cristian S.
1 Casagrande, Alberto
1 Casel, Katrin
1 Chakraborty, Sankardeep
1 Chandra, Ashish
1 Chandra, Ghanshyam
1 Chikhi, Rayan
1 Cioabă, Sebastian M.
1 Cooper, Martin C.
1 Cornaro, Alessandra
1 D’Agostino, Giovanna
1 Darbari, Parisa
1 De Domenico, Andrea
1 Deng, Hanyuan
1 Dias, Fernando H. C.
1 Dondi, Riccardo
1 Fabiano, Francesco
1 Fahad, Asfand
1 Farahani, Mohammad Reza
1 Feng, Shigang
1 Franco, Giuditta
1 Gagie, Travis
1 Gajarský, Jakub
1 Georgiadis, Loukas
1 Giordano, Laura
1 Hamzeh, Asma
1 He, Fangguo
1 Hong, Yunchao
1 Hoppenworth, Gary
1 Hossein-Zadeh, Samaneh
1 Hu, Shengbiao
1 Hu, Xiaolan
1 Huang, Xiaoli
...and 90 more Authors

Citations by Year