Spiga, Pablo; Xia, Binzhou Constructing infinitely many half-arc-transitive covers of tetravalent graphs. (English) Zbl 07313981 J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021). MSC: 68W PDF BibTeX XML Cite \textit{P. Spiga} and \textit{B. Xia}, J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021; Zbl 07313981) Full Text: DOI
Samanta, Aniruddha; Kannan, M. Rajesh Bounds for the energy of a complex unit gain graph. (English) Zbl 07312053 Linear Algebra Appl. 612, 1-29 (2021). MSC: 05C50 05C22 05C35 PDF BibTeX XML Cite \textit{A. Samanta} and \textit{M. R. Kannan}, Linear Algebra Appl. 612, 1--29 (2021; Zbl 07312053) Full Text: DOI
Bishnoi, Anurag; Das, Shagnik; Morris, Patrick; Szabó, Tibor Ryser’s conjecture for \(t\)-intersecting hypergraphs. (English) Zbl 07304866 J. Comb. Theory, Ser. A 179, Article ID 105366, 24 p. (2021). MSC: 05C65 PDF BibTeX XML Cite \textit{A. Bishnoi} et al., J. Comb. Theory, Ser. A 179, Article ID 105366, 24 p. (2021; Zbl 07304866) Full Text: DOI
Kao, Mong-Jen Iterative partial rounding for vertex cover with hard capacities. (English) Zbl 07303843 Algorithmica 83, No. 1, 45-71 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M.-J. Kao}, Algorithmica 83, No. 1, 45--71 (2021; Zbl 07303843) Full Text: DOI
Glazik, Christian; Jäger, Gerold; Schiemann, Jan; Srivastav, Anand Bounds for the static permutation mastermind game. (English) Zbl 07302673 Discrete Math. 344, No. 3, Article ID 112253, 13 p. (2021). MSC: 91A46 91A05 PDF BibTeX XML Cite \textit{C. Glazik} et al., Discrete Math. 344, No. 3, Article ID 112253, 13 p. (2021; Zbl 07302673) Full Text: DOI
Cabrera Martínez, Abel; Kuziak, Dorota; Yero, Ismael G. A constructive characterization of vertex cover Roman trees. (English) Zbl 1453.05086 Discuss. Math., Graph Theory 41, No. 1, 267-283 (2021). MSC: 05C69 05C05 05C75 05C70 PDF BibTeX XML Cite \textit{A. Cabrera Martínez} et al., Discuss. Math., Graph Theory 41, No. 1, 267--283 (2021; Zbl 1453.05086) Full Text: DOI
Klostermeyer, William F.; Messinger, Margaret-Ellen; Yeo, Anders Dominating vertex covers: the vertex-edge domination problem. (English) Zbl 07282947 Discuss. Math., Graph Theory 41, No. 1, 123-132 (2021). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} et al., Discuss. Math., Graph Theory 41, No. 1, 123--132 (2021; Zbl 07282947) Full Text: DOI
Zhu, Zheng; Fang, Chao; Katzgraber, Helmut G. borealis – a generalized global update algorithm for Boolean optimization problems. (English) Zbl 07311829 Optim. Lett. 14, No. 8, 2495-2514 (2020). MSC: 90C PDF BibTeX XML Cite \textit{Z. Zhu} et al., Optim. Lett. 14, No. 8, 2495--2514 (2020; Zbl 07311829) Full Text: DOI
Walteros, Jose L.; Buchanan, Austin Why is maximum clique often easy in practice? (English) Zbl 07298155 Oper. Res. 68, No. 6, 1866-1895 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. L. Walteros} and \textit{A. Buchanan}, Oper. Res. 68, No. 6, 1866--1895 (2020; Zbl 07298155) Full Text: DOI
Kamčev, Nina; Krivelevich, Michael; Morrison, Natasha; Sudakov, Benny The Kőnig graph process. (English) Zbl 07290208 Random Struct. Algorithms 57, No. 4, 1272-1302 (2020). MSC: 05C80 05C70 PDF BibTeX XML Cite \textit{N. Kamčev} et al., Random Struct. Algorithms 57, No. 4, 1272--1302 (2020; Zbl 07290208) Full Text: DOI
Kompišová, Anna; Lukot’ka, Robert Short cycle covers of graphs with at most 77% vertices of degree two. (English) Zbl 1453.05053 Electron. J. Comb. 27, No. 4, Research Paper P4.31, 7 p. (2020). MSC: 05C38 05C12 05C70 05C07 PDF BibTeX XML Cite \textit{A. Kompišová} and \textit{R. Lukot'ka}, Electron. J. Comb. 27, No. 4, Research Paper P4.31, 7 p. (2020; Zbl 1453.05053) Full Text: DOI
Hermon, Jonathan A spectral characterization for concentration of the cover time. (English) Zbl 07268526 J. Theor. Probab. 33, No. 4, 2167-2184 (2020). MSC: 60J10 60J27 PDF BibTeX XML Cite \textit{J. Hermon}, J. Theor. Probab. 33, No. 4, 2167--2184 (2020; Zbl 07268526) Full Text: DOI
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Nikpey, Hesam; Ono, Hirotaka Graph orientation with splits. (English) Zbl 07263631 Theor. Comput. Sci. 844, 16-25 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 844, 16--25 (2020; Zbl 07263631) Full Text: DOI
Selvaraja, S. Symbolic powers of vertex cover ideals. (English) Zbl 1445.13016 Int. J. Algebra Comput. 30, No. 6, 1167-1183 (2020). Reviewer: Jorge Neves (Coimbra) MSC: 13D02 13F20 PDF BibTeX XML Cite \textit{S. Selvaraja}, Int. J. Algebra Comput. 30, No. 6, 1167--1183 (2020; Zbl 1445.13016) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Li, Xianyue; Wu, Weili Approximation algorithm for minimum connected 3-path vertex cover. (English) Zbl 1448.05164 Discrete Appl. Math. 287, 77-84 (2020). MSC: 05C70 05C85 05C40 68W25 PDF BibTeX XML Cite \textit{P. Liu} et al., Discrete Appl. Math. 287, 77--84 (2020; Zbl 1448.05164) Full Text: DOI
Zhang, An; Chen, Yong; Chen, Zhi-Zhong; Lin, Guohui Improved approximation algorithms for path vertex covers in regular graphs. (English) Zbl 07259203 Algorithmica 82, No. 10, 3041-3064 (2020). MSC: 68R10 05C69 05C70 68W25 PDF BibTeX XML Cite \textit{A. Zhang} et al., Algorithmica 82, No. 10, 3041--3064 (2020; Zbl 07259203) Full Text: DOI
Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket On the approximate compressibility of connected vertex cover. (English) Zbl 07259198 Algorithmica 82, No. 10, 2902-2926 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{D. Majumdar} et al., Algorithmica 82, No. 10, 2902--2926 (2020; Zbl 07259198) Full Text: DOI
Xiao, Han; Fang, Qizhi; Du, Ding-Zhu Population monotonic allocation schemes for vertex cover games. (English) Zbl 07259072 Theor. Comput. Sci. 842, 41-49 (2020). MSC: 91B32 91A12 91A43 05C90 PDF BibTeX XML Cite \textit{H. Xiao} et al., Theor. Comput. Sci. 842, 41--49 (2020; Zbl 07259072) Full Text: DOI
Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu Conflict free version of covering problems on graphs: classical and parameterized. (English) Zbl 1453.68136 Theory Comput. Syst. 64, No. 6, 1067-1093 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{P. Jain} et al., Theory Comput. Syst. 64, No. 6, 1067--1093 (2020; Zbl 1453.68136) Full Text: DOI
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI
Zhang, Shaopu; Sun, Pin; Feng, Tao A graph approach for attribute reduction of Pythagorean fuzzy information systems. (Chinese. English summary) Zbl 1449.68109 J. Zhengzhou Univ., Nat. Sci. Ed. 52, No. 1, 79-86, 113 (2020). MSC: 68T37 68R10 PDF BibTeX XML Cite \textit{S. Zhang} et al., J. Zhengzhou Univ., Nat. Sci. Ed. 52, No. 1, 79--86, 113 (2020; Zbl 1449.68109) Full Text: DOI
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 1452.68134 Algorithmica 82, No. 8, 2292-2315 (2020). MSC: 68R10 05C09 05C12 68P05 68Q25 68U05 PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 82, No. 8, 2292--2315 (2020; Zbl 1452.68134) Full Text: DOI
Meeks, Kitty; Skerman, Fiona The parameterised complexity of computing the maximum modularity of a graph. (English) Zbl 1452.68091 Algorithmica 82, No. 8, 2174-2199 (2020). MSC: 68Q27 68R10 68W25 PDF BibTeX XML Cite \textit{K. Meeks} and \textit{F. Skerman}, Algorithmica 82, No. 8, 2174--2199 (2020; Zbl 1452.68091) Full Text: DOI
Chen, Xue-Gang; Sohn, Moo Young; Wang, Yu-Feng Total domination number of central trees. (English) Zbl 1446.05069 Bull. Korean Math. Soc. 57, No. 1, 245-250 (2020). Reviewer: Doost Ali Mojdeh (Babolsar) MSC: 05C69 05C35 PDF BibTeX XML Cite \textit{X.-G. Chen} et al., Bull. Korean Math. Soc. 57, No. 1, 245--250 (2020; Zbl 1446.05069) Full Text: DOI
Hoang, Duc A.; Suzuki, Akira; Yagita, Tsuyoshi Reconfiguring \(k\)-path vertex covers. (English) Zbl 07224279 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39880-4/pbk; 978-3-030-39881-1/ebook). Lecture Notes in Computer Science 12049, 133-145 (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{D. A. Hoang} et al., Lect. Notes Comput. Sci. 12049, 133--145 (2020; Zbl 07224279) Full Text: DOI
Kaur, Chamanvir; Misra, Neeldhara On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 427-438 (2020). MSC: 68Q27 05C05 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{C. Kaur} and \textit{N. Misra}, Lect. Notes Comput. Sci. 12016, 427--438 (2020; Zbl 1453.68096) Full Text: DOI
Abu-Khzam, Faisal N.; Bazgan, Cristina; Fernau, Henning Parameterized dynamic variants of red-blue dominating set. (English) Zbl 1440.68134 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 236-247 (2020). MSC: 68Q27 05C69 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 12011, 236--247 (2020; Zbl 1440.68134) Full Text: DOI
Chen, Xiaodong; Liu, Mingda; Liu, Huiqing Minimum path cover in quasi-claw-free graphs. (English) Zbl 07220173 Bull. Iran. Math. Soc. 46, No. 3, 815-820 (2020). Reviewer: Ko-Wei Lih (Taipei) MSC: 05C70 05C38 PDF BibTeX XML Cite \textit{X. Chen} et al., Bull. Iran. Math. Soc. 46, No. 3, 815--820 (2020; Zbl 07220173) Full Text: DOI
Beeler, Robert A.; Haynes, Teresa W.; Henning, Michael A.; Keaton, Rodney Total domination cover rubbling. (English) Zbl 1442.05147 Discrete Appl. Math. 283, 133-141 (2020). MSC: 05C69 05C40 05C57 PDF BibTeX XML Cite \textit{R. A. Beeler} et al., Discrete Appl. Math. 283, 133--141 (2020; Zbl 1442.05147) Full Text: DOI
Wei, Chao; Hao, Rong-Xia; Chang, Jou-Ming Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. (English) Zbl 07208690 Appl. Math. Comput. 381, Article ID 125305, 12 p. (2020). MSC: 00 PDF BibTeX XML Cite \textit{C. Wei} et al., Appl. Math. Comput. 381, Article ID 125305, 12 p. (2020; Zbl 07208690) Full Text: DOI
Pourhassan, Mojgan; Roostapour, Vahid; Neumann, Frank Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem. (English) Zbl 1443.68229 Theor. Comput. Sci. 832, 20-41 (2020). MSC: 68W50 68W40 90C27 90C59 PDF BibTeX XML Cite \textit{M. Pourhassan} et al., Theor. Comput. Sci. 832, 20--41 (2020; Zbl 1443.68229) Full Text: DOI
Klobučar, Ana; Manger, Robert Independent sets and vertex covers considered within the context of robust optimization. (English) Zbl 1443.90296 Math. Commun. 25, No. 1, 67-86 (2020). MSC: 90C27 90C17 90C35 90C29 05C22 05C69 PDF BibTeX XML Cite \textit{A. Klobučar} and \textit{R. Manger}, Math. Commun. 25, No. 1, 67--86 (2020; Zbl 1443.90296) Full Text: Link
Georgiou, Konstantinos; Jiang, Andy (Jia); Lee, Edward; Olave, Astrid A.; Seong, Ian; Upadhyaya, Twesh Lift & project systems performing on the partial-vertex-cover polytope. (English) Zbl 1433.90134 Theor. Comput. Sci. 820, 1-16 (2020). MSC: 90C27 05C70 68Q17 68W25 90C22 90C35 PDF BibTeX XML Cite \textit{K. Georgiou} et al., Theor. Comput. Sci. 820, 1--16 (2020; Zbl 1433.90134) Full Text: DOI
Masařík, Tomáš; Toufar, Tomáš Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227 Discrete Appl. Math. 278, 51-61 (2020). MSC: 05C99 68Q27 PDF BibTeX XML Cite \textit{T. Masařík} and \textit{T. Toufar}, Discrete Appl. Math. 278, 51--61 (2020; Zbl 1437.05227) Full Text: DOI
Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1433.68307 Algorithmica 82, No. 6, 1703-1739 (2020). MSC: 68R10 05C10 05C69 05C70 05C85 68U05 68W25 PDF BibTeX XML Cite \textit{M. Pilipczuk} et al., Algorithmica 82, No. 6, 1703--1739 (2020; Zbl 1433.68307) Full Text: DOI
Bhattacharya, Sayan; Chakrabarty, Deeparnab; Henzinger, Monika Deterministic dynamic matching in \(O(1)\) update time. (English) Zbl 1435.68226 Algorithmica 82, No. 4, 1057-1080 (2020). MSC: 68R10 05C70 05C85 68P05 68W25 68W40 PDF BibTeX XML Cite \textit{S. Bhattacharya} et al., Algorithmica 82, No. 4, 1057--1080 (2020; Zbl 1435.68226) Full Text: DOI
Cao, Fayun; Ren, Han Nonseparating independent sets of Cartesian product graphs. (English) Zbl 1434.05106 Taiwanese J. Math. 24, No. 1, 1-17 (2020). MSC: 05C69 05C70 05C76 05C05 05C40 PDF BibTeX XML Cite \textit{F. Cao} and \textit{H. Ren}, Taiwanese J. Math. 24, No. 1, 1--17 (2020; Zbl 1434.05106) Full Text: DOI Euclid
Zhang, Yubai; Zhang, Zhao; Shi, Yishuo; Li, Xianyue Algorithm for online 3-path vertex cover. (English) Zbl 1434.68696 Theory Comput. Syst. 64, No. 2, 327-338 (2020). MSC: 68W27 05C70 05C85 68R10 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Theory Comput. Syst. 64, No. 2, 327--338 (2020; Zbl 1434.68696) Full Text: DOI
Li, Shuchao; Wang, Shujing Extremal cover cost and reverse cover cost of trees with given segment sequence. (English) Zbl 1434.05138 Discrete Math. 343, No. 4, Article ID 111791, 13 p. (2020). MSC: 05C81 05C40 05C05 05C07 PDF BibTeX XML Cite \textit{S. Li} and \textit{S. Wang}, Discrete Math. 343, No. 4, Article ID 111791, 13 p. (2020; Zbl 1434.05138) Full Text: DOI
Khoshkhah, Kaveh; Ghadikolaei, Mehdi Khosravian; Monnot, Jérôme; Sikora, Florian Weighted upper edge cover: complexity and approximability. (English) Zbl 1433.05261 J. Graph Algorithms Appl. 24, No. 2, 65-88 (2020). MSC: 05C70 05C69 05C22 PDF BibTeX XML Cite \textit{K. Khoshkhah} et al., J. Graph Algorithms Appl. 24, No. 2, 65--88 (2020; Zbl 1433.05261) Full Text: DOI
Davila, Randy; Henning, Michael A. Matching, path covers, and total forcing sets. (English) Zbl 1432.05039 Quaest. Math. 43, No. 1, 131-147 (2020). MSC: 05C15 05C70 05C69 PDF BibTeX XML Cite \textit{R. Davila} and \textit{M. A. Henning}, Quaest. Math. 43, No. 1, 131--147 (2020; Zbl 1432.05039) Full Text: DOI
Choi, Ilkyoo; Kim, Jinha; Park, Boram Collapsibility of non-cover complexes of graphs. (English) Zbl 1431.05111 Electron. J. Comb. 27, No. 1, Research Paper P1.20, 8 p. (2020). MSC: 05C69 05E45 PDF BibTeX XML Cite \textit{I. Choi} et al., Electron. J. Comb. 27, No. 1, Research Paper P1.20, 8 p. (2020; Zbl 1431.05111) Full Text: Link arXiv
Conte, Alessio; Grossi, Roberto; Marino, Andrea Large-scale clique cover of real-world networks. (English) Zbl 1436.68228 Inf. Comput. 270, Article ID 104464, 15 p. (2020). MSC: 68R10 05C69 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{A. Conte} et al., Inf. Comput. 270, Article ID 104464, 15 p. (2020; Zbl 1436.68228) Full Text: DOI
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI
Li, Shudong; Zhao, Dawei; Wu, Xiaobo; Tian, Zhihong; Li, Aiping; Wang, Zhen Functional immunization of networks based on message passing. (English) Zbl 1433.91115 Appl. Math. Comput. 366, Article ID 124728, 8 p. (2020). MSC: 91D30 92D30 05C82 37N25 PDF BibTeX XML Cite \textit{S. Li} et al., Appl. Math. Comput. 366, Article ID 124728, 8 p. (2020; Zbl 1433.91115) Full Text: DOI
Dau, Hoang; Milenkovic, Olgica; Puleo, Gregory J. On the triangle clique cover and \(K_t\) clique cover problems. (English) Zbl 1429.05160 Discrete Math. 343, No. 1, Article ID 111627, 11 p. (2020). MSC: 05C70 05C69 68Q17 90C35 PDF BibTeX XML Cite \textit{H. Dau} et al., Discrete Math. 343, No. 1, Article ID 111627, 11 p. (2020; Zbl 1429.05160) Full Text: DOI
Akrida, Eleni C.; Mertzios, George B.; Spirakis, Paul G.; Zamaraev, Viktor Temporal vertex cover with a sliding time window. (English) Zbl 1436.68219 J. Comput. Syst. Sci. 107, 108-123 (2020). MSC: 68R10 05C70 68Q17 68W25 PDF BibTeX XML Cite \textit{E. C. Akrida} et al., J. Comput. Syst. Sci. 107, 108--123 (2020; Zbl 1436.68219) Full Text: DOI
Ben Basat, Ran; Even, Guy; Kawarabayashi, Ken-ichi; Schwartzman, Gregory Optimal distributed covering algorithms. (English) Zbl 07298661 Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6217-7). 104-106 (2019). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{R. Ben Basat} et al., in: Proceedings of the 38th ACM symposium on principles of distributed computing, PODC '19, Toronto, ON, Canada, July 29 -- August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 104--106 (2019; Zbl 07298661) Full Text: DOI
Jafarpour-Golzari, Reza A generalization of Hall’s theorem for \(k\)-uniform \(k\)-partite hypergraphs. (English) Zbl 07276681 Trans. Comb. 8, No. 3, 23-28 (2019). MSC: 05E40 05C65 05D15 PDF BibTeX XML Cite \textit{R. Jafarpour-Golzari}, Trans. Comb. 8, No. 3, 23--28 (2019; Zbl 07276681) Full Text: DOI
Jahari, Somayeh; Alikhani, Saeid Domination polynomial of clique cover product of graphs. (English) Zbl 1446.05067 Algebra Discrete Math. 28, No. 2, 248-259 (2019). MSC: 05C60 05C69 PDF BibTeX XML Cite \textit{S. Jahari} and \textit{S. Alikhani}, Algebra Discrete Math. 28, No. 2, 248--259 (2019; Zbl 1446.05067) Full Text: Link
Hliněný, Petr; Sankaran, Abhisekh Exact crossing number parameterized by vertex cover. (English) Zbl 07266125 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35801-3/pbk; 978-3-030-35802-0/ebook). Lecture Notes in Computer Science 11904, 307-319 (2019). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{A. Sankaran}, Lect. Notes Comput. Sci. 11904, 307--319 (2019; Zbl 07266125) Full Text: DOI
van Rooij, Sebastiaan B.; van Rooij, Johan M. M. Algorithms and complexity results for the capacitated vertex cover problem. (English) Zbl 1445.68178 Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 473-489 (2019). MSC: 68R10 68Q17 68Q27 68W40 PDF BibTeX XML Cite \textit{S. B. van Rooij} and \textit{J. M. M. van Rooij}, Lect. Notes Comput. Sci. 11376, 473--489 (2019; Zbl 1445.68178) Full Text: DOI
Cai, Shaowei; Li, Yuanjie; Hou, Wenying; Wang, Haoran Towards faster local search for minimum weight vertex cover on massive graphs. (English) Zbl 1441.68168 Inf. Sci. 471, 64-79 (2019). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{S. Cai} et al., Inf. Sci. 471, 64--79 (2019; Zbl 1441.68168) Full Text: DOI
Kozlova, Anna; Nikolaev, Andrei Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope. (English) Zbl 1444.90101 Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 374-389 (2019). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{A. Kozlova} and \textit{A. Nikolaev}, Lect. Notes Comput. Sci. 11548, 374--389 (2019; Zbl 1444.90101) Full Text: DOI
Bazzi, Abbas; Fiorini, Samuel; Pokutta, Sebastian; Svensson, Ola No small linear program approximates vertex cover within a factor \(2 -\varepsilon\). (English) Zbl 1435.68110 Math. Oper. Res. 44, No. 1, 147-172 (2019). MSC: 68Q17 05C69 05C70 68W25 90C05 90C27 PDF BibTeX XML Cite \textit{A. Bazzi} et al., Math. Oper. Res. 44, No. 1, 147--172 (2019; Zbl 1435.68110) Full Text: DOI
Khosravian Ghadikoalei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris Extension and its price for the Connected Vertex Cover problem. (English) Zbl 07173541 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 315-326 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{M. Khosravian Ghadikoalei} et al., Lect. Notes Comput. Sci. 11638, 315--326 (2019; Zbl 07173541) Full Text: DOI
Kumar, Mehul; Kumar, Amit; Pandu Rangan, C. Reoptimization of Path Vertex Cover problem. (English) Zbl 07172853 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 11653, 363-374 (2019). MSC: 68Rxx PDF BibTeX XML Cite \textit{M. Kumar} et al., Lect. Notes Comput. Sci. 11653, 363--374 (2019; Zbl 07172853) Full Text: DOI
Gorzny, Jan; Buss, Jonathan F. Imbalance, cutwidth, and the structure of optimal orderings. (English) Zbl 07172841 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 11653, 219-231 (2019). MSC: 68Rxx PDF BibTeX XML Cite \textit{J. Gorzny} and \textit{J. F. Buss}, Lect. Notes Comput. Sci. 11653, 219--231 (2019; Zbl 07172841) Full Text: DOI
Atserias, Albert; Dawar, Anuj Definable inapproximability: new challenges for duplicator. (English) Zbl 1446.68072 J. Log. Comput. 29, No. 8, 1185-1210 (2019). MSC: 68Q19 68Q17 PDF BibTeX XML Cite \textit{A. Atserias} and \textit{A. Dawar}, J. Log. Comput. 29, No. 8, 1185--1210 (2019; Zbl 1446.68072) Full Text: DOI
Singh, Mohit Integrality gap of the vertex cover linear programming relaxation. (English) Zbl 07165793 Oper. Res. Lett. 47, No. 4, 288-290 (2019). MSC: 90 PDF BibTeX XML Cite \textit{M. Singh}, Oper. Res. Lett. 47, No. 4, 288--290 (2019; Zbl 07165793) Full Text: DOI
Zuiddam, Jeroen The asymptotic spectrum of graphs and the Shannon capacity. (English) Zbl 1449.05208 Combinatorica 39, No. 5, 1173-1184 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C69 05C76 94C15 PDF BibTeX XML Cite \textit{J. Zuiddam}, Combinatorica 39, No. 5, 1173--1184 (2019; Zbl 1449.05208) Full Text: DOI
Bai, Zongwen; Tu, Jianhua; Shi, Yongtang An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth. (English) Zbl 07150563 Discrete Math. Theor. Comput. Sci. 21, No. 4, Paper No. 17, 13 p. (2019). MSC: 05C35 90C27 90C39 PDF BibTeX XML Cite \textit{Z. Bai} et al., Discrete Math. Theor. Comput. Sci. 21, No. 4, Paper No. 17, 13 p. (2019; Zbl 07150563) Full Text: Link arXiv
Laish, Itay; Mozes, Shay Efficient dynamic approximate distance oracles for vertex-labeled planar graphs. (English) Zbl 1436.68248 Theory Comput. Syst. 63, No. 8, 1849-1874 (2019). MSC: 68R10 05C10 05C78 68P05 68W25 PDF BibTeX XML Cite \textit{I. Laish} and \textit{S. Mozes}, Theory Comput. Syst. 63, No. 8, 1849--1874 (2019; Zbl 1436.68248) Full Text: DOI
Lajmiri, Bahareh; Rahmati, Farhad; Saeedi, Mahdis Cohen-Macaulay binomial edge ideals of some classes of graphs. (English) Zbl 1428.13034 JP J. Algebra Number Theory Appl. 42, No. 1, 137-150 (2019). Reviewer: Hero Saremi (Sanandaj) MSC: 13F65 13C14 13C15 05E40 PDF BibTeX XML Cite \textit{B. Lajmiri} et al., JP J. Algebra Number Theory Appl. 42, No. 1, 137--150 (2019; Zbl 1428.13034) Full Text: DOI
Malyshev, D. S.; Mokeev, D. B. König graphs with respect to the 4-path and its spanning supergraphs. (Russian, English) Zbl 1438.05143 Diskretn. Anal. Issled. Oper. 26, No. 1, 74-88 (2019); translation in J. Appl. Ind. Math. 13, No. 1, 85-92 (2019). MSC: 05C38 PDF BibTeX XML Cite \textit{D. S. Malyshev} and \textit{D. B. Mokeev}, Diskretn. Anal. Issled. Oper. 26, No. 1, 74--88 (2019; Zbl 1438.05143); translation in J. Appl. Ind. Math. 13, No. 1, 85--92 (2019) Full Text: DOI
Brešar, Boštjan; Kos, Tim; Krivoš-Belluš, Rastislav; Semanišin, Gabriel Hitting subgraphs in \(P_4\)-tidy graphs. (English) Zbl 1428.05254 Appl. Math. Comput. 352, 211-219 (2019). MSC: 05C75 05C70 PDF BibTeX XML Cite \textit{B. Brešar} et al., Appl. Math. Comput. 352, 211--219 (2019; Zbl 1428.05254) Full Text: DOI
Zhang, Wenjie; Tu, Jianhua; Wu, Lidong A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem. (English) Zbl 1428.05299 Appl. Math. Comput. 349, 359-366 (2019). MSC: 05C85 05C70 68Q25 90C27 90C35 PDF BibTeX XML Cite \textit{W. Zhang} et al., Appl. Math. Comput. 349, 359--366 (2019; Zbl 1428.05299) Full Text: DOI
Ran, Yingli; Zhang, Zhao; Huang, Xiaohui; Li, Xiaosong; Du, Ding-Zhu Approximation algorithms for minimum weight connected 3-path vertex cover. (English) Zbl 1428.05297 Appl. Math. Comput. 347, 723-733 (2019). MSC: 05C85 05C70 PDF BibTeX XML Cite \textit{Y. Ran} et al., Appl. Math. Comput. 347, 723--733 (2019; Zbl 1428.05297) Full Text: DOI
Majumdar, Diptapriyo; Neogi, Rian; Raman, Venkatesh; Vaishali, S. Tractability of König edge deletion problems. (English) Zbl 1435.68125 Theor. Comput. Sci. 796, 207-215 (2019). MSC: 68Q27 05C70 68Q17 PDF BibTeX XML Cite \textit{D. Majumdar} et al., Theor. Comput. Sci. 796, 207--215 (2019; Zbl 1435.68125) Full Text: DOI
Babu, Jasine; Chandran, L. Sunil; Francis, Mathew; Prabhakaran, Veena; Rajendraprasad, Deepak; Warrier, J. Nandini On graphs with minimal eternal vertex cover number. (English) Zbl 07115821 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-11508-1/pbk; 978-3-030-11509-8/ebook). Lecture Notes in Computer Science 11394, 263-273 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{J. Babu} et al., Lect. Notes Comput. Sci. 11394, 263--273 (2019; Zbl 07115821) Full Text: DOI
Cabrera Martínez, Abel; Kuziak, Dorota; Yero, Ismael G. Outer-independent total Roman domination in graphs. (English) Zbl 1426.05126 Discrete Appl. Math. 269, 107-119 (2019). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C69 05C10 05C07 PDF BibTeX XML Cite \textit{A. Cabrera Martínez} et al., Discrete Appl. Math. 269, 107--119 (2019; Zbl 1426.05126) Full Text: DOI
Kuo, Tung-Wei On the approximability and hardness of the minimum connected dominating set with routing cost constraint. (English) Zbl 1434.68677 Theor. Comput. Sci. 793, 140-151 (2019). MSC: 68W25 05C69 68R10 68W40 PDF BibTeX XML Cite \textit{T.-W. Kuo}, Theor. Comput. Sci. 793, 140--151 (2019; Zbl 1434.68677) Full Text: DOI
Liu, Mingda; Chen, Xiaodong; Li, Mingchu Path cover in \({K_{1,4}}\)-free graphs. (English) Zbl 1438.05200 J. Math. Res. Appl. 39, No. 3, 315-320 (2019). MSC: 05C70 05C38 PDF BibTeX XML Cite \textit{M. Liu} et al., J. Math. Res. Appl. 39, No. 3, 315--320 (2019; Zbl 1438.05200) Full Text: DOI
Meesum, Syed M.; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Rank vertex cover as a natural problem for algebraic compression. (English) Zbl 1419.05203 SIAM J. Discrete Math. 33, No. 3, 1277-1296 (2019). MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{S. M. Meesum} et al., SIAM J. Discrete Math. 33, No. 3, 1277--1296 (2019; Zbl 1419.05203) Full Text: DOI
Pothen, Alex; Ferdous, S. M.; Manne, Fredrik Approximation algorithms in combinatorial scientific computing. (English) Zbl 1440.68337 Acta Numerica 28, 541-633 (2019). Reviewer: Vladimír Lacko (Košice) MSC: 68W25 05C07 05C70 05C85 68R10 68W10 68W40 90C27 PDF BibTeX XML Cite \textit{A. Pothen} et al., Acta Numerica 28, 541--633 (2019; Zbl 1440.68337) Full Text: DOI
Abu-Khzam, Faisal N.; Li, Shouwei; Markarian, Christine; Meyer auf der Heide, Friedhelm; Podlipyan, Pavel Efficient parallel algorithms for parameterized problems. (English) Zbl 1429.68327 Theor. Comput. Sci. 786, 2-12 (2019). MSC: 68W10 68Q27 68R10 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Theor. Comput. Sci. 786, 2--12 (2019; Zbl 1429.68327) Full Text: DOI
Tsur, Dekel Parameterized algorithm for 3-path vertex cover. (English) Zbl 1423.68358 Theor. Comput. Sci. 783, 1-8 (2019). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{D. Tsur}, Theor. Comput. Sci. 783, 1--8 (2019; Zbl 1423.68358) Full Text: DOI
Hujdurović, Ademir Graphs with Cayley canonical double covers. (English) Zbl 1416.05138 Discrete Math. 342, No. 9, 2542-2548 (2019). MSC: 05C25 05C70 PDF BibTeX XML Cite \textit{A. Hujdurović}, Discrete Math. 342, No. 9, 2542--2548 (2019; Zbl 1416.05138) Full Text: DOI
Wu, Yaokun; Xiong, Yanzhen; Zaw, Soesoe Competition numbers and phylogeny numbers: uniform complete multipartite graphs. (English) Zbl 1416.05127 Graphs Comb. 35, No. 3, 653-667 (2019). MSC: 05C20 05C69 05B15 05C65 PDF BibTeX XML Cite \textit{Y. Wu} et al., Graphs Comb. 35, No. 3, 653--667 (2019; Zbl 1416.05127) Full Text: DOI
Miao, Dongjing; Liu, Xianmin; Li, Yingshu; Li, Jianzhong Vertex cover in conflict graphs. (English) Zbl 1423.68354 Theor. Comput. Sci. 774, 103-112 (2019). MSC: 68R10 05C70 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{D. Miao} et al., Theor. Comput. Sci. 774, 103--112 (2019; Zbl 1423.68354) Full Text: DOI
Li, Yuchao; Wang, Wei; Yang, Zishen The connected vertex cover problem in \(k\)-regular graphs. (English) Zbl 1420.05148 J. Comb. Optim. 38, No. 2, 635-645 (2019). MSC: 05C70 05C85 68W25 68Q17 PDF BibTeX XML Cite \textit{Y. Li} et al., J. Comb. Optim. 38, No. 2, 635--645 (2019; Zbl 1420.05148) Full Text: DOI
Bessy, Stéphane; Ochem, Pascal; Rautenbach, Dieter On the Kőnig-Egerváry theorem for \(k\)-paths. (English) Zbl 1414.05218 J. Graph Theory 91, No. 1, 73-87 (2019). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{S. Bessy} et al., J. Graph Theory 91, No. 1, 73--87 (2019; Zbl 1414.05218) Full Text: DOI
Chandrasekaran, Karthekeyan; Gottschalk, Corinna; Könemann, Jochen; Peis, Britta; Schmand, Daniel; Wierz, Andreas Additive stabilizers for unstable graphs. (English) Zbl 07065742 Discrete Optim. 31, 56-78 (2019). MSC: 90C PDF BibTeX XML Cite \textit{K. Chandrasekaran} et al., Discrete Optim. 31, 56--78 (2019; Zbl 07065742) Full Text: DOI
Hernández-Cruz, César; Lemańska, Magdalena; Zuazua, Rita A characterization of trees having a minimum vertex cover which is also a minimum total dominating set. (English) Zbl 1411.05206 Australas. J. Comb. 73, Part 2, 334-345 (2019). MSC: 05C69 05C05 05C70 05C35 PDF BibTeX XML Cite \textit{C. Hernández-Cruz} et al., Australas. J. Comb. 73, Part 2, 334--345 (2019; Zbl 1411.05206) Full Text: Link
Kolay, Sudeshna; Pandurangan, Ragukumar; Panolan, Fahad; Raman, Venkatesh; Tale, Prafullkumar Harmonious coloring: parameterized algorithms and upper bounds. (English) Zbl 1421.68136 Theor. Comput. Sci. 772, 132-142 (2019). MSC: 68R10 05C15 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{S. Kolay} et al., Theor. Comput. Sci. 772, 132--142 (2019; Zbl 1421.68136) Full Text: DOI
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod When can graph hyperbolicity be computed in linear time? (English) Zbl 1439.68016 Algorithmica 81, No. 5, 2016-2045 (2019). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{T. Fluschnik} et al., Algorithmica 81, No. 5, 2016--2045 (2019; Zbl 1439.68016) Full Text: DOI
Meybodi, M. Alambardar; Hooshmandasl, M. R.; Sharifani, P.; Shakiba, A. Domination cover number of graphs. (English) Zbl 1410.05158 Discrete Math. Algorithms Appl. 11, No. 2, Article ID 1950020, 17 p. (2019). MSC: 05C69 05C85 05C30 PDF BibTeX XML Cite \textit{M. A. Meybodi} et al., Discrete Math. Algorithms Appl. 11, No. 2, Article ID 1950020, 17 p. (2019; Zbl 1410.05158) Full Text: DOI arXiv
Beeler, Robert A.; Haynes, Teresa W.; Keaton, Rodney Domination cover rubbling. (English) Zbl 1409.05145 Discrete Appl. Math. 260, 75-85 (2019). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{R. A. Beeler} et al., Discrete Appl. Math. 260, 75--85 (2019; Zbl 1409.05145) Full Text: DOI
Javadi, Ramin; Hajebi, Sepehr Edge clique cover of claw-free graphs. (English) Zbl 1407.05181 J. Graph Theory 90, No. 3, 311-405 (2019). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{R. Javadi} and \textit{S. Hajebi}, J. Graph Theory 90, No. 3, 311--405 (2019; Zbl 1407.05181) Full Text: DOI arXiv
Lokshtanov, Daniel; Mouawad, Amer E. The complexity of independent set reconfiguration on bipartite graphs. (English) Zbl 07044611 ACM Trans. Algorithms 15, No. 1, Article No. 7, 19 p. (2019). MSC: 68R10 05C69 68Q17 PDF BibTeX XML Cite \textit{D. Lokshtanov} and \textit{A. E. Mouawad}, ACM Trans. Algorithms 15, No. 1, Article No. 7, 19 p. (2019; Zbl 07044611) Full Text: DOI
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka On directed covering and domination problems. (English) Zbl 1407.05194 Discrete Appl. Math. 259, 76-99 (2019). MSC: 05C70 05C69 05C20 05C85 PDF BibTeX XML Cite \textit{T. Hanaka} et al., Discrete Appl. Math. 259, 76--99 (2019; Zbl 1407.05194) Full Text: DOI
Camby, Eglantine Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs. (English) Zbl 1409.05156 Graphs Comb. 35, No. 1, 103-118 (2019). MSC: 05C70 05-04 05C40 05C35 05C69 PDF BibTeX XML Cite \textit{E. Camby}, Graphs Comb. 35, No. 1, 103--118 (2019; Zbl 1409.05156) Full Text: DOI
Marsh, S.; Wang, J. B. A quantum walk-assisted approximate algorithm for bounded NP optimisation problems. (English) Zbl 1417.81095 Quantum Inf. Process. 18, No. 3, Paper No. 61, 18 p. (2019). MSC: 81P68 68Q12 68Q17 68Q05 81S25 60G50 65K10 PDF BibTeX XML Cite \textit{S. Marsh} and \textit{J. B. Wang}, Quantum Inf. Process. 18, No. 3, Paper No. 61, 18 p. (2019; Zbl 1417.81095) Full Text: DOI
Erey, Nursel Powers of ideals associated to \((C_{4},2K_{2})\)-free graphs. (English) Zbl 1431.05154 J. Pure Appl. Algebra 223, No. 7, 3071-3080 (2019). Reviewer: Michela Ceria (Milano) MSC: 05E40 13D02 05C70 PDF BibTeX XML Cite \textit{N. Erey}, J. Pure Appl. Algebra 223, No. 7, 3071--3080 (2019; Zbl 1431.05154) Full Text: DOI arXiv
Żak, Andrzej Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs. (English) Zbl 1405.05186 Discrete Appl. Math. 255, 299-306 (2019). MSC: 05D15 05C65 PDF BibTeX XML Cite \textit{A. Żak}, Discrete Appl. Math. 255, 299--306 (2019; Zbl 1405.05186) Full Text: DOI
Tu, Jianhua; Shi, Yongtang An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs. (English) Zbl 1401.05286 Discuss. Math., Graph Theory 39, No. 1, 55-65 (2019). MSC: 05C85 05C10 05C35 90C27 90C39 68Q25 PDF BibTeX XML Cite \textit{J. Tu} and \textit{Y. Shi}, Discuss. Math., Graph Theory 39, No. 1, 55--65 (2019; Zbl 1401.05286) Full Text: DOI
Hols, Eva-Maria C.; Kratsch, Stefan Smaller parameters for vertex cover kernelization. (English) Zbl 1443.68072 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 20, 12 p. (2018). MSC: 68Q27 05C70 68R10 68W20 PDF BibTeX XML Cite \textit{E.-M. C. Hols} and \textit{S. Kratsch}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 20, 12 p. (2018; Zbl 1443.68072) Full Text: DOI
Chitturi, Bhadrachalam; Balachander, Srijith; Satheesh, Sandeep; Puthiyoppil, Krithic Layered graphs: applications and algorithms. (English) Zbl 07154077 Algorithms (Basel) 11, No. 7, Paper No. 93, 22 p. (2018). MSC: 68 05 PDF BibTeX XML Cite \textit{B. Chitturi} et al., Algorithms (Basel) 11, No. 7, Paper No. 93, 22 p. (2018; Zbl 07154077) Full Text: DOI
Li, Zhao; Zuo, Liancui The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs. (English) Zbl 1427.05177 Appl. Math. Comput. 331, 69-79 (2018). MSC: 05C70 05C38 05C76 PDF BibTeX XML Cite \textit{Z. Li} and \textit{L. Zuo}, Appl. Math. Comput. 331, 69--79 (2018; Zbl 1427.05177) Full Text: DOI
Delle Donne, Diego; Tagliavini, Guido Star routing: between vehicle routing and vertex cover. (English) Zbl 07116403 Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-04650-7/pbk; 978-3-030-04651-4/ebook). Lecture Notes in Computer Science 11346, 522-536 (2018). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{D. Delle Donne} and \textit{G. Tagliavini}, Lect. Notes Comput. Sci. 11346, 522--536 (2018; Zbl 07116403) Full Text: DOI