Brandstädt, Andreas; Mosca, Raffaele Combining decomposition approaches for the maximum weight stable set problem. (English) Zbl 07687175 Theor. Comput. Sci. 960, Article ID 113914, 16 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Theor. Comput. Sci. 960, Article ID 113914, 16 p. (2023; Zbl 07687175) Full Text: DOI OpenURL
Huang, Shenwei; Li, Jiawei; Xia, Wen Critical (\(P_5\), bull)-free graphs. (English) Zbl 07684693 Discrete Appl. Math. 334, 15-25 (2023). MSC: 05C15 05C17 05C85 PDF BibTeX XML Cite \textit{S. Huang} et al., Discrete Appl. Math. 334, 15--25 (2023; Zbl 07684693) Full Text: DOI arXiv OpenURL
Altschuler, Jason M.; Boix-Adserà, Enric Polynomial-time algorithms for multimarginal optimal transport problems with structure. (English) Zbl 07681272 Math. Program. 199, No. 1-2 (A), 1107-1178 (2023). MSC: 90C08 90C06 PDF BibTeX XML Cite \textit{J. M. Altschuler} and \textit{E. Boix-Adserà}, Math. Program. 199, No. 1--2 (A), 1107--1178 (2023; Zbl 07681272) Full Text: DOI arXiv OpenURL
Yan, Hao; Liu, Peihai; Lu, Xiwen Two-agent vehicle scheduling problem on a line-shaped network. (English) Zbl 07668946 J. Ind. Manag. Optim. 19, No. 7, 4874-4892 (2023). MSC: 68W25 05C85 PDF BibTeX XML Cite \textit{H. Yan} et al., J. Ind. Manag. Optim. 19, No. 7, 4874--4892 (2023; Zbl 07668946) Full Text: DOI OpenURL
Alecu, Bogdan; Atminas, Aistis; Lozin, Vadim; Malyshev, Dmitriy Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07661307 Algorithmica 85, No. 3, 642-664 (2023). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{B. Alecu} et al., Algorithmica 85, No. 3, 642--664 (2023; Zbl 07661307) Full Text: DOI OpenURL
Mildebrath, David A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation. (English) Zbl 07659733 Optim. Lett. 17, No. 2, 265-282 (2023). MSC: 90C15 90C26 PDF BibTeX XML Cite \textit{D. Mildebrath}, Optim. Lett. 17, No. 2, 265--282 (2023; Zbl 07659733) Full Text: DOI OpenURL
Del Pia, Alberto Sparse PCA on fixed-rank matrices. (English) Zbl 07658248 Math. Program. 198, No. 1 (A), 139-157 (2023). MSC: 90C20 90C26 90C60 68Q25 PDF BibTeX XML Cite \textit{A. Del Pia}, Math. Program. 198, No. 1 (A), 139--157 (2023; Zbl 07658248) Full Text: DOI arXiv OpenURL
Panda, B. S.; Chaudhary, Juhi Acyclic matching in some subclasses of graphs. (English) Zbl 07638584 Theor. Comput. Sci. 943, 36-49 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Theor. Comput. Sci. 943, 36--49 (2023; Zbl 07638584) Full Text: DOI OpenURL
Goedgebeur, Jan; Huang, Shenwei; Ju, Yiao; Merkel, Owen Colouring graphs with no induced six-vertex path or diamond. (English) Zbl 07638364 Theor. Comput. Sci. 941, 278-299 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Goedgebeur} et al., Theor. Comput. Sci. 941, 278--299 (2023; Zbl 07638364) Full Text: DOI arXiv OpenURL
Lichen, Junran; Cai, Lijian; Li, Jianping; Liu, Suding; Pan, Pengxiang; Wang, Wencheng Delay-constrained minimum shortest path trees and related problems. (English) Zbl 07638359 Theor. Comput. Sci. 941, 191-201 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Lichen} et al., Theor. Comput. Sci. 941, 191--201 (2023; Zbl 07638359) Full Text: DOI OpenURL
Costa, Edgar; Harvey, David; Sutherland, Andrew V. Counting points on smooth plane quartics. (English) Zbl 1507.11058 Res. Number Theory 9, No. 1, Paper No. 1, 32 p. (2023). Reviewer: István Gaál (Debrecen) MSC: 11G40 11G20 11Y16 14G10 PDF BibTeX XML Cite \textit{E. Costa} et al., Res. Number Theory 9, No. 1, Paper No. 1, 32 p. (2023; Zbl 1507.11058) Full Text: DOI arXiv OpenURL
Yan, Hao; Liu, Peihai; Lu, Xiwen Vehicle scheduling problems with two agents on a line. (English) Zbl 1507.90072 J. Comb. Optim. 45, No. 1, Paper No. 10, 18 p. (2023). MSC: 90B35 68W25 PDF BibTeX XML Cite \textit{H. Yan} et al., J. Comb. Optim. 45, No. 1, Paper No. 10, 18 p. (2023; Zbl 1507.90072) Full Text: DOI OpenURL
Panda, B. S.; Sachin Hardness and approximation results for some variants of stable marriage problem. (English) Zbl 07683177 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 252-264 (2022). MSC: 68Wxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{Sachin}, Lect. Notes Comput. Sci. 13179, 252--264 (2022; Zbl 07683177) Full Text: DOI OpenURL
Zhao, Xiaofang; Li, Shuguang A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions. (English) Zbl 07678882 Electron Res. Arch. 30, No. 11, 4209-4219 (2022). MSC: 90B35 68Q25 68M20 PDF BibTeX XML Cite \textit{X. Zhao} and \textit{S. Li}, Electron Res. Arch. 30, No. 11, 4209--4219 (2022; Zbl 07678882) Full Text: DOI OpenURL
Zhang, Long; Zhang, Yuzhong; Bai, Qingguo An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time. (English) Zbl 1503.90052 J. Comb. Optim. 44, No. 4, 2167-2179 (2022). MSC: 90B35 90B05 68W25 PDF BibTeX XML Cite \textit{L. Zhang} et al., J. Comb. Optim. 44, No. 4, 2167--2179 (2022; Zbl 1503.90052) Full Text: DOI OpenURL
van Iersel, Leo; Kole, Sjors; Moulton, Vincent; Nipius, Leonie An algorithm for reconstructing level-2 phylogenetic networks from trinets. (English) Zbl 07581528 Inf. Process. Lett. 178, Article ID 106300, 8 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. van Iersel} et al., Inf. Process. Lett. 178, Article ID 106300, 8 p. (2022; Zbl 07581528) Full Text: DOI arXiv OpenURL
Thi Huyen Chau Nguyen; Grass, Werner; Jansen, Klaus Exact polynomial time algorithm for the response time analysis of harmonic tasks. (English) Zbl 07577718 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 451-465 (2022). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{Thi Huyen Chau Nguyen} et al., Lect. Notes Comput. Sci. 13270, 451--465 (2022; Zbl 07577718) Full Text: DOI OpenURL
Caucchiolo, Andrea; Cicalese, Ferdinando On the intractability landscape of digraph intersection representations. (English) Zbl 07577705 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 270-284 (2022). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{A. Caucchiolo} and \textit{F. Cicalese}, Lect. Notes Comput. Sci. 13270, 270--284 (2022; Zbl 07577705) Full Text: DOI OpenURL
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V. Selecting a subset of diverse points based on the squared Euclidean distance. (English) Zbl 1493.62380 Ann. Math. Artif. Intell. 90, No. 7-9, 965-977 (2022). MSC: 62H30 90C09 68W25 PDF BibTeX XML Cite \textit{A. V. Eremeev} et al., Ann. Math. Artif. Intell. 90, No. 7--9, 965--977 (2022; Zbl 1493.62380) Full Text: DOI OpenURL
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P.; Mondal, Joyashree Induced star partition of graphs. (English) Zbl 1494.05093 Discrete Appl. Math. 319, 81-91 (2022). MSC: 05C70 05C69 05C15 68Q17 68Q25 68W25 PDF BibTeX XML Cite \textit{M. A. Shalu} et al., Discrete Appl. Math. 319, 81--91 (2022; Zbl 1494.05093) Full Text: DOI OpenURL
Brandstädt, Andreas; Mosca, Raffaele Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time. (English) Zbl 1493.05225 Discuss. Math., Graph Theory 42, No. 4, 1139-1162 (2022). MSC: 05C69 05C70 05C85 68R10 68Q25 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discuss. Math., Graph Theory 42, No. 4, 1139--1162 (2022; Zbl 1493.05225) Full Text: DOI OpenURL
Bouchard, Sébastien; Dieudonné, Yoann; Lamani, Anissa Byzantine gathering in polynomial time. (English) Zbl 1489.68036 Distrib. Comput. 35, No. 3, 235-263 (2022). MSC: 68M14 68M15 68R10 68W40 PDF BibTeX XML Cite \textit{S. Bouchard} et al., Distrib. Comput. 35, No. 3, 235--263 (2022; Zbl 1489.68036) Full Text: DOI Link OpenURL
Cook, Linda; Seymour, Paul Detecting a long even hole. (English) Zbl 1490.05184 Eur. J. Comb. 104, Article ID 103537, 26 p. (2022). MSC: 05C60 05C38 05C12 05C85 PDF BibTeX XML Cite \textit{L. Cook} and \textit{P. Seymour}, Eur. J. Comb. 104, Article ID 103537, 26 p. (2022; Zbl 1490.05184) Full Text: DOI arXiv OpenURL
Ndaoud, Mohamed; Sigalla, Suzanne; Tsybakov, Alexandre B. Improved clustering algorithms for the bipartite stochastic block model. (English) Zbl 1495.62052 IEEE Trans. Inf. Theory 68, No. 3, 1960-1975 (2022). MSC: 62H30 05C50 PDF BibTeX XML Cite \textit{M. Ndaoud} et al., IEEE Trans. Inf. Theory 68, No. 3, 1960--1975 (2022; Zbl 1495.62052) Full Text: DOI arXiv OpenURL
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip Faster minimization of tardy processing time on a single machine. (English) Zbl 07517138 Algorithmica 84, No. 5, 1341-1356 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 84, No. 5, 1341--1356 (2022; Zbl 07517138) Full Text: DOI arXiv OpenURL
Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasi-polynomial time. (English) Zbl 07516621 SIAM J. Comput. 51, No. 2, STOC17-152-STOC17-188 (2022). MSC: 68Q25 68Q70 PDF BibTeX XML Cite \textit{C. S. Calude} et al., SIAM J. Comput. 51, No. 2, STOC17--152-STOC17--188 (2022; Zbl 07516621) Full Text: DOI OpenURL
Tu, Jianhua; Zhang, Lei; Du, Junfeng; Lang, Rongling Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree. (English) Zbl 1485.05174 AIMS Math. 7, No. 1, 569-578 (2022). MSC: 05C85 05C05 05C69 PDF BibTeX XML Cite \textit{J. Tu} et al., AIMS Math. 7, No. 1, 569--578 (2022; Zbl 1485.05174) Full Text: DOI arXiv OpenURL
Dai, Yingjun; Foley, Angèle M.; Hoàng, Chính T. Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs. (English) Zbl 1493.68263 Theor. Comput. Sci. 914, 14-22 (2022). Reviewer: Xueliang Li (Tianjin) MSC: 68R10 05C15 05C85 68Q25 PDF BibTeX XML Cite \textit{Y. Dai} et al., Theor. Comput. Sci. 914, 14--22 (2022; Zbl 1493.68263) Full Text: DOI OpenURL
Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 1495.90226 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90C35 90C15 90C27 68Q25 PDF BibTeX XML Cite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 1495.90226) Full Text: DOI OpenURL
Pardo, Luis M.; Sebastián, Daniel A promenade through correct test sequences. I: Degree of constructible sets, Bézout’s inequality and density. (English) Zbl 1482.68280 J. Complexity 68, Article ID 101588, 92 p. (2022). Reviewer: Amir Hashemi (Isfahan) MSC: 68W30 12E05 13F20 13P15 14Q20 68Q25 68W20 68W40 PDF BibTeX XML Cite \textit{L. M. Pardo} and \textit{D. Sebastián}, J. Complexity 68, Article ID 101588, 92 p. (2022; Zbl 1482.68280) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI arXiv OpenURL
Shabtay, Dvir Single-machine scheduling with machine unavailability periods and resource dependent processing times. (English) Zbl 1490.90134 Eur. J. Oper. Res. 296, No. 2, 423-439 (2022). MSC: 90B35 PDF BibTeX XML Cite \textit{D. Shabtay}, Eur. J. Oper. Res. 296, No. 2, 423--439 (2022; Zbl 1490.90134) Full Text: DOI OpenURL
Frei, Fabian; Hemaspaandra, Edith; Rothe, Jörg Complexity of stability. (English) Zbl 1472.68113 J. Comput. Syst. Sci. 123, 103-121 (2022). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{F. Frei} et al., J. Comput. Syst. Sci. 123, 103--121 (2022; Zbl 1472.68113) Full Text: DOI arXiv OpenURL
Taghavi, Majid; Huang, Kai; Golmohammadi, Amirmohsen Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales. (English) Zbl 07675952 INFOR: Inf. Syst. Oper. Res. 59, No. 4, 572-591 (2021). MSC: 90B06 90C15 90C10 PDF BibTeX XML Cite \textit{M. Taghavi} et al., INFOR: Inf. Syst. Oper. Res. 59, No. 4, 572--591 (2021; Zbl 07675952) Full Text: DOI OpenURL
Arenas, Marcelo; Barceló, Pablo; Monet, Mikaël The complexity of counting problems over incomplete databases. (English) Zbl 07628963 ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021). MSC: 68P15 68Q17 68Q25 PDF BibTeX XML Cite \textit{M. Arenas} et al., ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021; Zbl 07628963) Full Text: DOI arXiv OpenURL
Rudi, Ali Gholami Maximizing the number of visible labels on a rotating map. (English) Zbl 07560049 Sci. Ann. Comput. Sci. 31, No. 2, 293-313 (2021). MSC: 68U05 68W25 PDF BibTeX XML Cite \textit{A. G. Rudi}, Sci. Ann. Comput. Sci. 31, No. 2, 293--313 (2021; Zbl 07560049) Full Text: DOI OpenURL
Wu, Zeyang; Nip, Kameng; He, Qie A new combinatorial algorithm for separable convex resource allocation with nested bound constraints. (English) Zbl 07548833 INFORMS J. Comput. 33, No. 3, 1197-1212 (2021). MSC: 90-XX 68-XX PDF BibTeX XML Cite \textit{Z. Wu} et al., INFORMS J. Comput. 33, No. 3, 1197--1212 (2021; Zbl 07548833) Full Text: DOI OpenURL
Selivanova, Svetlana; Steinberg, Florian; Thies, Holger; Ziegler, Martin Exact real computation of solution operators for linear analytic systems of partial differential equations. (English) Zbl 07497965 Boulier, François (ed.) et al., Computer algebra in scientific computing. 23rd international workshop, CASC 2021, Sochi, Russia, September 13–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12865, 370-390 (2021). MSC: 68W30 PDF BibTeX XML Cite \textit{S. Selivanova} et al., Lect. Notes Comput. Sci. 12865, 370--390 (2021; Zbl 07497965) Full Text: DOI OpenURL
Pérez-Escalona, Pedro; Rapaport, Ivan; Soto, José; Vidal, Ian The multiple traveling salesman problem on spiders. (English) Zbl 1490.90253 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 337-348 (2021). MSC: 90C27 68Q17 68W25 90C59 PDF BibTeX XML Cite \textit{P. Pérez-Escalona} et al., Lect. Notes Comput. Sci. 12607, 337--348 (2021; Zbl 1490.90253) Full Text: DOI OpenURL
Gurski, Frank; Komander, Dominique; Rehs, Carolin Acyclic coloring parameterized by directed clique-width. (English) Zbl 07497524 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 95-108 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{F. Gurski} et al., Lect. Notes Comput. Sci. 12601, 95--108 (2021; Zbl 07497524) Full Text: DOI OpenURL
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI OpenURL
Chakraborty, Dibyayan; Chandran, L. Sunil; Padinhatteeri, Sajith; Pillai, Raji R. Algorithms and complexity of \(s\)-club cluster vertex deletion. (English) Zbl 07495020 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 152-164 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{D. Chakraborty} et al., Lect. Notes Comput. Sci. 12757, 152--164 (2021; Zbl 07495020) Full Text: DOI OpenURL
Alecu, Bogdan; Atminas, Aistis; Lozin, Vadim; Malyshev, Dmitriy Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07495013 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 49-62 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{B. Alecu} et al., Lect. Notes Comput. Sci. 12757, 49--62 (2021; Zbl 07495013) Full Text: DOI arXiv OpenURL
Badri, Hossein; Bahreini, Tayebeh; Grosu, Daniel A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times. (English) Zbl 07485260 Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021). MSC: 90B35 68Q25 PDF BibTeX XML Cite \textit{H. Badri} et al., Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021; Zbl 07485260) Full Text: DOI OpenURL
Granger, Robert; Joux, Antoine Computing discrete logarithms. (English) Zbl 1483.94042 Bos, Joppe W. (ed.) et al., Computational cryptography. Algorithmic aspects of cryptology. A tribute to Arjen K. Lenstra on the occasion of his 65th birthday. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 469, 106-139 (2021). MSC: 94A60 94-03 94-02 68Q12 PDF BibTeX XML Cite \textit{R. Granger} and \textit{A. Joux}, Lond. Math. Soc. Lect. Note Ser. 469, 106--139 (2021; Zbl 1483.94042) Full Text: Link OpenURL
Reynoso, Alejandro; Vakhania, Nodari Theoretical and practical issues in single-machine scheduling with two job release and delivery times. (English) Zbl 1480.90142 J. Sched. 24, No. 6, 615-647 (2021). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{A. Reynoso} and \textit{N. Vakhania}, J. Sched. 24, No. 6, 615--647 (2021; Zbl 1480.90142) Full Text: DOI OpenURL
Khalife, Sammy Sequence graphs: characterization and counting of admissible elements. (English) Zbl 1479.05231 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 209-221 (2021). MSC: 05C62 05C75 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Khalife}, AIRO Springer Ser. 5, 209--221 (2021; Zbl 1479.05231) Full Text: DOI HAL OpenURL
Couto, Fernanda; Cunha, Luís; Posner, Daniel Edge tree spanners. (English) Zbl 1479.05052 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 195-207 (2021). MSC: 05C05 05C12 05C85 68Q17 05C75 PDF BibTeX XML Cite \textit{F. Couto} et al., AIRO Springer Ser. 5, 195--207 (2021; Zbl 1479.05052) Full Text: DOI OpenURL
Pradhan, D.; Pal, Saikat An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph. (English) Zbl 1475.05139 J. Appl. Math. Comput. 66, No. 1-2, 733-747 (2021). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{S. Pal}, J. Appl. Math. Comput. 66, No. 1--2, 733--747 (2021; Zbl 1475.05139) Full Text: DOI OpenURL
Naresh Kumar, H.; Pradhan, D.; Venkatakrishnan, Y. B. Double vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1475.05134 J. Appl. Math. Comput. 66, No. 1-2, 245-262 (2021). MSC: 05C69 68Q25 68Q17 PDF BibTeX XML Cite \textit{H. Naresh Kumar} et al., J. Appl. Math. Comput. 66, No. 1--2, 245--262 (2021; Zbl 1475.05134) Full Text: DOI OpenURL
Chen, Lin; Megow, Nicole; Rischke, Roman; Stougie, Leen; Verschae, José Optimal algorithms for scheduling under time-of-use tariffs. (English) Zbl 1476.90110 Ann. Oper. Res. 304, No. 1-2, 85-107 (2021). MSC: 90B35 68W25 90C39 PDF BibTeX XML Cite \textit{L. Chen} et al., Ann. Oper. Res. 304, No. 1--2, 85--107 (2021; Zbl 1476.90110) Full Text: DOI arXiv OpenURL
Madireddy, Raghunath Reddy; Nandy, Subhas C.; Pandit, Supantha On the geometric red-blue set cover problem. (English) Zbl 07405957 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 129-141 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{R. R. Madireddy} et al., Lect. Notes Comput. Sci. 12635, 129--141 (2021; Zbl 07405957) Full Text: DOI OpenURL
Xiong, Wei; Song, Sulin; Lai, Hong-Jian Polynomially determine if a graph is \((s,3)\)-supereulerian. (English) Zbl 1473.05158 Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021). MSC: 05C45 05C85 PDF BibTeX XML Cite \textit{W. Xiong} et al., Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021; Zbl 1473.05158) Full Text: DOI OpenURL
Zinder, Yakov; Kononov, Alexandr; Fung, Joey A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. (English) Zbl 1478.90046 J. Comb. Optim. 42, No. 2, 276-309 (2021). MSC: 90B35 PDF BibTeX XML Cite \textit{Y. Zinder} et al., J. Comb. Optim. 42, No. 2, 276--309 (2021; Zbl 1478.90046) Full Text: DOI OpenURL
Cucker, Felipe Smale’s 17th problem: advances and open directions. (English) Zbl 07402068 N. Z. J. Math. 52, 233-257 (2021). MSC: 65H20 65Y20 14-XX 68W30 PDF BibTeX XML Cite \textit{F. Cucker}, N. Z. J. Math. 52, 233--257 (2021; Zbl 07402068) Full Text: DOI OpenURL
Panda, B. S.; Chaudhary, Juhi Dominating induced matching in some subclasses of bipartite graphs. (English) Zbl 07391551 Theor. Comput. Sci. 885, 104-115 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{J. Chaudhary}, Theor. Comput. Sci. 885, 104--115 (2021; Zbl 07391551) Full Text: DOI OpenURL
Hamada, Koki; Miyazaki, Shuichi; Okamoto, Kazuya Strongly stable and maximum weakly stable noncrossing matchings. (English) Zbl 07390198 Algorithmica 83, No. 9, 2678-2696 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Hamada} et al., Algorithmica 83, No. 9, 2678--2696 (2021; Zbl 07390198) Full Text: DOI arXiv OpenURL
Ogorodnikov, Yu. Yu.; Khachay, M. Yu. Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension. (English. Russian original) Zbl 1494.90099 Comput. Math. Math. Phys. 61, No. 7, 1194-1206 (2021); translation from Zh. Vychisl. Mat. Mat. Fiz. 61, No. 7, 1206-1219 (2021). MSC: 90C27 90B20 68W25 PDF BibTeX XML Cite \textit{Yu. Yu. Ogorodnikov} and \textit{M. Yu. Khachay}, Comput. Math. Math. Phys. 61, No. 7, 1194--1206 (2021; Zbl 1494.90099); translation from Zh. Vychisl. Mat. Mat. Fiz. 61, No. 7, 1206--1219 (2021) Full Text: DOI OpenURL
Chaudhary, Juhi; Panda, B. S. On the complexity of minimum maximal uniquely restricted matching. (English) Zbl 07380857 Theor. Comput. Sci. 882, 15-28 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Chaudhary} and \textit{B. S. Panda}, Theor. Comput. Sci. 882, 15--28 (2021; Zbl 07380857) Full Text: DOI OpenURL
Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI OpenURL
Bravyi, Sergey; Maslov, Dmitri Hadamard-free circuits expose the structure of the Clifford group. (English) Zbl 1475.68132 IEEE Trans. Inf. Theory 67, No. 7, 4546-4563 (2021). MSC: 68Q12 81P68 81R05 PDF BibTeX XML Cite \textit{S. Bravyi} and \textit{D. Maslov}, IEEE Trans. Inf. Theory 67, No. 7, 4546--4563 (2021; Zbl 1475.68132) Full Text: DOI arXiv OpenURL
Gao, Chao; Ma, Zongming Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing. (English) Zbl 07368217 Stat. Sci. 36, No. 1, 16-33 (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{C. Gao} and \textit{Z. Ma}, Stat. Sci. 36, No. 1, 16--33 (2021; Zbl 07368217) Full Text: DOI arXiv OpenURL
Chudnovsky, Maria; Scott, Alex; Seymour, Paul Detecting a long odd hole. (English) Zbl 1474.05218 Combinatorica 41, No. 1, 1-30 (2021). MSC: 05C38 05C85 PDF BibTeX XML Cite \textit{M. Chudnovsky} et al., Combinatorica 41, No. 1, 1--30 (2021; Zbl 1474.05218) Full Text: DOI arXiv OpenURL
Kubiak, Wiesław On a conjecture for the university timetabling problem. (English) Zbl 1465.90028 Discrete Appl. Math. 299, 26-49 (2021). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{W. Kubiak}, Discrete Appl. Math. 299, 26--49 (2021; Zbl 1465.90028) Full Text: DOI OpenURL
Hermelin, Danny; Karhi, Shlomo; Pinedo, Michael; Shabtay, Dvir New algorithms for minimizing the weighted number of tardy jobs on a single machine. (English) Zbl 1467.90008 Ann. Oper. Res. 298, No. 1-2, 271-287 (2021). MSC: 90B35 PDF BibTeX XML Cite \textit{D. Hermelin} et al., Ann. Oper. Res. 298, No. 1--2, 271--287 (2021; Zbl 1467.90008) Full Text: DOI arXiv OpenURL
Bury, Marc; Gentili, Michele; Schwiegelshohn, Chris; Sorella, Mara Polynomial time approximation schemes for all 1-center problems on metric rational set similarities. (English) Zbl 07335026 Algorithmica 83, No. 5, 1371-1392 (2021). MSC: 68W25 68U05 PDF BibTeX XML Cite \textit{M. Bury} et al., Algorithmica 83, No. 5, 1371--1392 (2021; Zbl 07335026) Full Text: DOI OpenURL
Panda, B. S.; Priyamvada Injective coloring of some subclasses of bipartite graphs and chordal graphs. (English) Zbl 1460.05066 Discrete Appl. Math. 291, 68-87 (2021). MSC: 05C15 05C85 05C40 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{Priyamvada}, Discrete Appl. Math. 291, 68--87 (2021; Zbl 1460.05066) Full Text: DOI OpenURL
Klavík, Pavel; Knop, Dušan; Zeman, Peter Graph isomorphism restricted by lists. (English) Zbl 1497.68385 Theor. Comput. Sci. 860, 51-71 (2021). MSC: 68R10 05C60 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{P. Klavík} et al., Theor. Comput. Sci. 860, 51--71 (2021; Zbl 1497.68385) Full Text: DOI arXiv OpenURL
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann Computing the multilinear factors of lacunary polynomials without heights. (English) Zbl 1481.11105 J. Symb. Comput. 104, 183-206 (2021). Reviewer: Amir Hashemi (Isfahan) MSC: 11R09 11Y05 11Y16 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., J. Symb. Comput. 104, 183--206 (2021; Zbl 1481.11105) Full Text: DOI arXiv OpenURL
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 1458.05189 Theor. Comput. Sci. 858, 49-63 (2021). MSC: 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 858, 49--63 (2021; Zbl 1458.05189) Full Text: DOI arXiv OpenURL
Nguyen, Trung Thanh; Rothe, Jörg Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. (English) Zbl 1457.90073 Theor. Comput. Sci. 858, 35-48 (2021). MSC: 90B35 68W25 68M20 90C05 PDF BibTeX XML Cite \textit{T. T. Nguyen} and \textit{J. Rothe}, Theor. Comput. Sci. 858, 35--48 (2021; Zbl 1457.90073) Full Text: DOI OpenURL
Ko, Ker-I; Wu, Lidong On continuous one-way functions. (English) Zbl 1498.03096 Theor. Comput. Sci. 852, 1-17 (2021). MSC: 03D78 68Q25 PDF BibTeX XML Cite \textit{K.-I Ko} and \textit{L. Wu}, Theor. Comput. Sci. 852, 1--17 (2021; Zbl 1498.03096) Full Text: DOI OpenURL
Panda, B. S.; Goyal, Pooja Global total \(k\)-domination: approximation and hardness results. (English) Zbl 1464.68294 Theor. Comput. Sci. 850, 1-19 (2021). MSC: 68R10 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{P. Goyal}, Theor. Comput. Sci. 850, 1--19 (2021; Zbl 1464.68294) Full Text: DOI OpenURL
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos On the fast delivery problem with one or two packages. (English) Zbl 1464.68278 J. Comput. Syst. Sci. 115, 246-263 (2021). MSC: 68R10 68Q25 68T40 90B06 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., J. Comput. Syst. Sci. 115, 246--263 (2021; Zbl 1464.68278) Full Text: DOI OpenURL
Bousquet, Nicolas; Ito, Takehiro; Kobayashi, Yusuke; Mizuta, Haruka; Ouvrard, Paul; Suzuki, Akira; Wasa, Kunihiro Reconfiguration of spanning trees with many or few leaves. (English) Zbl 07651163 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 24, 15 p. (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{N. Bousquet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 24, 15 p. (2020; Zbl 07651163) Full Text: DOI arXiv OpenURL
Boehmer, Niclas; Bredereck, Robert; Heeger, Klaus; Niedermeier, Rolf Bribery and control in stable marriage. (English) Zbl 1506.91115 Harks, Tobias (ed.) et al., Algorithmic game theory. 13th international symposium, SAGT 2020, Augsburg, Germany, September 16–18, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12283, 163-177 (2020). MSC: 91B68 91A68 PDF BibTeX XML Cite \textit{N. Boehmer} et al., Lect. Notes Comput. Sci. 12283, 163--177 (2020; Zbl 1506.91115) Full Text: DOI OpenURL
Goemans, Michel X.; Rothvoss, Thomas Polynomiality for bin packing with a constant number of item types. (English) Zbl 1499.68428 J. ACM 67, No. 6, Paper No. 38, 21 p. (2020). MSC: 68W40 90B35 90C27 PDF BibTeX XML Cite \textit{M. X. Goemans} and \textit{T. Rothvoss}, J. ACM 67, No. 6, Paper No. 38, 21 p. (2020; Zbl 1499.68428) Full Text: DOI OpenURL
Kirchner, Paul; Espitau, Thomas; Fouque, Pierre-Alain Fast reduction of algebraic lattices over cyclotomic fields. (English) Zbl 1504.94161 Micciancio, Daniele (ed.) et al., Advances in cryptology – CRYPTO 2020. 40th annual international cryptology conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12171, 155-185 (2020). MSC: 94A60 PDF BibTeX XML Cite \textit{P. Kirchner} et al., Lect. Notes Comput. Sci. 12171, 155--185 (2020; Zbl 1504.94161) Full Text: DOI OpenURL
Aliev, Iskander; Averkov, Gennadiy; De Loera, Jesús A.; Oertel, Timm Optimizing sparsity over lattices and semigroups. (English) Zbl 1503.90073 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 40-51 (2020). MSC: 90C10 PDF BibTeX XML Cite \textit{I. Aliev} et al., Lect. Notes Comput. Sci. 12125, 40--51 (2020; Zbl 1503.90073) Full Text: DOI arXiv OpenURL
Hamada, Koki; Miyazaki, Shuichi; Okamoto, Kazuya Strongly stable and maximum weakly stable noncrossing matchings. (English) Zbl 07601016 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 304-315 (2020). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{K. Hamada} et al., Lect. Notes Comput. Sci. 12126, 304--315 (2020; Zbl 07601016) Full Text: DOI OpenURL
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji Dichotomy for Holant\(^\ast\) problems on the Boolean domain. (English) Zbl 1503.68199 Theory Comput. Syst. 64, No. 8, 1362-1391 (2020). MSC: 68R05 68Q17 68Q25 68R07 68R10 68W05 PDF BibTeX XML Cite \textit{J.-Y. Cai} et al., Theory Comput. Syst. 64, No. 8, 1362--1391 (2020; Zbl 1503.68199) Full Text: DOI Link OpenURL
Guo, Zhiwei; Broersma, Hajo; Li, Ruonan; Zhang, Shenggui Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. (English) Zbl 1462.05140 J. Comb. Optim. 40, No. 4, 1008-1019 (2020). MSC: 05C15 05C38 05C45 05C85 PDF BibTeX XML Cite \textit{Z. Guo} et al., J. Comb. Optim. 40, No. 4, 1008--1019 (2020; Zbl 1462.05140) Full Text: DOI OpenURL
Chan, T.-H. Hubert; Jiang, Haotian; Jiang, Shaofeng H.-C. A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics. (English) Zbl 1484.68331 ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020). MSC: 68W25 68R10 68W20 90C27 PDF BibTeX XML Cite \textit{T. H. H. Chan} et al., ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020; Zbl 1484.68331) Full Text: DOI Link OpenURL
Yamakami, Tomoyuki A schematic definition of quantum polynomial time computability. (English) Zbl 1461.81020 J. Symb. Log. 85, No. 4, 1546-1587 (2020). MSC: 81P68 68Q12 68Q10 03D75 PDF BibTeX XML Cite \textit{T. Yamakami}, J. Symb. Log. 85, No. 4, 1546--1587 (2020; Zbl 1461.81020) Full Text: DOI arXiv OpenURL
De Carufel, Jean-Lou; Dumitrescu, Adrian; Meulemans, Wouter; Ophelders, Tim; Pennarun, Claire; Tóth, Csaba D.; Verdonschot, Sander Convex polygons in Cartesian products. (English) Zbl 1466.52003 J. Comput. Geom. 11, No. 2, 205-233 (2020). MSC: 52A10 68U05 PDF BibTeX XML Cite \textit{J.-L. De Carufel} et al., J. Comput. Geom. 11, No. 2, 205--233 (2020; Zbl 1466.52003) Full Text: Link OpenURL
Sutherland, Andrew V. Counting points on superelliptic curves in average polynomial time. (English) Zbl 1472.11322 Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 403-422 (2020). MSC: 11Y16 11G20 11M38 14G10 PDF BibTeX XML Cite \textit{A. V. Sutherland}, Open Book Ser. 4, 403--422 (2020; Zbl 1472.11322) Full Text: DOI arXiv OpenURL
Costa, Edgar; Kedlaya, Kiran S.; Roe, David Hypergeometric \(L\)-functions in average polynomial time. (English) Zbl 1472.11316 Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP). Open Book Ser. 4, 143-159 (2020). MSC: 11Y16 33C20 11G09 11M38 11T24 PDF BibTeX XML Cite \textit{E. Costa} et al., Open Book Ser. 4, 143--159 (2020; Zbl 1472.11316) Full Text: DOI arXiv OpenURL
Furue, Hiroki; Hirai, Hiroshi On a weighted linear matroid intersection algorithm by deg-det computation. (English) Zbl 1497.68554 Japan J. Ind. Appl. Math. 37, No. 3, 677-696 (2020). MSC: 68W05 05B35 15A15 68W40 90C27 PDF BibTeX XML Cite \textit{H. Furue} and \textit{H. Hirai}, Japan J. Ind. Appl. Math. 37, No. 3, 677--696 (2020; Zbl 1497.68554) Full Text: DOI arXiv OpenURL
Jansen, Klaus; Klein, Kim-Manuel; Verschae, José Closing the gap for makespan scheduling via sparsification techniques. (English) Zbl 1451.90062 Math. Oper. Res. 45, No. 4, 1371-1392 (2020). MSC: 90B35 68W25 90C10 PDF BibTeX XML Cite \textit{K. Jansen} et al., Math. Oper. Res. 45, No. 4, 1371--1392 (2020; Zbl 1451.90062) Full Text: DOI Link OpenURL
Kuroki, Yuko; Xu, Liyuan; Miyauchi, Atsushi; Honda, Junya; Sugiyama, Masashi Polynomial-time algorithms for multiple-arm identification with full-bandit feedback. (English) Zbl 1454.91060 Neural Comput. 32, No. 9, 1733-1773 (2020). MSC: 91B06 91B86 60C99 68W25 PDF BibTeX XML Cite \textit{Y. Kuroki} et al., Neural Comput. 32, No. 9, 1733--1773 (2020; Zbl 1454.91060) Full Text: DOI arXiv OpenURL
Dehghan, Ali; Banihashemi, Amir H. On finding bipartite graphs with a small number of short cycles and large girth. (English) Zbl 1452.05093 IEEE Trans. Inf. Theory 66, No. 10, 6024-6036 (2020). MSC: 05C38 94B05 05C65 05C75 05C85 PDF BibTeX XML Cite \textit{A. Dehghan} and \textit{A. H. Banihashemi}, IEEE Trans. Inf. Theory 66, No. 10, 6024--6036 (2020; Zbl 1452.05093) Full Text: DOI OpenURL
Zhao, Ming; Zhang, Minjiao Multiechelon lot sizing: new complexities and inequalities. (English) Zbl 1446.90048 Oper. Res. 68, No. 2, 534-551 (2020). MSC: 90B05 PDF BibTeX XML Cite \textit{M. Zhao} and \textit{M. Zhang}, Oper. Res. 68, No. 2, 534--551 (2020; Zbl 1446.90048) Full Text: DOI OpenURL
Hell, Pavol; Huang, Jing; Lin, Jephian C.-H.; McConnell, Ross M. Bipartite analogues of comparability and cocomparability graphs. (English) Zbl 1450.05089 SIAM J. Discrete Math. 34, No. 3, 1969-1983 (2020). MSC: 05C99 05C75 05C85 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1969--1983 (2020; Zbl 1450.05089) Full Text: DOI arXiv OpenURL
Zhao, Haijun; He, Chunlin; Wang, Chaobin; Pu, Bin; Chen, Yihong; Cui, Mengtian WSN design based on polynomial time approximation and its improved algorithm. (Chinese. English summary) Zbl 1463.68011 J. Yunnan Univ., Nat. Sci. 42, No. 3, 452-458 (2020). MSC: 68M18 68W25 90C59 PDF BibTeX XML Cite \textit{H. Zhao} et al., J. Yunnan Univ., Nat. Sci. 42, No. 3, 452--458 (2020; Zbl 1463.68011) Full Text: DOI OpenURL
Xiao, Mingyu; Nagamochi, Hiroshi Characterizing star-PCGs. (English) Zbl 1479.05340 Algorithmica 82, No. 10, 3066-3090 (2020). MSC: 05C85 68R10 05C12 05C22 68Q17 PDF BibTeX XML Cite \textit{M. Xiao} and \textit{H. Nagamochi}, Algorithmica 82, No. 10, 3066--3090 (2020; Zbl 1479.05340) Full Text: DOI arXiv OpenURL
Gemsa, Andreas; Niedermann, Benjamin; Nöllenburg, Martin A unified model and algorithms for temporal map labeling. (English) Zbl 1460.68123 Algorithmica 82, No. 10, 2709-2736 (2020). MSC: 68U05 68Q17 68W25 PDF BibTeX XML Cite \textit{A. Gemsa} et al., Algorithmica 82, No. 10, 2709--2736 (2020; Zbl 1460.68123) Full Text: DOI OpenURL
Verma, Shaily; Panda, B. S. Grundy coloring in some subclasses of bipartite graphs and their complements. (English) Zbl 1466.05079 Inf. Process. Lett. 163, Article ID 105999, 6 p. (2020). MSC: 05C15 05C85 68Q17 68W40 PDF BibTeX XML Cite \textit{S. Verma} and \textit{B. S. Panda}, Inf. Process. Lett. 163, Article ID 105999, 6 p. (2020; Zbl 1466.05079) Full Text: DOI OpenURL
Jha, Anupriya; Pradhan, D.; Banerjee, S. Algorithm and hardness results on neighborhood total domination in graphs. (English) Zbl 1458.05197 Theor. Comput. Sci. 840, 16-32 (2020). Reviewer: Haiko Müller (Leeds) MSC: 05C69 05C85 68Q17 68R10 PDF BibTeX XML Cite \textit{A. Jha} et al., Theor. Comput. Sci. 840, 16--32 (2020; Zbl 1458.05197) Full Text: DOI arXiv OpenURL
Alon, Yahav; Krivelevich, Michael Finding a Hamilton cycle fast on average using rotations and extensions. (English) Zbl 1453.68118 Random Struct. Algorithms 57, No. 1, 32-46 (2020). MSC: 68R10 05C38 05C45 05C80 05C85 68W40 PDF BibTeX XML Cite \textit{Y. Alon} and \textit{M. Krivelevich}, Random Struct. Algorithms 57, No. 1, 32--46 (2020; Zbl 1453.68118) Full Text: DOI arXiv OpenURL
Akrida, Eleni C.; Mertzios, George B.; Nikoletseas, Sotiris; Raptopoulos, Christoforos; Spirakis, Paul G.; Zamaraev, Viktor How fast can we reach a target vertex in stochastic temporal graphs? (English) Zbl 1456.68124 J. Comput. Syst. Sci. 114, 65-83 (2020). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 68Q87 68W25 PDF BibTeX XML Cite \textit{E. C. Akrida} et al., J. Comput. Syst. Sci. 114, 65--83 (2020; Zbl 1456.68124) Full Text: DOI arXiv Link OpenURL