• Info
• Literatúra
• Ciele práce
• Aktuálny stav
• Súbory

• M. Novotný. Design and analysis of a generalized canvas protocol, volume 6033 LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2010. Cited By :27.


• B. Brešar, F. Kardoš, J. Katrenič, and G. Semanišin. Minimum k-path vertex cover. Discrete Applied Mathematics, 159(12):1189–1195, 2011. Cited By :58.


• F. Kardoš, J. Katrenič, and I. Schiermeyer. On computing the minimum 3-path vertex cover and dissociation number of graphs. Theoretical Computer Science, 412(50):7009–7017, 2011. Cited By :29.


• J. Tu and W. Zhou. A primal-dual approximation algorithm for the vertex cover p 3 problem. Theoretical Computer Science, 412(50):7044–7048, 2011. Cited By :29.


• J. Tu and W. Zhou. A factor 2 approximation algorithm for the vertex cover p3problem. Information Processing Letters, 111(14):683–686, 2011. Cited By :34.


• Y. Li and J. Tu. An efficient algorithm for the vertex cover p k problem on unicyclic graphs. Beijing Huagong Daxue Xuebao (Ziran Kexueban)/Journal of Beijing University of Chemical Technology (Natural Science Edition), 39(4):125–127, 2012.


• R. Erveš and P. Šparl. Different graph invariants and hexagonal graphs. In Proceedings of the 12th International Symposium on Operational Research in Slovenia, SOR 2013, pages 143–148, 2013.


• M. Jakovac and A. Taranenko. On the k-path vertex cover of some graph products. Discrete Mathematics, 313(1):94–100, 2013. Cited By :16.


• J. Tu and F. Yang. The vertex cover p3 problem in cubic graphs. Information Processing Letters, 113(13):481–485, 2013. Cited By :15.


• X. Liu, H. Lu, W. Wang, and W. Wu. Ptas for the minimum k-path connected vertex cover problem in unit disk graphs. Journal of Global Optimization, 56(2):449–458, 2013. Cited By :13.


• B. Brešar, M. Jakovac, J. Katrenič, G. Semanišin, and A. Taranenko. On the vertex k-path cover. Discrete Applied Mathematics, 161(13-14):1943–1949, 2013. Cited By :24.


• Y. Chu, J. Fan, W. Liu, and C. . Lin. PTAS for minimum k-Path connected vertex cover in growth-bounded graphs, volume 8630 LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2014.


• Y. Li and J. Tu. A 2-approximation algorithm for the vertex cover p4problem in cubic graphs. International Journal of Computer Mathematics, 91(10):2103–2108, 2014. Cited By :7.


• S. Funke, A. Nusser, and S. Storandt. On k-path covers and their applications. Proceedings of the VLDB Endowment, 7(10):893–902, 2014. Cited By :17.


• X. Li, Z. Zhang, and X. Huang. Approximation algorithm for the minimum connected k-path vertex cover problem, volume 8881 of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2014.


• A. Mazumdar. Achievable schemes and limits for local recovery on a graph. In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, pages 909–913, 2014. Cited By :3.


• B. Brešar, R. Krivoš-Belluš, G. Semanišin, and P. Šparl. On the weighted k-path vertex cover problem. Discrete Applied Mathematics, 177:14–18, 2014. Cited By :12.


• N. Safina Devi, A. C. Mane, and S. Mishra. Computational complexity of minimum p4 vertex cover problem for regular and k 1, 4-free graphs. Discrete Applied Mathematics, 184:114–121, 2015. Cited By :2.


• M. Xiao and S. Kou. Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs, volume 9130 of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2015. Cited By :3.


• J. Tu. A fixed-parameter algorithm for the vertex cover p3 problem. Information Processing Letters, 115(2):96–99, 2015. Cited By :21.


• M. Jakovac. The k-path vertex cover of rooted product graphs. Discrete Applied Mathematics, 187:111–119, 2015. Cited By :4.


• B. Ries, B. Schamberg, and W. Unger. The k-observer problem on d-regular graphs, volume 9212 of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2015.


• S. Bakalarski and J. Zygadło. On the path sequence of a graph. Schedae Informaticae, 24:239–251, 2015.


• L. Sharifan, M. Nasernejad, and K. Khashyarmanesh. Minimal path cover sets and monomial ideals. Journal of Algebra and its Applications, 14(2), 2015. Cited By :1.


• A. Mazumdar. Storage capacity of repairable networks. IEEE Transactions on Information Theory, 61(11):5810–5821, 2015. Cited By :8.


• M. Paindavoine and B. Vialla. Minimizing the number of bootstrappings in fully homomorphic encryption, volume 9566 of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2016. Cited By :4.


• X. Li, Z. Zhang, and X. Huang. Approximation algorithms for minimum (weight) connected k-path vertex cover. Discrete Applied Mathematics, 205:101–108, 2016. Cited By :5.


• P. Durga Bhavani, K. Vijay Kumar, and S. Satyanarayana. An investigation on some theorems on k-path vertex cover. Global Journal of Pure and Applied Mathematics, 12(2):1403–1412, 2016.


• M. Dettlaff, M. Lemánska, G. Semanǐsin, and R. Zuazua. Some variations of perfect graphs. Discussiones Mathematicae - Graph Theory, 36(3):661–668, 2016.


• M. Lemańska. On the minimum vertex k-path cover of trees. Utilitas Mathematica, 100:299–307, 2016.


• I. Hartstein, M. Shalom, and S. Zaks. On the complexity of the regenerator location problem treewidth and other parameters. Discrete Applied Mathematics, 199:199–225, 2016.


• S. Funke, A. Nusser, and S. Storandt. On k-path covers and their applications. VLDB Journal, 25(1):103–123, 2016.


• J. Katrenič. A faster fpt algorithm for 3-path vertex cover. Information Processing Letters, 116(4):273–278, 2016. Cited By :7.


• J. Tu and Z. Jin. An fpt algorithm for the vertex coverp4problem. Discrete Applied Mathematics, 200:186–190, 2016. Cited By :2.


• M. . Chang, L. . Chen, L. . Hung, P. Rossmanith, and P. . Su. Fixedparameter algorithms for vertex cover p3. Discrete Optimization, 19:12–22, 2016. Cited By :6.


• R. Erveš and P. Šparl. Maximum induced matching of hexagonal graphs. Bulletin of the Malaysian Mathematical Sciences Society, 39:283–295, 2016.


• C. Brause and I. Schiermeyer. Kernelization of the 3-path vertex cover problem. Discrete Mathematics, 339(7):1935–1939, 2016.


• T. Akiba, Y. Yano, and N. Mizuno. Hierarchical and dynamic k-path covers. In International Conference on Information and Knowledge Management, Proceedings, volume 24-28-October-2016, pages 1543–1552, 2016.


• M. Xiao and S. Kou. Kernelization and parameterized algorithms for 3-path vertex cover, volume 10185 LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. Cited By :1.


• E. Lee. Partitioning a graph into small pieces with applications to path transversal. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1546–1558, 2017. Cited By :4.


• L. Wang, W. Du, Z. Zhang, and X. Zhang. A ptas for minimum weighted connected vertex cover p3problem in 3-dimensional wireless sensor networks. Journal of Combinatorial Optimization, 33(1):106–122, 2017.Cited By :4.


• Z. Zhang, X. Huang, and L. Chen. A simpler method to obtain a PTAs for connected k-path vertex cover in unit disk graph, volume 10251 LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017.


• M. Xiao and S. Kou. Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theoretical Computer Science, 657:86–97, 2017. Cited By :2.


• Z. Zhang, X. Li, Y. Shi, H. Nie, and Y. Zhu. Ptas for minimum k-path vertex cover in ball graph. Information Processing Letters, 119:9–13, 2017. Cited By :3.


• C. Brause and R. Krivoš-Belluš. On a relation between k-path partition and k-path vertex cover. Discrete Applied Mathematics, 223:28–38, 2017.


• J. Tu, L. Wu, J. Yuan, and L. Cui. On the vertex cover p3problem parameterized by treewidth. Journal of Combinatorial Optimization, 34(2):414–425, 2017.


• J. Tu. Efficient algorithm for the vertex cover pkproblem on cacti. Applied Mathematics and Computation, 311:217–222, 2017.


• T. Fujito. On approximability of Connected Path Vertex Cover, volume 10787 LNCS of Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018.


• Z. Li and L. Zuo. The k-path vertex cover in cartesian product graphs and complete bipartite graphs. Applied Mathematics and Computation, 331:69–79, 2018.