The following pages link to Ljubomir Perković (Q270005):
Displaying 25 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Bounding the firing synchronization problem on a ring (Q596090) (← links)
- (Q1356778) (redirect page) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- There are plane spanners of degree 4 and moderate stretch factor (Q2349855) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations (Q2912842) (← links)
- Degree four plane spanners: Simpler and better (Q2970474) (← links)
- On Spanners and Lightweight Spanners of Geometric Graphs (Q3068627) (← links)
- Degree Four Plane Spanners: Simpler and Better (Q3132880) (← links)
- Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783) (← links)
- Computing Lightweight Spanners Locally (Q3540243) (← links)
- Plane Spanners of Maximum Degree Six (Q3587366) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- (Q4449224) (← links)
- Inexpensive <i>d</i>‐dimensional matchings (Q4534217) (← links)
- There are Plane Spanners of Maximum Degree 4 (Q4635524) (← links)
- (Q4708588) (← links)
- (Q4910737) (← links)
- (Q4944974) (← links)
- (Q5077646) (← links)
- AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH (Q5249045) (← links)
- The Stretch Factor of Hexagon-Delaunay Triangulations (Q6059983) (← links)
