Alexandru I. Tomescu
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
12
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Maximum Coverage k-Antichains and Chains: A Greedy Approach. | Manuel Cceres, Andreas Grigorjew, Wanchote Po Jiamjitrak, Alexandru I. Tomescu |
| 2025 | ESA | Safe Sequences via Dominators in DAGs for Path-Covering Problems. | Francisco Sena, Romeo Rizzi, Alexandru I. Tomescu |
| 2024 | WABI | Applying the Safe-And-Complete Framework to Practical Genome Assembly. | Sebastian S. Schmidt, Santeri Toivonen, Paul Medvedev, Alexandru I. Tomescu |
| 2023 | STACS | Cut Paths and Their Remainder Structure, with Applications. | Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli |
| 2022 | ESA | Optimizing Safe Flow Decompositions in DAGs. | Shahbaz Khan, Alexandru I. Tomescu |
| 2022 | ESA | Width Helps and Hinders Splitting Flows. | Manuel Cceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams |
| 2022 | RECOMB | Fast, Flexible, and Exact Minimum Flow Decompositions via ILP. | Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu |
| 2022 | RECOMB | Safety and Completeness in Flow Decompositions for RNA Assembly. | Shahbaz Khan, Milla Kortelainen, Manuel Cceres, Lucia Williams, Alexandru I. Tomescu |
| 2022 | SODA | Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. | Manuel Cceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu |
| 2021 | ICALP | Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. | Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli |
| 2021 | ISAAC | Algorithms and Complexity on Indexing Elastic Founder Graphs. | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mkinen |
| 2021 | SOFSEM | Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. | Massimo Equi, Veli Mkinen, Alexandru I. Tomescu |
| 2021 | WABI | Flow Decomposition with Subpath Constraints. | Lucia Williams, Alexandru I. Tomescu, Brendan Mumey |
| 2021 | WG | A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. | Manuel Cceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu |
| 2020 | WABI | Linear Time Construction of Indexable Founder Block Graphs. | Veli Mkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu |
| 2019 | CPM | Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. | Niko Kiirala, Leena Salmela, Alexandru I. Tomescu |
| 2019 | ICALP | On the Complexity of String Matching for Graphs. | Massimo Equi, Roberto Grossi, Veli Mkinen, Alexandru I. Tomescu |
| 2018 | RECOMB | Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. | Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mkinen |
| 2017 | CPM | Optimal Omnitig Listing for Safe and Complete Contig Assembly. | Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu |
| 2017 | WG | The Minimum Conflict-Free Row Split Problem Revisited. | Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu |
| 2016 | RECOMB | MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows. | Ahmed Sobih, Alexandru I. Tomescu, Veli Mkinen |
| 2016 | RECOMB | Safe and Complete Contig Assembly Via Omnitigs. | Alexandru I. Tomescu, Paul Medvedev |
| 2015 | RECOMB | Gap Filling as Exact Path Length Problem. | Leena Salmela, Kristoffer Sahlin, Veli Mkinen, Alexandru I. Tomescu |
| 2015 | WABI | Finding a Perfect Phylogeny from Mixed Tumor Samples. | Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu |
| 2014 | ESA | Faster FPTASes for Counting and Random Generation of Knapsack Solutions. | Romeo Rizzi, Alexandru I. Tomescu |
| 2013 | SPIRE | Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. | Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Liptk, Romeo Rizzi, Alexandru I. Tomescu |
| 2013 | WABI | A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. | Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mkinen |
| 2011 | LATA | Well-Quasi-Ordering Hereditarily Finite Sets. | Alberto Policriti, Alexandru I. Tomescu |
| 2010 | LATA | A Randomized Numerical Aligner (rNA). | Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi |