The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- 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)
- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data (Q3082959) (← links)
- Two-Bounded-Space Bin Packing Revisited (Q3092235) (← links)
- (Q3103294) (← links)
- How Cinderella Won the Bucket Game (and Lived Happily Ever After) (Q3103443) (← links)
- The Cinderella Game on Holes and Anti-holes (Q3104766) (← links)
- Charlemagne's Challenge: The Periodic Latency Problem (Q3109870) (← links)
- Analysis of multi-stage open shop processing systems (Q3113713) (← links)
- The Traveling Salesman Problem under squared Euclidean distances (Q3113753) (← links)
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width (Q3133204) (← links)
- Drawing Graphs in the Plane with High Resolution (Q3142593) (← links)
- (Q3152807) (← links)
- Reachability and Deadlocking Problems in Multi-stage Scheduling (Q3172872) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- A Study on the Computational Complexity of the Bilevel Knapsack Problem (Q3192105) (← links)
- The Open Shop Scheduling Problem (Q3304098) (← links)
- Geometric clusterings (Q3361924) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- (Q3396593) (← links)
- (Q3396599) (← links)
- (Q3396609) (← links)
- (Q3396641) (← links)
- A NOTE ON FAIR DIVISION UNDER INTERVAL UNCERTAINTY (Q3427044) (← links)
- Quadratic Programming and Combinatorial Minimum Weight Product Problems (Q3434541) (← links)
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) (← links)
- Backbone colorings for graphs: Tree and path backbones (Q3445508) (← links)
- The geometric maximum traveling salesman problem (Q3452505) (← links)
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← links)
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648) (← links)
- The Alcuin Number of a Graph (Q3541095) (← links)
- Between a Rock and a Hard Place: The Two-to-One Assignment Problem (Q3558923) (← links)
- Four point conditions and exponential neighborhoods for symmetric TSP (Q3581546) (← links)
- Caching Is Hard – Even in the Fault Model (Q3586462) (← links)
- The computational complexity of graph contractions II: Two tough polynomially solvable cases (Q3632967) (← links)
- Fully Decomposable Split Graphs (Q3651538) (← links)
- (Q3840359) (← links)
- (Q3840371) (← links)
- (Q3971282) (← links)
- (Q3989473) (← links)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling (Q4032943) (← links)
