The following pages link to D. S. Franzblau (Q944710):
Displaying 10 items.
- An algorithm for the difference between set covers (Q944712) (← links)
- Construction of Hamiltonian cycles in layered cubic planar graphs (Q1606028) (← links)
- Ear decomposition with bounds on ear length (Q1606950) (← links)
- Generic rigidity of molecular graphs via ear decomposition (Q1975368) (← links)
- An algorithm for covering polygons with rectangles (Q3719852) (← links)
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles (Q3826568) (← links)
- A bijective proof of the hook-length formula (Q3964024) (← links)
- Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity (Q4847363) (← links)
- The Mystery of the Linked Triangles (Q4886414) (← links)
