From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Trajectory Tracking of Parallel Robots: A Relaxed Differential-Algebraic-Equation Approach., , и . CCE, стр. 1-6. IEEE, (2020)Approximate the Clique-Width of a Graph Using Shortest Paths., , , и . MICAI (2), том 13068 из Lecture Notes in Computer Science, стр. 337-347. Springer, (2021)An Optimization Approach to the TWPVD Method for Digital Image Steganography., , , , и . MCPR, том 9703 из Lecture Notes in Computer Science, стр. 125-134. Springer, (2016)A GMP-FC++ Implementation of a Calculator for Exact Real Number Computation Based on LRT., , и . LA-NMR, том 804 из CEUR Workshop Proceedings, стр. 71-82. CEUR-WS.org, (2011)Model counting for #2SAT problem in outerplanar graphs., , , и . LANMR, том 2264 из CEUR Workshop Proceedings, стр. 76-87. CEUR-WS.org, (2018)Edge covering of acyclic graphs., , и . LA-NMR, том 911 из CEUR Workshop Proceedings, стр. 63-74. CEUR-WS.org, (2012)A Hybrid Feature Extraction Method for Offline Handwritten Math Symbol Recognition., , , и . CIARP, том 11401 из Lecture Notes in Computer Science, стр. 893-901. Springer, (2018)A Simulator for Teaching Automatas and Formal Languages - FLyA., , , и . ICEIS (4), стр. 175-178. (2009)Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs., , и . LANMR, том 1287 из CEUR Workshop Proceedings, стр. 1-8. CEUR-WS.org, (2014)A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas., , , и . MICAI (1), том 12468 из Lecture Notes in Computer Science, стр. 437-447. Springer, (2020)