The following pages link to Ion I. Măndoiu (Q1607059):
Displaying 16 items.
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Improved approximation algorithms for the quality of service multicast tree problem (Q2484000) (← links)
- Optimum extensions of prefix codes. (Q2583535) (← links)
- (Q2768326) (← links)
- Practical Approximation Algorithms for Zero- and Bounded-Skew Trees (Q2784505) (← links)
- Optimal Testing of Digital Microfluidic Biochips (Q2899144) (← links)
- EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH (Q3503104) (← links)
- High-Throughput SNP Genotyping by SBE/SBH (Q3545127) (← links)
- (Q4034165) (← links)
- On a theorem of gács (Q4285648) (← links)
- (Q4410160) (← links)
- (Q4778566) (← links)
- Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays (Q5449963) (← links)
- Computational Science – ICCS 2005 (Q5709422) (← links)
- Combinatorial Pattern Matching (Q5713562) (← links)
- Algorithms and Data Structures (Q5900771) (← links)
