The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- 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)
- Pseudo-hamiltonian graphs (Q2714402) (← links)
- (Q2721975) (← links)
- Preemptive scheduling with rejection. (Extended abstract) (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)
- Assigning chain-like tasks to a chain-like network (Q2768378) (← links)
- The complexity of coloring graphs without long induced paths (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)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Motion planning with pulley, rope, and baskets (Q2904777) (← links)
- Cinderella versus the Wicked Stepmother (Q2915161) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Core Stability in Hedonic Coalition Formation (Q2927636) (← links)
- Balanced Optimization with Vector Costs (Q2971159) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)
- (Q3046488) (← links)
- All-Norm Approximation Algorithms (Q3046503) (← links)
- (Q3074469) (← links)
