The following pages link to Alexandru I. Tomescu (Q400529):
Displaying 50 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)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Safety and completeness in flow decompositions for RNA assembly (Q2170145) (← links)
- Fast, flexible, and exact minimum flow decompositions via ILP (Q2170151) (← links)
- A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
- Unicyclic and bicyclic graphs having minimum degree distance (Q2462359) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Gap Filling as Exact Path Length Problem (Q2814587) (← links)
- Safe and Complete Contig Assembly Via Omnitigs (Q2814598) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Faster FPTASes for Counting and Random Generation of Knapsack Solutions (Q2921460) (← links)
- Markov chain algorithms for generating sets uniformly at random (Q2925425) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- (Q3002402) (← links)
- Well-Quasi-Ordering Hereditarily Finite Sets (Q3004603) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- (Q3172128) (← links)
- Mapping Sets and Hypersets into Numbers (Q3187011) (← links)
- A Randomized Numerical Aligner (rNA) (Q3564890) (← links)
- (Q3601854) (← links)
- (Q3645586) (← links)
- Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem (Q4554347) (← links)
- (Q4902266) (← links)
- Infinity, in short (Q4902312) (← links)
- Sparse Dynamic Programming on DAGs with Small Width (Q4972674) (← links)
- An Optimal <i>O</i> ( <i>nm</i> ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph (Q4973044) (← links)
- (Q5087784) (← 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)
- Finding a Perfect Phylogeny from Mixed Tumor Samples (Q5283823) (← links)
- On Sets and Graphs (Q5360855) (← links)
- Simulating the Bitonic Sort Using P Systems (Q5452056) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
- Simplicity in Eulerian circuits: uniqueness and safety (Q6072204) (← links)
