Author:
Hemaspaandra Edith,Hemaspaandra Lane A.,Tantau Till,Watanabe Osamu
Funder
Japan Society for the Promotion of Science
Ministry of Education, Culture, Sports, Science and Technology
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Generalizations of tournaments: A survey;Bang-Jensen;Journal of Graph Theory,1998
2. Llull and Copeland voting computationally resist bribery and control;Faliszewski;Journal of Artificial Intelligence Research,2009
3. Succinct representations of graphs;Galperin;Information and Control,1983
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. The radii of n-partite tournaments;Gutin;Mathematical Notes,1986
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Property-directed reachability as abstract interpretation in the monotone theory;Proceedings of the ACM on Programming Languages;2022-01-12
2. Results in Workflow Resiliency;Proceedings of the Ninth ACM Conference on Data and Application Security and Privacy;2019-03-13
3. King's Graph-Based Neighbor-Vehicle Mapping Framework;IEEE Transactions on Intelligent Transportation Systems;2013-09