default search action
Thomas Hackl
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
- [j43]Thomas Hackl
, Mathias Poik
Single-Harmonic Response Open-Loop Kelvin-Probe Force Microscopy. IEEE Trans. Instrum. Meas. 73: 1-7 (2024) - 2023
- [j42]Thomas Hackl
Heterodyne AC Kelvin Probe Force Microscopy for Nanoscale Surface Potential Imaging in Liquids. IEEE Trans. Instrum. Meas. 72: 1-8 (2023) - [j41]Mathias Poik
Model-Based RF Sensing for Contactless High-Resolution Voltage Measurements. IEEE Trans. Instrum. Meas. 72: 1-8 (2023) - [c36]Thomas Hackl, Mathias Poik, Georg Schitter:
Quantitative Surface Potential Measurements by AC Electrostatic Force Microscopy. I2MTC 2023: 1-5 - [c35]Mathias Poik, Thomas Hackl, Stefano Di Martino, Martin Schober, Jin Dang, Georg Schitter:
Analysis of Cross-Talk Induced Measurement Errors in Model-Based RF Voltage Sensing. I2MTC 2023: 1-6 - 2022
- [c34]Thomas Hackl
Electrostatic Actuation of AFM Cantilevers in Aqueous Solutions. AIM 2022: 1538-1542 - [c33]Thomas Hackl
DC-Bias-free Surface Potential Measurements by Heterodyne AC Kelvin Probe Force Microscopy. I2MTC 2022: 1-5 - [c32]Mathias Poik, Mario Mayr, Thomas Hackl
Mechatronic Demodulation for Dynamic Atomic Force Microscopy Measurement Modes. I2MTC 2022: 1-6 - [i17]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
- [j40]Roman Martin
MOSGA: Modular Open-Source Genome Annotator. Bioinform. 36(22-23): 5514-5515 (2021) - 2020
- [j39]Oswin Aichholzer
A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173: 105236 (2020)
2010 – 2019
- 2019
- [j38]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) - 2018
- [j37]Oswin Aichholzer
Linear transformation distance for bichromatic matchings. Comput. Geom. 68: 77-88 (2018) - [j36]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem illumination of monotone polygons. Comput. Geom. 68: 101-118 (2018) - [j35]Oswin Aichholzer
Holes in 2-convex point sets. Comput. Geom. 74: 38-49 (2018) - [j34]Markus J. Ankenbrand
chloroExtractor: extraction and assembly of the chloroplast genome from whole genome shotgun data. J. Open Source Softw. 3(21): 464 (2018) - [j33]Niklas Terhoeven
reper: Genome-wide identification, classification and quantification of repetitive elements without an assembled genome. J. Open Source Softw. 3(22): 527 (2018) - 2017
- [j32]Oswin Aichholzer
Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. 124: 35-41 (2017) - [j31]Markus J. Ankenbrand
AliTV - interactive visualization of whole genome comparisons. PeerJ Comput. Sci. 3: e116 (2017) - [c31]Oswin Aichholzer
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - [c30]Oswin Aichholzer
Holes in 2-Convex Point Sets. IWOCA 2017: 169-181 - [i16]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) - [i15]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) - [i14]Markus J. Ankenbrand
AliTV-interactive visualization of whole genome comparisons. PeerJ Prepr. 5: e2348 (2017) - 2016
- [j30]Oswin Aichholzer
Geometric Achromatic and Pseudoachromatic Indices. Graphs Comb. 32(2): 431-451 (2016) - [c29]Oswin Aichholzer
An Improved Lower Bound on the Minimum Number of Triangulations. SoCG 2016: 7:1-7:16 - [c28]Oswin Aichholzer
Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC 2016: 9:1-9:12 - [i13]Markus J. Ankenbrand
AliTV-interactive visualization of whole genome comparisons. PeerJ Prepr. 4: e2348 (2016) - 2015
- [j29]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) - [j28]Oswin Aichholzer
Empty Triangles in Good Drawings of the Complete Graph. Graphs Comb. 31(2): 335-345 (2015) - [j27]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. 25(4): 283-298 (2015) - [j26]Oswin Aichholzer
Monotone Simultaneous Embeddings of Upward Planar Digraphs. J. Graph Algorithms Appl. 19(1): 87-110 (2015) - [j25]Oswin Aichholzer
Embedding Four-directional Paths on Convex Point Sets. J. Graph Algorithms Appl. 19(2): 743-759 (2015) - [c27]Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber
Representing Directed Trees as Straight Skeletons. GD 2015: 335-347 - [c26]Oswin Aichholzer
A Note on the Number of General 4-holes in (Perturbed) Grids. JCDCGG 2015: 1-12 - [i12]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber:
Modem Illumination of Monotone Polygons. CoRR abs/1503.05062 (2015) - [i11]Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber:
Representing Directed Trees as Straight Skeletons. CoRR abs/1508.01076 (2015) - 2014
- [j24]Thomas Hackl
proovread: large-scale high-accuracy PacBio correction through iterative short read consensus. Bioinform. 30(21): 3004-3011 (2014) - [j23]Oswin Aichholzer
Lower bounds for the number of small convex k-holes. Comput. Geom. 47(5): 605-613 (2014) - [j22]Oswin Aichholzer
4-Holes in point sets. Comput. Geom. 47(6): 644-650 (2014) - [j21]Oswin Aichholzer
On k-convex point sets. Comput. Geom. 47(8): 809-832 (2014) - [j20]Oswin Aichholzer
Empty Monochromatic Simplices. Discret. Comput. Geom. 51(2): 362-393 (2014) - [j19]Oswin Aichholzer
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16(3): 317-332 (2014) - [j18]Oswin Aichholzer
Plane Graphs with Parity Constraints. Graphs Comb. 30(1): 47-69 (2014) - [j17]Oswin Aichholzer
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four. Int. J. Comput. Geom. Appl. 24(3): 197-224 (2014) - [j16]Oswin Aichholzer
Geodesic-Preserving Polygon Simplification. Int. J. Comput. Geom. Appl. 24(4): 307-324 (2014) - [c25]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 - [c24]Stefan Huber, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber:
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions. CCCG 2014 - [c23]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz
Linear transformation distance for bichromatic matchings. SoCG 2014: 154 - [c22]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze
Embedding Four-Directional Paths on Convex Point Sets. GD 2014: 355-366 - [i10]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber:
Embedding Four-directional Paths on Convex Point Sets. CoRR abs/1408.4933 (2014) - [i9]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) - 2013
- [j15]Oswin Aichholzer
Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1): 17-28 (2013) - [j14]Oswin Aichholzer
Blocking Delaunay triangulations. Comput. Geom. 46(2): 154-159 (2013) - [j13]Oswin Aichholzer
Flip Graphs of Bounded Degree Triangulations. Graphs Comb. 29(6): 1577-1593 (2013) - [c21]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 - [c20]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz
Geodesic-Preserving Polygon Simplification. ISAAC 2013: 11-21 - [c19]Andrei Asinowski
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i8]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i7]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) - [i6]Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic-Preserving Polygon Simplification. CoRR abs/1309.3858 (2013) - [i5]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) - [i4]Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Alexander Pilz, Birgit Vogtenhuber:
Monotone Simultaneous Embedding of Directed Paths. CoRR abs/1310.6955 (2013) - [i3]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. CoRR abs/1312.0884 (2013) - 2012
- [c18]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 - [c17]Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber, Brian Li, Andrej Risteski:
What makes a Tree a Straight Skeleton? CCCG 2012: 253-258 - [i2]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Simplices. CoRR abs/1210.7043 (2012) - 2011
- [j12]Oswin Aichholzer
Computational and Structural Advantages of Circular Boundary Representation. Int. J. Comput. Geom. Appl. 21(1): 47-69 (2011) - [c16]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 - [c15]Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber:
On 5-Gons and 5-Holes. EGC 2011: 1-13 - 2010
- [j11]Oswin Aichholzer
Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. 43(8): 688-699 (2010) - [j10]Oswin Aichholzer, Sergio Cabello
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - [j9]Oswin Aichholzer, Thomas Hackl, Clemens Huemer
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. SIAM J. Discret. Math. 23(4): 2147-2155 (2010) - [c14]Oswin Aichholzer
Exact Medial Axis Computation for Circular Arc Boundaries. Curves and Surfaces 2010: 28-42 - [c13]Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Alexander Pilz, Pedro Ramos, Marc J. van Kreveld, Birgit Vogtenhuber:
Blocking delaunay triangulations. CCCG 2010: 21-24 - [c12]Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber:
Compatible pointed pseudo-triangulations. CCCG 2010: 91-94 - [c11]Oswin Aichholzer, Daniel Detassis, Thomas Hackl, Gerald Steinbauer, Johannes Thonhauser:
Playing Pylos with an autonomous robot. IROS 2010: 2507-2508
2000 – 2009
- 2009
- [j8]Oswin Aichholzer
Medial axis computation for planar free-form shapes. Comput. Aided Des. 41(5): 339-349 (2009) - [j7]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
On minimum weight pseudo-triangulations. Comput. Geom. 42(6-7): 627-631 (2009) - [j6]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer
Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009) - [j5]Oswin Aichholzer
Flip Graphs of Bounded-Degree Triangulations. Electron. Notes Discret. Math. 34: 509-513 (2009) - [c10]Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler
Divide-and-conquer for Voronoi diagrams revisited. SCG 2009: 189-197 - [c9]Tilmann Rabl, Andreas Lang, Thomas Hackl, Bernhard Sick
Generating Shifting Workloads to Benchmark Adaptability in Relational Database Systems. TPCTC 2009: 116-131 - [c8]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz
Plane Graphs with Parity Constraints. WADS 2009: 13-24 - 2008
- [j4]Oswin Aichholzer
Matching edges and faces in polygonal partitions. Comput. Geom. 39(2): 134-141 (2008) - [c7]Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia:
Empty Monochromatic Triangles. CCCG 2008 - 2007
- [j3]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
Connecting colored point sets. Discret. Appl. Math. 155(3): 271-278 (2007) - [j2]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl:
Pre-Triangulations and Liftable Complexes. Discret. Comput. Geom. 38(4): 701-725 (2007) - [j1]Oswin Aichholzer, Thomas Hackl, Clemens Huemer
On the Number of Plane Geometric Graphs. Graphs Comb. 23(Supplement-1): 67-84 (2007) - [c6]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations. CCCG 2007: 209-212 - [c5]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír:
Computational and Structural Advantages of Circular Boundary Representation. WADS 2007: 374-385 - [c4]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer
Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469 - [i1]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
- [c3]Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl:
Pre-triangulations and liftable complexes. SCG 2006: 282-291 - [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
Coauthor Index
[i17] [j39] [j38] [j37] [j36] [j35] [j32] [c31] [c30] [i16] [i15] [j30] [c29] [c28] [j29] [j28] [j27] [j26] [j25] [c27] [c26] [i12] [i11] [j23] [j22] [j21] [j20] [j19] [j18] [j17] [j16] [c25] [c24] [c23] [c22] [i10] [i9] [j15] [j14] [j13] [c21] [c20] [i7] [i6] [i5] [i4] [i3] [c18] [c17] [i2] [j12] [c16] [c15] [j11] [j10] [j9] [c14] [c13] [c12] [c11] [j8] [j7] [j6] [j5] [c10] [c8] [j4] [c7] [j3] [j2] [j1] [c6] [c5] [c4] [i1] [c3] [c2] [c1]
[i17] [j39] [j38] [j37] [j36] [j35] [c31] [c30] [i16] [c29] [c28] [j29] [j28] [j27] [j26] [j25] [c27] [c26] [i12] [i11] [j23] [j22] [j21] [j19] [j18] [j17] [j16] [c24] [c23] [c22] [i10] [i9] [j15] [j14] [c21] [c20] [i7] [i6] [i5] [i4] [i3] [c18] [c16] [c15] [j9] [c13] [c12] [c8] [j4] [j1] [c4] [i1] [c2] [c1]
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-06-10 21:22 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: