Jörg Vogel

According to our database, Jörg Vogel authored at least 20 papers between 1984 and 2007.

Collaborative distances:

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

2007

Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2).

Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König

LOG IN, 2007

Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1).

Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König

LOG IN, 2007

Monotonicity of Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 2007

2005

The complexity of Kemeny elections.

Edith Hemaspaandra, Holger Spakowski, Jörg Vogel

Theor. Comput. Sci., 2005

2003

Exact Complexity of the Winner Problem for Young Elections.

Jörg Rothe, Holger Spakowski, Jörg Vogel

Theory Comput. Syst., 2003

2002

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph.

Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel

Inf. Comput., 2002

Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections.

Jörg Rothe, Holger Spakowski, Jörg Vogel

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2000

Theta₂^p-Completeness: A Classical Approach for New Results.

Holger Spakowski, Jörg Vogel

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

On Monotonic Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 1999

The Operators minCh and maxCh on the Polynomial Hierarchy.

Holger Spakowski, Jörg Vogel

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Different Types of Monotonicity for Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Monotonic Rewriting Automata with a Restart Operation.

Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Deleting Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the New Trends in Formal Languages, 1997

1996

Restarting Automata with Rewriting.

Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995

Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Restarting Automata, Marcus Grammars and Context-Free Languages.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the Developments in Language Theory II, 1995

1985

Two-Way Automata with More than one Storage Medium.

Jörg Vogel, Klaus W. Wagner

Theor. Comput. Sci., 1985

A note on the Chomsky hierarchy.

Michal P. Chytil, Martin Plátek, Jörg Vogel

Bull. EATCS, 1985

1984

Zum Berechnungsvermögen von Automaten mit Checking-Stack-Bändern.

Jörg Vogel

PhD thesis, 1984