The following pages link to David Orden (Q510535):
Displaying 47 items.
- Bounds on spectrum graph coloring (Q510538) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- The number of generalized balanced lines (Q603873) (← links)
- Combinatorial pseudo-triangulations (Q864146) (← links)
- From graphs to tensegrity structures: geometric and symbolic approaches (Q874401) (← links)
- New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
- Comparison of Box-Tiao and Johansen canonical estimators of cointegrating vectors in VEC(1) models (Q1341187) (← links)
- Asymptotically efficient triangulations of the \(d\)-cube (Q1422223) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- Non-crossing frameworks with non-crossing reciprocals (Q1764166) (← links)
- The polytope of non-crossing graphs on a planar point set (Q1772132) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Cellular morphogenesis of three-dimensional tensegrity structures (Q1986866) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q2154121) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- Generation of planar tensegrity structures through cellular multiplication (Q2306989) (← links)
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- Bijections for Baxter families and related objects (Q2431261) (← links)
- On the Fiedler value of large planar graphs (Q2435468) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- (Q2857328) (← links)
- Assymptotically efficient triangulations of the d-cube∗ (Q3438984) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- (Q3625834) (← links)
- (Q3625874) (← links)
- New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization (Q4564177) (← links)
- (Q4633837) (← links)
- The polytope of non-crossing graphs on a planar point set (Q4657333) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- Analysis of self-equilibrated networks through cellular modelling (Q5161066) (← links)
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR (Q5247062) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q5361619) (← links)
- $K_{1,3}$-covering red and blue points in the plane (Q5377228) (← links)
- (Q5396741) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q6161478) (← links)
- (Q6187792) (← links)
- Rainbow ortho-convex 4-sets in k-colored point sets (Q6529869) (← links)
