default search action
Alexander Pilz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j38]Stefan Felsner, Alexander Pilz, Patrick Schnider
:
Arrangements of Approaching Pseudo-Lines. Discret. Comput. Geom. 67(2): 380-402 (2022) - [j37]Oswin Aichholzer
On Compatible Matchings. J. Graph Algorithms Appl. 26(2): 225-240 (2022) - [i28]Alfredo García, Alexander Pilz, Javier Tejel
On Plane Subgraphs of Complete Topological Drawings. CoRR abs/2209.03072 (2022) - [i27]Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber:
Blocking Delaunay Triangulations from the Exterior. CoRR abs/2210.12015 (2022) - 2021
- [j36]Alfredo García Olaverri, Javier Tejel Altarriba
On plane subgraphs of complete topological drawings. Ars Math. Contemp. 20(1): 69-87 (2021) - [j35]Alexander Pilz, Patrick Schnider
Bisecting three classes of lines. Comput. Geom. 98: 101775 (2021) - [c24]Oswin Aichholzer
On Compatible Matchings. WALCOM 2021: 221-233 - [i26]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. CoRR abs/2101.03928 (2021) - 2020
- [j34]Alexander Pilz, Emo Welzl, Manuel Wettstein
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Discret. Comput. Geom. 64(3): 1067-1097 (2020) - [j33]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth
Transition operations over plane trees. Discret. Math. 343(8): 111929 (2020) - [j32]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [c23]Alexander Pilz, Jonathan Rollin
Augmenting Geometric Graphs with Matchings. GD 2020: 490-504 - [i25]Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. CoRR abs/2001.08419 (2020) - [i24]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. CoRR abs/2008.08413 (2020)
2010 – 2019
- 2019
- [j31]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber:
Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom. 82: 1-15 (2019) - [j30]Clemens Huemer
A new lower bound on the maximum number of plane graphs using production matrices. Comput. Geom. 84: 36-49 (2019) - [j29]Alexander Pilz:
Planar 3-SAT with a Clause/Variable Cycle. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j28]Alexander Pilz
Convex Quadrangulations of Bichromatic Point Sets. Int. J. Comput. Geom. Appl. 29(4): 289-299 (2019) - [c22]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [i23]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) - [i22]Luis Barba, Alexander Pilz, Patrick Schnider
Sharing a pizza: bisecting masses with two cuts. CoRR abs/1904.02502 (2019) - [i21]Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf:
Switches in Eulerian graphs. CoRR abs/1905.06895 (2019) - [i20]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. CoRR abs/1908.05124 (2019) - [i19]Alexander Pilz, Patrick Schnider:
Bisecting three classes of lines. CoRR abs/1909.04419 (2019) - 2018
- [j27]Stefan Felsner, Alexander Pilz
Ham-Sandwich Cuts for Abstract Order Types. Algorithmica 80(1): 234-257 (2018) - [j26]Oswin Aichholzer
Linear transformation distance for bichromatic matchings. Comput. Geom. 68: 77-88 (2018) - [j25]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell
The dual diameter of triangulations. Comput. Geom. 68: 243-252 (2018) - [j24]Oswin Aichholzer
Holes in 2-convex point sets. Comput. Geom. 74: 38-49 (2018) - [j23]Alexander Pilz
Order on Order Types. Discret. Comput. Geom. 59(4): 886-922 (2018) - [c21]Alexander Pilz, Patrick Schnider
Extending the Centerpoint Theorem to Multiple Points. ISAAC 2018: 53:1-53:13 - [c20]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan
Transition Operations over Plane Trees. LATIN 2018: 835-848 - [c19]Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz:
Convex Hulls in Polygonal Domains. SWAT 2018: 8:1-8:13 - [c18]Alexander Pilz:
Planar 3-SAT with a Clause/Variable Cycle. SWAT 2018: 31:1-31:13 - [i18]Alexander Pilz:
A Note on the Flip Distance Problem for Edge-Labeled Triangulations. CoRR abs/1808.03126 (2018) - [i17]Alexander Pilz, Patrick Schnider:
Extending the centerpoint theorem to multiple points. CoRR abs/1810.10231 (2018) - [i16]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. CoRR abs/1812.01595 (2018) - 2017
- [j22]Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz:
Induced Ramsey-Type Results and Binary Predicates for Point Sets. Electron. J. Comb. 24(4): 4 (2017) - [j21]Martin Balko
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61: 77-83 (2017) - [j20]Clemens Huemer
Characteristic polynomials of production matrices for geometric graphs. Electron. Notes Discret. Math. 61: 631-637 (2017) - [j19]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 27(1-2): 57-84 (2017) - [j18]Oswin Aichholzer
Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. 124: 35-41 (2017) - [c17]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. SoCG 2017: 54:1-54:16 - [c16]Oswin Aichholzer
Holes in 2-Convex Point Sets. IWOCA 2017: 169-181 - [i15]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Graphs in Complete Geometric Graphs. CoRR abs/1703.05863 (2017) - [i14]Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CoRR abs/1707.05440 (2017) - [i13]Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic Order Types. CoRR abs/1708.06064 (2017) - [i12]Alexander Pilz:
Planar 3-SAT with a Clause/Variable Cycle. CoRR abs/1710.07476 (2017) - 2016
- [j17]Clemens Huemer
Production matrices for geometric graphs. Electron. Notes Discret. Math. 54: 301-306 (2016) - [c15]Oswin Aichholzer
An Improved Lower Bound on the Minimum Number of Triangulations. SoCG 2016: 7:1-7:16 - [c14]Oswin Aichholzer
Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC 2016: 9:1-9:12 - 2015
- [j16]José Miguel Díaz-Báñez
New results on stabbing segments with a polygon. Comput. Geom. 48(1): 14-29 (2015) - [j15]Oswin Aichholzer, Wolfgang Mulzer
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. Discret. Comput. Geom. 54(2): 368-389 (2015) - [j14]Oswin Aichholzer
Empty Triangles in Good Drawings of the Complete Graph. Graphs Comb. 31(2): 335-345 (2015) - [j13]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. 25(4): 283-298 (2015) - [j12]Oswin Aichholzer
Monotone Simultaneous Embeddings of Upward Planar Digraphs. J. Graph Algorithms Appl. 19(1): 87-110 (2015) - [c13]Alexander Pilz
Order on Order Types. SoCG 2015: 285-299 - [c12]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. ISAAC 2015: 505-516 - [i11]Stefan Felsner, Alexander Pilz:
Ham-Sandwich Cuts for Abstract Order Types. CoRR abs/1503.02970 (2015) - [i10]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
The Dual Diameter of Triangulations. CoRR abs/1503.08518 (2015) - [i9]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. CoRR abs/1507.08080 (2015) - 2014
- [j11]Oswin Aichholzer
Geodesic Order Types. Algorithmica 70(1): 112-128 (2014) - [j10]Oswin Aichholzer
Reprint of: Extreme point and halving edge search in abstract order types. Comput. Geom. 47(3): 518-526 (2014) - [j9]Alexander Pilz
Flip distance between triangulations of a planar point set is APX-hard. Comput. Geom. 47(5): 589-604 (2014) - [j8]Oswin Aichholzer
Lower bounds for the number of small convex k-holes. Comput. Geom. 47(5): 605-613 (2014) - [j7]Oswin Aichholzer
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - [j6]Oswin Aichholzer
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [j5]Oswin Aichholzer
Plane Graphs with Parity Constraints. Graphs Comb. 30(1): 47-69 (2014) - [j4]Oswin Aichholzer
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four. Int. J. Comput. Geom. Appl. 24(3): 197-224 (2014) - [j3]Oswin Aichholzer
Geodesic-Preserving Polygon Simplification. Int. J. Comput. Geom. Appl. 24(4): 307-324 (2014) - [c11]Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl:
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CCCG 2014 - [c10]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz
Linear transformation distance for bichromatic matchings. SoCG 2014: 154 - [c9]Stefan Felsner, Alexander Pilz
Ham-Sandwich Cuts for Abstract Order Types. ISAAC 2014: 726-737 - 2013
- [j2]Oswin Aichholzer
Blocking Delaunay triangulations. Comput. Geom. 46(2): 154-159 (2013) - [j1]Oswin Aichholzer
Extreme point and halving edge search in abstract order types. Comput. Geom. 46(8): 970-978 (2013) - [c8]Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl:
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG 2013 - [c7]José Miguel Díaz-Báñez
New Results on Stabbing Segments with a Polygon. CIAC 2013: 146-157 - [c6]Oswin Aichholzer, Wolfgang Mulzer
Flip Distance between Triangulations of a Simple Polygon is NP-Complete. ESA 2013: 13-24 - [c5]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz
Geodesic-Preserving Polygon Simplification. ISAAC 2013: 11-21 - [i8]Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Pedro A. Ramos, Vera Sacristán, Birgit Vogtenhuber:
Empty triangles in good drawings of the complete graph. CoRR abs/1306.5081 (2013) - [i7]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic-Preserving Polygon Simplification. CoRR abs/1309.3858 (2013) - [i6]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) - [i5]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber:
Monotone Simultaneous Embedding of Directed Paths. CoRR abs/1310.6955 (2013) - [i4]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. CoRR abs/1312.0884 (2013) - 2012
- [c4]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 - [c3]Oswin Aichholzer, Matias Korman, Alexander Pilz
Geodesic Order Types. COCOON 2012: 216-227 - [i3]Alexander Pilz:
Flip Distance Between Triangulations of a Planar Point Set is NP-Complete. CoRR abs/1206.3179 (2012) - [i2]Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. CoRR abs/1209.0579 (2012) - [i1]José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira:
New results on stabbing segments with a polygon. CoRR abs/1211.1490 (2012) - 2010
- [c2]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber:
Blocking delaunay triangulations. CCCG 2010: 21-24
2000 – 2009
- 2009
- [c1]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz
Plane Graphs with Parity Constraints. WADS 2009: 13-24
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-08-05 21:20 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: