Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players-Reference-Cited by-同舟云学术

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

Published:2020 Issue:0 Volume:28 Page:987-1007
ISSN:1882-6652
Container-title:Journal of Information Processing
language:en
Short-container-title:Journal of Information Processing

Author:

Bosboom Jeffrey¹,Chen Charlotte¹,Chung Lily¹,Compton Spencer¹,Coulombe Michael¹,Demaine Erik D.¹,Demaine Martin L.¹,Filho Ivan Tadeu Ferreira Antunes¹,Hendrickson Dylan¹,Hesterberg Adam¹,Hsu Calvin¹,Hu William¹,Korten Oliver²,Luo Zhezheng¹,Zhang Lillian¹

Affiliation:

1. MIT Computer Science and Artificial Intelligence Laboratory

2. Department of Computer Science, Tufts University

Publisher

Information Processing Society of Japan

Subject

General Computer Science

Link

https://www.jstage.jst.go.jp/article/ipsjjip/28/0/28_987/_pdf

Reference31 articles.

1. [1] Ariyibi, D., Gabor, J. and Williams, A.: Personal communication (2019).

2. [2] Bang-Jensen, J., Bessy, S., Jackson, B. and Kriesell, M.: Antistrong digraphs, Journal of Combinatorial Theory, Series B, Vol.122, pp.68-90 (online), DOI: 10.1016/j.jctb.2016.05.004 (2017).

3. [3] Berger, R.: The undecidability of the domino problem, Memoirs of the American Mathematical Society, Vol.66 (1966).

4. [4] Berman, K.A.: Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths, Discrete Mathematics, Vol.22, No.1, pp.75-80 (online), DOI: 10.1016/0012-365X(78)90048-1 (1978).

5. [5] Bodlaender, H.L.: Complexity of Path-Forming Games, Theor. Comput. Sci., Vol.110, No.1, pp.215-245 (online), DOI: 10.1016/0304-3975(93)90357-Y (1993).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02