Thomas Hackl

According to our database1, Thomas Hackl authored at least 55 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A superlinear lower bound on the number of 5-holes.
J. Comb. Theory, Ser. A, 2020

2019
Packing plane spanning graphs with short edges in complete geometric graphs.
Comput. Geom., 2019

2018
reper: Genome-wide identification, classification and quantification of repetitive elements without an assembled genome.
J. Open Source Softw., 2018

chloroExtractor: extraction and assembly of the chloroplast genome from whole genome shotgun data.
J. Open Source Softw., 2018

Modem illumination of monotone polygons.
Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.
Comput. Geom., 2018

Holes in 2-convex point sets.
Comput. Geom., 2018

2017
AliTV - interactive visualization of whole genome comparisons.
PeerJ Comput. Sci., 2017

Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017

2016
Geometric Achromatic and Pseudoachromatic Indices.
Graphs Comb., 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Embedding Four-directional Paths on Convex Point Sets.
J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.
J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geom. Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.
Graphs Comb., 2015

On k-gons and k-holes in point sets.
Comput. Geom., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Representing Directed Trees as Straight Skeletons.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geom. Appl., 2014

Geodesic-Preserving Polygon Simplification.
Int. J. Comput. Geom. Appl., 2014

Plane Graphs with Parity Constraints.
Graphs Comb., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci., 2014

Empty Monochromatic Simplices.
Discret. Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014

4-Holes in point sets.
Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

<i>proovread</i>: large-scale high-accuracy PacBio correction through iterative short read consensus.
Bioinform., 2014

Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Monotone Simultaneous Embedding of Directed Paths.
CoRR, 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
What makes a Tree a Straight Skeleton?
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Computational and Structural Advantages of Circular Boundary Representation.
Int. J. Comput. Geom. Appl., 2011

On 5-Gons and 5-Holes.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.
SIAM J. Discret. Math., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010

Divide-and-conquer for Voronoi diagrams revisited.
Comput. Geom., 2010

Playing Pylos with an autonomous robot.
Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010

Compatible pointed pseudo-triangulations.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Exact Medial Axis Computation for Circular Arc Boundaries.
Proceedings of the Curves and Surfaces, 2010

2009
Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009

Empty monochromatic triangles.
Comput. Geom., 2009

On minimum weight pseudo-triangulations.
Comput. Geom., 2009

Medial axis computation for planar free-form shapes.
Comput. Aided Des., 2009

Generating Shifting Workloads to Benchmark Adaptability in Relational Database Systems.
Proceedings of the Performance Evaluation and Benchmarking, 2009

2008
Matching edges and faces in polygonal partitions.
Comput. Geom., 2008

2007
On the Number of Plane Geometric Graphs.
Graphs Comb., 2007

Pre-Triangulations and Liftable Complexes.
Discret. Comput. Geom., 2007

Connecting colored point sets.
Discret. Appl. Math., 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
On the number of plane graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006


  Loading...