Parallel Dictionaries in 2-3 Trees. - Wolfgang J. Paul; Uzi Vishkin; Hubert Wagener (ICALP, 1983)

Parallel Computation on 2-3-Trees. - Wolfgang J. Paul; Uzi Vishkin; Hubert Wagener (RAIRO Theor. Informatics Appl., 1983)

Parallel computational geometry - exploiting polygonal order for maximally parallel algorithms. - Hubert Wagener (1986)

Triangulating a Monotone Polygon in Parallel. - Hubert Wagener (Workshop on Computational Geometry, 1988)

On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. - Hubert Wagener (CSL, 1988)

Congruence, Similarity, and Symmetries of Geometric Objects. - Helmut Alt; Kurt Mehlhorn; Hubert Wagener; Emo Welzl (Discret. Comput. Geom., 1988)

Approximation of Polygons by Rechtangles and Circles. - Helmut Alt; Hubert Wagener (Bull. EATCS, 1988)

Approximation of Convex Polygons. - Helmut Alt; Johannes Blömer; Hubert Wagener (ICALP, 1990)

An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. - Mikhail J. Atallah; Danny Z. Chen; Hubert Wagener (J. ACM, 1991)

Optimal Parallel Hull Construction for Simple Polygons in calO(log log n) Time - Hubert Wagener (FOCS, 1992)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (SWAT, 1994)

The Complexity of Systolic Dissemination of Information in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener; Dana Pardubská (RAIRO Theor. Informatics Appl., 1994)

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Walter Unger; Juraj Waczulík; Hubert Wagener (FCT, 1995)

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Krzysztof Lorys; Przemyslawa Kanarek; Ralf Klasing; Walter Unger; Hubert Wagener (STACS, 1995)

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr; Hubert Wagener (Inf. Comput., 1995)

Translation queries for sets of polygons. - Mark de Berg; Hazel Everett; Hubert Wagener (Int. J. Comput. Geom. Appl., 1995)

Rendering Gestures as Line Drawings. - Frank Godenschweger; Thomas Strothotte; Hubert Wagener (Gesture Workshop, 1997)

Holographic imaging of lines: a texture based approach. - Alf Ritter; Oliver Deussen; Hubert Wagener; Thomas Strothotte (IV, 1997)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (Inf. Comput., 1997)

Effective Systolic Algorithms for Gossiping in Cycles. - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Juraj Waczulík; Hubert Wagener (Parallel Process. Lett., 1998)

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Przemyslawa Kanarek; Ralf Klasing; Krzysztof Lorys; Walter Unger; Hubert Wagener (SIAM J. Discret. Math., 2009)