Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Huber 0001
Person information
- affiliation: Institute of Science and Technology, Klosterneuburg, Austria
- affiliation: University of Salzburg, Department of Mathematics
Other persons with the same name
- Stefan Huber — disambiguation page
- Stefan Huber 0002 — Knowledge Media Research Center, Tübingen, Germany
- Stefan Huber 0003 — Pierre and Marie Curie University, France
- Stefan Huber 0004 — Siemens AG, Vienna, Austria
- Stefan Huber 0005
![[0000-0001-7229-9740]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7229-9740")
— University of Applied Sciences Kufstein, Austria - Stefan Huber 0006 — University of Hildesheim, Department of Psychology, Germany
- Stefan Huber 0007 — Technical University of Munich, Department of Mathematics, Institute for Advanced Study, Garching, Germany
- Stefan Huber 0008 — Technical University Dresden, Institute of Transport Planning and Road Traffic, Faculty of Transport and Traffic Science, Germany
- Stefan Huber 0009 — Salzburg University of Applied Sciences, Josef Ressel Centre for Intelligent and Secure Industrial Automation, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j8]Therese Biedl, Stefan Huber, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. Int. J. Comput. Geom. Appl. 26(3-4): 211- (2016)- 2015
- [j7]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Weighted straight skeletons in the plane. Comput. Geom. 48(2): 120-133 (2015) - [j6]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Reprint of: Weighted straight skeletons in the plane. Comput. Geom. 48(5): 429-442 (2015) - [j5]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Inf. Process. Lett. 115(2): 243-247 (2015) - [c14]Jan Reininghaus, Stefan Huber, Ulrich Bauer, Roland Kwitt:
A stable multi-scale kernel for topological machine learning. CVPR 2015: 4741-4748 - [c13]Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber:
Representing Directed Trees as Straight Skeletons. GD 2015: 335-347 - [c12]Roland Kwitt, Stefan Huber, Marc Niethammer, Weili Lin, Ulrich Bauer:
Statistical Topological Data Analysis - A Kernel Perspective. NIPS 2015: 3070-3078 - [i2]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
- [j4]Stefan Huber, Martin Held, Peter Meerwald, Roland Kwitt:
Topology-Preserving Watermarking of Vector Graphics. Int. J. Comput. Geom. Appl. 24(1): 61- (2014) - [c11]Stefan Huber, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber:
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions. CCCG 2014 - [c10]Therese Biedl, Stefan Huber, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. ISAAC 2014: 117-127 - [i1]Jan Reininghaus, Stefan Huber, Ulrich Bauer, Roland Kwitt:
A Stable Multi-Scale Kernel for Topological Machine Learning. CoRR abs/1412.6821 (2014) - 2013
- [c9]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Weighted Straight Skeletons In The Plane. CCCG 2013 - [c8]Therese Biedl, Martin Held, Stefan Huber:
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. ISVD 2013: 37-46 - 2012
- [b1]Stefan Huber:
Computing Straight Skeletons and Motorcycle Graphs: Theory and Practice. University of Salzburg, Shaker 2012, ISBN 978-3-8440-0938-5, pp. 1-136 - [j3]Stefan Huber, Martin Held:
A Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs. Int. J. Comput. Geom. Appl. 22(5): 471- (2012) - [c7]Willi Mann, Martin Held, Stefan Huber:
Computing Motorcycle Graphs Based on Kinetic Triangulations. CCCG 2012: 179-184 - [c6]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 - [c5]Peter Palfrader, Martin Held, Stefan Huber:
On Computing Straight Skeletons by Means of Kinetic Triangulations. ESA 2012: 766-777 - 2011
- [j2]Stefan Huber, Martin Held:
Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation. ACM J. Exp. Algorithmics 16 (2011) - [c4]Stefan Huber, Martin Held:
Approximating a Motorcycle Graph by a Straight Skeleton. CCCG 2011 - [c3]Stefan Huber, Martin Held:
Theoretical and practical results on straight skeletons of planar straight-line graphs. SCG 2011: 171-178 - 2010
- [c2]Stefan Huber, Martin Held:
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs. CCCG 2010: 187-190 - [c1]Stefan Huber, Roland Kwitt, Peter Meerwald, Martin Held, Andreas Uhl:
Watermarking of 2D vector graphics with distortion constraint. ICME 2010: 480-485
2000 – 2009
- 2009
- [j1]Martin Held, Stefan Huber:
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments. Comput. Aided Des. 41(5): 327-338 (2009)
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-04-21 16:53 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:
