The following pages link to Thomas Lengauer (Q458838):
Displaying 46 items.
- (Q79538) (redirect page) (← links)
- Hierarchical Bayes model for predicting effectiveness of HIV combination therapies (Q458839) (← links)
- The binary network flow problem is logspace complete for P (Q914388) (← links)
- (Q1089721) (redirect page) (← links)
- Efficient solutions of hierarchical systems of linear equations (Q1089723) (← links)
- The space complexity of pebble games on trees (Q1147515) (← links)
- Black-white pebbles and graph separation (Q1149765) (← links)
- (Q1185243) (redirect page) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- Parallel `go with the winners' algorithms in distributed memory models. (Q1414736) (← links)
- A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Provably Good Global Routing of Integrated Circuits (Q2706313) (← links)
- (Q2753918) (← links)
- (Q3140427) (← links)
- (Q3315011) (← links)
- (Q3321485) (← links)
- On the solution of inequality systems relevant to IC-layout (Q3683536) (← links)
- (Q3683537) (← links)
- (Q3684044) (← links)
- (Q3727874) (← links)
- (Q3730016) (← links)
- (Q3745297) (← links)
- (Q3759947) (← links)
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs (Q3771606) (← links)
- Linear arrangement problems on recursively partitioned graphs (Q3778551) (← links)
- (Q3795251) (← links)
- Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs (Q3826621) (← links)
- (Q3830538) (← links)
- A fast algorithm for finding dominators in a flowgraph (Q3896499) (← links)
- The Pebbling Problem is Complete in Polynomial Space (Q3906416) (← links)
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561) (← links)
- Asymptotically tight bounds on time-space trade-offs in a pebble game (Q3959426) (← links)
- (Q3997942) (← links)
- (Q4036574) (← links)
- (Q4037418) (← links)
- (Q4385521) (← links)
- (Q4450463) (← links)
- (Q4542535) (← links)
- Hierarchical planarity testing algorithms (Q4710683) (← links)
- (Q4718222) (← links)
- Efficient decision procedures for graph properties on context-free graph languages (Q5286167) (← links)
- Computing phylogenetic trees using topologically related minimum spanning trees (Q5371034) (← links)
- Model Selection for Mixtures of Mutagenetic Trees (Q5442998) (← links)
- Calculating the Statistical Significance of Changes in Pathway Activity From Gene Expression Data (Q5700455) (← links)
