| Equivalence of strongly connected graphs and black-and-white 2-SAT problems GK Csaba Biró Miskolc Mathematical Notes 19 (2), 755-768, 2018 | 20 | 2018 |
| Investigations of graph properties in terms of wireless sensor network optimization G Kovásznai, B Erdélyi, C Biró 2018 IEEE International Conference on Future IoT Technologies (Future IoT), 1-8, 2018 | 10 | 2018 |
| Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model G Kusper, C Biró Algorithms 13 (12), 321, 2020 | 9 | 2020 |
| Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers. G Kovásznai, C Biró, B Erdélyi SMT, 15-27, 2017 | 9 | 2017 |
| Puli–A Problem-Specific OMT solver G Kovásznai, C Biró, B Erdélyi Proc. 16th International Workshop on Satisfiability Modulo Theories (SMT …, 2018 | 8 | 2018 |
| SAT solving by CSFLOC, the next generation of full-length clause counting algorithms G Kusper, C Biró, GB Iszály 2018 IEEE International Conference on Future IoT Technologies (Future IoT), 1-9, 2018 | 8 | 2018 |
| BaW 1.0-A Problem Specific SAT Solver for Effective Strong Connectivity Testing in Sparse Directed Graphs GK Csaba Biró CINTI 2018 • 18th IEEE International Symposium on Computational Intelligence …, 2018 | 6* | 2018 |
| REPRESENTING DIRECTED GRAPHS AS 3-SAT PROBLEMS USING THE SIMPLIFIED BALATONBOGLÁR MODEL G KUSPER, C BIRÓ, T BALLA | 5 | 2020 |
| Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle, SYNASC 2015 G Kusper, C Biró IEEE Computer Society Press, 2015 | 5 | 2015 |
| How to generate weakly nondecisive SAT instances C Biró, G Kusper, T Tajti 2013 IEEE 11th International Symposium on Intelligent Systems and …, 2013 | 5 | 2013 |
| Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle G Kusper, C Biró 2015 17th International Symposium on Symbolic and Numeric Algorithms for …, 2015 | 4 | 2015 |
| SAT representation of randomly deployed wireless sensor networks C Biró, G Kusper, T Radványi, S Király, P Szigetváry, P Takács Proc. International Conference on Applied Informatics (ICAI), 101-111, 2014 | 4 | 2014 |
| Cube-and-Conquer approach for SAT solving on grids GG Csaba Biró, Gergely Kovásznai, Armin Biere, Gábor Kusper Annales Mathematicae et Informaticae 42, 9-21, 2013 | 4* | 2013 |
| Generating minimal unsatisfiable SAT instances from strong digraphs G Kusper, T Balla, C Biró, T Tajti, ZG Yang, I Baják 2020 22nd International Symposium on Symbolic and Numeric Algorithms for …, 2020 | 3 | 2020 |
| Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems G Kusper, C Biró, T Balla 2020 IEEE 14th International Symposium on Applied Computational Intelligence …, 2020 | 3 | 2020 |
| Számítógépes szimuláció GeoGebrával (Computer Simulation with GeoGebra) G Geda, C Bíró, E Kovács INFODIDACT, 2011 | 3 | 2011 |
| Alkalmazói ismeretek B Csaba, K Emőd, B Csaba Eszterházy Károly Főiskola Természettudományi Kar, 2011 | 3 | 2011 |
| The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs T Balla, C Biró, G Kusper The 11th International Conference on Applied Informatics, 2020 | 2 | 2020 |
| Survey of attacking and defending in the RFID system T Radványi, C Biró, S Király, P Szigetváry, P Takács Annales Mathematicae et Informaticae 44, 151-164, 2015 | 2 | 2015 |
| Educational Issues Raised by the Availability of the Quantum Computer F Koczka, C Prantner, C Bíro Central-European Journal of New Technologies in Research, Education and …, 2023 | 1 | 2023 |
Kusper GáborEszterházy Károly UniversityVerified email at uni-eszterhazy.hu
