The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- The Northwest corner rule revisited (Q2275935) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- Well-solvable instances for the partition problem (Q2371107) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- The one-dimensional Euclidean domain: finitely many obstructions are not enough (Q2397665) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- Analysis of multi-stage open shop processing systems (Q2434986) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- A characterization of the single-crossing domain (Q2453407) (← links)
- An approximation scheme for cake division with a linear number of cuts (Q2460623) (← links)
- Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- Complexity of the job insertion problem in multi-stage scheduling (Q2467449) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Angle-restricted tours in the plane. (Q2482907) (← links)
- Combinatorial approximation algorithms: a comparative review (Q2488226) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (Q2498403) (← links)
- Sports tournaments, home-away assignments, and the break minimization problem (Q2506823) (← links)
- Banks winners in tournaments are difficult to recognize (Q2568818) (← links)
- On the dimension of simple monotonic games (Q2572841) (← links)
- Decomposition of integer matrices and multileaf collimator sequencing (Q2576339) (← links)
- A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
- Scheduling with step-improving processing times (Q2583705) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- Roll cutting in the curtain industry, or: a well-solvable allocation problem (Q2643970) (← links)
- A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- (Q2714402) (← links)
- (Q2721975) (← links)
- (Q2753942) (← links)
- (Q2754152) (← links)
- The Travelling Salesman and the PQ-Tree (Q2757553) (← links)
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines (Q2757623) (← links)
- (Q2768378) (← links)
- (Q2770587) (← links)
- The Stock Size Problem (Q2781118) (← links)
- A PTAS for minimizing the weighted sum of job completion times on parallel machines (Q2819573) (← links)
- How to Put through Your Agenda in Collective Binary Decisions (Q2868543) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502) (← links)
