default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Orden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i28]Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec, Jules Wulms:
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. CoRR abs/2402.12357 (2024)- [i27]David Flores-Peñaloza, Mario Alberto López, Nestaly Marín, David Orden:
Rainbow ortho-convex 4-sets in k-colored point sets. CoRR abs/2404.06376 (2024) - [i26]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
Approximating shortest paths in weighted square and hexagonal meshes. CoRR abs/2404.07562 (2024) - 2023
- [j35]Prosenjit Bose, Guillermo Esteban
, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318: 103898 (2023) - [j34]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Separating bichromatic point sets in the plane by restricted orientation convex hulls. J. Glob. Optim. 85(4): 1003-1036 (2023) - [j33]José Manuel Giménez-Guzmán, Ivan Marsá-Maestre, Enrique de la Hoz, David Orden, David Herranz-Oliveros:
Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring. Sensors 23(13): 5932 (2023) - [i25]Mercè Claverol, Andrea de las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer, David Orden:
On polynomials associated to Voronoi diagrams of point sets and crossing numbers. CoRR abs/2304.12238 (2023) - 2022
- [c17]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM 2022: 409-421 - [i24]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Separating bichromatic point sets in the plane by restricted orientation convex hulls. CoRR abs/2209.04258 (2022) - 2021
- [j32]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - [j31]Carlos Alegría, David Orden, Carlos Seara, Jorge Urrutia:
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations. J. Glob. Optim. 79(3): 687-714 (2021) - [j30]Alejandra Martínez-Moraian, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Optimizing generalized kernels of polygons. J. Glob. Optim. 80(4): 887-920 (2021) - [j29]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. SIAM J. Comput. 50(1): 145-170 (2021) - [c16]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Illuminating the x-Axis by α-Floodlights. ISAAC 2021: 11:1-11:12 - [i23]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. CoRR abs/2111.13912 (2021) - 2020
- [c15]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON 2020: 311-323 - [i22]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR abs/2007.08368 (2020) - [i21]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020) - [i20]Omar Aloui, David Orden, Nizar Bel Hadj Ali, Landolf Rhode-Barbarigos:
Analysis of self-equilibrated networks through cellular modeling. CoRR abs/2008.04570 (2020) - [i19]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. CoRR abs/2008.10431 (2020)
2010 – 2019
- 2019
- [j28]David Orden, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz, Ana Álvarez-Suárez:
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction. Discret. Appl. Math. 263: 234-243 (2019) - [j27]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
K1,3-covering red and blue points in the plane. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j26]Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, David Orden, Enrique de la Hoz, Mark Klein:
REACT: reactive resilience for critical infrastructures using graph-coloring techniques. J. Netw. Comput. Appl. 145 (2019) - [j25]Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia:
Capturing Points with a Rotating Polygon (and a 3D Extension). Theory Comput. Syst. 63(3): 543-566 (2019) - [c14]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum Rectilinear Convex Subsets. FCT 2019: 274-291 - [i18]Ivan Marsá-Maestre, Enrique de la Hoz, José Manuel Giménez-Guzmán, David Orden, Mark Klein:
Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment. CoRR abs/1902.09457 (2019) - [i17]Omar Aloui, Jessica Flores, David Orden, Landolf Rhode-Barbarigos:
Cellular morphogenesis of three-dimensional tensegrity structures. CoRR abs/1902.09953 (2019) - [i16]Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, David Orden, Enrique de la Hoz, Mark Klein:
REACT: REActive resilience for critical infrastructures using graph-Coloring Techniques. CoRR abs/1907.05117 (2019) - [i15]Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia:
Maximum rectilinear convex subsets. CoRR abs/1907.07441 (2019) - 2018
- [j24]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
On the 𝒪β of a planar point set. Comput. Geom. 68: 277-291 (2018) - [j23]David Orden, José Manuel Giménez-Guzmán, Ivan Marsá-Maestre, Enrique de la Hoz:
Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment. Symmetry 10(3): 65 (2018) - [j22]José Manuel Giménez-Guzmán, Ivan Marsá-Maestre, David Orden, Enrique de la Hoz, Takayuki Ito:
On the Goodness of Using Orthogonal Channels in WLAN IEEE 802.11 in Realistic Scenarios. Wirel. Commun. Mob. Comput. 2018: 5742712:1-5742712:11 (2018) - [i14]David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Generalized kernels of polygons under rotation. CoRR abs/1802.05995 (2018) - [i13]Carlos Alegría-Galicia, David Orden, Leonidas Palios, Carlos Seara, Jorge Urrutia:
Capturing points with a rotating polygon (and a 3D extension). CoRR abs/1805.02570 (2018) - [i12]Omar Aloui, David Orden, Landolf Rhode-Barbarigos:
Generation of planar tensegrity structures through cellular multiplication. CoRR abs/1807.06279 (2018) - [i11]David Orden, Encarnación Fernández-Fernández, José M. Rodríguez-Nogales, Josefina Vila-Crespo:
Testing SensoGraph, a geometric approach for fast sensory evaluation. CoRR abs/1809.06911 (2018) - [i10]David Orden, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz, Ana Álvarez-Suárez:
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction. CoRR abs/1811.06832 (2018) - [i9]Mikio Kano, Kenta Noguchi, David Orden:
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets. CoRR abs/1812.02866 (2018) - 2017
- [c13]Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz, David Orden:
Competitive Belief Propagation to Efficiently Solve Complex Multi-agent Negotiations with Network Structure. AAMAS Workshops (Visionary Papers) 2017: 1-16 - [c12]Enrique de la Hoz, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, David Orden, Mark Klein:
Multi-Agent Nonlinear Negotiation for Wi-Fi Channel Assignment. AAMAS 2017: 1035-1043 - [c11]Enrique de la Hoz, José Manuel Giménez-Guzmán, Ivan Marsá-Maestre, Luis Cruz-Piris, David Orden:
A Distributed, Multi-Agent Approach to Reactive Network Resilience. AAMAS 2017: 1044-1053 - [i8]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
$K_{1, 3}$-covering red and blue points in the plane. CoRR abs/1707.06856 (2017) - [i7]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
Rectilinear and O-convex hull with minimum area. CoRR abs/1710.10888 (2017) - 2016
- [j21]David Orden, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz:
Bounds on spectrum graph coloring. Electron. Notes Discret. Math. 54: 63-68 (2016) - [c10]Ivan Marsá-Maestre, Enrique de la Hoz, José Manuel Giménez-Guzmán, David Orden, Mark Klein:
Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment. COREDEMA@ECAI 2016: 51-65 - [c9]Enrique de la Hoz, José Manuel Giménez-Guzmán, German Lopez-Civera, Ivan Marsá-Maestre, David Orden:
TOWER: Topology Optimization for netWork Enhanced Resilience. DCNET 2016: 121-128 - [i6]David Orden, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz:
Spectrum graph coloring and applications to WiFi channel assignment. CoRR abs/1602.05038 (2016) - 2015
- [j20]Enrique de la Hoz, José Manuel Giménez-Guzmán, Ivan Marsá-Maestre, David Orden:
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks. Sensors 15(11): 29547-29568 (2015) - [c8]Alvaro Estebanez, Diego R. Llanos, David Orden, Belén Palop:
Moody Scheduling for Speculative Parallelization. Euro-Par 2015: 135-146 - [i5]Carlos Alegría-Galicia, David Orden, Carlos Seara, Jorge Urrutia:
On the $O_β$-hull of a planar point set. CoRR abs/1509.02601 (2015) - 2014
- [j19]Oswin Aichholzer, Thomas Hackl, David Orden, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four. Int. J. Comput. Geom. Appl. 24(3): 197-224 (2014) - 2013
- [j18]Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded Degree Triangulations. Graphs Comb. 29(6): 1577-1593 (2013) - [i4]Oswin Aichholzer, Thomas Hackl, David Orden, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
Flips in combinatorial pointed pseudo-triangulations with face degree at most four. CoRR abs/1310.0833 (2013) - 2012
- [i3]Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs. CoRR abs/1206.3870 (2012) - 2011
- [j17]Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs (Extended abstract). Electron. Notes Discret. Math. 38: 111-116 (2011) - [j16]Stefan Felsner, Éric Fusy, Marc Noy, David Orden:
Bijections for Baxter families and related objects. J. Comb. Theory A 118(3): 993-1020 (2011) - 2010
- [j15]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. Discret. Comput. Geom. 44(3): 706-723 (2010) - [j14]David Orden, Pedro Ramos, Gelasio Salazar:
The Number of Generalized Balanced Lines. Discret. Comput. Geom. 44(4): 805-811 (2010) - [j13]Stefan Felsner, Clemens Huemer, Sarah Kappes, David Orden:
Binary Labelings for Plane Quadrangulations and their Relatives. Discret. Math. Theor. Comput. Sci. 12(3): 115-138 (2010)
2000 – 2009
- 2009
- [j12]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New results on lower bounds for the number of (<=k)-facets. Eur. J. Comb. 30(7): 1568-1574 (2009) - [j11]Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded-Degree Triangulations. Electron. Notes Discret. Math. 34: 509-513 (2009) - [c7]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of multiple coverings into more parts. SODA 2009: 302-310 - [i2]David Orden, Pedro Ramos, Gelasio Salazar:
The number of generalized balanced lines. CoRR abs/0904.4429 (2009) - 2008
- [j10]Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann:
On the number of pseudo-triangulations of certain point sets. J. Comb. Theory A 115(2): 254-278 (2008) - [c6]Diego R. Llanos Ferraris, David Orden, Belén Palop:
Just-In-Time Scheduling for Loop-based Speculative Parallelization. PDP 2008: 334-342 - [i1]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos:
Decomposition of Multiple Coverings into More Parts. CoRR abs/0807.0552 (2008) - 2007
- [j9]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. Discret. Comput. Geom. 38(1): 1-14 (2007) - [j8]David Orden, Francisco Santos, Brigitte Servatius, Herman Servatius:
Combinatorial pseudo-triangulations. Discret. Math. 307(3-5): 554-566 (2007) - [j7]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New results on lower bounds for the number of (k)-facets: (extended abstract). Electron. Notes Discret. Math. 29: 189-193 (2007) - [j6]Diego R. Llanos Ferraris, David Orden, Belén Palop:
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization. IEEE Trans. Computers 56(6): 839-852 (2007) - 2005
- [j5]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1-2): 31-61 (2005) - [j4]David Orden, Francisco Santos:
The Polytope of Non-Crossing Graphs on a Planar Point Set. Discret. Comput. Geom. 33(2): 275-305 (2005) - [c5]Diego R. Llanos Ferraris, David Orden, Belén Palop:
MESETA: A New Scheduling Strategy for Speculative Parallelization of Randomized Incremental Algorithms. ICPP Workshops 2005: 121-128 - 2004
- [j3]David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley:
Non-Crossing Frameworks with Non-Crossing Reciprocals. Discret. Comput. Geom. 32(4): 567-600 (2004) - [c4]David Orden, Francisco Santos:
The polytope of non-crossing graphs on a planar point set. ISSAC 2004: 250-257 - 2003
- [j2]David Orden, Francisco Santos:
Asymptotically Efficient Triangulations of the d-Cube. Discret. Comput. Geom. 30(4): 509-528 (2003) - [c3]Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann:
On the Number of Pseudo-Triangulations of Certain Point Sets. CCCG 2003: 141-144 - [c2]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. SCG 2003: 154-163 - 2002
- [c1]David Orden, Francisco Santos:
Asymptotically efficient triangulations of the d-cube. CCCG 2002: 167-169 - 2001
- [j1]David Orden, Francisco Santos:
Assymptotically efficient triangulations of the d-cube*. Electron. Notes Discret. Math. 10: 212-215 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
