The following pages link to Walter A. Kosters (Q1029094):
Displaying 21 items.
- (Q1023433) (redirect page) (← links)
- Solving nonograms by combining relaxations (Q1023434) (← links)
- Tetris and decidability (Q1029095) (← links)
- Expected heights in heaps (Q1195934) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Fourier analysis of genetic algorithms (Q1978370) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- Centrosymmetric solutions to chessboard separation problems (Q2869318) (← links)
- Constructing simple nonograms of varying difficulty (Q2915580) (← links)
- (Q3619292) (← links)
- (Q3676632) (← links)
- (Q3697576) (← links)
- (Q4185272) (← links)
- (Q4436449) (← links)
- (Q4444477) (← links)
- (Q4503830) (← links)
- (Q4790412) (← links)
- (Q4790414) (← links)
- (Q4802581) (← links)
- TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596) (← links)
- Mining frequent itemsets: a perspective from operations research (Q6573277) (← links)
