A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. - Hans Dietmar Gröger (FCT, 1991)

On Linear Decision Trees Computing Boolean Functions. - Hans Dietmar Gröger; György Turán (ICALP, 1991)

On the Randomized Complexity of Monotone Graph Properties. - Hans Dietmar Gröger (Acta Cybern., 1992)

Does Transitivity Help? On the Complexity of Poset Properties. - Hans Dietmar Gröger (FCT, 1993)

A Liniear lower bound for the size of threshold circuits. - Hans Dietmar Gröger; György Turán (Bull. EATCS, 1993)

A Method for Inheritance Processing in Object-Oriented Databases. - Anna Formica; Hans Dietmar Gröger; Michele Missikoff (SEBD, 1996)

Object-Oriented Database Schema Analysis and Inheritance Processing: A Graphtheoretic Approach. - Anna Formica; Hans Dietmar Gröger; Michele Missikoff (Data Knowl. Eng., 1997)

An Efficient Method for Checking Object-Oriented Database Schema Correctness. - Anna Formica; Hans Dietmar Gröger; Michele Missikoff (ACM Trans. Database Syst., 1998)