David Orden

Orcid: 0000-0001-5403-8467

According to our database1, David Orden authored at least 59 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4.
CoRR, 2024

2023
Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring.
Sensors, July, 2023

On approximating shortest paths in weighted triangular tessellations.
Artif. Intell., May, 2023

Separating bichromatic point sets in the plane by restricted orientation convex hulls.
J. Glob. Optim., April, 2023

On polynomials associated to Voronoi diagrams of point sets and crossing numbers.
CoRR, 2023

2021
Maximum Rectilinear Convex Subsets.
SIAM J. Comput., 2021

Optimizing generalized kernels of polygons.
J. Glob. Optim., 2021

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations.
J. Glob. Optim., 2021

Rainbow polygons for colored point sets in the plane.
Discret. Math., 2021

Illuminating the x-Axis by α-Floodlights.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers.
CoRR, 2020

Analysis of self-equilibrated networks through cellular modeling.
CoRR, 2020

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Capturing Points with a Rotating Polygon (and a 3D Extension).
Theory Comput. Syst., 2019

REACT: reactive resilience for critical infrastructures using graph-coloring techniques.
J. Netw. Comput. Appl., 2019

K<sub>1,3</sub>-covering red and blue points in the plane.
Discret. Math. Theor. Comput. Sci., 2019

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction.
Discret. Appl. Math., 2019

Cellular morphogenesis of three-dimensional tensegrity structures.
CoRR, 2019

2018
On the Goodness of Using Orthogonal Channels in WLAN IEEE 802.11 in Realistic Scenarios.
Wirel. Commun. Mob. Comput., 2018

Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment.
Symmetry, 2018

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets.
CoRR, 2018

Testing SensoGraph, a geometric approach for fast sensory evaluation.
CoRR, 2018

Generation of planar tensegrity structures through cellular multiplication.
CoRR, 2018

Generalized kernels of polygons under rotation.
CoRR, 2018

On the 𝒪<sub>β</sub> of a planar point set.
Comput. Geom., 2018

2017
Rectilinear and O-convex hull with minimum area.
CoRR, 2017

$K_{1, 3}$-covering red and blue points in the plane.
CoRR, 2017

Competitive Belief Propagation to Efficiently Solve Complex Multi-agent Negotiations with Network Structure.
Proceedings of the Autonomous Agents and Multiagent Systems, 2017

Multi-Agent Nonlinear Negotiation for Wi-Fi Channel Assignment.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

A Distributed, Multi-Agent Approach to Reactive Network Resilience.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Bounds on spectrum graph coloring.
Electron. Notes Discret. Math., 2016

Spectrum graph coloring and applications to WiFi channel assignment.
CoRR, 2016

TOWER: Topology Optimization for netWork Enhanced Resilience.
Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016), 2016

Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment.
Proceedings of the Conflict Resolution in Decision Making - Second International Workshop, 2016

2015
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks.
Sensors, 2015

On the $O_β$-hull of a planar point set.
CoRR, 2015

Moody Scheduling for Speculative Parallelization.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2014
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geom. Appl., 2014

2012
On the Fiedler value of large planar graphs
CoRR, 2012

2011
Bijections for Baxter families and related objects.
J. Comb. Theory, Ser. A, 2011

On the Fiedler value of large planar graphs (Extended abstract).
Electron. Notes Discret. Math., 2011

2010
Binary Labelings for Plane Quadrangulations and their Relatives.
Discret. Math. Theor. Comput. Sci., 2010

The Number of Generalized Balanced Lines.
Discret. Comput. Geom., 2010

Decomposition of Multiple Coverings into More Parts.
Discret. Comput. Geom., 2010

2009
Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009

New results on lower bounds for the number of (<=k)-facets.
Eur. J. Comb., 2009

2008
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory, Ser. A, 2008

Just-In-Time Scheduling for Loop-based Speculative Parallelization.
Proceedings of the 16th Euromicro International Conference on Parallel, 2008

2007
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization.
IEEE Trans. Computers, 2007

New results on lower bounds for the number of (k)-facets: (extended abstract).
Electron. Notes Discret. Math., 2007

Combinatorial pseudo-triangulations.
Discret. Math., 2007

New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2007

2005
The Polytope of Non-Crossing Graphs on a Planar Point Set.
Discret. Comput. Geom., 2005

Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom., 2005

MESETA: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms.
Proceedings of the 34th International Conference on Parallel Processing Workshops (ICPP 2005 Workshops), 2005

2004
Non-Crossing Frameworks with Non-Crossing Reciprocals.
Discret. Comput. Geom., 2004

2003
Asymptotically Efficient Triangulations of the d-Cube.
Discret. Comput. Geom., 2003

2002
Asymptotically efficient triangulations of the <i>d</i>-cube.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Assymptotically efficient triangulations of the d-cube<sup>*</sup>.
Electron. Notes Discret. Math., 2001


  Loading...