Frank G. Radmacher

According to our database, Frank G. Radmacher authored at least 8 papers between 2007 and 2014.

Collaborative distances:

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

2014

Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games.

Simon Tenbusch, Christof Löding, Frank G. Radmacher, James Gross

Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

2013

Games on dynamic networks: routing and connectivity.

Frank G. Radmacher

PhD thesis, 2013

Connectivity games over dynamic networks.

Sten Grüner, Frank G. Radmacher, Wolfgang Thomas

Theor. Comput. Sci., 2013

2012

Moving in a network under random failures: A complexity analysis.

Dominik Klein, Frank G. Radmacher, Wolfgang Thomas

Sci. Comput. Program., 2012

2010

A Game-Theoretic Approach to Routing under Adversarial Conditions.

James Gross, Frank G. Radmacher, Wolfgang Thomas

Proceedings of the Theoretical Computer Science, 2010

2009

The Complexity of Reachability in Randomized Sabotage Games.

Dominik Klein, Frank G. Radmacher, Wolfgang Thomas

Proceedings of the Fundamentals of Software Engineering, 2009

2008

An Automata Theoretic Approach to Rational Tree Relations.

Frank G. Radmacher

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007

A Game Theoretic Approach to the Analysis of Dynamic Networks.

Frank G. Radmacher, Wolfgang Thomas

Proceedings of the First Workshop on Verification of Adaptive Systems, 2007