14 citations · 23 across the 3 of their papers we have counts for
4 papers
The diameter game
József Balogh, Ryan R. Martin, András Pluhár
A large class of Positional Games are defined on the complete graph on vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his su…
On the complexity of Chooser-Picker positional games
András Csernenszky, Ryan R. Martin, András Pluhár
Two new versions of the so-called Maker-Breaker Positional Games are defined by József Beck in [{\em Combinatorica} {\bf 22}(2) (2002) 169--216]. He defines two players, Picker and…
On the path separation number of graphs
József Balogh, Béla Csaba, Ryan R. Martin +1
A path separator of a graph is a set of paths such that for every pair of edges , there exist paths such t…
A randomized algorithm for the on-line weighted bipartite matching problem
Béla Csaba, András S. Pluhár
We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, not necessary disjoint points of a metric space are given, and are to be…