Oswin Aichholzer

From MaRDI portal
Person:170468

Available identifiers

zbMath Open aichholzer.oswinWikidataQ101815499 ScholiaQ101815499MaRDI QIDQ170468

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61247622024-04-02Paper
https://portal.mardi4nfdi.de/entity/Q62046592024-04-02Paper
Perfect matchings with crossings2024-03-25Paper
Straight skeletons for general polygonal figures in the plane2024-01-29Paper
Twisted ways to find plane structures in simple drawings of complete graphs2024-01-09Paper
Flipping plane spanning paths2023-11-24Paper
Compatible spanning trees in simple drawings of \(K_n\)2023-08-16Paper
Shooting stars in simple drawings of \(K_{m,n}\)2023-08-16Paper
Disjoint compatibility via graph classes2023-05-05Paper
Graphs with large total angular resolution2023-01-05Paper
Drawing graphs as spanners2022-12-21Paper
On Compatible Matchings2022-11-14Paper
Geometric dominating sets -- a minimum version of the no-three-in-line problem2022-10-06Paper
Drawing graphs as spanners2022-09-16Paper
Perfect matchings with crossings2022-08-30Paper
On crossing-families in planar point sets2022-06-13Paper
On compatible matchings2021-10-04Paper
Flip distances between graph orientations2021-02-01Paper
Folding polyominoes with holes into a cube2021-01-07Paper
Graphs with large total angular resolution2020-10-26Paper
On the 2-colored crossing number2020-10-26Paper
On the edge-vertex ratio of maximal thrackles2020-10-26Paper
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants2020-09-04Paper
A superlinear lower bound on the number of 5-holes2020-03-20Paper
Flip distances between graph orientations2020-02-24Paper
Packing plane spanning graphs with short edges in complete geometric graphs2019-10-25Paper
Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings2019-01-11Paper
Folding Polyominoes into (Poly)Cubes2018-11-26Paper
On the crossing number of complete graphs2018-11-23Paper
Quickest paths, straight skeletons, and the city Voronoi diagram2018-11-23Paper
Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)2018-11-19Paper
Bishellable drawings of $K_n$2018-11-19Paper
Holes in 2-convex point sets2018-10-31Paper
A superlinear lower bound on the number of 5-holes2018-08-13Paper
Holes in 2-convex point sets2018-06-15Paper
Linear transformation distance for bichromatic matchings2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46364912018-04-19Paper
Computing balanced islands in two colored point sets in the plane2018-04-05Paper
Linear transformation distance for bichromatic matchings2018-02-19Paper
Modem illumination of monotone polygons2018-02-19Paper
https://portal.mardi4nfdi.de/entity/Q31328392018-01-30Paper
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings2017-10-20Paper
Abstract order type extension and new results on the rectilinear crossing number2017-10-20Paper
Divide-and-conquer for Voronoi diagrams revisited2017-10-20Paper
Enumerating order types for small sets with applications2017-09-29Paper
Spatial embedding of pseudo-triangulations2017-09-29Paper
Packing plane spanning trees and paths in complete geometric graphs2017-06-13Paper
Reconstructing Point Set Order Types from Radial Orderings2017-05-19Paper
Representing Directed Trees as Straight Skeletons2017-02-10Paper
A Note on the Number of General 4-holes in (Perturbed) Grids2017-02-01Paper
New results on MWT subgraphs2016-06-16Paper
Geometric achromatic and pseudoachromatic indices2016-06-13Paper
3-Colorability of Pseudo-Triangulations2016-03-14Paper
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings2016-01-11Paper
Embedding Four-directional Paths on Convex Point Sets2016-01-07Paper
On \(k\)-gons and \(k\)-holes in point sets2015-12-30Paper
Flip distance between triangulations of a simple polygon is NP-complete2015-12-02Paper
Reconstructing Point Set Order Typesfrom Radial Orderings2015-09-11Paper
GEODESIC-PRESERVING POLYGON SIMPLIFICATION2015-07-01Paper
Empty triangles in good drawings of the complete graph2015-05-22Paper
Reprint of: Theta-3 is connected2015-04-27Paper
FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR2015-04-22Paper
Disjoint compatibility graph of non-crossing matchings of points in convex position2015-03-19Paper
Monotone Simultaneous Embeddings of Upward Planar Digraphs2015-03-04Paper
https://portal.mardi4nfdi.de/entity/Q51731632015-02-09Paper
Shellable drawings and the cylindrical crossing number of \(K_n\)2015-02-03Paper
Triangulations with Circular Arcs2015-01-27Paper
Geodesic order types2015-01-19Paper
Embedding Four-Directional Paths on Convex Point Sets2015-01-07Paper
Theta-3 is connected2014-08-13Paper
The 2-page crossing number of K n2014-08-07Paper
Empty monochromatic simplices2014-07-04Paper
On \(k\)-convex point sets2014-06-27Paper
4-holes in point sets2014-05-19Paper
https://portal.mardi4nfdi.de/entity/Q54124722014-04-25Paper
Lower bounds for the number of small convex \(k\)-holes2014-04-09Paper
Flip graphs of bounded degree triangulations2014-02-14Paper
Reprint of: Extreme point and halving edge search in abstract order types2014-01-22Paper
Geodesic-Preserving Polygon Simplification2014-01-14Paper
https://portal.mardi4nfdi.de/entity/Q28574032013-11-01Paper
Flip Graphs of Bounded-Degree Triangulations2013-10-10Paper
Flip distance between triangulations of a simple polygon is NP-complete2013-09-17Paper
The 2-page crossing number of \(K_{n}\)2013-08-05Paper
Extreme point and halving edge search in abstract order types2013-07-31Paper
Compatible Geometric Matchings2013-06-28Paper
Shape spaces via medial axis transforms for segmentation of complex geometry in 3D voxel data2013-06-12Paper
Extremal antipodal polygons and polytopes2013-01-28Paper
On 5-Gons and 5-Holes2013-01-07Paper
Convexifying Monotone Polygons while Maintaining Internal Visibility2013-01-07Paper
Blocking Delaunay triangulations2012-12-04Paper
Geodesic Order Types2012-09-25Paper
Pointed drawings of planar graphs2012-09-21Paper
On \(k\)-convex polygons2012-06-13Paper
Triangulations with Circular Arcs2012-03-09Paper
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics2012-01-13Paper
Exact Medial Axis Computation for Circular Arc Boundaries2012-01-13Paper
COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION2011-06-17Paper
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons2010-12-03Paper
Divide-and-conquer for Voronoi diagrams revisited2010-09-02Paper
On the number of plane graphs2010-08-16Paper
Einführung in die angewandte Geometrie2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35754702010-07-27Paper
Algorithms and Data Structures2010-04-20Paper
Algorithms and Data Structures2010-04-20Paper
Discrete and Computational Geometry2010-02-05Paper
Transforming spanning trees and pseudo-triangulations2009-12-18Paper
New results on lower bounds for the number of \((\leq k)\)-facets2009-11-30Paper
Empty monochromatic triangles2009-08-14Paper
Compatible geometric matchings2009-07-27Paper
On minimum weight pseudo-triangulations2009-07-27Paper
https://portal.mardi4nfdi.de/entity/Q36258342009-05-22Paper
Computational and Structural Advantages of Circular Boundary Representation2009-02-17Paper
Improved upper bounds on the reflexivity of point sets2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015502009-02-10Paper
New results on lower bounds for the number of (⩽ k)-facets2008-06-05Paper
Triangulations without pointed spanning trees2008-03-26Paper
On the number of pseudo-triangulations of certain point sets2008-03-06Paper
Pre-triangulations and liftable complexes2008-02-18Paper
Gray code enumeration of plane straight-line graphs2007-12-10Paper
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles2007-12-10Paper
New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)2007-10-11Paper
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles2007-09-05Paper
On the number of plane geometric graphs2007-07-19Paper
A quadratic distance bound on sliding between crossing-free spanning trees2007-06-04Paper
Abstract order type extension and new results on the rectilinear crossing number2007-03-12Paper
Connecting colored point sets2007-03-02Paper
On the crossing number of complete graphs2006-03-02Paper
Games on triangulations2005-10-26Paper
ON FLIPS IN POLYHEDRAL SURFACES2005-06-22Paper
A lower bound on the number of triangulations of planar point sets2004-10-01Paper
Convexity minimizes pseudo-triangulations2004-08-06Paper
Quickest paths, straight skeletons, and the city Voronoi diagram2004-03-11Paper
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip2004-01-08Paper
Towards compatible triangulations.2003-08-17Paper
Long proteins with unique optimal foldings in the H-P model2003-05-19Paper
Flipturning Polygons2003-03-17Paper
Enumerating order types for small point sets with applications2003-03-11Paper
https://portal.mardi4nfdi.de/entity/Q45513522002-09-05Paper
Sequences of spanning trees and a fixed tree theorem2002-09-03Paper
Reconfiguring convex polygons2002-01-14Paper
Constant-level greedy triangulations approximate the MWT well2001-11-06Paper
Generalized self-approaching curves2001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q45189842000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45092052000-10-11Paper
https://portal.mardi4nfdi.de/entity/Q49422632000-05-11Paper
SKEW VORONOI DIAGRAMS2000-05-07Paper
Matching Shapes with a Reference Point1998-03-16Paper
Triangulations intersect nicely1997-02-18Paper
Classifying Hyperplanes in Hypercubes1996-09-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Oswin Aichholzer