Kobayashi, Kenya; Lin, Guohui; Miyano, Eiji; Saitoh, Toshiki; Suzuki, Akira; Utashima, Tadatoshi; Yagita, Tsuyoshi Path cover problems with length cost. (English) Zbl 07767693 Algorithmica 85, No. 11, 3348-3375 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{K. Kobayashi} et al., Algorithmica 85, No. 11, 3348--3375 (2023; Zbl 07767693) Full Text: DOI
Beisegel, Jesse; Köhler, Ekkehard; Scheffler, Robert; Strehler, Martin Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs. (English) Zbl 07729250 Algorithmica 85, No. 8, 2454-2481 (2023). MSC: 68Wxx 05Cxx 05C85 05C45 68R10 PDFBibTeX XMLCite \textit{J. Beisegel} et al., Algorithmica 85, No. 8, 2454--2481 (2023; Zbl 07729250) Full Text: DOI
Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna Social distancing network creation. (English) Zbl 07704070 Algorithmica 85, No. 7, 2087-2130 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Friedrich} et al., Algorithmica 85, No. 7, 2087--2130 (2023; Zbl 07704070) Full Text: DOI arXiv
Francis, Mathew C.; Hell, Pavol; Jacob, Dalu On the kernel and related problems in interval digraphs. (English) Zbl 07691812 Algorithmica 85, No. 6, 1522-1559 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. C. Francis} et al., Algorithmica 85, No. 6, 1522--1559 (2023; Zbl 07691812) Full Text: DOI arXiv
Dumas, Maël; Perez, Anthony; Todinca, Ioan A cubic vertex-kernel for Trivially Perfect Editing. (English) Zbl 07673396 Algorithmica 85, No. 4, 1091-1110 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. Dumas} et al., Algorithmica 85, No. 4, 1091--1110 (2023; Zbl 07673396) Full Text: DOI arXiv
Rojas Anríquez, Alberto; Stein, Maya 3-colouring \(P_t\)-free graphs without short odd cycles. (English) Zbl 07673386 Algorithmica 85, No. 4, 831-853 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{A. Rojas Anríquez} and \textit{M. Stein}, Algorithmica 85, No. 4, 831--853 (2023; Zbl 07673386) Full Text: DOI arXiv
Jelínek, Vít; Klimošová, Tereza; Masařík, Tomáš; Novotná, Jana; Pokorná, Aneta On 3-coloring of \((2P_4,C_5)\)-free graphs. (English) Zbl 07535644 Algorithmica 84, No. 6, 1526-1547 (2022). MSC: 68Wxx 05Cxx 05C75 PDFBibTeX XMLCite \textit{V. Jelínek} et al., Algorithmica 84, No. 6, 1526--1547 (2022; Zbl 07535644) Full Text: DOI
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 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Algorithmica 84, No. 5, 1183--1212 (2022; Zbl 07517132) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{Y. Kobayashi} et al., Algorithmica 84, No. 4, 1163--1181 (2022; Zbl 07495638) Full Text: DOI
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 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI
Matl, Gregor; Živný, Stanislav Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs. (English) Zbl 1494.68202 Algorithmica 82, No. 12, 3492-3520 (2020). MSC: 68R10 68R07 PDFBibTeX XMLCite \textit{G. Matl} and \textit{S. Živný}, Algorithmica 82, No. 12, 3492--3520 (2020; Zbl 1494.68202) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1433.68164 Algorithmica 82, No. 6, 1616-1639 (2020). MSC: 68Q25 05C20 05C38 05C70 05C85 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 82, No. 6, 1616--1639 (2020; Zbl 1433.68164) Full Text: DOI arXiv
Habib, Michel; Mouatadid, Lalla Maximum induced matching algorithms via vertex ordering characterizations. (English) Zbl 1433.68296 Algorithmica 82, No. 2, 260-278 (2020). MSC: 68R10 05C70 05C76 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{M. Habib} and \textit{L. Mouatadid}, Algorithmica 82, No. 2, 260--278 (2020; Zbl 1433.68296) Full Text: DOI arXiv
Jansen, Bart M. P.; Pieterse, Astrid Optimal data reduction for graph coloring using low-degree polynomials. (English) Zbl 1430.68128 Algorithmica 81, No. 10, 3865-3889 (2019). MSC: 68Q27 05C15 05C85 PDFBibTeX XMLCite \textit{B. M. P. Jansen} and \textit{A. Pieterse}, Algorithmica 81, No. 10, 3865--3889 (2019; Zbl 1430.68128) Full Text: DOI arXiv
Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques. (English) Zbl 1418.05120 Algorithmica 81, No. 3, 986-1005 (2019). MSC: 05C85 05C35 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Liedloff} et al., Algorithmica 81, No. 3, 986--1005 (2019; Zbl 1418.05120) Full Text: DOI
Chudnovsky, Maria; de Figueiredo, Celina M. H.; Spirkl, Sophie The sandwich problem for decompositions and almost monotone properties. (English) Zbl 1397.05186 Algorithmica 80, No. 12, 3618-3645 (2018). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Algorithmica 80, No. 12, 3618--3645 (2018; Zbl 1397.05186) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Mecchia, Marco; Rescigno, Adele A.; Vaccaro, Ugo Discovering small target sets in social networks: a fast and effective algorithm. (English) Zbl 1390.05224 Algorithmica 80, No. 6, 1804-1833 (2018). MSC: 05C85 05C82 68W40 90C59 91D30 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Algorithmica 80, No. 6, 1804--1833 (2018; Zbl 1390.05224) Full Text: DOI arXiv
Chitnis, Rajesh; Egri, László; Marx, Dániel List H-coloring a graph by removing few vertices. (English) Zbl 1361.05085 Algorithmica 78, No. 1, 110-146 (2017). MSC: 05C60 05C15 05D15 68Q25 PDFBibTeX XMLCite \textit{R. Chitnis} et al., Algorithmica 78, No. 1, 110--146 (2017; Zbl 1361.05085) Full Text: DOI arXiv
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Rutter, Ignaz; Saitoh, Toshiki; Saumell, Maria; Vyskočil, Tomáš Extending partial representations of proper and unit interval graphs. (English) Zbl 1360.05167 Algorithmica 77, No. 4, 1071-1104 (2017). MSC: 05C85 05C62 68Q17 PDFBibTeX XMLCite \textit{P. Klavík} et al., Algorithmica 77, No. 4, 1071--1104 (2017; Zbl 1360.05167) Full Text: DOI arXiv
Soulignac, Francisco J. Fully dynamic recognition of proper circular-arc graphs. (English) Zbl 1323.05125 Algorithmica 71, No. 4, 904-968 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C62 05C40 68Q25 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Algorithmica 71, No. 4, 904--968 (2015; Zbl 1323.05125) Full Text: DOI arXiv Link
Chang, Maw-Shang; Ko, Ming-Tat; Lu, Hsueh-I Linear-time algorithms for tree root problems. (English) Zbl 1312.05131 Algorithmica 71, No. 2, 471-495 (2015). MSC: 05C85 05C05 05C12 05C35 05C69 68Q25 PDFBibTeX XMLCite \textit{M.-S. Chang} et al., Algorithmica 71, No. 2, 471--495 (2015; Zbl 1312.05131) Full Text: DOI
Feldmann, Andreas Emil; Foschini, Luca Balanced partitions of trees and applications. (English) Zbl 1315.68201 Algorithmica 71, No. 2, 354-376 (2015). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. E. Feldmann} and \textit{L. Foschini}, Algorithmica 71, No. 2, 354--376 (2015; Zbl 1315.68201) Full Text: DOI Link
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan Parameterized complexity of induced graph matching on claw-free graphs. (English) Zbl 1306.05163 Algorithmica 70, No. 3, 513-560 (2014). MSC: 05C60 05C70 05C69 68Q25 68P05 PDFBibTeX XMLCite \textit{D. Hermelin} et al., Algorithmica 70, No. 3, 513--560 (2014; Zbl 1306.05163) Full Text: DOI
Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien Computing \(H\)-joins with application to 2-modular decomposition. (English) Zbl 1306.05235 Algorithmica 70, No. 2, 245-266 (2014). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Habib} et al., Algorithmica 70, No. 2, 245--266 (2014; Zbl 1306.05235) Full Text: DOI
Vikas, Narayan Algorithms for partition of some class of graphs under compaction and vertex-compaction. (English) Zbl 1275.05057 Algorithmica 67, No. 2, 180-206 (2013). MSC: 05C85 05C70 68Q17 PDFBibTeX XMLCite \textit{N. Vikas}, Algorithmica 67, No. 2, 180--206 (2013; Zbl 1275.05057) Full Text: DOI
van ’t Hof, Pim; Villanger, Yngve Proper interval vertex deletion. (English) Zbl 1262.68052 Algorithmica 65, No. 4, 845-867 (2013). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{P. van 't Hof} and \textit{Y. Villanger}, Algorithmica 65, No. 4, 845--867 (2013; Zbl 1262.68052) Full Text: DOI
Cai, Jin-Yi; Huang, Sangxia; Lu, Pinyan From Holant to #CSP and back: dichotomy for Holant\(^{c}\) problems. (English) Zbl 1255.68079 Algorithmica 64, No. 3, 511-533 (2012). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Algorithmica 64, No. 3, 511--533 (2012; Zbl 1255.68079) Full Text: DOI
Fiala, Jiří; Kamiński, Marcin; Lidický, Bernard; Paulusma, Daniël The \(k\)-in-a-path problem for claw-free graphs. (English) Zbl 1236.68088 Algorithmica 62, No. 1-2, 499-519 (2012). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{J. Fiala} et al., Algorithmica 62, No. 1--2, 499--519 (2012; Zbl 1236.68088) Full Text: DOI
Joeris, Benson L.; Lin, Min Chih; McConnell, Ross M.; Spinrad, Jeremy P.; Szwarcfiter, Jayme L. Linear-time recognition of Helly circular-arc models and graphs. (English) Zbl 1209.68376 Algorithmica 59, No. 2, 215-239 (2011). MSC: 68R10 PDFBibTeX XMLCite \textit{B. L. Joeris} et al., Algorithmica 59, No. 2, 215--239 (2011; Zbl 1209.68376) Full Text: DOI
Havet, Frédéric; Klazar, Martin; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu Exact algorithms for \(L(2,1)\)-labeling of graphs. (English) Zbl 1213.68455 Algorithmica 59, No. 2, 169-194 (2011). MSC: 68R10 05C78 PDFBibTeX XMLCite \textit{F. Havet} et al., Algorithmica 59, No. 2, 169--194 (2011; Zbl 1213.68455) Full Text: DOI
Ibarra, Louis A fully dynamic graph algorithm for recognizing interval graphs. (English) Zbl 1200.05227 Algorithmica 58, No. 3, 637-678 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{L. Ibarra}, Algorithmica 58, No. 3, 637--678 (2010; Zbl 1200.05227) Full Text: DOI
Caragiannis, I.; Ferreira, A.; Kaklamanis, C.; Pérennes, S.; Rivano, H. Fractional path coloring in bounded degree trees with applications. (English) Zbl 1297.05079 Algorithmica 58, No. 2, 516-540 (2010). MSC: 05C15 05C38 68W25 90C05 PDFBibTeX XMLCite \textit{I. Caragiannis} et al., Algorithmica 58, No. 2, 516--540 (2010; Zbl 1297.05079) Full Text: DOI HAL
Crespelle, Christophe; Paul, Christophe Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. (English) Zbl 1205.68258 Algorithmica 58, No. 2, 405-432 (2010). MSC: 68R10 05C85 68P05 PDFBibTeX XMLCite \textit{C. Crespelle} and \textit{C. Paul}, Algorithmica 58, No. 2, 405--432 (2010; Zbl 1205.68258) Full Text: DOI Link
Bang-Jensen, J.; El Haddad, M.; Manoussakis, Y.; Przytycka, T. M. Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs. (English) Zbl 0864.68049 Algorithmica 17, No. 1, 67-87 (1997). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 17, No. 1, 67--87 (1997; Zbl 0864.68049) Full Text: DOI
Hagerup, T.; Kutyłowski, M. Fast integer merging on the EREW PRAM. (English) Zbl 0864.68047 Algorithmica 17, No. 1, 55-66 (1997). MSC: 68W15 PDFBibTeX XMLCite \textit{T. Hagerup} and \textit{M. Kutyłowski}, Algorithmica 17, No. 1, 55--66 (1997; Zbl 0864.68047) Full Text: DOI
Masuyama, Shigeru; Ibaraki, Toshihide Chain packing in graphs. (English) Zbl 0731.68088 Algorithmica 6, No. 6, 826-839 (1991). MSC: 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{S. Masuyama} and \textit{T. Ibaraki}, Algorithmica 6, No. 6, 826--839 (1991; Zbl 0731.68088) Full Text: DOI
Monma, Clyde; Paterson, Michael; Suri, Subhash; Yao, Frances Computing Euclidean maximum spanning trees. (English) Zbl 0696.68066 Algorithmica 5, No. 3, 407-419 (1990). MSC: 68Q25 68R10 05C05 PDFBibTeX XMLCite \textit{C. Monma} et al., Algorithmica 5, No. 3, 407--419 (1990; Zbl 0696.68066) Full Text: DOI
Richards, Dana Fast heuristic algorithms for rectilinear Steiner trees. (English) Zbl 0668.68075 Algorithmica 4, No. 2, 191-207 (1989). Reviewer: C.J.Colbourn MSC: 68R10 PDFBibTeX XMLCite \textit{D. Richards}, Algorithmica 4, No. 2, 191--207 (1989; Zbl 0668.68075) Full Text: DOI