The following pages link to Rainer Schrader (Q751494):
Displaying 50 items.
- (Q129075) (redirect page) (← links)
- (Q496431) (redirect page) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- Greedoids (Q810029) (← links)
- Coloring in sublinear time (Q826110) (← links)
- Semi-preemptive routing on a linear and circular track (Q834179) (← links)
- Distance-hereditary digraphs (Q972365) (← links)
- Semi-preemptive routing on trees (Q1003476) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- Setup optimization problems with matroid structure (Q1092934) (← links)
- On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
- Monge sequences and a simple assignment algorithm (Q1104243) (← links)
- A characterization of minimal valid inequalities for mixed integer programs (Q1165157) (← links)
- A greedy reduction algorithm for setup optimization (Q1183348) (← links)
- The communication complexity of interval orders (Q1201817) (← links)
- Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
- The setup polyhedron of series-parallel posets (Q1372744) (← links)
- Modeling and solving an airline schedule generation problem (Q1599336) (← links)
- Modeling feedback loops in the H-NS-mediated regulation of the \textit{Escherichia coli bgl} operon (Q1788356) (← links)
- Minor characterization of undirected branching greedoids -- a short proof (Q1813731) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- On the separability of graphs (Q1942674) (← links)
- The setup polytope of \(N\)-sparse posets (Q1960314) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
- A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs (Q2181233) (← links)
- A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
- The permutahedron of \(N\)-sparse posets (Q2365343) (← links)
- On the existence of a local Hamiltonian in the Galilean invariant Lee Model (Q2528654) (← links)
- (Q2722656) (← links)
- A Note on the Finite Time Behavior of Simulated Annealing (Q2757648) (← links)
- (Q2816015) (← links)
- (Q3048588) (← links)
- (Q3309451) (← links)
- (Q3320130) (← links)
- (Q3337214) (← links)
- (Q3671758) (← links)
- Algorithmic Approaches to Setup Minimization (Q3694689) (← links)
- (Q3731619) (← links)
- (Q3753826) (← links)
- Searching in Trees, Series-Parallel and Interval Orders (Q3756532) (← links)
- (Q3798158) (← links)
- (Q3883902) (← links)
- Minimal Inequalities and Subadditive Duality (Q3890411) (← links)
- (Q3905057) (← links)
