Frank G. Radmacher

Moving in a network under random failures: A complexity analysis

Wolfgang Thomas, Dominik Klein, Frank G. Radmacher, 2012, Sci. Comput. Program..

Connectivity games over dynamic networks

Wolfgang Thomas, Sten Grüner, Frank G. Radmacher, 2011, Theor. Comput. Sci..

The Complexity of Reachability in Randomized Sabotage Games

Wolfgang Thomas, Dominik Klein, Frank G. Radmacher, 2009, FSEN.

An Automata Theoretic Approach to Rational Tree Relations

Frank G. Radmacher, 2008, SOFSEM.

A Game-Theoretic Approach to Routing under Adversarial Conditions

James Gross, Wolfgang Thomas, Frank G. Radmacher, 2010, IFIP TCS.

Connectivity games over dynamic networks

Wolfgang Thomas, Sten Grüner, Frank G. Radmacher, 2013, Theor. Comput. Sci..

Games on dynamic networks: routing and connectivity

Frank G. Radmacher, 2013 .

A Game Theoretic Approach to the Analysis of Dynamic Networks

Wolfgang Thomas, Frank G. Radmacher, W. Thomas, 2008, VerAS@TPHOLs.

An Automata Theoretic Approach to the Theory of Rational Tree Relations

Frank G. Radmacher, 2008 .

Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games

Christof Löding, James Gross, Frank G. Radmacher, 2014, 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems.