Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Clemens Huemer"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 3, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/e91c65777393448b9b62e7e682f17132
Autor:
Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 1, Iss Graph and Algorithms (2010)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/bced14a406bb406ea2d51d7796ac040b
Autor:
Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 11 no. 2, Iss Graph and Algorithms (2009)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/bf84775a29334727950f6517dd396af7
Publikováno v:
Discrete and Computational Geometry
Let S be a set of n points in general position in the plane, and let $$X_{k,\ell }(S)$$ X k , ℓ ( S ) be the number of convex k-gons with vertices in S that have exactly $$\ell $$ ℓ points of S in their interior. We prove several equalities for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e787baaae3aee1f9cf9d26827ee18b63
Autor:
Miquel Àngel Fiol, F. J. Zaragoza Martínez, Frank Duque, Clemens Huemer, Ruy Fabila-Monroy, Cristina Dalfó, Ana Laura Trujillo-Negrete
Publikováno v:
Linear algebra and its applications
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent whenever their symmetric diffe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22b2cb737ca422a9cedd0d8f819f1b25
Autor:
Sergey Bereg, Oscar P. Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Journal of Global Optimization
Universitat Politècnica de Catalunya (UPC)
Journal of Global Optimization
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets R and B with $$|R|=|B|$$ | R | = | B | , the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the matched p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0c2e2de0d7cbebadbbbf1ef247debe2
http://hdl.handle.net/2117/365196
http://hdl.handle.net/2117/365196
Autor:
Francisco Javier Zaragoza Martínez, Frank Duque, Clemens Huemer, Cristina Dalfó, Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete, Miquel Àngel Fiol
Publikováno v:
Extended Abstracts EuroComb 2021. European Conference on Combinatorics, Graph Theory and Applications. Trends in Mathematics book series (RPCRMB,volume 14)
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Trends in Mathematics ISBN: 9783030838225
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Trends in Mathematics ISBN: 9783030838225
This version of the contribution has been accepted for publication, after peer review but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ccdde2d91018d96defd2e65d3b343de
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Linear algebra and its applications
Universitat Politècnica de Catalunya (UPC)
Linear algebra and its applications
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and elegant, way of counting the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67e9d5f879e33477fc3133287b00dd89
Publikováno v:
International Workshop on Algorithms and Computation, WALCOM 2020, Lecture Notes in Computer Science (LNCS, volume 12049)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=r3c4b2081b22::0a16f8f0687cd2057f5ee1753b97b51d
Autor:
Ruy Fabila-Monroy, Clemens Huemer
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Discrete & Computational Geometry
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Discrete & Computational Geometry
Let X be a finite set of points in $$\mathbb {R}^d$$Rd. The Tukey depth of a point q with respect to X is the minimum number $$\tau _X(q)$$źX(q) of points of X in a halfspace containing q. In this paper we prove a depth version of Caratheodory's the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c23904c2b3ebe863e632f8a9c6c9f150
https://doi.org/10.1007/s00454-017-9893-8
https://doi.org/10.1007/s00454-017-9893-8