Author:
Matsumoto Naoki,Nakamigawa Tomoki,Sakuma Tadashi
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Chaplick, S., Micek, P., Ueckerdt, T., Wiechert, V.: A note on concurrent graph sharing games. Integers 16, 5 (2016). Paper No. G1
2. Cibulka, J., Kynčl, J., Mészáros, V., Stolař, R., Valtr, P.: Graph sharing games: complexity and connectivity. Theoret. Comput. Sci. 494, 49–62 (2013)
3. Cibulka, J., Kynčl, J., Mészáros, V., Stolař, R., Valtr, P.: Solution to Peter Winkler’s pizza problem, Combinatorial Algorithms. Lecture Notes Comput. Sci. 5874, 356–367 (2009)
4. Egawa, Y., Enomoto, H., Matsumoto, N.: The graph grabbing game on $$K_{m, n}$$-trees. Discrete Math. 341, 1555–1560 (2018)
5. Knauer, K., Micek, P., Ueckerdt, T.: How to eat $$4/9$$ of a pizza. Discrete Math. 311, 1635–1645 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献