共 50 条
- [41] Algorithmic and complexity aspects of problems related to total Roman domination for graphs [J]. Journal of Combinatorial Optimization, 2020, 39 : 747 - 763
- [42] Using Automaton Model to Determine the Complexity of Algorithmic Problems for Virtual Laboratories [J]. 2015 9TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT), 2015, : 541 - 545
- [46] Nonlinear singular elliptic problems:: Recent results and open problems [J]. NONLINEAR ELLIPTIC AND PARABOLIC PROBLEMS: A SPECIAL TRIBUTE TO THE WORK OF HERBERT AMANN, MICHEL CHIPOT AND JOACHIM ESCHER, 2005, 64 : 227 - 242
- [49] Confinement in QCD: Results and open problems [J]. ACTA PHYSICA POLONICA B, 2005, 36 (12): : 3723 - 3749
- [50] Complexity Results for Linear XSAT-Problems [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 251 - 263