The following pages link to Maciej Kurowski (Q834905):
Displaying 4 items.
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
- Simple and efficient floor-planning (Q1007584) (← links)
- Oracles for bounded-length shortest paths in planar graphs (Q2944520) (← links)
