| A Novel Method For Providing Situational Awareness To Longitudinal Controllers In (Semi-) Automated Vehicles | 0 | 0.34 | 2016 |
| A telemetry design for anticipating train-road crossing collisions | 0 | 0.34 | 2015 |
| Virtual traffic lights: Managing intersections in the cloud | 0 | 0.34 | 2015 |
| Weather Detection in Vehicles by Means of Camera and LIDAR Systems | 2 | 0.41 | 2014 |
| TEAM -- CO2 Reduction through Online Weather Assistant for Cooperative ACC Driving | 3 | 0.61 | 2013 |
| A novel approach for the enhancement of cooperative ACC by deriving real time weather information | 0 | 0.34 | 2013 |
| Geo-Based IPv6 Multicast in LTE for Dynamic Addressing of Road Users | 1 | 0.36 | 2013 |
| Exploring Grid Polygons Online | 1 | 0.35 | 2010 |
| Exploring simple grid polygons | 9 | 0.61 | 2005 |
| An Optimal Competitive Strategy for Walking in Streets | 19 | 1.01 | 2004 |
| Java applets for the dynamic visualization of Voronoi diagrams | 4 | 0.48 | 2003 |
| The Polygon Exploration Problem | 47 | 2.08 | 2001 |
| Smallest Color-Spanning Objects | 15 | 1.06 | 2001 |
| A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D | 5 | 0.49 | 2001 |
| Generalized self-approaching curves | 10 | 1.38 | 2001 |
| Exploring an Unknown Cellular Environment | 8 | 0.63 | 2000 |
| On the Competitive Complexity of Navigation Tasks | 20 | 1.26 | 2000 |
| On bisectors for different distance functions | 13 | 0.95 | 1999 |
| On bisectors for convex distance functions in 3-space | 3 | 0.43 | 1999 |
| How to find a point on a line within a fixed distance | 11 | 0.82 | 1999 |
| Moving an Angle Around a Region | 2 | 0.49 | 1998 |
| A competitive strategy for learning a polygon | 14 | 2.02 | 1997 |
| Convex distance functions in 3-space are different | 25 | 2.38 | 1995 |
| Searching for the kernel of a polygon—a competitive strategy | 31 | 2.52 | 1995 |
| Competitive Strategies for Autonomous Systems | 16 | 1.26 | 1994 |
| Competitive searching in a generalized street | 35 | 2.35 | 1994 |
| Shortest Paths for Line Segments | 5 | 0.84 | 1993 |
| How to Look Around a Corner | 15 | 1.46 | 1993 |
| Restricted Orientation Computational Geometry | 1 | 0.36 | 1992 |
| The two guards problem | 39 | 4.44 | 1991 |
| Binary search trees of almost optimal height | 10 | 0.78 | 1990 |
