The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- (Q4936534) (← links)
- (Q4944178) (← links)
- (Q4952618) (← links)
- Getting the best response for your erg (Q4962743) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- Fine-grained Complexity Analysis of Two Classic TSP Variants (Q5028342) (← links)
- Continuous Facility Location on Graphs (Q5041743) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- Minimum cost dynamic flows: The series-parallel case (Q5101426) (← 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)
- The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases (Q5200499) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311097) (← links)
- Parameterized and Exact Computation (Q5311520) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313019) (← links)
- Algorithm Theory - SWAT 2004 (Q5315386) (← links)
- Discrete Geometry for Computer Imagery (Q5316521) (← links)
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (Q5363760) (← links)
- Nothing New about Equiangular Polygons (Q5404044) (← links)
- Realizing Small Tournaments Through Few Permutations (Q5414486) (← links)
- (Q5417626) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431312) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
- Graph Coloring with Rejection (Q5449542) (← links)
- Algorithms – ESA 2005 (Q5475840) (← links)
- Disjoint Pairs with Distinct Sums (Q5478272) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)
- (Q5501827) (← links)
- (Q5702307) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710800) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710806) (← links)
- Integer Programming and Combinatorial Optimization (Q5712462) (← links)
- A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← links)
- An Algorithmic Study of Switch Graphs (Q5851108) (← links)
- The Alcuin number of a graph and its connections to the vertex cover number (Q5891491) (← links)
- The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number (Q5892563) (← links)
- Algorithms - ESA 2003 (Q5897268) (← links)
- Algorithms - ESA 2003 (Q5897274) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)
- Timetabling problems at the TU Eindhoven (Q5899383) (← links)
- LATIN 2004: Theoretical Informatics (Q5901640) (← links)
- Timetabling problems at the TU Eindhoven (Q5902305) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902516) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902532) (← links)
- The subset sum game revisited (Q5918124) (← links)
- The subset sum game revisited (Q5918370) (← links)
