David Orden

From MaRDI portal
Revision as of 12:23, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:510535

Available identifiers

zbMath Open orden.davidDBLP48/2358WikidataQ57638106 ScholiaQ57638106MaRDI QIDQ510535

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61877922024-01-15Paper
On approximating shortest paths in weighted triangular tessellations2023-06-27Paper
On polynomials associated to Voronoi diagrams of point sets and crossing numbers2023-04-24Paper
Separating bichromatic point sets in the plane by restricted orientation convex hulls2023-04-03Paper
On approximating shortest paths in weighted triangular tessellations2022-07-13Paper
Analysis of self-equilibrated networks through cellular modelling2021-10-29Paper
Optimizing generalized kernels of polygons2021-08-17Paper
Rainbow polygons for colored point sets in the plane2021-06-14Paper
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations2021-04-28Paper
Shortest watchman tours in simple polygons under rotated monotone visibility2021-04-21Paper
Maximum Rectilinear Convex Subsets2021-02-08Paper
Cellular morphogenesis of three-dimensional tensegrity structures2020-04-09Paper
Generation of planar tensegrity structures through cellular multiplication2020-03-27Paper
Maximum rectilinear convex subsets2020-01-30Paper
Capturing points with a rotating polygon (and a 3D extension)2019-06-27Paper
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction2019-06-06Paper
$K_{1,3}$-covering red and blue points in the plane2019-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46338372019-05-06Paper
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets2018-12-06Paper
Spectrum graph coloring and applications to Wi-Fi channel assignment2018-08-13Paper
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization2018-06-12Paper
On the \(\mathcal{O}_\beta\)-hull of a planar point set2018-02-19Paper
Planar minimally rigid graphs and pseudo-triangulations2017-09-29Paper
Bounds on spectrum graph coloring2017-02-13Paper
FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR2015-04-22Paper
On the Fiedler value of large planar graphs2014-02-19Paper
Flip graphs of bounded degree triangulations2014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q53967412014-02-03Paper
https://portal.mardi4nfdi.de/entity/Q28573282013-11-01Paper
Flip Graphs of Bounded-Degree Triangulations2013-10-10Paper
Bijections for Baxter families and related objects2011-04-11Paper
Decomposition of multiple coverings into more parts2010-11-08Paper
The number of generalized balanced lines2010-11-08Paper
New results on lower bounds for the number of \((\leq k)\)-facets2009-11-30Paper
https://portal.mardi4nfdi.de/entity/Q36258342009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36258742009-05-22Paper
Balanced lines in two-coloured point sets2009-05-20Paper
New results on lower bounds for the number of (⩽ k)-facets2008-06-05Paper
On the number of pseudo-triangulations of certain point sets2008-03-06Paper
New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)2007-10-11Paper
Assymptotically efficient triangulations of the d-cube∗2007-05-29Paper
From graphs to tensegrity structures: geometric and symbolic approaches2007-04-05Paper
Combinatorial pseudo-triangulations2007-02-13Paper
Planar minimally rigid graphs and pseudo-triangulations2005-05-04Paper
The polytope of non-crossing graphs on a planar point set2005-04-15Paper
The polytope of non-crossing graphs on a planar point set2005-03-14Paper
Non-crossing frameworks with non-crossing reciprocals2005-02-23Paper
Asymptotically efficient triangulations of the \(d\)-cube2004-02-05Paper
Comparison of Box-Tiao and Johansen canonical estimators of cointegrating vectors in VEC(1) models1995-11-28Paper
Rainbow ortho-convex 4-sets in k-colored point setsN/APaper

Research outcomes over time

This page was built for person: David Orden