{"id":423,"date":"2023-04-19T13:44:19","date_gmt":"2023-04-19T10:44:19","guid":{"rendered":"https:\/\/new.usm.md\/?page_id=423"},"modified":"2025-01-27T18:26:35","modified_gmt":"2025-01-27T15:26:35","slug":"radu-buzatu","status":"publish","type":"page","link":"https:\/\/fmi.usm.md\/en\/radu-buzatu\/","title":{"rendered":"Radu Buzatu"},"content":{"rendered":"
\n
\n

\"\"<\/h2>\n

Radu Buzatu<\/h2>\n<\/div>\n<\/div>\n
\n
\n
NumeBuzatu<\/div>\n<\/div>\n<\/div>\n
\n
Grad \u015ftiin\u0163ific<\/div>\n
\n
\n
\n
doctor<\/div>\n<\/div>\n
\n
Academic title\/position<\/div>\n
lecturer<\/div>\n<\/div>\n
\n
Department<\/div>\n
Mathematics Department<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n
<\/div>\n
\n
\n
Education<\/div>\n
\n

 <\/p>\n

Moldova State University, Faculty of Mathematics and Computer Science<\/span><\/p>\n

2013 \u2013 2017<\/p>\n

PhD in Mathematical Sciences.\u00a0Thesis: \u201cCovers of Undirected Graphs by Convex Sets\u201d.\u00a0Operational Research and Cybernetics.\u00a0<\/span>Advisor: Sergiu Cataranciuc, Dr. habil., Professor<\/span><\/p>\n

2011 \u2013 2013<\/p>\n

Master in Applied Mathematics.\u00a0Statistical Analysis of Economic Processes <\/span><\/p>\n

2008 \u2013 2011<\/p>\n

Bachelor in Computer Science.\u00a0Information Management<\/span><\/p>\n

 <\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

\n
<\/div>\n
\n
\n
Professional experience<\/div>\n
\n

2013 \u2013 present<\/p>\n

Researcher,\u00a0Moldova State University, Faculty of Mathematics and Computer Science,<\/p>\n

Mathematical Modeling and Optimization Laboratory,<\/p>\n

Results:<\/p>\n

    \n
  • Proved that the problem of deciding whether a graph can be covered (partitioned) by a given number of convex sets is NP-complete;<\/li>\n
  • Identified a series of graphs classes for which there exists a cover (partition) by a given number of convex sets;<\/li>\n
  • Established conditions for the existence of a graph with the given minimum number of convex sets and minimum (maximum) number of nontrivial convex sets, which cover or partition a graph. Proved that it is NP-hard to determine these invariants for a graph;<\/li>\n
  • Proposed a polynomial algorithm that determines whether a tree can be partitioned into a given number of nontrivial convex sets, and showed that it can be verified in polynomial time whether a graph can be covered by an arbitrary number of nontrivial convex sets;<\/li>\n
  • Developed a library of algorithms by using C# language for decision whether a graph can be covered (partitioned) by convex sets, which may be applied to facility location problem;<\/li>\n
  • Developed a binary linear programming model for optimizing administrative-territorial structure of the state that takes into consideration population, economic development, ethnic structure, territorial and road connectivity;<\/li>\n
  • Developed an information system by using MATLAB for simulations of optimal scenarios of administrative-territorial organization in real time;<\/li>\n
  • Developed a technique based on mixed integer programming for detecting gerrymandering in parallel voting systems.<\/span><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
    \n
    <\/div>\n
    \n
    \n
    Didactic activity<\/div>\n
    \n

    2017 \u2013 present<\/p>\n

    Moldova State University, Faculty of Mathematics and Computer Science,<\/span><\/p>\n

    Department of Mathematics,<\/span><\/p>\n

    Courses:<\/span><\/p>\n

      \n
    • Discrete Mathematics;<\/li>\n
    • Combinatorial Optimization;<\/li>\n
    • Linear programming;<\/li>\n
    • Graph Theory;<\/li>\n
    • Mathematical Software;<\/li>\n
    • Information and Communication Technology.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
      \n
      <\/div>\n
      \n
      \n
      Scientific activity<\/div>\n
      \n

      List of scientific papers and books<\/p>\n

        \n
      1. Buzatu R., Cataranciuc S., Convex graph covers.<\/em><\/span> Computer Science Journal of Moldova (ISSN 1561-4042), Vol. 23, Nr.3(69), 2015, p.251-269;<\/span><\/li>\n
      2. Buzatu R., <\/span>Covers of graphs by two convex sets.<\/span><\/em> Studia Universitatis Babe\u0219-Bolyai, Informatica, Vol. LXI, Nr.1, 2016, p.5-22;<\/span><\/li>\n
      3. Buzatu R., <\/span>Minimum convex cover of special nonoriented graphs<\/span><\/em>.<\/span> Studia Universitatis Moldaviae, Exact and Economic Science (ISSN:1857-2073), Nr. 2(92), 2016, p.46-54;<\/span><\/li>\n
      4. Buzatu R., Cataranciuc S., Nontrivial convex covers of trees.<\/em><\/span> Bulletin of Academy of Sciences of Republic of Moldova, Mathematics (ISSN:1024-7696), Nr.3(82), 2016, p.72-81;<\/span><\/li>\n
      5. Buzatu R., Cataranciuc S., On nontrivial covers and partitions of graphs by convex sets.<\/em><\/span> Computer Science Journal of Moldova (ISSN:1561-4042), Vol.26, Nr.1(76), 2018, p.3-14;<\/span><\/li>\n
      6. Buzatu R., Rabei C., Ro\u0219covan M.,<\/span> A mathematical model for optimization of administrative-territorial organization of the Republic of Moldova<\/span><\/em>, <\/span>Studia Universitatis Moldaviae, Exact and Economic Science (ISSN:1857-2073), Nr.2(112), 2018, p.164-170<\/span>.<\/span><\/li>\n
      7. Cataranciuc S., Buzatu R., Tkacenko A., H\u00e2ncu B., Novac L., Pa\u021biuc V., R\u00eebacova G., Cucu I. Disctrete structures and optimization problems<\/em>. Monograph. Chapter II. Chi\u0219in\u0103u, (ISBN 978-9975-149-44-0), 2019, 454 p;<\/span><\/li>\n
      8. Buzatu R., Binary linear programming approach for graph convex covering problems.<\/em><\/span> \u00a0Bulletin of Academy of Sciences of Republic of Moldova, Mathematics (ISSN:1024-7696), Nr.3(91), 2019, p.54-59;<\/span><\/li>\n
      9. Buzatu R., On the computational complexity of optimization convex covering problems of graphs.<\/em><\/span> Computer Science Journal of Moldova (ISSN:1561-4042), Vol.28, Nr.2(83), 2020, p.187-200;<\/span><\/li>\n
      10. Mandric I., Ro<\/span>\u0219<\/span>ca I., Buzatu R., Gerrymandering and fair districting in parallel voting systems<\/em>. arXiv:2002.06849v1, 2020, 23 p.<\/span><\/li>\n
      11. Buzatu R., Maximum nontrivial convex cover number of join and corona of graphs<\/em>. \u00a0Bulletin of Academy of Sciences of Republic of Moldova, Mathematics, in press.<\/li>\n<\/ol>\n

        List of scientific conferences<\/p>\n

          \n
        1. Buzatu R., Po\u0219taru A., Genetic algorithms. Some applications<\/em>.<\/em> Scientific Annals of the Moldova State University, Natural and Exact Sciences, 2011, Chi\u0219in\u0103u, Moldova, p. 124 – 127;<\/li>\n
        2. Buzatu R., Iurco D., Knowledge interchange between semantic technologies in building of intelligent interface<\/em>s.<\/em> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2013), August 18 – 22, 2013, Chi\u0219in\u0103u, Moldova, p. 107;<\/li>\n
        3. Andrie\u0219 I., Buzatu R., Tridimentional spectral color model as an one to one transformation from rgb color space.<\/em> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2013), August 18 – 22, 2013, Chi\u0219in\u0103u, Moldova, p. 102;<\/li>\n
        4. Buzatu R., Convex covers of undirected graph<\/em>.<\/em> Proceedings of the 22nd Conference on Applied and Industrial Mathematics, (CAIM-2014), September 18 – 21, 2014, Bac\u0103u, Romania, p. 47 – 48;<\/li>\n
        5. Buzatu R., NP-completeness of graph convex cover problems.<\/em> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2015), July 2 – 5, 2015, Chi\u0219in\u0103u, Moldova, p. 13;<\/li>\n
        6. Andrie\u0219 I., Buzatu R., Ordering colors of the hvs color model in an one-dimentional physical spectrum.<\/em> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2015), July 2 – 5, 2015, Chi\u0219in\u0103u, Moldova, p. 89;<\/li>\n
        7. Buzatu R., Nontrivial convex 2-covers of simple connected graphs<\/em>. Proceedings of the 23rd Conference on Applied and Industrial Mathematics (CAIM-2015), September 17 – 20, 2015, Suceava, Romania, p. 36-37;<\/li>\n
        8. Buzatu R., Convex <\/em>2-covers of nonoriented graphs.<\/em> Proceedings of the International Conference \u201eIntegration through Research and Innovation\u201d, Moldova State University, \u00a0November 10 – 11, 2015, Chi\u0219in\u0103u, Moldova, p. 177 – 180;<\/li>\n
        9. Buzatu R., Cataranciuc S., Cover of a nonoriented graph by nontrivial convex sets<\/em>. Proceedings of the 5th International Conference \u201cMathematical Modeling, Optimization and Information Technologies\u201d, Academy of transport, informatics and communication, March 22 – 25, 2016, Chi\u0219in\u0103u, Moldova, p.64 – 71;<\/li>\n
        10. Buzatu R., Cataranciuc S., Minimum convex covers of some graph operations.<\/em> Proceedings of the Annual Conference of the Romanian Mathematical Society, May 19 -22, 2016, Baia Mare, Romania, p. 18 – 19;<\/li>\n
        11. Buzatu R., Nontrivial convex partition of a tree<\/em>. Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2016), June 23 – 26, 2016, Chi\u0219in\u0103u, Moldova, p. 12 – 13;<\/li>\n
        12. Buzatu R., Nontrivial convex cover of a tree.<\/em> Proceedings of the 24th Conference on Applied and Industrial Mathematics (CAIM-2016), September 15 – 18, 2016, Craiova, Romania, p. 82;<\/li>\n
        13. Buzatu R., Maximum nontrivial convex cover of a tree<\/em>. Proceedings of the Fourth Conference of Mathematical Society of the Republic of Moldova, June 28 – July 2, 2017, Chi\u0219in\u0103u, Moldova, p. 365 – 368;<\/li>\n
        14. Buzatu R., Algorithms for determining nontrivial convex covers of graphs<\/em>.<\/em> Proceedings of the 25th Conference on Applied and Industrial Mathematics (CAIM-2017), September 14 – 17, 2017, Ia\u0219i, Romania, p. 49 – 50;<\/li>\n
        15. Buzatu R., Partitioning a graph into convex sets<\/em>. Some applications.<\/em> \u00a0Proceedings of the Annual Conference of the Romanian Mathematical Society, May 25 – 26, 2018, Corabia, Romania;<\/li>\n
        16. Buzatu R., A binary linear programming model for minimum convex partition of a graph.<\/em> \u00a0Proceedings of the International Summer Mathematical School in Memoriam V. A. Plotnikov, June 11 – 16, 2018, Odessa, Ukraine, p. 89;<\/li>\n
        17. Buzatu R., BLP modeling of the convex cover problem of a graph<\/em>. Proceedings of the \u00a0International Scientific Conference \u201cModern Problems of Mathematics and Its Application in Natural Sciences and Information Technologies\u201d, September 17 – 19, 2018, Chernivtsi, Ukraine, p. 124;<\/li>\n
        18. Buzatu R., Improvement of the administrative-territorial structure using mixed integer linear programming.<\/em> Proceedings of the 26th Conference on Applied and Industrial Mathematics (CAIM-2018), September 20 – 23, 2018, Chi\u0219in\u0103u, Moldova, p. 117;<\/li>\n
        19. Buzatu R., A <\/em>formulation of convex covering problem of graphs as a linear programming problem.<\/em> Proceedings of the 6th International Conference \u201cMathematical Modeling, Optimization and Information Technologies\u201d, Academy of transport, informatics and communication, November 12 – 16, 2018, Chi\u0219in\u0103u, Moldova, p. 48 – 49;<\/li>\n
        20. Buzatu R., Cataranciuc S., On the difficulty of determining the maximum nontrivial convex cover number of a graph<\/em>.<\/em> Proceedings of the Thirteenth International Workshop \u201cDiscrete Mathematics and Its Applications, June 17 – 22, 2019, Moscow, Russia;<\/li>\n
        21. Buzatu R., Optimization problems of general convex covering problem of graphs<\/em>. Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2019), June 24 – 26, 2019, Chi\u0219in\u0103u, Moldova, p. 13;<\/li>\n
        22. Buzatu R., Graph partitioning problems and their applications in socio-economic fields<\/em>. Proceedings of the Ninth Conference of Romanian Mathematicians, June 28 – July 3, 2019, Gala\u021bi, Romania, p. 18;<\/li>\n
        23. Buzatu R., On<\/em> the maximum nontrivial convex cover number of the join of graphs. <\/em>Proceedings of the Fifth Conference of the Mathematical Society of the Republic of Moldova, September 28 \u2013 October 1, 2019, Chi\u0219in\u0103u, Moldova.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
          \n
          <\/div>\n
          \n
          \n
          Other<\/div>\n
          \n

           <\/p>\n

          List of scientific projects<\/p>\n

            \n
          1. Project 11.817.08.49A (institutional project). Research theme: \u201cModern methodologies in software development\u201d (2011-2014);<\/li>\n
          2. Project 1C\/2012 (bilateral projects with \u201eEst Computer\u201d company). Research theme: \u201cWeb 3.0 development\u201d (2012);<\/li>\n
          3. Project 15.820.18.02.03\/B (bilateral projects with Belarus). Research theme: \u201cEfficient models and algorithms for solving optimization problems on discrete structures\u201d (2015-2016);<\/li>\n
          4. Project 16.80012.02.03F (project for young scientist). Research theme: \u201cStochastic optimization algorithms\u201d (2016-2018);<\/li>\n
          5. Project 2017.3506.7-001.00 (Government project with GIZ cooperation). Research theme: \u201cSupport to Territorial-Administrative Reform in the Republic of Moldova\u201d (2018);<\/li>\n
          6. Project 15.817.02.37A (institutional project). Research theme: \u201cMathematical modeling and advanced computing in applied problems\u201d (2015-2019);<\/li>\n
          7. Project 20.80009.5007.13 (institutional project \u201cInstitute of Mathematics and Computer Science\u201d). Research theme: \u201cDeterministic and stochastic methods for solving optimization and control problems\u201d (2020).<\/span><\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

             <\/p>\n<\/div>\n

            \n
            \n
            \n
            <\/div>\n<\/section>\n<\/div>\n<\/div>\n
            \n
            \n

            \"\"<\/h2>\n

            Radu Buzatu<\/h2>\n<\/div>\n<\/div>\n
            \n
            \n
            NumeBuzatu<\/div>\n<\/div>\n<\/div>\n
            \n
            Grad \u015ftiin\u0163ific<\/div>\n
            doctor<\/div>\n<\/div>\n
            \n
            Titlu didactic\/func\u0163ie exercitat\u0103<\/div>\n
            lector universitar<\/div>\n<\/div>\n
            \n
            Departament<\/div>\n
            Departamentul de Matematic\u0103<\/div>\n
            \n
            \n
            \n
            \n
            \n
            \n
            \n
            \n
            Studii<\/strong><\/div>\n
            \n

            Moldova State University, Faculty of Mathematics and Computer Science<\/p>\n

            2013 \u2013 2017<\/p>\n

            PhD in Mathematical Sciences.\u00a0Thesis: \u201cCovers of Undirected Graphs by Convex Sets\u201d.\u00a0Operational Research and Cybernetics.\u00a0Advisor: Sergiu Cataranciuc, Dr. habil., Professor<\/p>\n

            2011 \u2013 2013<\/p>\n

            Master in Applied Mathematics.\u00a0Statistical Analysis of Economic Processes<\/p>\n

            2008 \u2013 2011<\/p>\n

            Bachelor in Computer Science.\u00a0Information Management<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

            \n
            <\/div>\n
            \n
            \n
            Experien\u021ba profesional\u0103<\/strong><\/div>\n
            \n

            2013 \u2013 present<\/p>\n

            Researcher,\u00a0Moldova State University, Faculty of Mathematics and Computer Science,<\/p>\n

            Mathematical Modeling and Optimization Laboratory,<\/p>\n

            Results:<\/p>\n

              \n
            • Proved that the problem of deciding whether a graph can be covered (partitioned) by a given number of convex sets is NP-complete;<\/li>\n
            • Identified a series of graphs classes for which there exists a cover (partition) by a given number of convex sets;<\/li>\n
            • Established conditions for the existence of a graph with the given minimum number of convex sets and minimum (maximum) number of nontrivial convex sets, which cover or partition a graph. Proved that it is NP-hard to determine these invariants for a graph;<\/li>\n
            • Proposed a polynomial algorithm that determines whether a tree can be partitioned into a given number of nontrivial convex sets, and showed that it can be verified in polynomial time whether a graph can be covered by an arbitrary number of nontrivial convex sets;<\/li>\n
            • Developed a library of algorithms by using C# language for decision whether a graph can be covered (partitioned) by convex sets, which may be applied to facility location problem;<\/li>\n
            • Developed a binary linear programming model for optimizing administrative-territorial structure of the state that takes into consideration population, economic development, ethnic structure, territorial and road connectivity;<\/li>\n
            • Developed an information system by using MATLAB for simulations of optimal scenarios of administrative-territorial organization in real time;<\/li>\n
            • Developed a technique based on mixed integer programming for detecting gerrymandering in parallel voting systems.<\/span><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
              \n
              <\/div>\n
              \n
              \n
              Activitatea didactic\u0103<\/div>\n
              \n

              2017 \u2013 present<\/p>\n

              Moldova State University, Faculty of Mathematics and Computer Science,<\/p>\n

              Department of Mathematics,<\/p>\n

              Courses:<\/p>\n

                \n
              • Discrete Mathematics;<\/li>\n
              • Combinatorial Optimization;<\/li>\n
              • Linear programming;<\/li>\n
              • Graph Theory;<\/li>\n
              • Mathematical Software;<\/li>\n
              • Information and Communication Technology.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
                \n
                <\/div>\n
                \n
                \n
                Activitatea \u0219tiin\u021bific\u0103<\/div>\n
                \n

                List of scientific papers and books<\/p>\n

                  \n
                1. Buzatu R., Cataranciuc S., Convex graph covers.<\/em><\/span> Computer Science Journal of Moldova (ISSN 1561-4042), Vol. 23, Nr.3(69), 2015, p.251-269;<\/span><\/li>\n
                2. Buzatu R., <\/span>Covers of graphs by two convex sets.<\/span><\/em> Studia Universitatis Babe\u0219-Bolyai, Informatica, Vol. LXI, Nr.1, 2016, p.5-22;<\/span><\/li>\n
                3. Buzatu R., <\/span>Minimum convex cover of special nonoriented graphs<\/span><\/em>.<\/span> Studia Universitatis Moldaviae, Exact and Economic Science (ISSN:1857-2073), Nr. 2(92), 2016, p.46-54;<\/span><\/li>\n
                4. Buzatu R., Cataranciuc S., Nontrivial convex covers of trees.<\/em><\/span> Bulletin of Academy of Sciences of Republic of Moldova, Mathematics (ISSN:1024-7696), Nr.3(82), 2016, p.72-81;<\/span><\/li>\n
                5. Buzatu R., Cataranciuc S., On nontrivial covers and partitions of graphs by convex sets.<\/em><\/span> Computer Science Journal of Moldova (ISSN:1561-4042), Vol.26, Nr.1(76), 2018, p.3-14;<\/span><\/li>\n
                6. Buzatu R., Rabei C., Ro\u0219covan M.,<\/span> A mathematical model for optimization of administrative-territorial organization of the Republic of Moldova<\/span><\/em>, <\/span>Studia Universitatis Moldaviae, Exact and Economic Science (ISSN:1857-2073), Nr.2(112), 2018, p.164-170<\/span>.<\/span><\/li>\n
                7. Cataranciuc S., Buzatu R., Tkacenko A., H\u00e2ncu B., Novac L., Pa\u021biuc V., R\u00eebacova G., Cucu I. Disctrete structures and optimization problems<\/em>. Monograph. Chapter II. Chi\u0219in\u0103u, (ISBN 978-9975-149-44-0), 2019, 454 p;<\/span><\/li>\n
                8. Buzatu R., Binary linear programming approach for graph convex covering problems.<\/em><\/span> \u00a0Bulletin of Academy of Sciences of Republic of Moldova, Mathematics (ISSN:1024-7696), Nr.3(91), 2019, p.54-59;<\/span><\/li>\n
                9. Buzatu R., On the computational complexity of optimization convex covering problems of graphs.<\/em><\/span> Computer Science Journal of Moldova (ISSN:1561-4042), Vol.28, Nr.2(83), 2020, p.187-200;<\/span><\/li>\n
                10. Mandric I., Ro<\/span>\u0219<\/span>ca I., Buzatu R., Gerrymandering and fair districting in parallel voting systems<\/em>. arXiv:2002.06849v1, 2020, 23 p.<\/span><\/li>\n
                11. Buzatu R., Maximum nontrivial convex cover number of join and corona of graphs<\/em>. \u00a0Bulletin of Academy of Sciences of Republic of Moldova, Mathematics, in press.<\/li>\n<\/ol>\n

                  List of scientific conferences<\/p>\n

                    \n
                  1. Buzatu R., Po\u0219taru A.<\/span>, Genetic algorithms. Some applications<\/span><\/em>.<\/span><\/em> Scientific Annals of the Moldova State University, Natural and Exact Sciences, 2011, Chi\u0219in\u0103u, Moldova, p. 124 – 127;<\/span><\/li>\n
                  2. Buzatu R., Iurco D., <\/span>Knowledge interchange between semantic technologies in building of intelligent interface<\/span><\/em>s.<\/span><\/em> Proceedings of the International<\/span> Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2013), August 18 – 22, 2013, Chi\u0219in\u0103u, Moldova, p. 107;<\/span><\/li>\n
                  3. Andrie\u0219 I., Buzatu R., <\/span>Tridimentional spectral color model as an one to one transformation from rgb color space.<\/span><\/em> Proceedings of the <\/span>International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2013), August 18 – 22, 2013, Chi\u0219in\u0103u, Moldova, p. 102;<\/span><\/li>\n
                  4. Buzatu R., <\/span>Convex covers of undirected graph<\/span><\/em>.<\/span><\/em> Proceedings of the <\/span>22nd Conference on Applied and Industrial Mathematics, (CAIM-2014), September 18 – 21, 2014, Bac<\/span>\u0103<\/span>u, Romania, p. 47 – 48;<\/span><\/li>\n
                  5. Buzatu R., <\/span>NP-completeness of graph convex cover problems.<\/span><\/em> Proceedings of the International Conference<\/span> \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2015), July 2 – 5, 2015, Chi\u0219in\u0103u, Moldova, p. 13;<\/span><\/li>\n
                  6. Andrie\u0219 I., Buzatu R., <\/span>Ordering colors of the hvs color model in an one-dimentional physical spectrum.<\/span><\/em> Proceedings of the International Conference<\/span> \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2015), July 2 – 5, 2015, Chi\u0219in\u0103u, Moldova, p. 89;<\/span><\/li>\n
                  7. Buzatu R., <\/span>Nontrivial convex 2-covers of simple connected graphs<\/span><\/em>. <\/span>Proceedings of the<\/span> 23rd Conference on Applied and Industrial Mathematics (CAIM-2015), September 17 – 20, 2015, Suceava, Romania, p. 36-37;<\/span><\/li>\n
                  8. Buzatu R., Convex <\/em><\/span>2-covers of nonoriented graphs.<\/span><\/em> Proceedings of the International Conference<\/span> \u201eIntegration through Research and Innovation\u201d, Moldova State University, \u00a0November 10 – 11, 2015, Chi\u0219in\u0103u, Moldova, p. 177 – 180;<\/span><\/li>\n
                  9. Buzatu R., Cataranciuc S., <\/span>Cover of a nonoriented graph by nontrivial convex sets<\/span><\/em>.<\/span> Proceedings of the <\/span>5th International Conference \u201cMathematical Modeling, Optimization and Information Technologies\u201d, Academy of transport, informatics and communication, March 22 – 25, 2016<\/span>,<\/span> Chi\u0219in\u0103u, Moldova, <\/span>p.64 – 71<\/span>;<\/span><\/li>\n
                  10. Buzatu R., Cataranciuc S., <\/span>Minimum convex covers of some graph operations.<\/span><\/em> Proceedings of the Annual <\/span>Conference of the Romanian Mathematical Society, May 19 -22, 2016, Baia Mare, Romania, p. 18 – 19;<\/span><\/li>\n
                  11. Buzatu R., <\/span>Nontrivial convex partition of a tree<\/span><\/em>.<\/span> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2016), June 23 – 26, 2016, Chi\u0219in\u0103u, Moldova, p. 12 – 13;<\/span><\/li>\n
                  12. Buzatu R., <\/span>Nontrivial convex cover of a tree.<\/span><\/em> Proceedings of the <\/span>24th Conference on Applied and Industrial Mathematics (CAIM-2016), September 15 – 18, 2016, Craiova, Romania, p. 82;<\/span><\/li>\n
                  13. Buzatu R., <\/span>Maximum nontrivial convex cover of a tree<\/span><\/em>.<\/span> Proceedings of the Fourth Conference of Mathematical Society of the Republic of Moldova, June 28 – July 2, 2017, Chi\u0219in\u0103u, Moldova, p. 365 – 368;<\/span><\/li>\n
                  14. Buzatu R., <\/span>Algorithms for determining nontrivial convex covers of graphs<\/span><\/em>.<\/span><\/em> Proceedings of the <\/span>25th Conference on Applied and Industrial Mathematics (CAIM-2017), September 14 – 17, 2017, <\/span>Ia\u0219i<\/span>, Romania, p. 49 – 50;<\/span><\/li>\n
                  15. Buzatu R., <\/span>Partitioning a graph into convex sets<\/span><\/em>. Some applications.<\/em> \u00a0Proceedings of the Annual <\/span>Conference of the Romanian Mathematical Society, May 25 – 26, 2018, Corabia, Romania;<\/span><\/li>\n
                  16. Buzatu R.,<\/span> A binary linear programming model for minimum convex partition of a graph.<\/span><\/em> \u00a0Proceedings of the International Summer Mathematical School in Memoriam V. A. Plotnikov<\/span>, June 11 – 16, 2018, Odessa, Ukraine<\/span>,<\/span> p. 89;<\/span><\/li>\n
                  17. Buzatu R.,<\/span> BLP modeling of the convex cover problem of a graph<\/span><\/em>. Proceedings of the <\/span>\u00a0<\/span>International Scientific Conference \u201cModern Problems of Mathematics and Its Application in Natural Sciences and Information Technologies\u201d<\/span>, September 17 – 19, 2018,<\/span> Chernivtsi, Ukraine<\/span>, <\/span>p. 124;<\/span><\/li>\n
                  18. Buzatu R., <\/span>Improvement of the administrative-territorial structure using mixed integer linear programming.<\/span><\/em> Proceedings of the <\/span>26th Conference on Applied and Industrial Mathematics (CAIM-2018), September 20 – 23, 2018, Chi\u0219in\u0103u, Moldova, p. 117<\/span>;<\/span><\/li>\n
                  19. Buzatu R., A <\/em><\/span>formulation of convex covering problem of graphs as a linear programming problem.<\/span><\/em> Proceedings of the <\/span>6th International Conference \u201cMathematical Modeling, Optimization and Information Technologies\u201d, Academy of transport, informatics and communication, November 12 – 16, 2018<\/span>, <\/span>Chi\u0219in\u0103u, Moldova, p. 48 – 49;<\/span><\/li>\n
                  20. Buzatu R., Cataranciuc S., On the difficulty of determining the maximum nontrivial convex cover number of a graph<\/em><\/span>.<\/span><\/em> Proceedings of the Thirteenth International Workshop <\/span>\u201cDiscrete Mathematics and Its Applications, June 17 – 22, 2019, Moscow, Russia;<\/span><\/li>\n
                  21. Buzatu R., <\/span>Optimization problems of general convex covering problem of graphs<\/span><\/em>.<\/span> Proceedings of the International Conference \u201cMathematics & Information Technologies: Research and Education\u201d (MITRE \u2013 2019), June 24 – 26, 2019, Chi\u0219in\u0103u, Moldova, p. 13;<\/span><\/li>\n
                  22. Buzatu R., <\/span>Graph partitioning problems and their applications in socio-economic fields<\/span><\/em>.<\/span> Proceedings of the Ninth Conference of Romanian Mathematicians, June 28 – July 3, 2019, Gala<\/span>\u021bi<\/span>, Romania, p. 18;<\/span><\/li>\n
                  23. Buzatu R., On<\/em><\/span> the maximum nontrivial convex cover number of the join of graphs.<\/span> <\/em>Proceedings of the Fifth <\/span>Conference of the Mathematical Society of the Republic of Moldova, September 28 \u2013 October 1, 2019, Chi\u0219in\u0103u, Moldova<\/span>.<\/span><\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
                    \n
                    <\/div>\n
                    \n
                    \n
                    Altele<\/div>\n
                    \n

                    List of scientific projects<\/p>\n

                      \n
                    1. Project 11.817.08.49A (institutional project). Research theme: \u201cModern methodologies in software development\u201d (2011-2014);<\/li>\n
                    2. Project 1C\/2012 (bilateral projects with \u201eEst Computer\u201d company). Research theme: \u201cWeb 3.0 development\u201d (2012);<\/li>\n
                    3. Project 15.820.18.02.03\/B (bilateral projects with Belarus). Research theme: \u201cEfficient models and algorithms for solving optimization problems on discrete structures\u201d (2015-2016);<\/li>\n
                    4. Project 16.80012.02.03F (project for young scientist). Research theme: \u201cStochastic optimization algorithms\u201d (2016-2018);<\/li>\n
                    5. Project 2017.3506.7-001.00 (Government project with GIZ cooperation). Research theme: \u201cSupport to Territorial-Administrative Reform in the Republic of Moldova\u201d (2018);<\/li>\n
                    6. Project 15.817.02.37A (institutional project). Research theme: \u201cMathematical modeling and advanced computing in applied problems\u201d (2015-2019);<\/li>\n
                    7. Project 20.80009.5007.13 (institutional project \u201cInstitute of Mathematics and Computer Science\u201d). Research theme: \u201cDeterministic and stochastic methods for solving optimization and control problems\u201d (2020).<\/span><\/li>\n<\/ol>\n

                       <\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/article>\n<\/div>\n<\/section>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

                      Radu Buzatu NumeBuzatu Grad \u015ftiin\u0163ific doctor Academic title\/position lecturer Department Mathematics Department Education   Moldova State University, Faculty of Mathematics and Computer Science 2013 \u2013 2017 PhD in Mathematical Sciences.\u00a0Thesis: \u201cCovers of Undirected Graphs by Convex Sets\u201d.\u00a0Operational Research and Cybernetics.\u00a0Advisor: Sergiu Cataranciuc, Dr. habil., Professor 2011 \u2013 2013 Master in Applied Mathematics.\u00a0Statistical Analysis of Economic…
                      Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_theme","meta":{"_seopress_robots_primary_cat":"","_seopress_titles_title":"","_seopress_titles_desc":"","_seopress_robots_index":"","footnotes":""},"class_list":["post-423","page","type-page","status-publish","hentry"],"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"","author_link":"https:\/\/fmi.usm.md\/en\/author\/"},"rttpg_comment":0,"rttpg_category":null,"rttpg_excerpt":"Radu Buzatu NumeBuzatu Grad \u015ftiin\u0163ific doctor Academic title\/position lecturer Department Mathematics Department Education   Moldova State University, Faculty of Mathematics and Computer Science 2013 \u2013 2017 PhD in Mathematical Sciences.\u00a0Thesis: \u201cCovers of Undirected Graphs by Convex Sets\u201d.\u00a0Operational Research and Cybernetics.\u00a0Advisor: Sergiu Cataranciuc, Dr. habil., Professor 2011 \u2013 2013 Master in Applied Mathematics.\u00a0Statistical Analysis of Economic……","_links":{"self":[{"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/pages\/423","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/comments?post=423"}],"version-history":[{"count":2,"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/pages\/423\/revisions"}],"predecessor-version":[{"id":429,"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/pages\/423\/revisions\/429"}],"wp:attachment":[{"href":"https:\/\/fmi.usm.md\/en\/wp-json\/wp\/v2\/media?parent=423"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}