The following pages link to Alexandru I. Tomescu (Q400529):
Displaying 11 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- (Q6147517) (← links)
- Flow Decomposition with Subpath Constraints (Q6175893) (← links)
- A Safety Framework for Flow Decomposition Problems via Integer Linear Programming (Q6424903) (← links)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
- Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time (Q6575090) (← links)
- Cut paths and their remainder structure, with applications (Q6615119) (← links)
- Human genomes for GGCAT benchmarks - part 1 (Q6706969) (← links)
- Human genomes for GGCAT benchmarks - part 2 (Q6706971) (← links)
- IsoQuant graphs from PacBio and ONT Mouse sequencing data (Q6706983) (← links)