Christian Icking

According to our database1, Christian Icking
  • authored at least 41 papers between 1987 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
A novel method for providing situational awareness to longitudinal controllers in (semi-) automated vehicles.
Proceedings of the 19th IEEE International Conference on Intelligent Transportation Systems, 2016

2015
Virtual traffic lights: Managing intersections in the cloud.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

A telemetry design for anticipating train-road crossing collisions.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

2014
Weather Detection in Vehicles by Means of Camera and LIDAR Systems.
Proceedings of the Sixth International Conference on Computational Intelligence, 2014

2013
Collaborative traffic technologies and their effect on driving safety.
Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013

Cooperation and collaboration in ITS systems through geo-based addressing of road users.
Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013

Geo-Based IPv6 Multicast in LTE for Dynamic Addressing of Road Users.
Proceedings of the Fifth International Conference on Computational Intelligence, 2013

TEAM - CO2 Reduction through Online Weather Assistant for Cooperative ACC Driving.
Proceedings of the Fifth International Conference on Computational Intelligence, 2013

2010
Exploring Grid Polygons Online
CoRR, 2010

2005
Exploring Simple Grid Polygons.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput., 2004

2003
Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett., 2003

Java Applets for the Dynamic Visualization of Voronoi Diagrams.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2001
The Polygon Exploration Problem.
SIAM J. Comput., 2001

On bisectors for different distance functions.
Discrete Applied Mathematics, 2001

Generalized self-approaching curves.
Discrete Applied Mathematics, 2001

A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Smallest Color-Spanning Objects.
Proceedings of the Algorithms, 2001

2000
Exploring an Unknown Cellular Environment.
EuroCG, 2000

On the Competitive Complexity of Navigation Tasks.
Proceedings of the Sensor Based Intelligent Robots, 2000

1999
How to Find a Point on a Line Within a Fixed Distance.
Discrete Applied Mathematics, 1999

Competitive searching in a generalized street.
Comput. Geom., 1999

An Optimal Competitive Strategy for Walking in Streets.
Proceedings of the STACS 99, 1999

On Bisectors for Different Distance Functions.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

On bisectors for convex distance functions in 3-space.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Moving an Angle Around a Region.
Proceedings of the Algorithm Theory, 1998

Generalized Self-Approaching Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
A Competitive Strategy for Learning a Polygon.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1995
Convex Distance Functions in 3-Space are Different.
Fundam. Inform., 1995

Searching for the Kernel of a Polygon - A Competitive Strategy.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Competitive Strategies for Autonomous Systems.
Proceedings of the Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, 1994

Competitive Searching in a Generalized Street.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Motion and visibility in simple polygons.
PhD thesis, 1994

1993
Shortest Paths for Line Segments.
Algorithmica, 1993

Convex Distance Functions in 3-Space are Different.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

How to Look Around a Corner.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
The Two Guards Problem.
Int. J. Comput. Geometry Appl., 1992

Restricted Orientation Computational Geometry.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
The Two Guards Problem.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Binary Search Trees of Almost Optimal Height.
Acta Inf., 1990

1987
Priority Search Trees in Secondary Memory (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987


  Loading...