Franz Höfting

According to our database, Franz Höfting authored at least 7 papers between 1992 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

Polynomial-Time Analysis of Toroidal Periodic Graphs.

Franz Höfting, Egon Wanke

J. Algorithms, 2000

1995

Algorithmen und Komplexitätsanalyse für die Verarbeitung kompakter Beschreibungen gitterstrukturierter Graphen.

Franz Höfting

PhD thesis, 1995

Minimum Cost Paths in Periodic Graphs.

Franz Höfting, Egon Wanke

SIAM J. Comput., 1995

1994

Polynomial Time Analysis of Torodial Periodic Graphs.

Franz Höfting, Egon Wanke

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms.

Franz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann

Proceedings of the STACS 93, 1993

Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs.

Franz Höfting, Egon Wanke

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

Processing of Hierarchically Defined Graphs and Graph Families.

Franz Höfting, Thomas Lengauer, Egon Wanke

Proceedings of the Data Structures and Efficient Algorithms, 1992