Rudolf Stolar

According to our database, Rudolf Stolar authored at least 7 papers between 2008 and 2011.

Collaborative distances:

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

2011

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

CoRR, 2011

Complexity of the Cop and Robber Guarding Game.

Robert Sámal, Rudolf Stolar, Tomás Valla

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Graph Sharing Games: Complexity and Connectivity.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Three Parameters of Invisibility Graphs.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Monochromatic triangles in two-colored plane.

Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla

Comb., 2009

Solution of Peter Winkler's Pizza Problem.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Hamiltonian Alternating Paths on Bicolored Double-Chains.

Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr

Proceedings of the Graph Drawing, 16th International Symposium, 2008