The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- The focus of attention problem (Q262243) (← links)
- Linearizable special cases of the QAP (Q266060) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- Shelf algorithms for on-line strip packing (Q287167) (← links)
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- The interval ordering problem (Q423919) (← links)
- More about subcolorings (Q424720) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- Two hardness results for Gamson's game (Q485436) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- How \(*\)not\(*\) to solve a sudoku (Q614048) (← links)
- Hamiltonian index is NP-complete (Q629366) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- Graph coloring with rejection (Q632809) (← links)
- String execution time for finite languages: max is easy, min is hard (Q642653) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- The Wiener maximum quadratic assignment problem (Q665991) (← links)
- Robust balanced optimization (Q668952) (← links)
- Scheduling with time-dependent execution times (Q673610) (← links)
- Unit-time scheduling problems with time dependent resources (Q678109) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- Reconstructing sets of orthogonal line segments in the plane (Q688265) (← links)
- (Q691402) (redirect page) (← links)
- Complexity and approximation of an area packing problem (Q691403) (← links)
- Caching is hard -- even in the fault model (Q692624) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- The no-wait flow-shop paradox (Q813966) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- Fine-grained complexity analysis of two classic TSP variants (Q4598137) (← links)
- A branch-and-price algorithm for a hierarchical crew scheduling problem (Q4805639) (← links)
- All-norm approximation algorithms (Q4815768) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. (Q5136245) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← links)
- Nothing New about Equiangular Polygons (Q5404044) (← links)
