Zum Berechnungsvermögen von Automaten mit Checking-Stack-Bändern. - Jörg Vogel 001 (1984)

A note on the Chomsky hierarchy. - Michal P. Chytil; Martin Plátek; Jörg Vogel 001 (Bull. EATCS, 1985)

Two-Way Automata with More than one Storage Medium. - Jörg Vogel 001; Klaus W. Wagner (Theor. Comput. Sci., 1985)

Restarting Automata, Marcus Grammars and Context-Free Languages. - Petr Jancar; Frantisek Mráz; Martin Plátek; Martin Procházka; Jörg Vogel 001 (Developments in Language Theory, 1995)

Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (FCT, 1995)

Restarting Automata with Rewriting. - Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (SOFSEM, 1996)

On Restarting Automata with Rewriting. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (New Trends in Formal Languages, 1997)

Deleting Automata with a Restart Operation. - Petr Jancar; Frantisek Mráz; Martin Plátek; Martin Procházka; Jörg Vogel 001 (Developments in Language Theory, 1997)

Monotonic Rewriting Automata with a Restart Operation. - Frantisek Mráz; Martin Plátek; Petr Jancar; Jörg Vogel 001 (SOFSEM, 1997)

Different Types of Monotonicity for Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (FSTTCS, 1998)

The Operators minCh and maxCh on the Polynomial Hierarchy. - Holger Spakowski; Jörg Vogel 001 (FCT, 1999)

On Monotonic Automata with a Restart Operation. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (J. Autom. Lang. Comb., 1999)

Theta2p-Completeness: A Classical Approach for New Results. - Holger Spakowski; Jörg Vogel 001 (FSTTCS, 2000)

Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. - Jörg Rothe; Holger Spakowski; Jörg Vogel 001 (IFIP TCS, 2002)

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. - Richard Beigel; Lane A. Hemaspaandra; Harald Hempel; Jörg Vogel 001 (Inf. Comput., 2002)

Exact Complexity of the Winner Problem for Young Elections. - Jörg Rothe; Holger Spakowski; Jörg Vogel 001 (Theory Comput. Syst., 2003)

The complexity of Kemeny elections. - Edith Hemaspaandra; Holger Spakowski; Jörg Vogel 001 (Theor. Comput. Sci., 2005)

Monotonicity of Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (J. Autom. Lang. Comb., 2007)

Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1). - Rolf Niedermeier; Jörg Vogel 001; Michael Fothe; Mirko König (LOG IN, 2007)

Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2). - Rolf Niedermeier; Jörg Vogel 001; Michael Fothe; Mirko König (LOG IN, 2007)