Author:
Halldórsson Magnús M.,Kitaev Sergey,Pyatkin Artem
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. On the complexity of diagram testing;Brightwell;Order,1993
2. P. Chalermsook, B. Laekhanukit, D. Nanongkai, Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more, in: Proc. 24th annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2013.
3. New results on word-representable graphs;Collins;Discrete Appl. Math.,2015
4. Circle graphs and Monadic Second-order logic;Courcelle;J. Appl. Log.,2008
5. D.L. Draper, A.K. Jonsson, D.P. Clements, D.E. Joslin, Cyclic scheduling, in: Proc. IJCAI, 1999.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献