A Combinatorial Rearrangement Problem with Implications to the Embedding of Graphs. - Heinrich Müller; Stephan Abramowski (WG, 1983)

Visible surface calculation for complex unstructured polygonal scences. - Heinrich Müller; Alfred Schmitt; Stephan Abramowski (Computing, 1985)

Searching Connected Components in Very Large Grid Graphs. - Stephan Abramowski; Heinrich Müller (WG, 1986)

Collision Avoidance for Nonrigid Objects. - Stephan Abramowski (Workshop on Computational Geometry, 1988)

Moving Regular k-Gons in Contact. - Stephan Abramowski; Bruno Lang; Heinrich Müller (WG, 1988)

Collision avoidance for nonrigid objects. - Stephan Abramowski; Heinrich Müller (ZOR Methods Model. Oper. Res., 1988)

Exakte Algorithmen zur Bewegung gelenkgekoppelter Objekte zwischen festen Hindernissen. - Stephan Abramowski (1989)

Digitale Netze in Wohnungen - Unterhaltungselektronik im Umbruch. - Stephan Abramowski; Heribert Baldus; Tobias Helbig (Kommunikation in Verteilten Systemen, 1999)