var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"http://rvb.su/rvb-students.bib\",\"jsonp\":\"1\",\"theme\":\"mila\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"mastersthesis\",\"type\":\"Bachelor's Thesis\",\"author\":[{\"firstnames\":[\"Daniel\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Skachkov\"],\"suffixes\":[]}],\"title\":\"Reduktsiya dannykh v graficheskoy zadache kommivoyazhеra [Data Reduction in the Graphic Traveling Salesman Problem]\",\"school\":\"Moscow Institute of Physics and Technology\",\"year\":\"2021\",\"url\":\"http://rvb.su/pdf/Ska21.pdf\",\"bibtex\":\"@MastersThesis{Ska21,\\n  author =\\t {Daniel A. Skachkov},\\n  title =\\t {Reduktsiya dannykh v graficheskoy zadache\\n                  kommivoyazhеra [Data Reduction in the Graphic\\n                  Traveling Salesman Problem]},\\n  school =\\t {Moscow Institute of Physics and Technology},\\n  year =\\t {2021},\\n  type =\\t {Bachelor's Thesis},\\n  url =\\t\\t {http://rvb.su/pdf/Ska21.pdf}\\n}\\n\\n\",\"author_short\":[\"Skachkov, D. A.\"],\"key\":\"Ska21\",\"id\":\"Ska21\",\"bibbaseid\":\"skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Ska21.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"mastersthesis\",\"type\":\"mastersthesis\",\"author\":[{\"firstnames\":[\"Pavel\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]}],\"title\":\"Razrabotka algoritmov i programmnogo obespecheniya dlya resheniya zadach analiza setevykh struktur [Algorithm and Software Design for Network Analysis Problems]\",\"school\":\"Novosibirsk State University\",\"year\":\"2020\",\"url\":\"http://rvb.su/pdf/Smi20.pdf\",\"bibtex\":\"@MastersThesis{Smi20,\\n  author =\\t {Pavel V. Smirnov},\\n  title =\\t {Razrabotka algoritmov i programmnogo obespecheniya\\n                  dlya resheniya zadach analiza setevykh struktur\\n                  [Algorithm and Software Design for Network Analysis\\n                  Problems]},\\n  school =\\t {Novosibirsk State University},\\n  year =\\t 2020,\\n  url =\\t\\t {http://rvb.su/pdf/Smi20.pdf}\\n}\\n\\n\",\"author_short\":[\"Smirnov, P. V.\"],\"key\":\"Smi20\",\"id\":\"Smi20\",\"bibbaseid\":\"smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Smi20.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"mastersthesis\",\"type\":\"Bachelor's Thesis\",\"author\":[{\"firstnames\":[\"Pavel\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]}],\"title\":\"Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat'yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space]\",\"school\":\"Novosibirsk State University\",\"year\":\"2018\",\"url\":\"http://rvb.su/pdf/Smi18.pdf\",\"bibtex\":\"@MastersThesis{Smi18,\\n  author =\\t {Pavel V. Smirnov},\\n  title =\\t {Reduktsiya dannykh dlya zadachi o vershinnom\\n                  pokrytii gipergrafa za lineynoye vremya s lineynoy\\n                  pamyat'yu [Data Reduction for the Vertex Cover\\n                  Problem in Hypergraphs in linear time and space]},\\n  school =\\t {Novosibirsk State University},\\n  year =\\t 2018,\\n  type =\\t {Bachelor's Thesis},\\n  url =\\t\\t {http://rvb.su/pdf/Smi18.pdf}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Smirnov, P. V.\"],\"key\":\"Smi18\",\"id\":\"Smi18\",\"bibbaseid\":\"smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Smi18.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Approximation algorithms for the Hierarchical Chinese Postman Problem\",\"author\":[{\"firstnames\":[\"Vsevolod\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Afanasev\"],\"suffixes\":[]}],\"year\":\"2020\",\"url\":\"http://rvb.su/pdf/Afa20.pdf\",\"booktitle\":\"Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 58th International Scientific Student Conference, Mathematics)\",\"editor\":[{\"firstnames\":[\"S.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Goncharov\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Marchuk\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"I.\"],\"propositions\":[],\"lastnames\":[\"Takhonov\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Kaushan\"],\"suffixes\":[]}],\"pages\":\"135\",\"address\":\"Novosibirsk, April 10–13\",\"organization\":\"Novosibirsk State University\",\"bibtex\":\"@inproceedings{Afa20,\\n  title =\\t {Approximation algorithms for the Hierarchical\\n                  Chinese Postman Problem},\\n  author =\\t {Vsevolod A. Afanasev},\\n  year =\\t {2020},\\n  url =\\t\\t {http://rvb.su/pdf/Afa20.pdf},\\n  booktitle =\\t {Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy\\n                  konferentsii, Matematika (Proceedings of the 58th\\n                  International Scientific Student Conference,\\n                  Mathematics)},\\n  editor =\\t {S. S. Goncharov and I. V. Marchuk and I. I. Takhonov\\n                  and K. A. Kaushan},\\n  pages =\\t 135,\\n  address =\\t {Novosibirsk, April 10--13},\\n  organization = {Novosibirsk State University},\\n  year =\\t 2020,\\n}\\n\\n\",\"author_short\":[\"Afanasev, V. A.\"],\"editor_short\":[\"Goncharov, S. S.\",\"Marchuk, I. V.\",\"Takhonov, I. I.\",\"Kaushan, K. A.\"],\"key\":\"Afa20\",\"id\":\"Afa20\",\"bibbaseid\":\"afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Afa20.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"On Data Reduction for the Min-Power Symmetric Connectivity Problem\",\"year\":\"2020\",\"author\":[{\"firstnames\":[\"Pavel\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]}],\"url\":\"http://rvb.su/pdf/Smi20b.pdf\",\"booktitle\":\"Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 58th International Scientific Student Conference, Mathematics)\",\"editor\":[{\"firstnames\":[\"S.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Goncharov\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Marchuk\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"I.\"],\"propositions\":[],\"lastnames\":[\"Takhonov\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Kaushan\"],\"suffixes\":[]}],\"pages\":\"136\",\"address\":\"Novosibirsk, April 10–13\",\"organization\":\"Novosibirsk State University\",\"bibtex\":\"@inProceedings{Smi20b,\\n  title =\\t {On Data Reduction for the Min-Power Symmetric\\n                  Connectivity Problem},\\n  year =\\t {2020},\\n  author =\\t {Pavel V. Smirnov},\\n  url =\\t\\t {http://rvb.su/pdf/Smi20b.pdf},\\n  booktitle =\\t {Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy\\n                  konferentsii, Matematika (Proceedings of the 58th\\n                  International Scientific Student Conference,\\n                  Mathematics)},\\n  editor =\\t {S. S. Goncharov and I. V. Marchuk and I. I. Takhonov\\n                  and K. A. Kaushan},\\n  pages =\\t 136,\\n  address =\\t {Novosibirsk, April 10--13},\\n  year =\\t 2020,\\n  organization = {Novosibirsk State University},\\n}\\n\\n\",\"author_short\":[\"Smirnov, P. V.\"],\"editor_short\":[\"Goncharov, S. S.\",\"Marchuk, I. V.\",\"Takhonov, I. I.\",\"Kaushan, K. A.\"],\"key\":\"Smi20b\",\"id\":\"Smi20b\",\"bibbaseid\":\"smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Smi20b.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Optimizatsiya FPT-algoritma dlya ustanovleniya svyaznosti besprovodnoy sensornoy seti [Optimization of an FPT-algorithm for connecting wireless sensor networks]\",\"author\":[{\"firstnames\":[\"Pavel\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]}],\"pages\":\"169\",\"url\":\"http://rvb.su/pdf/Smi19.pdf\",\"booktitle\":\"Materialy 57-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 57th International Scientific Student Conference, Mathematics)\",\"editor\":[{\"firstnames\":[\"S.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Goncharov\"],\"suffixes\":[]},{\"firstnames\":[\"E.\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Konstantinova\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"I.\"],\"propositions\":[],\"lastnames\":[\"Takhonov\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Kaushan\"],\"suffixes\":[]}],\"address\":\"Novosibirsk, April 14–19\",\"year\":\"2019\",\"organization\":\"Novosibirsk State University\",\"bibtex\":\"@inProceedings{Smi19,\\n  title =\\t {Optimizatsiya FPT-algoritma dlya ustanovleniya\\n                  svyaznosti besprovodnoy sensornoy seti [Optimization\\n                  of an FPT-algorithm for connecting wireless sensor\\n                  networks]},\\n  author =\\t {Pavel V. Smirnov},\\n  pages =\\t 169,\\n  url =\\t\\t {http://rvb.su/pdf/Smi19.pdf},\\n  booktitle =\\t {Materialy 57-y Mezhdunarodnoy nauchnoy studencheskoy\\n                  konferentsii, Matematika (Proceedings of the 57th\\n                  International Scientific Student Conference,\\n                  Mathematics)},\\n  editor =\\t {S. S. Goncharov and E. V. Konstantinova and\\n                  I. I. Takhonov and K. A. Kaushan},\\n  address =\\t {Novosibirsk, April 14--19},\\n  year =\\t 2019,\\n  organization = {Novosibirsk State University},\\n}\\n\\n\",\"author_short\":[\"Smirnov, P. V.\"],\"editor_short\":[\"Goncharov, S. S.\",\"Konstantinova, E. V.\",\"Takhonov, I. I.\",\"Kaushan, K. A.\"],\"key\":\"Smi19\",\"id\":\"Smi19\",\"bibbaseid\":\"smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Smi19.pdf\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat'yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space]\",\"author\":[{\"firstnames\":[\"Pavel\",\"V.\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]}],\"pages\":\"210\",\"url\":\"http://rvb.su/pdf/Smi18b.pdf\",\"booktitle\":\"Materialy 56-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 56th International Scientific Student Conference, Mathematics)\",\"editor\":[{\"firstnames\":[\"S.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Goncharov\"],\"suffixes\":[]},{\"firstnames\":[\"E.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Batyaev\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Kaushan\"],\"suffixes\":[]}],\"address\":\"Novosibirsk, April 22–27\",\"year\":\"2018\",\"organization\":\"Novosibirsk State University\",\"bibtex\":\"@inProceedings{Smi18b,\\n  title =\\t {Reduktsiya dannykh dlya zadachi o vershinnom\\n                  pokrytii gipergrafa za lineynoye vremya s lineynoy\\n                  pamyat'yu [Data Reduction for the Vertex Cover\\n                  Problem in Hypergraphs in linear time and space]},\\n  author =\\t {Pavel V. Smirnov},\\n  pages =\\t 210,\\n  url =\\t\\t {http://rvb.su/pdf/Smi18b.pdf},\\n  booktitle =\\t {Materialy 56-y Mezhdunarodnoy nauchnoy studencheskoy\\n                  konferentsii, Matematika (Proceedings of the 56th\\n                  International Scientific Student Conference,\\n                  Mathematics)},\\n  editor =\\t {S. S. Goncharov and E. A. Batyaev and K. A. Kaushan},\\n  address =\\t {Novosibirsk, April 22--27},\\n  year =\\t 2018,\\n  organization = {Novosibirsk State University},\\n}\\n\\n\\n\",\"author_short\":[\"Smirnov, P. V.\"],\"editor_short\":[\"Goncharov, S. S.\",\"Batyaev, E. A.\",\"Kaushan, K. A.\"],\"key\":\"Smi18b\",\"id\":\"Smi18b\",\"bibbaseid\":\"smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://rvb.su/pdf/Smi18b.pdf\"},\"metadata\":{\"authorlinks\":{}},\"downloads\":2,\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"rvb-students.bib\" href=\"data:text/bibtex;base64,QE1hc3RlcnNUaGVzaXN7U2thMjEsCiAgYXV0aG9yID0JIHtEYW5pZWwgQS4gU2thY2hrb3Z9LAogIHRpdGxlID0JIHtSZWR1a3RzaXlhIGRhbm55a2ggdiBncmFmaWNoZXNrb3kgemFkYWNoZQogICAgICAgICAgICAgICAgICBrb21taXZveWF6aNC1cmEgW0RhdGEgUmVkdWN0aW9uIGluIHRoZSBHcmFwaGljCiAgICAgICAgICAgICAgICAgIFRyYXZlbGluZyBTYWxlc21hbiBQcm9ibGVtXX0sCiAgc2Nob29sID0JIHtNb3Njb3cgSW5zdGl0dXRlIG9mIFBoeXNpY3MgYW5kIFRlY2hub2xvZ3l9LAogIHllYXIgPQkgezIwMjF9LAogIHR5cGUgPQkge0JhY2hlbG9yJ3MgVGhlc2lzfSwKICB1cmwgPQkJIHtodHRwOi8vcnZiLnN1L3BkZi9Ta2EyMS5wZGZ9Cn0KCgoKQE1hc3RlcnNUaGVzaXN7U21pMjAsCiAgYXV0aG9yID0JIHtQYXZlbCBWLiBTbWlybm92fSwKICB0aXRsZSA9CSB7UmF6cmFib3RrYSBhbGdvcml0bW92IGkgcHJvZ3JhbW1ub2dvIG9iZXNwZWNoZW5peWEKICAgICAgICAgICAgICAgICAgZGx5YSByZXNoZW5peWEgemFkYWNoIGFuYWxpemEgc2V0ZXZ5a2ggc3RydWt0dXIKICAgICAgICAgICAgICAgICAgW0FsZ29yaXRobSBhbmQgU29mdHdhcmUgRGVzaWduIGZvciBOZXR3b3JrIEFuYWx5c2lzCiAgICAgICAgICAgICAgICAgIFByb2JsZW1zXX0sCiAgc2Nob29sID0JIHtOb3Zvc2liaXJzayBTdGF0ZSBVbml2ZXJzaXR5fSwKICB5ZWFyID0JIDIwMjAsCiAgdXJsID0JCSB7aHR0cDovL3J2Yi5zdS9wZGYvU21pMjAucGRmfQp9CgoKCkBNYXN0ZXJzVGhlc2lze1NtaTE4LAogIGF1dGhvciA9CSB7UGF2ZWwgVi4gU21pcm5vdn0sCiAgdGl0bGUgPQkge1JlZHVrdHNpeWEgZGFubnlraCBkbHlhIHphZGFjaGkgbyB2ZXJzaGlubm9tCiAgICAgICAgICAgICAgICAgIHBva3J5dGlpIGdpcGVyZ3JhZmEgemEgbGluZXlub3llIHZyZW15YSBzIGxpbmV5bm95CiAgICAgICAgICAgICAgICAgIHBhbXlhdCd5dSBbRGF0YSBSZWR1Y3Rpb24gZm9yIHRoZSBWZXJ0ZXggQ292ZXIKICAgICAgICAgICAgICAgICAgUHJvYmxlbSBpbiBIeXBlcmdyYXBocyBpbiBsaW5lYXIgdGltZSBhbmQgc3BhY2VdfSwKICBzY2hvb2wgPQkge05vdm9zaWJpcnNrIFN0YXRlIFVuaXZlcnNpdHl9LAogIHllYXIgPQkgMjAxOCwKICB0eXBlID0JIHtCYWNoZWxvcidzIFRoZXNpc30sCiAgdXJsID0JCSB7aHR0cDovL3J2Yi5zdS9wZGYvU21pMTgucGRmfQp9CgoKCgoKQGlucHJvY2VlZGluZ3N7QWZhMjAsCiAgdGl0bGUgPQkge0FwcHJveGltYXRpb24gYWxnb3JpdGhtcyBmb3IgdGhlIEhpZXJhcmNoaWNhbAogICAgICAgICAgICAgICAgICBDaGluZXNlIFBvc3RtYW4gUHJvYmxlbX0sCiAgYXV0aG9yID0JIHtWc2V2b2xvZCBBLiBBZmFuYXNldn0sCiAgeWVhciA9CSB7MjAyMH0sCiAgdXJsID0JCSB7aHR0cDovL3J2Yi5zdS9wZGYvQWZhMjAucGRmfSwKICBib29rdGl0bGUgPQkge01hdGVyaWFseSA1OC15IE1lemhkdW5hcm9kbm95IG5hdWNobm95IHN0dWRlbmNoZXNrb3kKICAgICAgICAgICAgICAgICAga29uZmVyZW50c2lpLCBNYXRlbWF0aWthIChQcm9jZWVkaW5ncyBvZiB0aGUgNTh0aAogICAgICAgICAgICAgICAgICBJbnRlcm5hdGlvbmFsIFNjaWVudGlmaWMgU3R1ZGVudCBDb25mZXJlbmNlLAogICAgICAgICAgICAgICAgICBNYXRoZW1hdGljcyl9LAogIGVkaXRvciA9CSB7Uy4gUy4gR29uY2hhcm92IGFuZCBJLiBWLiBNYXJjaHVrIGFuZCBJLiBJLiBUYWtob25vdgogICAgICAgICAgICAgICAgICBhbmQgSy4gQS4gS2F1c2hhbn0sCiAgcGFnZXMgPQkgMTM1LAogIGFkZHJlc3MgPQkge05vdm9zaWJpcnNrLCBBcHJpbCAxMC0tMTN9LAogIG9yZ2FuaXphdGlvbiA9IHtOb3Zvc2liaXJzayBTdGF0ZSBVbml2ZXJzaXR5fSwKICB5ZWFyID0JIDIwMjAsCn0KCgoKQGluUHJvY2VlZGluZ3N7U21pMjBiLAogIHRpdGxlID0JIHtPbiBEYXRhIFJlZHVjdGlvbiBmb3IgdGhlIE1pbi1Qb3dlciBTeW1tZXRyaWMKICAgICAgICAgICAgICAgICAgQ29ubmVjdGl2aXR5IFByb2JsZW19LAogIHllYXIgPQkgezIwMjB9LAogIGF1dGhvciA9CSB7UGF2ZWwgVi4gU21pcm5vdn0sCiAgdXJsID0JCSB7aHR0cDovL3J2Yi5zdS9wZGYvU21pMjBiLnBkZn0sCiAgYm9va3RpdGxlID0JIHtNYXRlcmlhbHkgNTgteSBNZXpoZHVuYXJvZG5veSBuYXVjaG5veSBzdHVkZW5jaGVza295CiAgICAgICAgICAgICAgICAgIGtvbmZlcmVudHNpaSwgTWF0ZW1hdGlrYSAoUHJvY2VlZGluZ3Mgb2YgdGhlIDU4dGgKICAgICAgICAgICAgICAgICAgSW50ZXJuYXRpb25hbCBTY2llbnRpZmljIFN0dWRlbnQgQ29uZmVyZW5jZSwKICAgICAgICAgICAgICAgICAgTWF0aGVtYXRpY3MpfSwKICBlZGl0b3IgPQkge1MuIFMuIEdvbmNoYXJvdiBhbmQgSS4gVi4gTWFyY2h1ayBhbmQgSS4gSS4gVGFraG9ub3YKICAgICAgICAgICAgICAgICAgYW5kIEsuIEEuIEthdXNoYW59LAogIHBhZ2VzID0JIDEzNiwKICBhZGRyZXNzID0JIHtOb3Zvc2liaXJzaywgQXByaWwgMTAtLTEzfSwKICB5ZWFyID0JIDIwMjAsCiAgb3JnYW5pemF0aW9uID0ge05vdm9zaWJpcnNrIFN0YXRlIFVuaXZlcnNpdHl9LAp9CgoKCkBpblByb2NlZWRpbmdze1NtaTE5LAogIHRpdGxlID0JIHtPcHRpbWl6YXRzaXlhIEZQVC1hbGdvcml0bWEgZGx5YSB1c3Rhbm92bGVuaXlhCiAgICAgICAgICAgICAgICAgIHN2eWF6bm9zdGkgYmVzcHJvdm9kbm95IHNlbnNvcm5veSBzZXRpIFtPcHRpbWl6YXRpb24KICAgICAgICAgICAgICAgICAgb2YgYW4gRlBULWFsZ29yaXRobSBmb3IgY29ubmVjdGluZyB3aXJlbGVzcyBzZW5zb3IKICAgICAgICAgICAgICAgICAgbmV0d29ya3NdfSwKICBhdXRob3IgPQkge1BhdmVsIFYuIFNtaXJub3Z9LAogIHBhZ2VzID0JIDE2OSwKICB1cmwgPQkJIHtodHRwOi8vcnZiLnN1L3BkZi9TbWkxOS5wZGZ9LAogIGJvb2t0aXRsZSA9CSB7TWF0ZXJpYWx5IDU3LXkgTWV6aGR1bmFyb2Rub3kgbmF1Y2hub3kgc3R1ZGVuY2hlc2tveQogICAgICAgICAgICAgICAgICBrb25mZXJlbnRzaWksIE1hdGVtYXRpa2EgKFByb2NlZWRpbmdzIG9mIHRoZSA1N3RoCiAgICAgICAgICAgICAgICAgIEludGVybmF0aW9uYWwgU2NpZW50aWZpYyBTdHVkZW50IENvbmZlcmVuY2UsCiAgICAgICAgICAgICAgICAgIE1hdGhlbWF0aWNzKX0sCiAgZWRpdG9yID0JIHtTLiBTLiBHb25jaGFyb3YgYW5kIEUuIFYuIEtvbnN0YW50aW5vdmEgYW5kCiAgICAgICAgICAgICAgICAgIEkuIEkuIFRha2hvbm92IGFuZCBLLiBBLiBLYXVzaGFufSwKICBhZGRyZXNzID0JIHtOb3Zvc2liaXJzaywgQXByaWwgMTQtLTE5fSwKICB5ZWFyID0JIDIwMTksCiAgb3JnYW5pemF0aW9uID0ge05vdm9zaWJpcnNrIFN0YXRlIFVuaXZlcnNpdHl9LAp9CgoKCkBpblByb2NlZWRpbmdze1NtaTE4YiwKICB0aXRsZSA9CSB7UmVkdWt0c2l5YSBkYW5ueWtoIGRseWEgemFkYWNoaSBvIHZlcnNoaW5ub20KICAgICAgICAgICAgICAgICAgcG9rcnl0aWkgZ2lwZXJncmFmYSB6YSBsaW5leW5veWUgdnJlbXlhIHMgbGluZXlub3kKICAgICAgICAgICAgICAgICAgcGFteWF0J3l1IFtEYXRhIFJlZHVjdGlvbiBmb3IgdGhlIFZlcnRleCBDb3ZlcgogICAgICAgICAgICAgICAgICBQcm9ibGVtIGluIEh5cGVyZ3JhcGhzIGluIGxpbmVhciB0aW1lIGFuZCBzcGFjZV19LAogIGF1dGhvciA9CSB7UGF2ZWwgVi4gU21pcm5vdn0sCiAgcGFnZXMgPQkgMjEwLAogIHVybCA9CQkge2h0dHA6Ly9ydmIuc3UvcGRmL1NtaTE4Yi5wZGZ9LAogIGJvb2t0aXRsZSA9CSB7TWF0ZXJpYWx5IDU2LXkgTWV6aGR1bmFyb2Rub3kgbmF1Y2hub3kgc3R1ZGVuY2hlc2tveQogICAgICAgICAgICAgICAgICBrb25mZXJlbnRzaWksIE1hdGVtYXRpa2EgKFByb2NlZWRpbmdzIG9mIHRoZSA1NnRoCiAgICAgICAgICAgICAgICAgIEludGVybmF0aW9uYWwgU2NpZW50aWZpYyBTdHVkZW50IENvbmZlcmVuY2UsCiAgICAgICAgICAgICAgICAgIE1hdGhlbWF0aWNzKX0sCiAgZWRpdG9yID0JIHtTLiBTLiBHb25jaGFyb3YgYW5kIEUuIEEuIEJhdHlhZXYgYW5kIEsuIEEuIEthdXNoYW59LAogIGFkZHJlc3MgPQkge05vdm9zaWJpcnNrLCBBcHJpbCAyMi0tMjd9LAogIHllYXIgPQkgMjAxOCwKICBvcmdhbml6YXRpb24gPSB7Tm92b3NpYmlyc2sgU3RhdGUgVW5pdmVyc2l0eX0sCn0KCgo=\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=http://rvb.su/rvb-students.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=http://rvb.su/rvb-students.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=http%3A%2F%2Frvb.su%2Frvb-students.bib&amp;jsonp=1&amp;theme=mila&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=http%3A%2F%2Frvb.su%2Frvb-students.bib&amp;jsonp=1&amp;theme=mila\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=http%3A%2F%2Frvb.su%2Frvb-students.bib&amp;jsonp=1&amp;theme=mila\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Ska21.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021', 'http://rvb.su/pdf/Ska21.pdf', event);\">\n    Reduktsiya dannykh v graficheskoy zadache kommivoyazhеra [Data Reduction in the Graphic Traveling Salesman Problem].\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Skachkov, D. A.\n</span>\n\n  \n\n</span>\n\n  Bachelor's Thesis, Moscow Institute of Physics and Technology,  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Ska21.pdf\"\n     onclick=\"log_download('skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021', 'http://rvb.su/pdf/Ska21.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Reduktsiya dannykh v graficheskoy zadache kommivoyazhеra [Data Reduction in the Graphic Traveling Salesman Problem] [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('skachkov-reduktsiyadannykhvgraficheskoyzadachekommivoyazhradatareductioninthegraphictravelingsalesmanproblem-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@MastersThesis{Ska21,\n  author =\t {Daniel A. Skachkov},\n  title =\t {Reduktsiya dannykh v graficheskoy zadache\n                  kommivoyazhеra [Data Reduction in the Graphic\n                  Traveling Salesman Problem]},\n  school =\t {Moscow Institute of Physics and Technology},\n  year =\t {2021},\n  type =\t {Bachelor&#x27;s Thesis},\n  url =\t\t {http://rvb.su/pdf/Ska21.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Smi20.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020', 'http://rvb.su/pdf/Smi20.pdf', event);\">\n    Razrabotka algoritmov i programmnogo obespecheniya dlya resheniya zadach analiza setevykh struktur [Algorithm and Software Design for Network Analysis Problems].\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Smirnov, P. V.\n</span>\n\n  \n\n</span>\n\n  Master's thesis, Novosibirsk State University,  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Smi20.pdf\"\n     onclick=\"log_download('smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020', 'http://rvb.su/pdf/Smi20.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Razrabotka algoritmov i programmnogo obespecheniya dlya resheniya zadach analiza setevykh struktur [Algorithm and Software Design for Network Analysis Problems] [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('smirnov-razrabotkaalgoritmoviprogrammnogoobespecheniyadlyaresheniyazadachanalizasetevykhstrukturalgorithmandsoftwaredesignfornetworkanalysisproblems-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@MastersThesis{Smi20,\n  author =\t {Pavel V. Smirnov},\n  title =\t {Razrabotka algoritmov i programmnogo obespecheniya\n                  dlya resheniya zadach analiza setevykh struktur\n                  [Algorithm and Software Design for Network Analysis\n                  Problems]},\n  school =\t {Novosibirsk State University},\n  year =\t 2020,\n  url =\t\t {http://rvb.su/pdf/Smi20.pdf}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Afa20.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020', 'http://rvb.su/pdf/Afa20.pdf', event);\">\n    Approximation algorithms for the Hierarchical Chinese Postman Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Afanasev, V. A.\n</span>\n\n  \n\n</span>\n\n  In Goncharov, S. S.; Marchuk, I. V.; Takhonov, I. I.;  and Kaushan, K. A., editor(s), <i>Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 58th International Scientific Student Conference, Mathematics)</i>, pages 135, Novosibirsk, April 10–13,  2020. Novosibirsk State University\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Afa20.pdf\"\n     onclick=\"log_download('afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020', 'http://rvb.su/pdf/Afa20.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Approximation algorithms for the Hierarchical Chinese Postman Problem [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('afanasev-approximationalgorithmsforthehierarchicalchinesepostmanproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Afa20,\n  title =\t {Approximation algorithms for the Hierarchical\n                  Chinese Postman Problem},\n  author =\t {Vsevolod A. Afanasev},\n  year =\t {2020},\n  url =\t\t {http://rvb.su/pdf/Afa20.pdf},\n  booktitle =\t {Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy\n                  konferentsii, Matematika (Proceedings of the 58th\n                  International Scientific Student Conference,\n                  Mathematics)},\n  editor =\t {S. S. Goncharov and I. V. Marchuk and I. I. Takhonov\n                  and K. A. Kaushan},\n  pages =\t 135,\n  address =\t {Novosibirsk, April 10--13},\n  organization = {Novosibirsk State University},\n  year =\t 2020,\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Smi20b.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020', 'http://rvb.su/pdf/Smi20b.pdf', event);\">\n    On Data Reduction for the Min-Power Symmetric Connectivity Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Smirnov, P. V.\n</span>\n\n  \n\n</span>\n\n  In Goncharov, S. S.; Marchuk, I. V.; Takhonov, I. I.;  and Kaushan, K. A., editor(s), <i>Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 58th International Scientific Student Conference, Mathematics)</i>, pages 136, Novosibirsk, April 10–13,  2020. Novosibirsk State University\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Smi20b.pdf\"\n     onclick=\"log_download('smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020', 'http://rvb.su/pdf/Smi20b.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"On Data Reduction for the Min-Power Symmetric Connectivity Problem [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('smirnov-ondatareductionfortheminpowersymmetricconnectivityproblem-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inProceedings{Smi20b,\n  title =\t {On Data Reduction for the Min-Power Symmetric\n                  Connectivity Problem},\n  year =\t {2020},\n  author =\t {Pavel V. Smirnov},\n  url =\t\t {http://rvb.su/pdf/Smi20b.pdf},\n  booktitle =\t {Materialy 58-y Mezhdunarodnoy nauchnoy studencheskoy\n                  konferentsii, Matematika (Proceedings of the 58th\n                  International Scientific Student Conference,\n                  Mathematics)},\n  editor =\t {S. S. Goncharov and I. V. Marchuk and I. I. Takhonov\n                  and K. A. Kaushan},\n  pages =\t 136,\n  address =\t {Novosibirsk, April 10--13},\n  year =\t 2020,\n  organization = {Novosibirsk State University},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Smi19.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019', 'http://rvb.su/pdf/Smi19.pdf', event);\">\n    Optimizatsiya FPT-algoritma dlya ustanovleniya svyaznosti besprovodnoy sensornoy seti [Optimization of an FPT-algorithm for connecting wireless sensor networks].\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Smirnov, P. V.\n</span>\n\n  \n\n</span>\n\n  In Goncharov, S. S.; Konstantinova, E. V.; Takhonov, I. I.;  and Kaushan, K. A., editor(s), <i>Materialy 57-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 57th International Scientific Student Conference, Mathematics)</i>, pages 169, Novosibirsk, April 14–19,  2019. Novosibirsk State University\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Smi19.pdf\"\n     onclick=\"log_download('smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019', 'http://rvb.su/pdf/Smi19.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Optimizatsiya FPT-algoritma dlya ustanovleniya svyaznosti besprovodnoy sensornoy seti [Optimization of an FPT-algorithm for connecting wireless sensor networks] [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('smirnov-optimizatsiyafptalgoritmadlyaustanovleniyasvyaznostibesprovodnoysensornoysetioptimizationofanfptalgorithmforconnectingwirelesssensornetworks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inProceedings{Smi19,\n  title =\t {Optimizatsiya FPT-algoritma dlya ustanovleniya\n                  svyaznosti besprovodnoy sensornoy seti [Optimization\n                  of an FPT-algorithm for connecting wireless sensor\n                  networks]},\n  author =\t {Pavel V. Smirnov},\n  pages =\t 169,\n  url =\t\t {http://rvb.su/pdf/Smi19.pdf},\n  booktitle =\t {Materialy 57-y Mezhdunarodnoy nauchnoy studencheskoy\n                  konferentsii, Matematika (Proceedings of the 57th\n                  International Scientific Student Conference,\n                  Mathematics)},\n  editor =\t {S. S. Goncharov and E. V. Konstantinova and\n                  I. I. Takhonov and K. A. Kaushan},\n  address =\t {Novosibirsk, April 14--19},\n  year =\t 2019,\n  organization = {Novosibirsk State University},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Smi18.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018', 'http://rvb.su/pdf/Smi18.pdf', event);\">\n    Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat'yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space].\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Smirnov, P. V.\n</span>\n\n  \n\n</span>\n\n  Bachelor's Thesis, Novosibirsk State University,  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Smi18.pdf\"\n     onclick=\"log_download('smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018', 'http://rvb.su/pdf/Smi18.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat&#x27;yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space] [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@MastersThesis{Smi18,\n  author =\t {Pavel V. Smirnov},\n  title =\t {Reduktsiya dannykh dlya zadachi o vershinnom\n                  pokrytii gipergrafa za lineynoye vremya s lineynoy\n                  pamyat&#x27;yu [Data Reduction for the Vertex Cover\n                  Problem in Hypergraphs in linear time and space]},\n  school =\t {Novosibirsk State University},\n  year =\t 2018,\n  type =\t {Bachelor&#x27;s Thesis},\n  url =\t\t {http://rvb.su/pdf/Smi18.pdf}\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rvb.su/pdf/Smi18b.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018', 'http://rvb.su/pdf/Smi18b.pdf', event);\">\n    Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat'yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space].\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Smirnov, P. V.\n</span>\n\n  \n\n</span>\n\n  In Goncharov, S. S.; Batyaev, E. A.;  and Kaushan, K. A., editor(s), <i>Materialy 56-y Mezhdunarodnoy nauchnoy studencheskoy konferentsii, Matematika (Proceedings of the 56th International Scientific Student Conference, Mathematics)</i>, pages 210, Novosibirsk, April 22–27,  2018. Novosibirsk State University\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rvb.su/pdf/Smi18b.pdf\"\n     onclick=\"log_download('smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018', 'http://rvb.su/pdf/Smi18b.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Reduktsiya dannykh dlya zadachi o vershinnom pokrytii gipergrafa za lineynoye vremya s lineynoy pamyat&#x27;yu [Data Reduction for the Vertex Cover Problem in Hypergraphs in linear time and space] [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('smirnov-reduktsiyadannykhdlyazadachiovershinnompokrytiigipergrafazalineynoyevremyaslineynoypamyatyudatareductionforthevertexcoverprobleminhypergraphsinlineartimeandspace-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inProceedings{Smi18b,\n  title =\t {Reduktsiya dannykh dlya zadachi o vershinnom\n                  pokrytii gipergrafa za lineynoye vremya s lineynoy\n                  pamyat&#x27;yu [Data Reduction for the Vertex Cover\n                  Problem in Hypergraphs in linear time and space]},\n  author =\t {Pavel V. Smirnov},\n  pages =\t 210,\n  url =\t\t {http://rvb.su/pdf/Smi18b.pdf},\n  booktitle =\t {Materialy 56-y Mezhdunarodnoy nauchnoy studencheskoy\n                  konferentsii, Matematika (Proceedings of the 56th\n                  International Scientific Student Conference,\n                  Mathematics)},\n  editor =\t {S. S. Goncharov and E. A. Batyaev and K. A. Kaushan},\n  address =\t {Novosibirsk, April 22--27},\n  year =\t 2018,\n  organization = {Novosibirsk State University},\n}\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);