The following pages link to David Schindl (Q429510):
Displaying 20 items.
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- (Q556850) (redirect page) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints (Q816434) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- A solution method for a car fleet management problem with maintenance constraints (Q1038835) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Optimal student sectioning on mandatory courses with various sections numbers (Q1730755) (← links)
- On some subclasses of split \(B_1\)-EPG graphs (Q2081659) (← links)
- On split \(B_1\)-EPG graphs (Q2294698) (← links)
- A solvable case of image reconstruction in discrete tomography (Q2486067) (← links)
- Some simple optimization techniques for self-organized public key management in mobile ad hoc networks (Q2495903) (← links)
- On the maximum orders of an induced forest, an induced tree, and a stable set (Q2975433) (← links)
- Ant Local Search and its efficient adaptation to graph colouring (Q3582660) (← links)
- Average distance and maximum induced forest (Q3605159) (← links)
- A learning tabu search for a truck allocation problem with linear and nonlinear cost components (Q4632880) (← links)
- Solution Methods for Fuel Supply of Trains (Q6160380) (← links)
- Locally checkable problems parameterized by clique-width (Q6392934) (← links)
- Finding $k$-community structures in special graph classes (Q6403538) (← links)