Alexandru I. Tomescu

127 papers A* 3A 5B 14C 8Journal 90Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Fast and Flexible Flow Decompositions in General Graphs via Dominators. CoRR Francisco Sena, Alexandru I. Tomescu
2025	J	`jnl`	Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework. CoRR Francisco Sena, Aleksandr Politov, Corentin Moumard, Manuel Cáceres, Sebastian Schmidt, Juha Harviainen, Alexandru I. Tomescu
2025	J	`jnl`	Maximum Coverage CoRR Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak, Alexandru I. Tomescu
2025	J	`jnl`	Minimum flow decomposition in graphs with cycles using integer linear programming. J. Glob. Optim. Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2025	A	`conf`	Safe Sequences via Dominators in DAGs for Path-Covering Problems. ESA Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu
2024	B	`conf`	Accelerating ILP Solvers for Minimum Flow Decompositions Through Search Space and Dimensionality Reductions. SEA Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco, Romeo Rizzi, Alexandru I. Tomescu
2024	J	`jnl`	Accurate Flow Decomposition via Robust Integer Linear Programming. IEEE ACM Trans. Comput. Biol. Bioinform. Fernando H. C. Dias, Alexandru I. Tomescu
2024	C	`conf`	Applying the Safe-And-Complete Framework to Practical Genome Assembly. WABI Sebastian S. Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I. Tomescu
2024	J	`jnl`	Genome Assembly, from Practice to Theory: Safe, Complete and ACM Trans. Algorithms Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2024	J	`jnl`	Parameterised Approximation and Complexity of Minimum Flow Decompositions. CoRR Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey, Alexandru I. Tomescu
2024	B	`conf`	Practical Minimum Path Cover. SEA Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2024	J	`jnl`	Safe Paths and Sequences for Scalable ILPs in RNA Transcript Assembly Problems. CoRR Francisco Sena, Alexandru I. Tomescu
2024	J	`jnl`	Simplicity in Eulerian circuits: Uniqueness and safety. Inf. Process. Lett. Nidia Obscura Acosta, Alexandru I. Tomescu
2024	J	`jnl`	Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2024	J	`jnl`	cloudrna SP Ades : isoform assembly using bulk barcoded RNA sequencing data. Bioinform. Dmitry Meleshko, Andrey D. Prjbelski, Mikhail Raiko, Alexandru I. Tomescu, Hagen U. Tilgner, Iman Hajirasouliha
2023	J	`jnl`	A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	J	`jnl`	A safety framework for flow decomposition problems via integer linear programming. Bioinform. Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	J	`jnl`	Algorithms and Complexity on Indexing Founder Graphs. Algorithmica Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2023	J	`jnl`	Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. Bioinform. Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu
2023	A	`conf`	Cut Paths and Their Remainder Structure, with Applications. STACS Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2023	J	`jnl`	Flow Decomposition With Subpath Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. Lucia Williams, Alexandru I. Tomescu, Brendan Mumey
2023	—	`book`	Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing (2nd edition). Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu
2023	J	`jnl`	Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theor. Comput. Sci. Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2023	J	`jnl`	Minimum Path Cover: The Power of Parameterization. CoRR Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2023	J	`jnl`	On the Complexity of String Matching for Graphs. ACM Trans. Algorithms Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi
2022	J	`jnl`	Cut paths and their remainder structure, with applications. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2022	J	`jnl`	Efficient Minimum Flow Decomposition via Integer Linear Programming. J. Comput. Biol. Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	B	`conf`	Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. RECOMB Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	J	`jnl`	Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming. CoRR Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2022	J	`jnl`	Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	A	`conf`	Optimizing Safe Flow Decompositions in DAGs. ESA Shahbaz Khan, Alexandru I. Tomescu
2022	B	`conf`	Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
2022	J	`jnl`	Safety in s-t Paths, Trails and Walks. Algorithmica Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2022	J	`jnl`	Simplicity in Eulerian Circuits: Uniqueness and Safety. CoRR Nidia Obscura Acosta, Alexandru I. Tomescu
2022	J	`jnl`	Solving String Problems on Graphs Using the Labeled Direct Product. Algorithmica Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti
2022	A*	`conf`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	A	`conf`	Width Helps and Hinders Splitting Flows. ESA Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2022	J	`jnl`	Width Helps and Hinders Splitting Flows. CoRR Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2021	B	`conf`	A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	J	`jnl`	A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2021	B	`conf`	Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021	J	`jnl`	Algorithms and Complexity on Indexing Founder Graphs. CoRR Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021	C	`conf`	Flow Decomposition with Subpath Constraints. WABI Lucia Williams, Alexandru I. Tomescu, Brendan Mumey
2021	A*	`conf`	Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ICALP Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2021	B	`conf`	Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. SOFSEM Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2021	J	`jnl`	Safety of Flow Decompositions in DAGs. CoRR Shahbaz Khan, Alexandru I. Tomescu
2021	J	`jnl`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	J	`jnl`	The Labeled Direct Product Optimally Solves String Problems on Graphs. CoRR Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti
2020	J	`jnl`	Computing all s-t bridges and articulation points simplified. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020	J	`jnl`	Conditional Indexing Lower Bounds Through Self-Reducibility. CoRR Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
2020	J	`jnl`	From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph. CoRR Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli
2020	J	`jnl`	Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020	C	`conf`	Linear Time Construction of Indexable Founder Block Graphs. WABI Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2020	J	`jnl`	Linear Time Construction of Indexable Founder Block Graphs. CoRR Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2020	J	`jnl`	On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2020	J	`jnl`	Safety in s-t Paths, Trails and Walks. CoRR Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2019	J	`jnl`	An Optimal ACM Trans. Algorithms Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
2019	J	`jnl`	Faster FPTASes for counting and random generation of Knapsack solutions. Inf. Comput. Romeo Rizzi, Alexandru I. Tomescu
2019	J	`jnl`	Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela
2019	J	`jnl`	MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu
2019	J	`jnl`	On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen
2019	A*	`conf`	On the Complexity of String Matching for Graphs. ICALP Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu
2019	B	`conf`	Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. CPM Niko Kiirala, Leena Salmela, Alexandru I. Tomescu
2019	J	`jnl`	Safely Filling Gaps with Partial Solutions Common to All Solutions. IEEE ACM Trans. Comput. Biol. Bioinform. Leena Salmela, Alexandru I. Tomescu
2019	J	`jnl`	Sparse Dynamic Programming on DAGs with Small Width. ACM Trans. Algorithms Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi
2018	J	`jnl`	A safe and complete algorithm for metagenomic assembly. Algorithms Mol. Biol. Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu
2018	J	`jnl`	Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2018	J	`jnl`	Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2018	B	`conf`	Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. RECOMB Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen
2017	J	`jnl`	Interval scheduling maximizing minimum coverage. Discret. Appl. Math. Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach
2017	—	`book`	On Sets and Graphs: Perspectives on Logic and Combinatorics Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
2017	B	`conf`	Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
2017	J	`jnl`	Safe and Complete Contig Assembly Through Omnitigs. J. Comput. Biol. Alexandru I. Tomescu, Paul Medvedev
2017	J	`jnl`	Set-syllogistics meet combinatorics. Math. Struct. Comput. Sci. Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
2017	J	`jnl`	Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover. CoRR Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen
2017	B	`conf`	The Minimum Conflict-Free Row Split Problem Revisited. WG Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2017	J	`jnl`	The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2016	J	`jnl`	Gap Filling as Exact Path Length Problem. J. Comput. Biol. Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu
2016	J	`jnl`	Graph operations on parity games and polynomial-time algorithms. Theor. Comput. Sci. Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu
2016	B	`conf`	MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows. RECOMB Ahmed Sobih, Alexandru I. Tomescu, Veli Mäkinen
2016	—	`conf`	On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. BIOINFORMATICS Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu
2016	B	`conf`	Safe and Complete Contig Assembly Via Omnitigs. RECOMB Alexandru I. Tomescu, Paul Medvedev
2016	J	`jnl`	Safe and complete contig assembly via omnitigs. CoRR Alexandru I. Tomescu, Paul Medvedev
2015	J	`jnl`	Enumeration of the adjunctive hierarchy of hereditarily finite sets. J. Log. Comput. Giorgio Audrito, Alexandru I. Tomescu, Stephan G. Wagner
2015	J	`jnl`	Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen
2015	C	`conf`	Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015	J	`jnl`	Finding a perfect phylogeny from mixed tumor samples. CoRR Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015	B	`conf`	Gap Filling as Exact Path Length Problem. RECOMB Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu
2015	—	`book`	Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing. Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu
2015	J	`jnl`	Interval scheduling maximizing minimum coverage. CoRR Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela
2015	J	`jnl`	Mapping Sets and Hypersets into Numbers. Fundam. Informaticae Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
2015	J	`jnl`	SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP. Bioinform. Karen E. van Rens, Veli Mäkinen, Alexandru I. Tomescu
2015	J	`jnl`	Set Graphs. V. On representing graphs as membership digraphs. J. Log. Comput. Eugenio G. Omodeo, Alexandru I. Tomescu
2014	A	`conf`	Faster FPTASes for Counting and Random Generation of Knapsack Solutions. ESA Romeo Rizzi, Alexandru I. Tomescu
2014	—	`conf`	Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu
2014	J	`jnl`	Motif matching using gapped patterns. Theor. Comput. Sci. Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2014	J	`jnl`	On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. BMC Bioinform. Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen
2014	J	`jnl`	Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets. J. Autom. Reason. Eugenio G. Omodeo, Alexandru I. Tomescu
2014	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2014	J	`jnl`	Set graphs. IV. Further connections with claw-freeness. Discret. Appl. Math. Martin Milanic, Alexandru I. Tomescu
2014	—	`conf`	The Representation of Boolean Algebras in the Spotlight of a Proof Checker. CILC Rodica Ceterchi, Eugenio G. Omodeo, Alexandru I. Tomescu
2013	C	`conf`	A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. WABI Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	J	`jnl`	A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. CoRR Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	—	`conf`	A Proof-checking Experiment on Representing Graphs as Membership Digraphs. CILC Pierpaolo Calligaris, Eugenio G. Omodeo, Alexandru I. Tomescu
2013	J	`jnl`	A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinform. Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen
2013	J	`jnl`	Enumeration of the adjunctive hierarchy of hereditarily finite sets. CoRR Giorgio Audrito, Alexandru I. Tomescu
2013	J	`jnl`	Floating-point arithmetic for approximate counting and random generation problems. CoRR Romeo Rizzi, Alexandru I. Tomescu
2013	J	`jnl`	Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs CoRR Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013	C	`conf`	Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu
2013	J	`jnl`	Markov chain algorithms for generating sets uniformly at random. Ars Math. Contemp. Alberto Policriti, Alexandru I. Tomescu
2013	J	`jnl`	Motif matching using gapped patterns. CoRR Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2013	J	`jnl`	Ranking, unranking and random generation of extensional acyclic digraphs. Inf. Process. Lett. Romeo Rizzi, Alexandru I. Tomescu
2013	J	`jnl`	Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discret. Appl. Math. Martin Milanic, Alexandru I. Tomescu
2013	J	`jnl`	Well-quasi-ordering hereditarily finite sets. Int. J. Comput. Math. Alberto Policriti, Alexandru I. Tomescu
2012	J	`jnl`	A randomized Numerical Aligner (rNA). J. Comput. Syst. Sci. Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi
2012	J	`jnl`	A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs. Discret. Math. Alexandru I. Tomescu
2012	J	`jnl`	Graph Operations on Parity Games and Polynomial-Time Algorithms CoRR Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu
2012	J	`jnl`	Infinity, in short. J. Log. Comput. Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
2012	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems CoRR Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2012	J	`jnl`	rNA: a fast and accurate short reads numerical aligner. Bioinform. Francesco Vezzi, Cristian Del Fabbro, Alexandru I. Tomescu, Alberto Policriti
2011	J	`jnl`	Counting extensional acyclic digraphs. Inf. Process. Lett. Alberto Policriti, Alexandru I. Tomescu
2011	C	`conf`	Well-Quasi-Ordering Hereditarily Finite Sets. LATA Alberto Policriti, Alexandru I. Tomescu
2010	C	`conf`	A Randomized Numerical Aligner (rNA). LATA Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi
2010	J	`jnl`	On cycles through two arcs in strong multipartite tournaments CoRR Alexandru I. Tomescu