The following pages link to Alexandru I. Tomescu (Q400529):
Displaying 22 items.
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs (Q442331) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- The minimum conflict-free row split problem revisited (Q1687927) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations (Q1941395) (← links)
- Ranking, unranking and random generation of extensional acyclic digraphs (Q1941716) (← links)
- Counting extensional acyclic digraphs (Q1944136) (← links)
- Infinity, in short (Q4902312) (← links)
- (Q5088896) (← links)
- (Q5091210) (← links)
- Optimal Omnitig Listing for Safe and Complete Contig Assembly (Q5110895) (← links)
- Set Graphs. V. On representing graphs as membership digraphs (Q5262489) (← links)
- Simplicity in Eulerian circuits: uniqueness and safety (Q6072204) (← links)
- 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)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
