| Дисертация д-р |
|
|
Минко Маринов Марков, ВЪРХОВО РАЗДЕЛЕНИЕ НА КАКТУСОВИ ГРАФИ И МАКСИМАЛНО ВЪНШНОПЛАНАРНИ
ГРАФИ, ИМИ-БАН, Ръководител:ст. н. с. доктор Радослав Павлов, ИМИ-БАН
|
2010
|
| Научен проект |
|
1
|
Минко Марков, Workshop on Algorithmic Graph Theory, Член, MITACS (Mathematics of Information Technology and Complex Systems), Номер на договора:10-03-146-
|
2011
|
|
2
|
Минко Марков, Алгоритми и обучение по алгоритми, Член, ФМИ
|
2011
|
|
3
|
Минко Марков, Дискетни и алгебрични структури, Член, ФМИ
|
2010
|
|
4
|
Минко Марков, Дискретни Структури, Ръководител, ФМИ, Номер на договора:267
|
2009
|
| Научно ръководство |
|
1
|
Минко Марков, Piratewish - Уеб-бьзирана игра в реално време, ФМИ дипломна работа:Емил Владев Иванов
|
2013
|
|
2
|
Минко Марков, Онлайн услуга за събиране, анализиране и визуализиране на данни, ФМИ дипломна работа:Андрей Тодоров Козовски М-21749
|
2013
|
| Статия в научно списание |
|
1
|
Minko Markov, Vladislav Haralmpiev, Georgi Georgiev, Lower Bounds on the Directed Sweepwidth of Planar Shapes, Serdica Journal of Computing, vol:9, issue:2, 2015, pages:151-166
|
2015
|
|
2
|
Minko Markov, Vladislav Haralampiev, Georgi Georgiev, Lower bounds on the directed sweepwidth of planar shapes, Serdica Journal of Computing, vol:9, issue:2, 2015, pages:151-166, ISSN (print):1312-6555, ISSN (online):1314-7897, Ref, Zentralblatt
|
2015
|
|
3
|
Siavash Soleimanifard, Dilian Gurov, Ina Schaefer, Bjarte Østvold, Minko Markov, Model Mining and Efficient Verification of Software Product Lines, Serdica Journal of Computing, vol:9, issue:1, 2015, International
|
2015
|
|
4
|
Minko Markov, Tzvetalin S. Vassilev, Krassimir Manev, A Linear Time Algorithm for Computing Longest Paths in 2-Trees, Ars Combinatoria, vol:112, 2013, pages:329-0, Ref, Web of Science
|
2013
|
|
5
|
Minko Markov, Krassimir Manev, Algorithmic Results on a Novel Computational Problem, Olympiads in Informatics, vol:7, 2013, pages:61-77
|
2013
|
|
6
|
Minko Markov, Krassimir Manev, Mugurel Andreica, Nikolae Tapus, A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs, Serdica Journal of Computing, vol:6, issue:3, 2012, pages:287-298, Ref, Web of Science
|
2012
|
|
7
|
Krassimir Manev, N. Nikolov, Minko Markov, Reconstruction of Trees Using Metric Properties, Olympiads in Informatics, vol:5, 2011, pages:82-91
|
2011
|
|
8
|
Minko Markov, On the vertex separation of maximal outerplanar graphs, Serdica Journal of Computing, vol:3, 2008, pages:207-283, Ref
|
2008
|
|
9
|
Minko Markov, On the vertex separation of cactus graphs, Serdica Journal of Computing, vol:1, 2007, pages:45-72, Ref
|
2007
|
|
10
|
Minko Markov, John Ellis, Computing the vertex separation of unicyclic graphs, Information and Computation, vol:192, 2004, pages:123-161, Ref, Web of Science
|
2004
|
|
11
|
John Ellis, Minko Markov, In-Situ, Stable Merging by way of the Perfect Shuffle, The Computer Journal, vol:43, issue:1, 2000, pages:40-53, Ref, Web of Science
|
2000
|
| Статия в сборник (на конференция и др.) |
|
1
|
Dilian Gurov, Minko Markov, Self-Correlation and Maximum Independence in Finite Relations, Proceedings of the Tenth International Workshop of Fixed Points in Computer Science, 2015, doi:10.4204/EPTCS.191.7, Ref, International
|
2015
|
|
2
|
Borislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev, Decontaminating Planar Regions by Sweeping with Barrier Curves , CCCG 2014 Proceedings, 2014, pages:206-211, International
|
2014
|
| Участие в конференция |
|
1
|
Секционен доклад, Минко Марков, The sweeping of planar shapes: a geometric analogue of graph searching
|
2017
|
|
2
|
Секционен доклад, Минко Марков, Корелираност и независимост в релации
|
2015
|
|
3
|
Секционен доклад, Минко Марков, Self-Correlation and Maximum Independence in Finite Relations
|
2015
|
|
4
|
Секционен доклад, Владислав Харалампиев, Lower Bounds for the Sweepwidth of Polygons
|
2014
|
|
5
|
Секционен доклад, Минко Марков, On the Geometric Analogue of Graph Search of Planar Graphs
|
2012
|
|
6
|
Секционен доклад, Минко Марков, On the Middle Level Conjecture
|
2012
|
|
7
|
Секционен доклад, Минко Марков, A Linear Time Algorithm for the Longest Path Problem on 2-trees
|
2011
|
|
8
|
Секционен доклад, Минко Марков, Towards the Construction of a Fast Algorithm for the Vertex Separation Problem on Cactus Graphs
|
2011
|
|
9
|
Секционен доклад, Минко Марков, Vertex Separation in Graphs
|
2010
|
|
10
|
Секционен доклад, Минко Марков, Longest Paths in Cactus Graphs
|
2010
|
|
11
|
Секционен доклад, Минко Марков, The reversibility of graph layout multistretchability
|
2007
|
|