Eden, Alon; Feige, Uriel; Feldman, Michal Max-min greedy matching. (English) Zbl 07528582 Theory Comput. 18, Paper No. 6, 33 p. (2022). MSC: 68Qxx 68W25 68R10 91B26 05C70 PDF BibTeX XML Cite \textit{A. Eden} et al., Theory Comput. 18, Paper No. 6, 33 p. (2022; Zbl 07528582) Full Text: DOI OpenURL
Shalini, Arul Jeya; Parkavi, E. Optimal layout of embedding generalized Petersen graph \(P(n,m)\) into cycle of triangle. (English) Zbl 07528054 South East Asian J. Math. Math. Sci. 18, No. 1, 333-340 (2022). MSC: 05C12 05C85 05C90 PDF BibTeX XML Cite \textit{A. J. Shalini} and \textit{E. Parkavi}, South East Asian J. Math. Math. Sci. 18, No. 1, 333--340 (2022; Zbl 07528054) Full Text: Link OpenURL
Klimm, Max; Warode, Philipp Parametric computation of minimum-cost flows with piecewise quadratic costs. (English) Zbl 07528010 Math. Oper. Res. 47, No. 1, 812-846 (2022). MSC: 90C31 90C20 90C49 68Q25 91A07 PDF BibTeX XML Cite \textit{M. Klimm} and \textit{P. Warode}, Math. Oper. Res. 47, No. 1, 812--846 (2022; Zbl 07528010) Full Text: DOI OpenURL
Gutekunst, Samuel C.; Williamson, David P. Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps. (English) Zbl 07527977 Math. Oper. Res. 47, No. 1, 1-28 (2022). MSC: 90C22 90C57 90C27 05C85 68R05 68W25 PDF BibTeX XML Cite \textit{S. C. Gutekunst} and \textit{D. P. Williamson}, Math. Oper. Res. 47, No. 1, 1--28 (2022; Zbl 07527977) Full Text: DOI OpenURL
Deme, Chérif Bachir; Diaw, Mame Abdou; Fall, Oumar; Ba, Alhousseynou; Diankha, Oumar Two-variable function to design interleaved sequences on \(\mathbb{F}_2\). (English) Zbl 07527460 Adv. Appl. Discrete Math. 29, No. 2, 187-203 (2022). MSC: 11B50 11B85 11Y16 PDF BibTeX XML Cite \textit{C. B. Deme} et al., Adv. Appl. Discrete Math. 29, No. 2, 187--203 (2022; Zbl 07527460) Full Text: DOI OpenURL
García Trillos, Nicolás; Murray, Ryan; Thorpe, Matthew From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds. (English) Zbl 07525964 Arch. Ration. Mech. Anal. 244, No. 3, 541-598 (2022). MSC: 68Pxx 05C85 49Qxx 52Axx 62G05 PDF BibTeX XML Cite \textit{N. García Trillos} et al., Arch. Ration. Mech. Anal. 244, No. 3, 541--598 (2022; Zbl 07525964) Full Text: DOI OpenURL
Breen, Jane; Butler, Steve; Fuentes, Melissa; Lidický, Bernard; Phillips, Michael; Riasanovsky, Alexander W. N.; Song, Sung-Yell; Villagrán, Ralihe R.; Wiseman, Cedar; Zhang, Xiaohong Hadamard diagonalizable graphs of order at most 36. (English) Zbl 07525883 Electron. J. Comb. 29, No. 2, Research Paper P2.16, 22 p. (2022). MSC: 05C50 15B34 05B20 05C76 05C85 PDF BibTeX XML Cite \textit{J. Breen} et al., Electron. J. Comb. 29, No. 2, Research Paper P2.16, 22 p. (2022; Zbl 07525883) Full Text: DOI OpenURL
Devriendt, Karel; Martin-Gutierrez, Samuel; Lambiotte, Renaud Variance and covariance of distributions on graphs. (English) Zbl 07525526 SIAM Rev. 64, No. 2, 343-359 (2022). MSC: 05D40 05C82 05C12 05C69 90C35 05C85 PDF BibTeX XML Cite \textit{K. Devriendt} et al., SIAM Rev. 64, No. 2, 343--359 (2022; Zbl 07525526) Full Text: DOI OpenURL
Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Okamoto, Yoshio Shortest reconfiguration of perfect matchings via alternating cycles. (English) Zbl 07524461 SIAM J. Discrete Math. 36, No. 2, 1102-1123 (2022). MSC: 05C70 05C85 52B05 68Q17 PDF BibTeX XML Cite \textit{T. Ito} et al., SIAM J. Discrete Math. 36, No. 2, 1102--1123 (2022; Zbl 07524461) Full Text: DOI OpenURL
Gonzaga de Oliveira, S. L.; Carvalho, C. Metaheuristic algorithms for the bandwidth reduction of large-scale matrices. (English) Zbl 07524282 J. Comb. Optim. 43, No. 4, 727-784 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{S. L. Gonzaga de Oliveira} and \textit{C. Carvalho}, J. Comb. Optim. 43, No. 4, 727--784 (2022; Zbl 07524282) Full Text: DOI OpenURL
Aoike, Yuuki; Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Kurita, Kazuhiro; Otachi, Yota An improved deterministic parameterized algorithm for cactus vertex deletion. (English) Zbl 07523544 Theory Comput. Syst. 66, No. 2, 502-515 (2022). MSC: 05C85 05C40 68Q25 68W25 PDF BibTeX XML Cite \textit{Y. Aoike} et al., Theory Comput. Syst. 66, No. 2, 502--515 (2022; Zbl 07523544) Full Text: DOI OpenURL
Fluschnik, Till; Niedermeier, Rolf; Rohm, Valentin; Zschoche, Philipp Multistage vertex cover. (English) Zbl 07523542 Theory Comput. Syst. 66, No. 2, 454-483 (2022). MSC: 68Qxx 05Cxx 68Wxx PDF BibTeX XML Cite \textit{T. Fluschnik} et al., Theory Comput. Syst. 66, No. 2, 454--483 (2022; Zbl 07523542) Full Text: DOI OpenURL
Marques Jr., Elias L.; Coelho, Vitor N.; Coelho, Igor M.; Frota, Yuri Abitbol de Menezes; Koochaksaraei, Roozbeh H.; Ochi, Luiz Satoru; Coelho, Bruno N. UAVs routes optimization on smart cities and regions. (English) Zbl 07523423 RAIRO, Oper. Res. 56, No. 2, 853-869 (2022). MSC: 90C29 05C85 PDF BibTeX XML Cite \textit{E. L. Marques Jr.} et al., RAIRO, Oper. Res. 56, No. 2, 853--869 (2022; Zbl 07523423) Full Text: DOI OpenURL
Fan, Chenglin; Raichel, Benjamin; van Buskirk, Gregory Metric violation distance: hardness and approximation. (English) Zbl 07517142 Algorithmica 84, No. 5, 1441-1465 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{C. Fan} et al., Algorithmica 84, No. 5, 1441--1465 (2022; Zbl 07517142) Full Text: DOI OpenURL
Charalampopoulos, Panagiotis; Iliopoulos, Costas S.; Kociumaka, Tomasz; Pissis, Solon P.; Radoszewski, Jakub; Straszyński, Juliusz Efficient computation of sequence mappability. (English) Zbl 07517141 Algorithmica 84, No. 5, 1418-1440 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{P. Charalampopoulos} et al., Algorithmica 84, No. 5, 1418--1440 (2022; Zbl 07517141) Full Text: DOI OpenURL
Bergougnoux, Benjamin; Papadopoulos, Charis; Telle, Jan Arne Node multiway cut and subset feedback vertex set on graphs of bounded mim-width. (English) Zbl 07517140 Algorithmica 84, No. 5, 1385-1417 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{B. Bergougnoux} et al., Algorithmica 84, No. 5, 1385--1417 (2022; Zbl 07517140) Full Text: DOI OpenURL
Komm, Dennis; Královič, Rastislav; Královič, Richard; Mömke, Tobias Randomized online computation with high probability guarantees. (English) Zbl 07517139 Algorithmica 84, No. 5, 1357-1384 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Komm} et al., Algorithmica 84, No. 5, 1357--1384 (2022; Zbl 07517139) Full Text: DOI 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 OpenURL
Ashvinkumar, Vikrant; Gudmundsson, Joachim; Levcopoulos, Christos; Nilsson, Bengt J.; van Renssen, André Local routing in sparse and lightweight geometric graphs. (English) Zbl 07517137 Algorithmica 84, No. 5, 1316-1340 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{V. Ashvinkumar} et al., Algorithmica 84, No. 5, 1316--1340 (2022; Zbl 07517137) Full Text: DOI OpenURL
Haraguchi, Kazuya; Nagamochi, Hiroshi Enumeration of support-closed subsets in confluent systems. (English) Zbl 07517136 Algorithmica 84, No. 5, 1279-1315 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Haraguchi} and \textit{H. Nagamochi}, Algorithmica 84, No. 5, 1279--1315 (2022; Zbl 07517136) Full Text: DOI OpenURL
Guo, Xiangyu; Kortsarz, Guy; Laekhanukit, Bundit; Li, Shi; Vaz, Daniel; Xian, Jiayi On approximating degree-bounded network design problems. (English) Zbl 07517135 Algorithmica 84, No. 5, 1252-1278 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{X. Guo} et al., Algorithmica 84, No. 5, 1252--1278 (2022; Zbl 07517135) Full Text: DOI OpenURL
Li, Yaqiao; Narayan, Vishnu V.; Pankratov, Denis Online coloring and a new type of adversary for online graph problems. (English) Zbl 07517134 Algorithmica 84, No. 5, 1232-1251 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{Y. Li} et al., Algorithmica 84, No. 5, 1232--1251 (2022; Zbl 07517134) Full Text: DOI OpenURL
Dumitrescu, Adrian; Tóth, Csaba D. Online unit clustering and unit covering in higher dimensions. (English) Zbl 07517133 Algorithmica 84, No. 5, 1213-1231 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Dumitrescu} and \textit{C. D. Tóth}, Algorithmica 84, No. 5, 1213--1231 (2022; Zbl 07517133) Full Text: DOI OpenURL
Foucaud, Florent; Hocquard, Hervé; Lajou, Dimitri; Mitsou, Valia; Pierron, Théo Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity. (English) Zbl 07517132 Algorithmica 84, No. 5, 1183-1212 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{F. Foucaud} et al., Algorithmica 84, No. 5, 1183--1212 (2022; Zbl 07517132) Full Text: DOI OpenURL
Golin, Mordecai; Sandeep, Sai Minmax regret for sink location on dynamic flow paths with general capacities. (English) Zbl 07516293 Discrete Appl. Math. 315, 1-26 (2022). MSC: 90B80 90B10 90C35 90C47 05C85 PDF BibTeX XML Cite \textit{M. Golin} and \textit{S. Sandeep}, Discrete Appl. Math. 315, 1--26 (2022; Zbl 07516293) Full Text: DOI OpenURL
Blekherman, Grigoriy; Dey, Santanu S.; Shu, Kevin; Sun, Shengding Hyperbolic relaxation of \(k\)-locally positive semidefinite matrices. (English) Zbl 07516284 SIAM J. Optim. 32, No. 2, 470-490 (2022). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{G. Blekherman} et al., SIAM J. Optim. 32, No. 2, 470--490 (2022; Zbl 07516284) Full Text: DOI OpenURL
Bousquet, Nicolas; Heinrich, Marc A polynomial version of Cereceda’s conjecture. (English) Zbl 07514791 J. Comb. Theory, Ser. B 155, 1-16 (2022). MSC: 05C15 05C85 60J10 68R10 05C40 PDF BibTeX XML Cite \textit{N. Bousquet} and \textit{M. Heinrich}, J. Comb. Theory, Ser. B 155, 1--16 (2022; Zbl 07514791) 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 07512915 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 07512915) Full Text: DOI OpenURL
Chen, Jie; Saad, Yousef; Zhang, Zechen Graph coarsening: from scientific computing to machine learning. (English) Zbl 07511992 S\(\vec{\text{e}}\)MA J. 79, No. 1, 187-223 (2022). MSC: 65N55 65F10 68T05 05C85 94C15 PDF BibTeX XML Cite \textit{J. Chen} et al., S\(\vec{\text{e}}\)MA J. 79, No. 1, 187--223 (2022; Zbl 07511992) Full Text: DOI OpenURL
Pérez-Rosés, Hebert; Bras-Amorós, Maria; Serradilla-Merinero, José Miguel Greedy routing in circulant networks. (English) Zbl 07510844 Graphs Comb. 38, No. 3, Paper No. 86, 16 p. (2022). MSC: 05C82 05C20 05C35 05C85 11B39 68R10 PDF BibTeX XML Cite \textit{H. Pérez-Rosés} et al., Graphs Comb. 38, No. 3, Paper No. 86, 16 p. (2022; Zbl 07510844) Full Text: DOI OpenURL
Bessy, S.; Rautenbach, D. Algorithmic aspects of broadcast independence. (English) Zbl 07510695 Discrete Appl. Math. 314, 142-149 (2022). MSC: 05C12 05C85 05C69 68R10 PDF BibTeX XML Cite \textit{S. Bessy} and \textit{D. Rautenbach}, Discrete Appl. Math. 314, 142--149 (2022; Zbl 07510695) Full Text: DOI OpenURL
Bonomo-Braberman, Flavia; Gonzalez, Carolina Lucía A new approach on locally checkable problems. (English) Zbl 07510690 Discrete Appl. Math. 314, 53-80 (2022). MSC: 05C85 05C69 05C70 PDF BibTeX XML Cite \textit{F. Bonomo-Braberman} and \textit{C. L. Gonzalez}, Discrete Appl. Math. 314, 53--80 (2022; Zbl 07510690) Full Text: DOI OpenURL
Sun, Ying; Scutari, Gesualdo; Daneshmand, Amir Distributed optimization based on gradient tracking revisited: enhancing convergence rate via surrogation. (English) Zbl 07510407 SIAM J. Optim. 32, No. 2, 354-385 (2022). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{Y. Sun} et al., SIAM J. Optim. 32, No. 2, 354--385 (2022; Zbl 07510407) Full Text: DOI OpenURL
Agrawal, Akanksha; Kanesh, Lawqueen; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs. (English) Zbl 07510395 SIAM J. Discrete Math. 36, No. 2, 911-921 (2022). MSC: 05C85 05C07 05C12 68Q27 PDF BibTeX XML Cite \textit{A. Agrawal} et al., SIAM J. Discrete Math. 36, No. 2, 911--921 (2022; Zbl 07510395) Full Text: DOI OpenURL
Levent Doğan, M.; Ergür, Alperen A.; Mundo, Jake D.; Tsigaridas, Elias The multivariate Schwartz-Zippel lemma. (English) Zbl 07510394 SIAM J. Discrete Math. 36, No. 2, 888-910 (2022). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{M. Levent Doğan} et al., SIAM J. Discrete Math. 36, No. 2, 888--910 (2022; Zbl 07510394) Full Text: DOI OpenURL
Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal A subexponential parameterized algorithm for directed Subset Traveling Salesman Problem on planar graphs. (English) Zbl 07510285 SIAM J. Comput. 51, No. 2, 254-289 (2022). MSC: 05C10 05C85 68R10 90C35 90C27 PDF BibTeX XML Cite \textit{D. Marx} et al., SIAM J. Comput. 51, No. 2, 254--289 (2022; Zbl 07510285) Full Text: DOI OpenURL
Kathuria, Tarun; Liu, Yang P.; Sidford, Aaron Unit capacity maxflow in almost \(m^{4/3}\) time. (English) Zbl 07510284 SIAM J. Comput. 51, No. 2, FOCS20-175-FOCS20-204 (2022). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{T. Kathuria} et al., SIAM J. Comput. 51, No. 2, FOCS20--175-FOCS20--204 (2022; Zbl 07510284) Full Text: DOI OpenURL
Albi, Giacomo; Herty, Michael; Kalise, Dante; Segala, Chiara Moment-driven predictive control of mean-field collective dynamics. (English) Zbl 07510074 SIAM J. Control Optim. 60, No. 2, 814-841 (2022). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{G. Albi} et al., SIAM J. Control Optim. 60, No. 2, 814--841 (2022; Zbl 07510074) Full Text: DOI OpenURL
Brinkmann, Gunnar; Goedgebeur, Jan; Mckay, Brendan D. The minimality of the Georges-Kelmans graph. (English) Zbl 07506858 Math. Comput. 91, No. 335, 1483-1500 (2022). MSC: 05C45 05C85 05C10 PDF BibTeX XML Cite \textit{G. Brinkmann} et al., Math. Comput. 91, No. 335, 1483--1500 (2022; Zbl 07506858) Full Text: DOI OpenURL
Kumar, Neeraj; Sintos, Stavros; Suri, Subhash The maximum exposure problem. (English) Zbl 1483.68466 Comput. Geom. 104, Article ID 101861, 15 p. (2022). MSC: 68U05 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{N. Kumar} et al., Comput. Geom. 104, Article ID 101861, 15 p. (2022; Zbl 1483.68466) Full Text: DOI OpenURL
Frati, Fabrizio Planar rectilinear drawings of outerplanar graphs in linear time. (English) Zbl 07505560 Comput. Geom. 103, Article ID 101854, 52 p. (2022). MSC: 05C62 05C10 05C85 PDF BibTeX XML Cite \textit{F. Frati}, Comput. Geom. 103, Article ID 101854, 52 p. (2022; Zbl 07505560) Full Text: DOI OpenURL
Bose, Prosenjit; Carmi, Paz; Keil, J. Mark; Maheshwari, Anil; Mehrabi, Saeed; Mondal, Debajyoti; Smid, Michiel Computing maximum independent set on outerstring graphs and their relatives. (English) Zbl 07505558 Comput. Geom. 103, Article ID 101852, 12 p. (2022). MSC: 05C69 05C35 05C62 68Q25 68W05 PDF BibTeX XML Cite \textit{P. Bose} et al., Comput. Geom. 103, Article ID 101852, 12 p. (2022; Zbl 07505558) Full Text: DOI OpenURL
Barth, Dominique; Mautor, Thierry; Watel, Dimitri; Weisser, Marc-Antoine A polynomial algorithm for deciding the validity of an electrical distribution tree. (English) Zbl 07504771 Inf. Process. Lett. 176, Article ID 106249, 6 p. (2022). MSC: 90B10 68Q25 PDF BibTeX XML Cite \textit{D. Barth} et al., Inf. Process. Lett. 176, Article ID 106249, 6 p. (2022; Zbl 07504771) Full Text: DOI OpenURL
Brand, Cornelius A note on algebraic techniques for subgraph detection. (English) Zbl 07504764 Inf. Process. Lett. 176, Article ID 106242, 8 p. (2022). MSC: 68P27 05C85 PDF BibTeX XML Cite \textit{C. Brand}, Inf. Process. Lett. 176, Article ID 106242, 8 p. (2022; Zbl 07504764) Full Text: DOI OpenURL
Lyon, Merritt; Mahmoud, Hosam Insertion depth in power-weight trees. (English) Zbl 07504761 Inf. Process. Lett. 176, Article ID 106227, 9 p. (2022). MSC: 05C80 05C05 05C85 PDF BibTeX XML Cite \textit{M. Lyon} and \textit{H. Mahmoud}, Inf. Process. Lett. 176, Article ID 106227, 9 p. (2022; Zbl 07504761) Full Text: DOI OpenURL
Brignall, Robert; Cocks, Daniel Uncountably many minimal hereditary classes of graphs of unbounded clique-width. (English) Zbl 07503066 Electron. J. Comb. 29, No. 1, Research Paper P1.63, 27 p. (2022). MSC: 05C75 05C85 05C69 68R15 PDF BibTeX XML Cite \textit{R. Brignall} and \textit{D. Cocks}, Electron. J. Comb. 29, No. 1, Research Paper P1.63, 27 p. (2022; Zbl 07503066) Full Text: DOI OpenURL
Michail, Othon; Skretas, George; Spirakis, Paul G. Distributed computation and reconfiguration in actively dynamic networks. (English) Zbl 1483.68031 Distrib. Comput. 35, No. 2, 185-206 (2022). MSC: 68M14 68M10 68R10 68W15 68W40 PDF BibTeX XML Cite \textit{O. Michail} et al., Distrib. Comput. 35, No. 2, 185--206 (2022; Zbl 1483.68031) Full Text: DOI OpenURL
Nanongkai, Danupon; Scquizzato, Michele Equivalence classes and conditional hardness in massively parallel computations. (English) Zbl 1483.68032 Distrib. Comput. 35, No. 2, 165-183 (2022). MSC: 68M14 68Q10 68Q17 68Q25 68R10 PDF BibTeX XML Cite \textit{D. Nanongkai} and \textit{M. Scquizzato}, Distrib. Comput. 35, No. 2, 165--183 (2022; Zbl 1483.68032) Full Text: DOI OpenURL
Takazawa, Kenjiro Excluded \(t\)-factors in bipartite graphs: unified framework for nonbipartite matchings, restricted 2-matchings, and matroids. (English) Zbl 07501964 SIAM J. Discrete Math. 36, No. 1, 702-727 (2022). MSC: 05C70 05B35 05C85 68R10 90C27 90C35 PDF BibTeX XML Cite \textit{K. Takazawa}, SIAM J. Discrete Math. 36, No. 1, 702--727 (2022; Zbl 07501964) Full Text: DOI OpenURL
Kaabar, Mohammed K. A.; Yenoke, Kins Radio and radial radio numbers of certain sunflower extended graphs. (English) Zbl 07500468 Int. J. Math. Math. Sci. 2022, Article ID 9229409, 9 p. (2022). MSC: 05Cxx 68Mxx 68Wxx PDF BibTeX XML Cite \textit{M. K. A. Kaabar} and \textit{K. Yenoke}, Int. J. Math. Math. Sci. 2022, Article ID 9229409, 9 p. (2022; Zbl 07500468) Full Text: DOI OpenURL
Bridoux, Florian; Durbec, Amélia; Perrot, Kevin; Richard, Adrien Complexity of fixed point counting problems in Boolean networks. (English) Zbl 1483.68240 J. Comput. Syst. Sci. 126, 138-164 (2022). MSC: 68R05 37B10 68Q17 68Q25 68R10 PDF BibTeX XML Cite \textit{F. Bridoux} et al., J. Comput. Syst. Sci. 126, 138--164 (2022; Zbl 1483.68240) Full Text: DOI OpenURL
Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann Medians in median graphs and their cube complexes in linear time. (English) Zbl 1483.68250 J. Comput. Syst. Sci. 126, 80-105 (2022). MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{L. Bénéteau} et al., J. Comput. Syst. Sci. 126, 80--105 (2022; Zbl 1483.68250) Full Text: DOI OpenURL
Crespelle, Christophe; Golovach, Petr A. Cyclability in graph classes. (English) Zbl 07499203 Discrete Appl. Math. 313, 147-178 (2022). MSC: 05C75 05C45 05C38 05C85 05A05 PDF BibTeX XML Cite \textit{C. Crespelle} and \textit{P. A. Golovach}, Discrete Appl. Math. 313, 147--178 (2022; Zbl 07499203) Full Text: DOI OpenURL
Brown, Jason Maximal intervals of decrease and inflection points for node reliability. (English) Zbl 07499193 Discrete Appl. Math. 313, 40-44 (2022). MSC: 90B25 90B10 05C31 05C85 68R10 PDF BibTeX XML Cite \textit{J. Brown}, Discrete Appl. Math. 313, 40--44 (2022; Zbl 07499193) Full Text: DOI OpenURL
Gil, José Arturo; Santini, Simone Matching regular expressions on uncertain data. (English) Zbl 07498370 Algorithmica 84, No. 2, 532-564 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. A. Gil} and \textit{S. Santini}, Algorithmica 84, No. 2, 532--564 (2022; Zbl 07498370) Full Text: DOI OpenURL
Baste, Julien; Thilikos, Dimitrios M. Contraction bidimensionality of geometric intersection graphs. (English) Zbl 07498369 Algorithmica 84, No. 2, 510-531 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Baste} and \textit{D. M. Thilikos}, Algorithmica 84, No. 2, 510--531 (2022; Zbl 07498369) Full Text: DOI OpenURL
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian On the parameterized complexity of reconfiguration of connected dominating sets. (English) Zbl 07498368 Algorithmica 84, No. 2, 482-509 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., Algorithmica 84, No. 2, 482--509 (2022; Zbl 07498368) Full Text: DOI OpenURL
Alon, Noga; Shikhelman, Clara Additive approximation of generalized Turán questions. (English) Zbl 07498367 Algorithmica 84, No. 2, 464-481 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{N. Alon} and \textit{C. Shikhelman}, Algorithmica 84, No. 2, 464--481 (2022; Zbl 07498367) Full Text: DOI OpenURL
Arvind, V.; Chatterjee, Abhranil; Datta, Rajit; Mukhopadhyay, Partha Fast exact algorithms using Hadamard product of polynomials. (English) Zbl 07498366 Algorithmica 84, No. 2, 436-463 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{V. Arvind} et al., Algorithmica 84, No. 2, 436--463 (2022; Zbl 07498366) Full Text: DOI OpenURL
Saurabh, Saket; Tale, Prafullkumar On the parameterized complexity of maximum degree contraction problem. (English) Zbl 07498365 Algorithmica 84, No. 2, 405-435 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{S. Saurabh} and \textit{P. Tale}, Algorithmica 84, No. 2, 405--435 (2022; Zbl 07498365) Full Text: DOI OpenURL
Dörfler, Julian; Roth, Marc; Schmitt, Johannes; Wellnitz, Philip Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness. (English) Zbl 07498364 Algorithmica 84, No. 2, 379-404 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Dörfler} et al., Algorithmica 84, No. 2, 379--404 (2022; Zbl 07498364) Full Text: DOI OpenURL
Kleinberg, Jon; Oren, Sigal Mechanisms for (mis)allocating scientific credit. (English) Zbl 07498363 Algorithmica 84, No. 2, 344-378 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Kleinberg} and \textit{S. Oren}, Algorithmica 84, No. 2, 344--378 (2022; Zbl 07498363) Full Text: DOI OpenURL
Levin, Asaf Approximation schemes for the generalized extensible bin packing problem. (English) Zbl 07498362 Algorithmica 84, No. 2, 325-343 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Levin}, Algorithmica 84, No. 2, 325--343 (2022; Zbl 07498362) Full Text: DOI OpenURL
Naor, Joseph (Seffi); Umboh, Seeun William; Williamson, David P. Tight bounds for online weighted tree augmentation. (English) Zbl 07498361 Algorithmica 84, No. 2, 304-324 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Naor} et al., Algorithmica 84, No. 2, 304--324 (2022; Zbl 07498361) Full Text: DOI OpenURL
Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese Structural parameterizations of clique coloring. (English) Zbl 07498360 Algorithmica 84, No. 2, 273-303 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{L. Jaffke} et al., Algorithmica 84, No. 2, 273--303 (2022; Zbl 07498360) Full Text: DOI OpenURL
Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four. (English) Zbl 07497780 Discrete Appl. Math. 312, 106-115 (2022). MSC: 05C15 68Q25 05C85 05D10 68R10 PDF BibTeX XML Cite \textit{B. Cameron} et al., Discrete Appl. Math. 312, 106--115 (2022; Zbl 07497780) Full Text: DOI OpenURL
Dourado, Mitre C.; de Figueiredo, Celina M. H.; de Melo, Alexsander A.; de Oliveira Oliveira, Mateus; Souza, Uéverton S. Computing the zig-zag number of directed graphs. (English) Zbl 07497779 Discrete Appl. Math. 312, 86-105 (2022). MSC: 05C20 68R10 05C85 68Q25 05C05 PDF BibTeX XML Cite \textit{M. C. Dourado} et al., Discrete Appl. Math. 312, 86--105 (2022; Zbl 07497779) Full Text: DOI OpenURL
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. (English) Zbl 07497778 Discrete Appl. Math. 312, 72-85 (2022). MSC: 68R10 68Q25 05C85 91A43 05C05 PDF BibTeX XML Cite \textit{G. Mescoff} et al., Discrete Appl. Math. 312, 72--85 (2022; Zbl 07497778) Full Text: DOI OpenURL
Bonomo-Braberman, Flavia; Gonzalez, Carolina L.; Oliveira, Fabiano S.; Sampaio, Moysés S. Jr.; Szwarcfiter, Jayme L. Thinness of product graphs. (English) Zbl 07497777 Discrete Appl. Math. 312, 52-71 (2022). MSC: 05C15 05C76 05C35 05C99 68Q25 PDF BibTeX XML Cite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 312, 52--71 (2022; Zbl 07497777) Full Text: DOI OpenURL
Adler, Isolde; Benediktsson, Bjarki Geir; Macpherson, Dugald Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. (English) Zbl 07497775 Discrete Appl. Math. 312, 29-44 (2022). MSC: 03C45 68Q25 05C42 05C85 05C12 PDF BibTeX XML Cite \textit{I. Adler} et al., Discrete Appl. Math. 312, 29--44 (2022; Zbl 07497775) Full Text: DOI OpenURL
Lecomte, Victor; Ódor, Gergely; Thiran, Patrick The power of adaptivity in source identification with time queries on the path. (English) Zbl 07496389 Theor. Comput. Sci. 911, 92-123 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{V. Lecomte} et al., Theor. Comput. Sci. 911, 92--123 (2022; Zbl 07496389) Full Text: DOI OpenURL
Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; Uno, Yushi Linear-time recognition of double-threshold graphs. (English) Zbl 07495638 Algorithmica 84, No. 4, 1163-1181 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{Y. Kobayashi} et al., Algorithmica 84, No. 4, 1163--1181 (2022; Zbl 07495638) Full Text: DOI OpenURL
Bajpai, Swapnam; Krishan, Vaibhav; Kush, Deepanshu; Limaye, Nutan; Srinivasan, Srikanth A #SAT algorithm for small constant-depth circuits with PTF gates. (English) Zbl 07495637 Algorithmica 84, No. 4, 1132-1162 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{S. Bajpai} et al., Algorithmica 84, No. 4, 1132--1162 (2022; Zbl 07495637) Full Text: DOI OpenURL
Halldórsson, Magnús M.; Ishii, Toshimasa; Makino, Kazuhisa; Takazawa, Kenjiro Posimodular function optimization. (English) Zbl 07495636 Algorithmica 84, No. 4, 1107-1131 (2022). MSC: 68W40 68Q25 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M. M. Halldórsson} et al., Algorithmica 84, No. 4, 1107--1131 (2022; Zbl 07495636) Full Text: DOI OpenURL
Gawrychowski, Paweł; Manea, Florin; Serafin, Radosław Fast and longest rollercoasters. (English) Zbl 07495635 Algorithmica 84, No. 4, 1081-1106 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{P. Gawrychowski} et al., Algorithmica 84, No. 4, 1081--1106 (2022; Zbl 07495635) Full Text: DOI OpenURL
Klemz, Boris; Rote, Günter Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs. (English) Zbl 07495634 Algorithmica 84, No. 4, 1064-1080 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{B. Klemz} and \textit{G. Rote}, Algorithmica 84, No. 4, 1064--1080 (2022; Zbl 07495634) Full Text: DOI OpenURL
Bensmail, Julien; Fioravantes, Foivos; Nisse, Nicolas On proper labellings of graphs with minimum label sum. (English) Zbl 07495633 Algorithmica 84, No. 4, 1030-1063 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Bensmail} et al., Algorithmica 84, No. 4, 1030--1063 (2022; Zbl 07495633) Full Text: DOI OpenURL
Alistarh, Dan; Nadiradze, Giorgi; Sabour, Amirmojtaba Dynamic averaging load balancing on cycles. (English) Zbl 07495632 Algorithmica 84, No. 4, 1007-1029 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Alistarh} et al., Algorithmica 84, No. 4, 1007--1029 (2022; Zbl 07495632) Full Text: DOI OpenURL
Li, Wenjun; Xu, Chao; Yang, Yongjie; Chen, Jianer; Wang, Jianxin A refined branching algorithm for the maximum satisfiability problem. (English) Zbl 07495631 Algorithmica 84, No. 4, 982-1006 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{W. Li} et al., Algorithmica 84, No. 4, 982--1006 (2022; Zbl 07495631) Full Text: DOI OpenURL
Agrawal, Akanksha; Kolay, Sudeshna; Zehavi, Meirav Parameter analysis for guarding terrains. (English) Zbl 07495630 Algorithmica 84, No. 4, 961-981 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Agrawal} et al., Algorithmica 84, No. 4, 961--981 (2022; Zbl 07495630) Full Text: DOI OpenURL
van Iersel, Leo; Janssen, Remie; Jones, Mark; Murakami, Yukihiro; Zeh, Norbert A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees. (English) Zbl 07495629 Algorithmica 84, No. 4, 917-960 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{L. van Iersel} et al., Algorithmica 84, No. 4, 917--960 (2022; Zbl 07495629) Full Text: DOI OpenURL
Gawrychowski, Paweł; Starikovskaya, Tatiana Streaming dictionary matching with mismatches. (English) Zbl 07495628 Algorithmica 84, No. 4, 896-916 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{P. Gawrychowski} and \textit{T. Starikovskaya}, Algorithmica 84, No. 4, 896--916 (2022; Zbl 07495628) Full Text: DOI OpenURL
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI OpenURL
Börm, Steffen; Christophersen, Sven; Kriemann, Ronald Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic. (English) Zbl 07495529 SIAM J. Sci. Comput. 44, No. 2, C77-C98 (2022). MSC: 65Y05 65Y20 68W10 68W40 65-XX 68-XX PDF BibTeX XML Cite \textit{S. Börm} et al., SIAM J. Sci. Comput. 44, No. 2, C77--C98 (2022; Zbl 07495529) Full Text: DOI OpenURL
Chen, Hangdi; Lu, Changhong Roman \(\{2\}\)-domination problem in graphs. (English) Zbl 07495528 Discuss. Math., Graph Theory 42, No. 2, 641-660 (2022). MSC: 05C69 05C85 PDF BibTeX XML Cite \textit{H. Chen} and \textit{C. Lu}, Discuss. Math., Graph Theory 42, No. 2, 641--660 (2022; Zbl 07495528) Full Text: DOI OpenURL
Mezzini, Mauro An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs. (English) Zbl 07495524 Discuss. Math., Graph Theory 42, No. 2, 591-599 (2022). MSC: 05C85 05C10 05C12 PDF BibTeX XML Cite \textit{M. Mezzini}, Discuss. Math., Graph Theory 42, No. 2, 591--599 (2022; Zbl 07495524) Full Text: DOI OpenURL
Kontogiannis, Spyros; Wagner, Dorothea; Zaroliagis, Christos An axiomatic approach to time-dependent shortest path oracles. (English) Zbl 07495497 Algorithmica 84, No. 3, 815-870 (2022). MSC: 05C12 05C85 05C38 68Q25 68R10 PDF BibTeX XML Cite \textit{S. Kontogiannis} et al., Algorithmica 84, No. 3, 815--870 (2022; Zbl 07495497) Full Text: DOI OpenURL
Gibney, Daniel; Thankachan, Sharma V. On the complexity of recognizing Wheeler graphs. (English) Zbl 07495496 Algorithmica 84, No. 3, 784-814 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Gibney} and \textit{S. V. Thankachan}, Algorithmica 84, No. 3, 784--814 (2022; Zbl 07495496) Full Text: DOI OpenURL
Conte, Alessio; Grossi, Roberto; Punzi, Giulia; Uno, Takeaki Enumeration of maximal common subsequences between two strings. (English) Zbl 07495495 Algorithmica 84, No. 3, 757-783 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Conte} et al., Algorithmica 84, No. 3, 757--783 (2022; Zbl 07495495) Full Text: DOI OpenURL
Merkurev, Oleg; Shur, Arseny M. Computing the maximum exponent in a stream. (English) Zbl 07495494 Algorithmica 84, No. 3, 742-756 (2022). MSC: 68W32 68W27 68R15 68Wxx 05Cxx PDF BibTeX XML Cite \textit{O. Merkurev} and \textit{A. M. Shur}, Algorithmica 84, No. 3, 742--756 (2022; Zbl 07495494) Full Text: DOI OpenURL
Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I. Safety in \(s\)-\(t\) paths, trails and walks. (English) Zbl 07495493 Algorithmica 84, No. 3, 719-741 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M. Cairo} et al., Algorithmica 84, No. 3, 719--741 (2022; Zbl 07495493) Full Text: DOI OpenURL
Arroyuelo, Diego; Raman, Rajeev Adaptive succinctness. (English) Zbl 07495492 Algorithmica 84, No. 3, 694-718 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Arroyuelo} and \textit{R. Raman}, Algorithmica 84, No. 3, 694--718 (2022; Zbl 07495492) Full Text: DOI OpenURL
Mieno, Takuya; Fujishige, Yuta; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki Computing minimal unique substrings for a sliding window. (English) Zbl 07495491 Algorithmica 84, No. 3, 670-693 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{T. Mieno} et al., Algorithmica 84, No. 3, 670--693 (2022; Zbl 07495491) Full Text: DOI OpenURL
Egidi, Lavinia; Louza, Felipe A.; Manzini, Giovanni Space efficient merging of de Bruijn graphs and Wheeler graphs. (English) Zbl 07495490 Algorithmica 84, No. 3, 639-669 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{L. Egidi} et al., Algorithmica 84, No. 3, 639--669 (2022; Zbl 07495490) Full Text: DOI OpenURL
Levy, Avivit; Shalom, B. Riva A comparative study of dictionary matching with gaps: limitations, techniques and challenges. (English) Zbl 07495489 Algorithmica 84, No. 3, 590-638 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Levy} and \textit{B. R. Shalom}, Algorithmica 84, No. 3, 590--638 (2022; Zbl 07495489) Full Text: DOI OpenURL
Kędzierski, Aleksander; Radoszewski, Jakub \(k\)-approximate quasiperiodicity under Hamming and edit distance. (English) Zbl 07495488 Algorithmica 84, No. 3, 566-589 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Kędzierski} and \textit{J. Radoszewski}, Algorithmica 84, No. 3, 566--589 (2022; Zbl 07495488) Full Text: DOI OpenURL
Conforti, Michele; Fiorini, Samuel; Huynh, Tony; Weltge, Stefan Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. (English) Zbl 07495431 Math. Program. 192, No. 1-2 (B), 547-566 (2022). MSC: 90C27 90C10 05C21 05C85 PDF BibTeX XML Cite \textit{M. Conforti} et al., Math. Program. 192, No. 1--2 (B), 547--566 (2022; Zbl 07495431) Full Text: DOI OpenURL
Adjiashvili, David; Hommelsheim, Felix; Mühlenthaler, Moritz Flexible graph connectivity. (English) Zbl 07495426 Math. Program. 192, No. 1-2 (B), 409-441 (2022). MSC: 68W25 90C27 05C40 PDF BibTeX XML Cite \textit{D. Adjiashvili} et al., Math. Program. 192, No. 1--2 (B), 409--441 (2022; Zbl 07495426) Full Text: DOI OpenURL
Hartmann, Tim A.; Lendl, Stefan; Woeginger, Gerhard J. Continuous facility location on graphs. (English) Zbl 07495418 Math. Program. 192, No. 1-2 (B), 207-227 (2022). MSC: 90C27 68Q25 05C85 PDF BibTeX XML Cite \textit{T. A. Hartmann} et al., Math. Program. 192, No. 1--2 (B), 207--227 (2022; Zbl 07495418) Full Text: DOI OpenURL
Chen, Hangdi; Lu, Changhong; Ye, Qingjie Generalized power domination in claw-free regular graphs. (English) Zbl 07493909 Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022). MSC: 05C69 90C35 05C85 68R10 05C35 05C90 PDF BibTeX XML Cite \textit{H. Chen} et al., Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022; Zbl 07493909) Full Text: DOI arXiv OpenURL