The following pages link to Ron Shamir (Q214970):
Displaying 50 items.
- (Q81345) (redirect page) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
- Increasing the power of association studies by imputation-based sparse tag SNP selection (Q964236) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- (Q1293875) (redirect page) (← links)
- Bounded degree interval sandwich problems (Q1293876) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- On the complexity of DNA physical mapping (Q1338883) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- A clustering algorithm based on graph connectivity (Q1607070) (← links)
- Copy-number evolution problems: complexity and algorithms (Q1708426) (← links)
- Cluster graph modification problems (Q1885821) (← links)
- A note on tolerance graph recognition (Q1887065) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- (Q2723947) (← links)
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs (Q2784453) (← links)
- Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification, and Population Stratification (Q2890437) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- (Q3024800) (← links)
- (Q3046495) (← links)
- On the Generality of Phylogenies from Incomplete Directed Characters (Q3046511) (← links)
- (Q3138912) (← links)
- The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
- A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- (Q4035172) (← links)
- (Q4250206) (← links)
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (Q4268849) (← links)
- Complexity and algorithms for reasoning about time (Q4285633) (← links)
- Realizing Interval Graphs with Size and Distance Constraints (Q4377452) (← links)
- (Q4414513) (← links)
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (Q4507385) (← links)
- (Q4542518) (← links)
- Incomplete Directed Perfect Phylogeny (Q4651483) (← links)
- A Chemical-Distance-Based Test for Positive Darwinian Selection (Q4801147) (← links)
- Graph Sandwich Problems (Q4857542) (← links)
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques (Q4887017) (← links)
- Faster Subtree Isomorphism (Q4935309) (← links)
