default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandru I. Tomescu
Alexandru Ioan Tomescu
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Nidia Obscura Acosta
, Alexandru I. Tomescu:
Simplicity in Eulerian circuits: Uniqueness and safety. Inf. Process. Lett. 183: 106421 (2024)- [j51]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ACM Trans. Algorithms 20(1): 4:1-4:26 (2024) - [j50]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024) - [j49]Fernando H. C. Dias, Alexandru I. Tomescu:
Accurate Flow Decomposition via Robust Integer Linear Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 21(6): 1955-1964 (2024) - [c35]Sebastian S. Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I. Tomescu:
Applying the Safe-And-Complete Framework to Practical Genome Assembly. WABI 2024: 8:1-8:16 - [c34]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Practical Minimum Path Cover. SEA 2024: 3:1-3:19 - [c33]Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu:
Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. SEA 2024: 14:1-14:19 - [i35]Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey, Alexandru I. Tomescu:
Parameterised Approximation and Complexity of Minimum Flow Decompositions. CoRR abs/2409.20278 (2024) - [i34]Francisco Sena, Alexandru I. Tomescu:
Safe Paths and Sequences for Scalable ILPs in RNA Transcript Assembly Problems. CoRR abs/2411.03871 (2024) - 2023
- [b4]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu:
Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing (2nd edition). Cambridge University Press 2023, ISBN 9781009341233 - [j48]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023) - [j47]Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu:
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. Bioinform. 39(8) (2023) - [j46]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A safety framework for flow decomposition problems via integer linear programming. Bioinform. 39(10) (2023) - [j45]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi:
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19(3): 21:1-21:25 (2023) - [j44]Lucia Williams, Alexandru I. Tomescu, Brendan Mumey:
Flow Decomposition With Subpath Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 360-370 (2023) - [j43]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theor. Comput. Sci. 975: 114128 (2023) - [c32]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut Paths and Their Remainder Structure, with Applications. STACS 2023: 17:1-17:17 - [i33]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR abs/2301.13245 (2023) - [i32]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Minimum Path Cover: The Power of Parameterization. CoRR abs/2308.08960 (2023) - 2022
- [j42]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. Algorithmica 84(3): 719-741 (2022) - [j41]Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti:
Solving String Problems on Graphs Using the Labeled Direct Product. Algorithmica 84(10): 3008-3033 (2022) - [j40]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Efficient Minimum Flow Decomposition via Integer Linear Programming. J. Comput. Biol. 29(11): 1252-1267 (2022) - [j39]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. 29(12): 1270-1287 (2022) - [j38]Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - [c31]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - [c30]Shahbaz Khan, Alexandru I. Tomescu:
Optimizing Safe Flow Decompositions in DAGs. ESA 2022: 72:1-72:17 - [c29]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB 2022: 177-192 - [c28]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. RECOMB 2022: 230-245 - [c27]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA 2022: 359-376 - [i31]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR abs/2201.10372 (2022) - [i30]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - [i29]Nidia Obscura Acosta, Alexandru I. Tomescu:
Simplicity in Eulerian Circuits: Uniqueness and Safety. CoRR abs/2208.08522 (2022) - [i28]Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming. CoRR abs/2209.00042 (2022) - [i27]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut paths and their remainder structure, with applications. CoRR abs/2210.07530 (2022) - [i26]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - 2021
- [j37]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. 305: 103-108 (2021) - [c26]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP 2021: 43:1-43:18 - [c25]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC 2021: 20:1-20:18 - [c24]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. SOFSEM 2021: 608-622 - [c23]Lucia Williams, Alexandru I. Tomescu, Brendan Mumey:
Flow Decomposition with Subpath Constraints. WABI 2021: 16:1-16:15 - [c22]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG 2021: 257-269 - [i25]Shahbaz Khan, Alexandru I. Tomescu:
Safety of Flow Decompositions in DAGs. CoRR abs/2102.06480 (2021) - [i24]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. CoRR abs/2102.12822 (2021) - [i23]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR abs/2107.05717 (2021) - [i22]Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti:
The Labeled Direct Product Optimally Solves String Problems on Graphs. CoRR abs/2109.05290 (2021) - 2020
- [c21]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. WABI 2020: 7:1-7:18 - [i21]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Conditional Indexing Lower Bounds Through Self-Reducibility. CoRR abs/2002.00629 (2020) - [i20]Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. CoRR abs/2002.10498 (2020) - [i19]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. CoRR abs/2005.09342 (2020) - [i18]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Computing all s-t bridges and articulation points simplified. CoRR abs/2006.15024 (2020) - [i17]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. CoRR abs/2007.04726 (2020) - [i16]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR abs/2007.07575 (2020) - [i15]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR abs/2011.12635 (2020)
2010 – 2019
- 2019
- [j36]Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu:
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35(5): 769-777 (2019) - [j35]Romeo Rizzi, Alexandru I. Tomescu:
Faster FPTASes for counting and random generation of Knapsack solutions. Inf. Comput. 267: 135-144 (2019) - [j34]Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi:
Sparse Dynamic Programming on DAGs with Small Width. ACM Trans. Algorithms 15(2): 29:1-29:21 (2019) - [j33]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019) - [j32]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela:
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 23-30 (2019) - [j31]Leena Salmela, Alexandru I. Tomescu:
Safely Filling Gaps with Partial Solutions Common to All Solutions. IEEE ACM Trans. Comput. Biol. Bioinform. 16(2): 617-626 (2019) - [c20]Niko Kiirala, Leena Salmela, Alexandru I. Tomescu:
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. CPM 2019: 8:1-8:16 - [c19]Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu:
On the Complexity of String Matching for Graphs. ICALP 2019: 55:1-55:15 - [i14]Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR abs/1902.03560 (2019) - 2018
- [j30]Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu:
A safe and complete algorithm for metagenomic assembly. Algorithms Mol. Biol. 13(1): 3:1-3:12 (2018) - [j29]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms 14(2): 20:1-20:26 (2018) - [j28]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 96-108 (2018) - [c18]Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen:
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. RECOMB 2018: 105-121 - 2017
- [b3]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
On Sets and Graphs: Perspectives on Logic and Combinatorics. Springer 2017, ISBN 978-3-319-54981-1 - [j27]Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach:
Interval scheduling maximizing minimum coverage. Discret. Appl. Math. 225: 130-135 (2017) - [j26]Alexandru I. Tomescu, Paul Medvedev:
Safe and Complete Contig Assembly Through Omnitigs. J. Comput. Biol. 24(6): 590-602 (2017) - [j25]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Set-syllogistics meet combinatorics. Math. Struct. Comput. Sci. 27(2): 296-310 (2017) - [c17]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM 2017: 29:1-29:12 - [c16]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The Minimum Conflict-Free Row Split Problem Revisited. WG 2017: 303-315 - [i13]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR abs/1701.05492 (2017) - [i12]Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen:
Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover. CoRR abs/1705.08754 (2017) - 2016
- [j24]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. J. Comput. Biol. 23(5): 347-361 (2016) - [j23]Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu:
Graph operations on parity games and polynomial-time algorithms. Theor. Comput. Sci. 614: 97-108 (2016) - [c15]Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu:
On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. BIOINFORMATICS 2016: 272-277 - [c14]Ahmed Sobih, Alexandru I. Tomescu, Veli Mäkinen:
MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows. RECOMB 2016: 111-121 - [c13]Alexandru I. Tomescu, Paul Medvedev:
Safe and Complete Contig Assembly Via Omnitigs. RECOMB 2016: 152-163 - [i11]Alexandru I. Tomescu, Paul Medvedev:
Safe and complete contig assembly via omnitigs. CoRR abs/1601.02932 (2016) - 2015
- [b2]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu:
Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing. Cambridge University Press 2015, ISBN 9781107078536 - [j22]Karen E. van Rens, Veli Mäkinen, Alexandru I. Tomescu:
SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP. Bioinform. 31(7): 1133-1135 (2015) - [j21]Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140(3-4): 307-328 (2015) - [j20]Eugenio G. Omodeo, Alexandru I. Tomescu:
Set Graphs. V. On representing graphs as membership digraphs. J. Log. Comput. 25(3): 899-919 (2015) - [j19]Giorgio Audrito, Alexandru I. Tomescu, Stephan G. Wagner:
Enumeration of the adjunctive hierarchy of hereditarily finite sets. J. Log. Comput. 25(3): 943-963 (2015) - [j18]Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen:
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1345-1354 (2015) - [c12]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. RECOMB 2015: 281-292 - [c11]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI 2015: 80-92 - [i10]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a perfect phylogeny from mixed tumor samples. CoRR abs/1506.07675 (2015) - [i9]Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela:
Interval scheduling maximizing minimum coverage. CoRR abs/1508.07820 (2015) - 2014
- [j17]Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen:
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. BMC Bioinform. 15(S-9): S5 (2014) - [j16]Martin Milanic, Alexandru I. Tomescu:
Set graphs. IV. Further connections with claw-freeness. Discret. Appl. Math. 174: 113-121 (2014) - [j15]Eugenio G. Omodeo, Alexandru I. Tomescu:
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets. J. Autom. Reason. 52(1): 1-29 (2014) - [j14]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. 547: 70-81 (2014) - [j13]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. Theor. Comput. Sci. 548: 1-13 (2014) - [c10]Rodica Ceterchi, Eugenio G. Omodeo, Alexandru I. Tomescu:
The Representation of Boolean Algebras in the Spotlight of a Proof Checker. CILC 2014: 287-301 - [c9]Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu:
Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC 2014: 341-346 - [c8]Romeo Rizzi, Alexandru I. Tomescu:
Faster FPTASes for Counting and Random Generation of Knapsack Solutions. ESA 2014: 762-773 - 2013
- [j12]Alberto Policriti, Alexandru I. Tomescu:
Markov chain algorithms for generating sets uniformly at random. Ars Math. Contemp. 6(1): 57-68 (2013) - [j11]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinform. 14(S-5): S15 (2013) - [j10]Martin Milanic, Alexandru I. Tomescu:
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discret. Appl. Math. 161(4-5): 677-690 (2013) - [j9]Alberto Policriti, Alexandru I. Tomescu:
Well-quasi-ordering hereditarily finite sets. Int. J. Comput. Math. 90(6): 1278-1291 (2013) - [j8]Romeo Rizzi, Alexandru I. Tomescu:
Ranking, unranking and random generation of extensional acyclic digraphs. Inf. Process. Lett. 113(5-6): 183-187 (2013) - [c7]Pierpaolo Calligaris, Eugenio G. Omodeo, Alexandru I. Tomescu:
A Proof-checking Experiment on Representing Graphs as Membership Digraphs. CILC 2013: 227-233 - [c6]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [c5]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. WABI 2013: 85-98 - [i8]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i7]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. CoRR abs/1306.2483 (2013) - [i6]Romeo Rizzi, Alexandru I. Tomescu:
Floating-point arithmetic for approximate counting and random generation problems. CoRR abs/1307.2347 (2013) - [i5]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. CoRR abs/1307.7811 (2013) - [i4]Giorgio Audrito, Alexandru I. Tomescu:
Enumeration of the adjunctive hierarchy of hereditarily finite sets. CoRR abs/1309.2512 (2013) - 2012
- [b1]Alexandru Ioan Tomescu:
Sets as graphs. University of Udine, Italy, 2012 - [j7]Francesco Vezzi, Cristian Del Fabbro, Alexandru I. Tomescu, Alberto Policriti:
rNA: a fast and accurate short reads numerical aligner. Bioinform. 28(1): 123-124 (2012) - [j6]Alexandru I. Tomescu:
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs. Discret. Math. 312(15): 2388-2391 (2012) - [j5]Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
A randomized Numerical Aligner (rNA). J. Comput. Syst. Sci. 78(6): 1868-1882 (2012) - [j4]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Infinity, in short. J. Log. Comput. 22(6): 1391-1403 (2012) - [i3]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. CoRR abs/1207.7184 (2012) - [i2]Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu:
Graph Operations on Parity Games and Polynomial-Time Algorithms. CoRR abs/1208.1640 (2012) - 2011
- [j3]Alberto Policriti, Alexandru I. Tomescu:
Counting extensional acyclic digraphs. Inf. Process. Lett. 111(16): 787-791 (2011) - [c4]Rodica Ceterchi, Alexandru Ioan Tomescu:
Computing the Maximum Bisimulation with Spiking Neural P Systems. Computation, Cooperation, and Life 2011: 151-157 - [c3]Alberto Policriti, Alexandru I. Tomescu:
Well-Quasi-Ordering Hereditarily Finite Sets. LATA 2011: 440-451 - 2010
- [c2]Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
A Randomized Numerical Aligner (rNA). LATA 2010: 512-523 - [i1]Alexandru I. Tomescu:
On cycles through two arcs in strong multipartite tournaments. CoRR abs/1006.0902 (2010)
2000 – 2009
- 2008
- [j2]Alexandru Ioan Tomescu:
Unicyclic and bicyclic graphs having minimum degree distance. Discret. Appl. Math. 156(1): 125-130 (2008) - [j1]Rodica Ceterchi, Alexandru Ioan Tomescu:
Implementing Sorting Networks with Spiking Neural P Systems. Fundam. Informaticae 87(1): 35-48 (2008) - 2007
- [c1]Rodica Ceterchi, Mario J. Pérez-Jiménez, Alexandru Ioan Tomescu:
Simulating the Bitonic Sort Using P Systems. Workshop on Membrane Computing 2007: 172-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-08 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
