Publisher
Springer Berlin Heidelberg
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Some Complexity Considerations on the Uniqueness of Graph Colouring;WSEAS TRANSACTIONS ON MATHEMATICS;2023-07-05
2. Minimal Distance of Propositional Models;Theory of Computing Systems;2018-12-20
3. As Close as It Gets;WALCOM: Algorithms and Computation;2016
4. Give Me Another One!;Algorithms and Computation;2015
5. On the Structure of Solution-Graphs for Boolean Formulas;Fundamentals of Computation Theory;2015