Stefan Funke

Affiliations:
  • University of Stuttgart, Germany


According to our database1, Stefan Funke authored at least 109 papers between 1998 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithms for Gradual Polyline Simplification.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Smooth Building Footprint Aggregation with Alpha Shapes.
Proceedings of the Web and Wireless Geographical Information Systems, 2024

Improved Lightweight Rendering of Road Networks based on Contraction Hierarchies.
Proceedings of the 17th IEEE Pacific Visualization Conference, 2024

Parameterized Upper Bounds for Path-Consistent Hub Labeling.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Scalable Ultrafast Almost-optimal Euclidean Shortest Paths.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2022
Gradual road network simplification with shape and topology preservation.
Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

Pathfinder<sup>vis</sup>.
Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Privacy Preserving Queries of Shortest Path Distances.
Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
Sublinear search spaces for shortest path planning in grid and road networks.
J. Comb. Optim., 2021

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema.
Algorithms, 2021

Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Towards Faster Space-Efficient Shortest Path Queries (Work-in-Progress).
Proceedings of the Web and Wireless Geographical Information Systems, 2020

Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Scalable unsupervised multi-criteria trajectory segmentation and driving preference mining.
Proceedings of the BIGSPATIAL '20: Proceedings of the 9th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2020

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels.
Proceedings of the Computer Science - Theory and Applications, 2020

Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Identifying Preferred Areas in Road Networks.
Proceedings of the Web and Wireless Geographical Information Systems, 2019

PATHFINDER: Storage and Indexing of Massive Trajectory Sets.
Proceedings of the 16th International Symposium on Spatial and Temporal Databases, 2019

Improved Contraction Hierarchy Queries via Perfect Stalling.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Destination Signs in OpenStreetMap: Quality Assessment and Instrumentation for Routing.
Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 2019

A Repository of Network-Constrained Trajectory Data (Position Paper).
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data, 2019

Alternative Routes for Next Generation Traffic Shaping.
Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 2019

Parametrized Runtimes for Label Tournaments.
Proceedings of the Combinatorial Optimization and Applications, 2019

Alternative Multicriteria Routes.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Algorithms for Average Regret Minimization.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
CYCLOPS: CYCLe route options planning service.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

URAN: A Unified Data Structure for Rendering and Navigation.
Proceedings of the Web and Wireless Geographical Information Systems, 2017

Automatic Tag Enrichment for Points-of-Interest in Open Street Map.
Proceedings of the Web and Wireless Geographical Information Systems, 2017

Generating Concise and Robust Driving Directions.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Searching OSM Planet with Context-Aware Spatial Relations.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Map Simplification with Topology Constraints: Exactly and in Practice.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Growing Balls in ℝ<sup><i>d</i></sup>.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

The Simultaneous Maze Solving Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Curve Reconstruction.
Encyclopedia of Algorithms, 2016

Consistent Rounding of Edge Weights in Graphs.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Crushing Disks Efficiently.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Deducing individual driving preferences for user-aware navigation.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

Placement of Loading Stations for Electric Vehicles: Allowing Small Detours.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015
Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
J. Artif. Intell. Res., 2015

Conic nearest neighbor queries and approximate Voronoi diagrams.
Comput. Geom., 2015

OSCAR: OpenStreetMap Planet at Your Fingertips via OSm Cell ARrangements.
Proceedings of the Web Information Systems Engineering - WISE 2015, 2015

Compass-Based Navigation in Street Networks.
Proceedings of the Web and Wireless Geographical Information Systems, 2015

Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths.
Proceedings of the 2nd International Workshop on Mining Urban Data co-located with 32nd International Conference on Machine Learning (ICML 2015), 2015

Automatic Extrapolation of Missing Road Network Data in OpenStreetMap.
Proceedings of the 2nd International Workshop on Mining Urban Data co-located with 32nd International Conference on Machine Learning (ICML 2015), 2015

Personalized route planning in road networks.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

2014
On k-Path Covers and their Applications.
Proc. VLDB Endow., 2014

Energy-Efficient Routing: Taking Speed into Account.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Frontmatter, Table of Contents, Preface, Workshop Organization.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

DORC: Distributed online route computation - Higher throughput, more privacy.
Proceedings of the 2013 IEEE International Conference on Pervasive Computing and Communications Workshops, 2013

Enabling E-Mobility: Facility Location for Battery Loading Stations.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Sequenced route queries: getting things done on the way back home.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Transit Nodes - Lower Bounds and Refined Construction.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Cruising with a Battery-Powered Vehicle and Not Getting Stranded.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Energy-Efficient Paths in Radio Networks.
Algorithmica, 2011

Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours.
Ad Hoc Networks, 2011

Path shapes: an alternative method for map matching and fully autonomous self-localization.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Algorithms for Matching and Predicting Trajectories.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

Optimal Route Planning for Electric Vehicles in Large Networks.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Optimal Triangulations of Points and Segments with Steiner Points.
Int. J. Comput. Geom. Appl., 2010

2009
How much geometry it takes to reconstruct a 2-manifold in R<sup>3</sup>.
ACM J. Exp. Algorithmics, 2009

A Separation Bound for Real Algebraic Expressions.
Algorithmica, 2009

Visualizing Gene Expression Data via Voronoi Treemaps.
Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

Of What Use Is Floating-Point Arithmetic in Computational Geometry?
Proceedings of the Efficient Algorithms, 2009

2008
Energy-Aware Stage Illumination.
Int. J. Comput. Geom. Appl., 2008

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.
J. Comput. Inf. Technol., 2008

On the Locality of Extracting a 2-Manifold in .
Proceedings of the Algorithm Theory, 2008

How much Geometry it takes to Reconstruct a 2-Manifold in R3.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
Improved approximation algorithms for connected sensor cover.
Wirel. Networks, 2007

Packing a Truck - Now with a Twist!
Int. J. Comput. Geom. Appl., 2007

Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets.
Proceedings of the STACS 2007, 2007

Network sketching or: "How Much Geometry Hides in Connectivity?--Part II".
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Optimal Triangulation with Steiner Points.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Minimum-Energy Broadcast with Few Senders.
Proceedings of the Distributed Computing in Sensor Systems, 2007

In Transit to Constant Time Shortest-Path Queries in Road Networks.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Information Brokerage Via Location-Free Double Rulings.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference, 2007

2006
A simple improved distributed algorithm for minimum CDS in unit disk graphs.
ACM Trans. Sens. Networks, 2006

Power Assignment Problems in Wireless Communication
CoRR, 2006

Ultrafast Shortest-Path Queries via Transit Nodes.
Proceedings of the Shortest Path Problem, 2006

Distance-Sensitive Information Brokerage in Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2006

Hole detection or: "how much geometry hides in connectivity?".
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Approximating <i>k</i>-hop minimum-spanning trees.
Oper. Res. Lett., 2005

Finding Planar Regions in a Terrain - in Practice and with a Guarantee.
Int. J. Comput. Geom. Appl., 2005

Structural filtering: a paradigm for efficient and exact geometric programs.
Comput. Geom., 2005

Curve reconstruction from noisy samples.
Comput. Geom., 2005

Controlled perturbation for Delaunay triangulations.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Packing a trunk: now with a twist!
Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005

Topological hole detection in wireless sensor networks and its applications.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

Infrastructure-Establishment from Scratch in Wireless Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2005

2004
Point containment in the integer hull of a polyhedron.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding planar regions in a terrain: in practice and with a guarantree.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Improved Approximation Algorithms for Connected Sensor Cover.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Certifying and repairing solutions to large LPs how good are LP-solvers?
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximating Energy Efficient Paths in Wireless Multi-hop Networks.
Proceedings of the Algorithms, 2003

Packing a Trunk.
Proceedings of the Algorithms, 2003

2002
LOOK: A Lazy Object-Oriented Kernel design for geometric computation.
Comput. Geom., 2002

Smooth-surface reconstruction in near-linear time.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms.
PhD thesis, 2001

Exact Geometric Computation Using Cascading.
Int. J. Comput. Geom. Appl., 2001

Reconstructing a collection of curves with corners and endpoints.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Look - a Lazy Object-Oriented Kernel for geometric computation.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1998
Exact Geometric Predicates Using Cascaded Computation.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998


  Loading...