The following pages link to Problem-solving through problems (Q585180):
Displaying 27 items.
- Connecting colored point sets (Q868381) (← links)
- Simple-motion pursuit-evasion differential games. II: Optimal evasion from proportional navigation guidance in the deterministic and stochastic cases (Q1068735) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- On the lattice of specifications: Applications to a specification methodology (Q1205187) (← links)
- Intersection number of two connected geometric graphs (Q1350920) (← links)
- Problem-solving strategies (Q1378149) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- Formulating patterns in problem solving (Q1924764) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Matching points with disks with a common intersection (Q2421852) (← links)
- Encompassing colored planar straight line graphs (Q2456662) (← links)
- On maximum-sum matchings of points (Q2679241) (← links)
- Monochromatic geometric \(k\)-factors in red-blue sets with white and Steiner points (Q2851455) (← links)
- A mathematical orchard. Problems and solutions (Q2903452) (← links)
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane (Q2945669) (← links)
- (Q3126360) (← links)
- From ‘tricks’ to strategies for problem solving† (Q3199682) (← links)
- (Q4387776) (← links)
- Only Isotetrahedra Can Be Stampers (Q4622970) (← links)
- (Q4790613) (← links)
- Problem Solving in a Dynamic Environment (Q4836105) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
- Elementary Proofs of the Trigonometric Inequalities of Huygens, Cusa, and Wilker (Q5137093) (← links)
- (Q5485723) (← links)
- (Q5868571) (← links)
- Matching random colored points with rectangles (Q5925699) (← links)
