default search action
Clemens Huemer
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j50]Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer, Alejandra Martínez-Moraian
:
The edge labeling of higher order Voronoi diagrams. J. Glob. Optim. 90(2): 515-549 (2024) - [i18]Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer, Dolores Lara:
Sibson's formula for higher order Voronoi diagrams. CoRR abs/2404.17422 (2024) - 2023
- [j49]Josué Corujo
Matching random colored points with rectangles. J. Comb. Optim. 45(2): 81 (2023) - [j48]Sergey Bereg
On maximum-sum matchings of points. J. Glob. Optim. 85(1): 111-128 (2023) - [i17]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
- [j47]Clemens Huemer, Deborah Oliveros, Pablo Pérez-Lantero, Ferran Torra Clotet, Birgit Vogtenhuber
On Weighted Sums of Numbers of Convex Polygons in Point Sets. Discret. Comput. Geom. 68(2): 448-476 (2022) - [i16]Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer:
Voronoi Diagrams of Arbitrary Order on the Sphere. CoRR abs/2207.13788 (2022) - 2021
- [j46]Katherina Böhmova, Cristina Dalfó, Clemens Huemer:
New cyclic Kautz digraphs with optimal diameter. Contributions Discret. Math. 16(3): 111-124 (2021) - [j45]Mercè Claverol
On circles enclosing many points. Discret. Math. 344(10): 112541 (2021) - [i15]Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer, Alejandra Martínez-Moraian:
The edge labeling of higher order Voronoi diagrams. CoRR abs/2109.13002 (2021) - 2020
- [j44]Clemens Huemer, Pablo Pérez-Lantero:
The intersection graph of the disks with diameters the sides of a convex n-gon. Discret. Math. 343(2): 111669 (2020) - [c11]Josué Corujo
Matching Random Colored Points with Rectangles. WALCOM 2020: 261-272 - [i14]Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira:
New production matrices for geometric graphs. CoRR abs/2003.00524 (2020)
2010 – 2019
- 2019
- [j43]Clemens Huemer
A new lower bound on the maximum number of plane graphs using production matrices. Comput. Geom. 84: 36-49 (2019) - [j42]Clemens Huemer
Matching points with disks with a common intersection. Discret. Math. 342(7): 1885-1893 (2019) - [i13]Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara, Rodrigo I. Silveira:
Matching points with disks with a common intersection. CoRR abs/1902.08427 (2019) - [i12]Clemens Huemer, Alexander Pilz, Rodrigo I. Silveira:
A new lower bound on the maximum number of plane graphs using production matrices. CoRR abs/1902.09841 (2019) - [i11]Mercè Claverol, Clemens Huemer, Alejandra Martínez-Moraian:
On circles enclosing many points. CoRR abs/1907.06601 (2019) - [i10]Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
On Maximum-Sum Matchings of Points. CoRR abs/1911.10610 (2019) - 2018
- [j41]Guillermo Esteban
New results on production matrices for geometric graphs. Electron. Notes Discret. Math. 68: 215-220 (2018) - [c10]Ruy Fabila Monroy, Carlos Hidalgo-Toscano
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. GD 2018: 593-605 - [i9]Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche:
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. CoRR abs/1808.09024 (2018) - 2017
- [j40]Ruy Fabila Monroy
Carathéodory's Theorem in Depth. Discret. Comput. Geom. 58(1): 51-66 (2017) - [j39]Clemens Huemer
Characteristic polynomials of production matrices for geometric graphs. Electron. Notes Discret. Math. 61: 631-637 (2017) - 2016
- [j38]Cristina Dalfó
The Degree/Diameter Problem in Maximal Planar Bipartite graphs. Electron. J. Comb. 23(1): 1 (2016) - [j37]Clemens Huemer
Production matrices for geometric graphs. Electron. Notes Discret. Math. 54: 301-306 (2016) - 2015
- [j36]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia
On k-gons and k-holes in point sets. Comput. Geom. 48(7): 528-537 (2015) - [j35]Clemens Huemer
Lower bounds on the maximum number of non-crossing acyclic graphs. Eur. J. Comb. 48: 48-62 (2015) - [j34]Katerina Böhmová, Cristina Dalfó
The Diameter of Cyclic Kautz Digraphs. Electron. Notes Discret. Math. 49: 323-330 (2015) - [j33]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. 25(4): 283-298 (2015) - [i8]Ruy Fabila Monroy, Clemens Huemer:
Caratheodory's Theorem in Depth. CoRR abs/1509.04575 (2015) - 2014
- [j32]Alfredo García Olaverri, Clemens Huemer
Compatible spanning trees. Comput. Geom. 47(5): 563-584 (2014) - [j31]Oswin Aichholzer
Lower bounds for the number of small convex k-holes. Comput. Geom. 47(5): 605-613 (2014) - [j30]Oswin Aichholzer
4-Holes in point sets. Comput. Geom. 47(6): 644-650 (2014) - [j29]Oswin Aichholzer
Empty Monochromatic Simplices. Discret. Comput. Geom. 51(2): 362-393 (2014) - [j28]Cristina Dalfó
The degree/diameter problem in maximal planar bipartite graphs. Electron. Notes Discret. Math. 46: 73-80 (2014) - [j27]Ruy Fabila Monroy, Clemens Huemer, Dieter Mitsche:
The number of empty four-gons in random point sets. Electron. Notes Discret. Math. 46: 161-168 (2014) - [j26]Ruy Fabila Monroy, Clemens Huemer
Note on the number of obtuse angles in Point Sets. Int. J. Comput. Geom. Appl. 24(3): 177-182 (2014) - [i7]Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber:
On $k$-Gons and $k$-Holes in Point Sets. CoRR abs/1409.0081 (2014) - [i6]Clemens Huemer, Pablo Pérez-Lantero:
The intersection graph of the disks with diameters the sides of a convex $n$-gon. CoRR abs/1410.4126 (2014) - 2013
- [j25]Oswin Aichholzer
Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1): 17-28 (2013) - [j24]Javier Cano, José Miguel Díaz-Báñez
The Edge Rotation Graph. Graphs Comb. 29(5): 1207-1219 (2013) - [j23]Crevel Bautista-Santiago, Marco A. Heredia
On the Number of Edges in Geometric Graphs Without Empty Triangles. Graphs Comb. 29(6): 1623-1631 (2013) - 2012
- [j22]Lali Barrière, Clemens Huemer
4-labelings and grid embeddings of plane quadrangulations. Discret. Math. 312(10): 1722-1731 (2012) - [j21]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer
Token Graphs. Graphs Comb. 28(3): 365-380 (2012) - [c9]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber:
Lower Bounds for the Number of Small Convex k-Holes. CCCG 2012: 247-252 - [i5]Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs. CoRR abs/1206.3870 (2012) - [i4]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Simplices. CoRR abs/1210.7043 (2012) - 2011
- [j20]Lali Barrière, Clemens Huemer
On the Fiedler value of large planar graphs (Extended abstract). Electron. Notes Discret. Math. 38: 111-116 (2011) - [j19]Ruy Fabila Monroy, Clemens Huemer
A combinatorial property on angular orders of plane point sets. Inf. Process. Lett. 111(12): 591-594 (2011) - [c8]Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr:
On k-Gons and k-Holes in Point Sets. CCCG 2011 - [c7]Ruy Fabila Monroy, Clemens Huemer
Covering Islands in Plane Point Sets. EGC 2011: 220-225 - 2010
- [j18]Oswin Aichholzer, Sergio Cabello
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - [j17]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) - [j16]Oswin Aichholzer, Thomas Hackl, Clemens Huemer
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. SIAM J. Discret. Math. 23(4): 2147-2155 (2010)
2000 – 2009
- 2009
- [j15]Oswin Aichholzer
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j14]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On triconnected and cubic plane graphs on given point sets. Comput. Geom. 42(9): 913-922 (2009) - [j13]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer
Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009) - [j12]Clemens Huemer
Gray codes for non-crossing partitions and dissections of a convex polygon. Discret. Appl. Math. 157(7): 1509-1520 (2009) - [j11]Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood
On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. 11(2): 47-56 (2009) - [c6]Lali Barrière, Clemens Huemer
4-Labelings and Grid Embeddings of Plane Quadrangulations. GD 2009: 413-414 - 2008
- [j10]Oswin Aichholzer
Matching edges and faces in polygonal partitions. Comput. Geom. 39(2): 134-141 (2008) - [j9]Oswin Aichholzer
Triangulations without pointed spanning trees. Comput. Geom. 40(1): 79-83 (2008) - [j8]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j7]Clemens Huemer
The rotation graph of k. Inf. Process. Lett. 109(2): 124-129 (2008) - [c5]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Triangles. CCCG 2008 - 2007
- [j6]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
Connecting colored point sets. Discret. Appl. Math. 155(3): 271-278 (2007) - [j5]Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On embedding triconnected cubic graphs on point sets. Electron. Notes Discret. Math. 29: 531-538 (2007) - [j4]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer
Gray Code Enumeration of Plane Straight-Line Graphs. Graphs Comb. 23(5): 467-479 (2007) - [j3]Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. Graphs Comb. 23(5): 481-507 (2007) - [j2]Oswin Aichholzer, Thomas Hackl, Clemens Huemer
On the Number of Plane Geometric Graphs. Graphs Comb. 23(Supplement-1): 67-84 (2007) - [c4]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer
Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469 - [i3]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos
Maximizing Maximal Angles for Plane Straight-Line Graphs. CoRR abs/0705.3820 (2007) - 2006
- [j1]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer
Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97(1): 19-22 (2006) - [c3]Oswin Aichholzer
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. MFCS 2006: 86-97 - [c2]Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser:
On the number of plane graphs. SODA 2006: 504-513 - 2005
- [c1]Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching Edges and Faces in Polygonal Partitions. CCCG 2005: 126-129 - [i2]Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. EuroCG 2005: 81-84 - [i1]Oswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth:
On pseudo-convex decompositions, partitions, and coverings. EuroCG 2005: 89-92
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-10-23 20:30 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: