The following pages link to Dzmitry Sledneu (Q309058):
Displaying 9 items.
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
