The following pages link to Mark J. Keil (Q1116693):
Displayed 10 items.
- Polynomial algorithms for restricted Euclidean p-centre problems (Q1116694) (← links)
- (Q1193844) (redirect page) (← links)
- On covering orthogonal polygons with star-shaped polygons (Q1193845) (← links)
- Predicting information technology project escalation: A neural network approach (Q1869516) (← links)
- Construal level theory and escalation of commitment (Q2046162) (← links)
- Spanners in graphs of bounded degree (Q4303628) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5919310) (← links)