David Orden

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Approximating shortest paths in weighted square and hexagonal meshes 2024 Prosenjit Bose
Guillermo Esteban
David Orden
Rodrigo I. Silveira
+ PDF Chat Rainbow ortho-convex 4-sets in k-colored point sets 2024 David Flores‐Peñaloza
Mario A. LĂłpez
N. MarĂ­n
David Orden
+ PDF Chat Connecting the dots: A candy comparison of the free-linking task to the projective mapping task (Video abstract) 2024 David Orden
Encarnación Fernández‐Fernández
Jacob Lahne
+ PDF Chat Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4 2024 Maarten Löffler
Tamara Mchedlidze
David Orden
Josef Tkadlec
Jules Wulms
+ PDF Chat Analyzing larger sample sets with rapid methods: Incomplete-block designs with free-sorting and free-linking tasks 2023 Marlon Ac-Pangan
Marino Tejedor‐Romero
Kyra Swatko
David Orden
Jacob Lahne
+ On approximating shortest paths in weighted triangular tessellations 2023 Prosenjit Bose
Guillermo Esteban
David Orden
Rodrigo I. Silveira
+ PDF Chat On Approximating Shortest Paths in Weighted Triangular Tessellations 2022 Prosenjit Bose
Guillermo Esteban
David Orden
Rodrigo I. Silveira
+ Rainbow polygons for colored point sets in the plane 2021 David Flores‐Peñaloza
Mikio Kanƍ
Leonardo MartĂ­nez-Sandoval
David Orden
Javier Tejel
Csaba D. TĂłth
Jorge Urrutia
Birgit Vogtenhuber
+ PDF Chat Optimizing generalized kernels of polygons 2021 Alejandra MartĂ­nez-Moraian
David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ PDF Chat Maximum Rectilinear Convex Subsets 2021 HernĂ n GonzĂĄlez-Aguilar
David Orden
Pablo PĂ©rez-Lantero
David Rappaport
Carlos Seara
Javier Tejel
Jorge Urrutia
+ PDF Chat Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations 2020 Carlos Alegrı́a
David Orden
Carlos Seara
Jorge Urrutia
+ PDF Chat Analysis of self-equilibrated networks through cellular modelling 2020 Omar Aloui
David Orden
N. Bel Hadj Ali
Landolf Rhode‐Barbarigos
+ PDF Chat Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers 2020 David Orden
Encarnación Fernández‐Fernández
Marino Tejedor‐Romero
Alejandra MartĂ­nez-Moraian
+ Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers 2020 David Orden
Encarnación Fernández‐Fernández
Marino Tejedor‐Romero
Alejandra MartĂ­nez-Moraian
+ Rainbow polygons for colored point sets in the plane 2020 David Flores‐Peñaloza
Mikio Kanƍ
Leonardo MartĂ­nez-Sandoval
David Orden
Javier Tejel
Csaba D. TĂłth
Jorge Urrutia
Birgit Vogtenhuber
+ Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility 2020 Bengt J. Nilsson
David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ PDF Chat Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility 2020 Bengt J. Nilsson
David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ PDF Chat REACT: reactive resilience for critical infrastructures using graph-coloring techniques 2019 IvĂĄn MarsĂĄ-Maestre
José Manuel Giménez-Guzmån
David Orden
Enrique de la Hoz
Mark Klein
+ PDF Chat Estimation of spatio-temporal wave grouping properties using Delaunay triangulation and spline techniques 2019 José Carlos Nieto Borge
Juan Gerardo AlcĂĄzar
David Orden
Sara Marazuela Reca
Gerardo Rodrı́guez
+ $K_{1,3}$-covering red and blue points in the plane 2019 Bernardo M. Ábrego
Silvia Fernández‐Merchant
Mikio Kanƍ
David Orden
Pablo PĂ©rez-Lantero
Carlos Seara
Javier Tejel
+ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction 2019 David Orden
IvĂĄn MarsĂĄ-Maestre
José Manuel Giménez-Guzmån
Enrique de la Hoz
Ana Álvarez-Suårez
+ PDF Chat Maximum Rectilinear Convex Subsets 2019 HernĂ n GonzĂĄlez-Aguilar
David Orden
Pablo PĂ©rez-Lantero
David Rappaport
Carlos Seara
Javier Tejel
Jorge Urrutia
+ PDF Chat Cellular morphogenesis of three-dimensional tensegrity structures 2018 Omar Aloui
Jessica Flores
David Orden
Landolf Rhode‐Barbarigos
+ PDF Chat Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment 2018 Ivan Marsa‐Maestre
Enrique de la Hoz
José Manuel Giménez-Guzmån
David Orden
Mark Klein
+ PDF Chat Testing SensoGraph, a geometric approach for fast sensory evaluation 2018 David Orden
Encarnación Fernández‐Fernández
JosĂ© Manuel RodrĂ­guez‐Nogales
Josefina Vila‐Crespo
+ PDF Chat Capturing Points with a Rotating Polygon (and a 3D Extension) 2018 Carlos AlegrĂ­a-Galicia
David Orden
Leonidas Palios
Carlos Seara
Jorge Urrutia
+ Generation of planar tensegrity structures through cellular multiplication 2018 Omar Aloui
David Orden
Landolf Rhode‐Barbarigos
+ PDF Chat Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment 2018 David Orden
José Manuel Giménez-Guzmån
IvĂĄn MarsĂĄ-Maestre
Enrique de la Hoz
+ Generalized kernels of polygons under rotation 2018 David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ Optimizing generalized kernels of polygons 2018 Alejandra MartĂ­nez-Moraian
David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets 2018 Mikio Kanƍ
Kenta Noguchi
David Orden
+ Optimizing generalized kernels of polygons 2018 Alejandra MartĂ­nez-Moraian
David Orden
Leonidas Palios
Carlos Seara
PaweƂ Ć»yliƄski
+ Rectilinear and $\mathcal{O}$-convex hull with minimum area 2017 Carlos AlegrĂ­a-Galicia
David Orden
Carlos Seara
Jorge Urrutia
+ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations 2017 Carlos AlegrĂ­a-Galicia
David Orden
Carlos Seara
Jorge Urrutia
+ On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="script">O</mml:mi></mml:mrow><mml:mrow><mml:mi>ÎČ</mml:mi></mml:mrow></mml:msub><mml:mtext>-hull</mml:mtext></mml:math> of a planar point set 2017 Carlos AlegrĂ­a-Galicia
David Orden
Carlos Seara
Jorge Urrutia
+ $K_{1,3}$-covering red and blue points in the plane 2017 Bernardo M. Ábrego
Silvia Fernández‐Merchant
Mikio Kanƍ
David Orden
Pablo PĂ©rez-Lantero
Carlos Seara
Javier Tejel
+ Rectilinear and O-convex hull with minimum area. 2017 Carlos AlegrĂ­a-Galicia
David Orden
Carlos Seara
Jorge Urrutia
+ PDF Chat Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment 2017 Ivan Marsa‐Maestre
Enrique de la Hoz
José Manuel Giménez-Guzmån
David Orden
Mark Klein
+ PDF Chat FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR 2014 Oswin Aichholzer
Thomas Hackl
David Orden
Alexander Pilz
Maria Saumell
Birgit Vogtenhuber
+ On the Fiedler value of large planar graphs 2013 Lali BarriĂšre
Clemens Huemer
Dieter Mitsche
David Orden
+ PDF Chat Flip Graphs of Bounded Degree Triangulations 2012 Oswin Aichholzer
Thomas Hackl
David Orden
Pedro Ramos
GĂŒnter Rote
André Schulz
Bettina Speckmann
+ On the Fiedler value of large planar graphs (Extended abstract) 2011 Lali BarriĂšre
Clemens Huemer
Dieter Mitsche
David Orden
+ Software Tools Used in Math Refresher Courses at the University of AlcalĂĄ, Spain 2011 Juan Gerardo AlcĂĄzar
Marcos MarvĂĄ
David Orden
Fernando San Segundo
+ PDF Chat Binary Labelings for Plane Quadrangulations and their Relatives 2011 Stefan Felsner
Clemens Huemer
Sarah Kappes
David Orden
+ Bijections for Baxter families and related objects 2010 Stefan Felsner
Éric Fusy
Marc Noy
David Orden
+ PDF Chat The Number of Generalized Balanced Lines 2010 David Orden
Pedro Ramos
Gelasio Salazar
+ PDF Chat Decomposition of Multiple Coverings into More Parts 2010 Greg Aloupis
Jean Cardinal
SĂ©bastien Collette
Stefan Langerman
David Orden
Pedro Ramos
+ Flip Graphs of Bounded-Degree Triangulations 2009 Oswin Aichholzer
Thomas Hackl
David Orden
Pedro Ramos
Guenter Rote
André Schulz
Bettina Speckmann
+ PDF Chat New results on lower bounds for the number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mo>≀</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-facets 2009 Oswin Aichholzer
JesĂșs Garcı́a
David Orden
Pedro Ramos
+ Decomposition of multiple coverings into more parts 2009 Greg Aloupis
Jean Cardinal
SĂ©bastien Collette
Stefan Langerman
David Orden
Pedro Ramos
+ Balanced lines in two-coloured point sets 2009 David Orden
Pedro Ramos
Gelasio Salazar
+ New results on lower bounds for the number of ( 2009 Oswin Aichholzer
JesĂșs Garcı́a
David Orden
Pedro Ramos
+ The number of generalized balanced lines 2009 David Orden
Pedro Ramos
Gelasio Salazar
+ PDF Chat On the number of pseudo-triangulations of certain point sets 2007 Oswin Aichholzer
David Orden
Francisco Santos
Bettina Speckmann
+ PDF Chat New Lower Bounds for the Number of (≀ k)-Edges and the Rectilinear Crossing Number of Kn 2007 Oswin Aichholzer
JesĂșs Garcı́a
David Orden
Pedro Ramos
+ New results on lower bounds for the number of 2007 Oswin Aichholzer
JesĂșs Garcı́a
David Orden
Pedro Ramos
+ Combinatorial pseudo-triangulations 2006 David Orden
Francisco Santos
Brigitte Servatius
Herman Servatius
+ PDF Chat From graphs to tensegrity structures: Geometric and symbolic approaches 2006 David Orden
Miguel de GuzmĂĄn OzĂĄmiz
+ PDF Chat From graphs to tensegrity structures 2006 Miguel de GuzmĂĄn
David Orden
+ Planar minimally rigid graphs and pseudo-triangulations 2004 Ruth Haas
David Orden
GĂŒnter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Diane L. Souvaine
Ileana Streinu
Walter Whiteley
+ PDF Chat The Polytope of Non-Crossing Graphs on a Planar Point Set 2004 David Orden
Francisco Santos
+ PDF Chat Non-Crossing Frameworks with Non-Crossing Reciprocals 2004 David Orden
Gïżœnter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Walter Whiteley
+ PDF Chat The polytope of non-crossing graphs on a planar point set 2004 David Orden
Francisco Santos
+ Finding tensegrity structures: Geometric and symbolic approaches 2004 Miguel de GuzmĂĄn
David Orden
+ PDF Chat Asymptotically Efficient Triangulations of the d -Cube 2003 David Orden
Francisco Santos
+ PDF Chat Planar minimally rigid graphs and pseudo-triangulations 2003 Ruth Haas
David Orden
GĂŒnter Rote
Francisco Santos
Brigitte Servatius
Hermann Servatius
Diane L. Souvaine
Ileana Streinu
Walter Whiteley
+ On the Number of Pseudo-Triangulations of Certain Point Sets. 2003 Oswin Aichholzer
David Orden
Francisco Santos
Bettina Speckmann
+ Asymptotically efficient triangulations of the d -cube. 2002 David Orden
Francisco Santos
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Expansive Motions and the Polytope of Pointed Pseudo-Triangulations 2003 GĂŒnter Rote
Francisco Santos
Ileana Streinu
11
+ Combinatorial pseudo-triangulations 2006 David Orden
Francisco Santos
Brigitte Servatius
Herman Servatius
7
+ Discrete and computational geometry : the Goodman-Pollack Festschrift 2003 Boris Aronov
Eli Goodman
Ricky Pollack
7
+ Restricted-Orientation Convexity 2004 Eugene Fink
Derick Wood
7
+ PDF Chat The Polytope of Non-Crossing Graphs on a Planar Point Set 2004 David Orden
Francisco Santos
6
+ Planar minimally rigid graphs and pseudo-triangulations 2004 Ruth Haas
David Orden
GĂŒnter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Diane L. Souvaine
Ileana Streinu
Walter Whiteley
5
+ Distance Coloring 2007 Alexa Sharp
4
+ PDF Chat The hamburger theorem 2017 Mikio Kanƍ
Jan Kynčl
4
+ PDF Chat Plane Bichromatic Trees of Low Degree 2017 Ahmad Biniaz
Prosenjit Bose
Anil Maheshwari
Michiel Smid
4
+ PDF Chat Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment 2018 David Orden
José Manuel Giménez-Guzmån
IvĂĄn MarsĂĄ-Maestre
Enrique de la Hoz
4
+ Convex Representations of Graphs 1960 W. T. Tutte
4
+ Computing D-convex hulls in the plane 2008 Vojtěch Franěk
JiĆ™Ä±Ì MatouĆĄek
4
+ PDF Chat Planar minimally rigid graphs and pseudo-triangulations 2003 Ruth Haas
David Orden
GĂŒnter Rote
Francisco Santos
Brigitte Servatius
Hermann Servatius
Diane L. Souvaine
Ileana Streinu
Walter Whiteley
4
+ Counting triangulations and pseudo-triangulations of wheels. 2001 Dana Randall
GĂŒnter Rote
Francisco Santos
Jack Snoeyink
4
+ Balanced Convex Partitions of Measures in ℝ 2 2002 Toshinori Sakai
4
+ PDF Chat Dynamic planar convex hull 2003 Gerth StĂžlting Brodal
Riko Jacob
4
+ On the Maximum Degree of Bipartite Embeddings of Trees in the Plane 2000 Atsushi Kaneko
3
+ PDF Chat From graphs to tensegrity structures: Geometric and symbolic approaches 2006 David Orden
Miguel de GuzmĂĄn OzĂĄmiz
3
+ Research Problems in Discrete Geometry 2005 JĂĄnos Pach
Peter Braß
W. O. J. Moser
3
+ None 2001 Stefan Felsner
3
+ PDF Chat Handbook of discrete and computational geometry 1998 3
+ Ortho-Convexity and its Generalizations 1988 Gregory J. E. Rawlins
Derick Wood
3
+ PDF Chat Near equipartitions of colored point sets 2017 Andreas F. Holmsen
Jan Kynčl
Claudiu Valculescu
3
+ PDF Chat Pseudo-triangulations—a survey 2008 GĂŒnter Rote
Francisco Santos
Ileana Streinu
3
+ PDF Chat Non-Crossing Frameworks with Non-Crossing Reciprocals 2004 David Orden
Gïżœnter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Walter Whiteley
3
+ Enumerative Combinatorics 1997 Richard P. Stanley
Gian‐Carlo Rota
3
+ Pseudo-triangulations 1996 Michel Pocchiola
Gert Vegter
3
+ Zum Hilbertschen Aufbau der reellen Zahlen 1928 Wilhelm Ackermann
3
+ PDF Chat On Functional Separately Convex Hulls 1998 J Matousek
Petr Plecháč
3
+ Multilayer networks 2014 Mikko KivelÀ
Àlex Arenas
Marc Barthélemy
James P. Gleeson
Yamir Moreno
Mason A. Porter
3
+ PDF Chat Flip Graphs of Bounded Degree Triangulations 2012 Oswin Aichholzer
Thomas Hackl
David Orden
Pedro Ramos
GĂŒnter Rote
André Schulz
Bettina Speckmann
2
+ A Separator Theorem in Minor-Closed Classes 2010 Ken‐ichi Kawarabayashi
Bruce Reed
2
+ Using the Borsuk–Ulam Theorem 2008 JiĆ™Ä±Ì MatouĆĄek
2
+ PDF Chat Probability via Expectation 1992 Peter Whittle
2
+ Lectures on Polytopes 1994 GĂŒnter M. Ziegler
2
+ PDF Chat A Combinatorial Problem in Geometry 2009 P. ErdƑs
G. Szckeres
2
+ PDF Chat Multiple Coverings of the Plane with Triangles 2007 GĂĄbor Tardos
GĂ©zĂĄ TĂłth
2
+ PDF Chat Algebraic connectivity of graphs 1973 Miroslav Fiedler
2
+ On the algebraic connectivity of graphs as a function of genus 2006 Jason J. Molitierno
2
+ PDF Chat Realization Spaces of Polytopes 1996 JĂŒrgen Richter-Gebert
2
+ PDF Chat A simple and relatively efficient triangulation of then-cube 1991 Mark Haiman
2
+ Dichotomies properties on computational complexity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si26.gif" display="inline" overflow="scroll"><mml:mi>S</mml:mi></mml:math>-packing coloring problems 2015 Nicolas Gastineau
2
+ Old and new results on algebraic connectivity of graphs 2006 Nair Maria Maia de Abreu
2
+ Characteristic vertices of trees<sup>*</sup> 1987 Russell Merris
2
+ PDF Chat Indecomposable Coverings with Concave Polygons 2009 Dömötör Pålvölgyi
2
+ PDF Chat Improved Bounds for the Number of (≀ k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n 2005 JĂłzsef Balogh
Gelasio Salazar
2
+ PDF Chat Singularity Analysis of Generating Functions 1990 Philippe Flajolet
Andrew Odlyzko
2
+ PDF Chat Covering the plane with convex polygons 1986 JĂĄnos Pach
2
+ On the approximability of covering points by lines and related problems 2015 Adrian Dumitrescu
Minghui Jiang
2
+ PDF Chat On Polygons Excluding Point Sets 2012 Radoslav Fulek
BalĂĄzs Keszegh
Filip Morić
Igor Uljarević
2