Baste, Julien; Watel, Dimitri An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. (English) Zbl 07807473 Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Baste} and \textit{D. Watel}, Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024; Zbl 07807473) Full Text: DOI
Priyamvada; Panda, B. S. Complexity and algorithms for injective edge coloring of graphs. (English) Zbl 07715626 Theor. Comput. Sci. 968, Article ID 114010, 10 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{Priyamvada} and \textit{B. S. Panda}, Theor. Comput. Sci. 968, Article ID 114010, 10 p. (2023; Zbl 07715626) Full Text: DOI
Xiao, Mingyu; Kou, Shaowei A \(5k\)-vertex kernel for 3-path vertex cover. (English) Zbl 07685357 Theor. Comput. Sci. 959, Article ID 113872, 20 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Xiao} and \textit{S. Kou}, Theor. Comput. Sci. 959, Article ID 113872, 20 p. (2023; Zbl 07685357) Full Text: DOI
Munaro, Andrea; Yang, Shizhou On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs. (English) Zbl 07673671 Theor. Comput. Sci. 955, Article ID 113825, 20 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Munaro} and \textit{S. Yang}, Theor. Comput. Sci. 955, Article ID 113825, 20 p. (2023; Zbl 07673671) Full Text: DOI arXiv
Tsin, Yung H. A simple certifying algorithm for 3-edge-connectivity. (English) Zbl 1509.05169 Theor. Comput. Sci. 951, Article ID 113760, 26 p. (2023). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{Y. H. Tsin}, Theor. Comput. Sci. 951, Article ID 113760, 26 p. (2023; Zbl 1509.05169) Full Text: DOI arXiv
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity. (English) Zbl 07585795 Theor. Comput. Sci. 932, 56-68 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Theor. Comput. Sci. 932, 56--68 (2022; Zbl 07585795) Full Text: DOI
Bensmail, Julien; Dross, François; Oijid, Nacim; Sopena, Éric Generalising the achromatic number to Zaslavsky’s colourings of signed graphs. (English) Zbl 07540239 Theor. Comput. Sci. 923, 196-221 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bensmail} et al., Theor. Comput. Sci. 923, 196--221 (2022; Zbl 07540239) Full Text: DOI arXiv
Li, Wenjun; Ye, Junjie; Cao, Yixin A \(5k\)-vertex kernel for \(P_2\)-packing. (English) Zbl 07496373 Theor. Comput. Sci. 910, 1-13 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Li} et al., Theor. Comput. Sci. 910, 1--13 (2022; Zbl 07496373) Full Text: DOI
Dourado, Mitre C.; Penso, Lucia D.; Rautenbach, Dieter The hull number in the convexity of induced paths of order \(3\). (English) Zbl 07477132 Theor. Comput. Sci. 906, 52-63 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Theor. Comput. Sci. 906, 52--63 (2022; Zbl 07477132) Full Text: DOI
Soulignac, Francisco J. A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. (English) Zbl 1517.05170 Theor. Comput. Sci. 889, 105-134 (2021). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Theor. Comput. Sci. 889, 105--134 (2021; Zbl 1517.05170) Full Text: DOI arXiv
Groot Koerkamp, Ragnar; Živný, Stanislav On rainbow-free colourings of uniform hypergraphs. (English) Zbl 1517.05127 Theor. Comput. Sci. 885, 69-76 (2021). MSC: 05C65 05C15 05C80 PDFBibTeX XMLCite \textit{R. Groot Koerkamp} and \textit{S. Živný}, Theor. Comput. Sci. 885, 69--76 (2021; Zbl 1517.05127) Full Text: DOI arXiv
Shi, Qihao; Wang, Can; Ye, Deshi; Chen, Jiawei; Zhou, Sheng; Feng, Yan; Chen, Chun; Huang, Yanhao Profit maximization for competitive social advertising. (English) Zbl 1500.91104 Theor. Comput. Sci. 868, 12-29 (2021). MSC: 91D30 90B60 PDFBibTeX XMLCite \textit{Q. Shi} et al., Theor. Comput. Sci. 868, 12--29 (2021; Zbl 1500.91104) Full Text: DOI
Cameron, Kathie; Goedgebeur, Jan; Huang, Shenwei; Shi, Yongtang \(k\)-critical graphs in \(P_5\)-free graphs. (English) Zbl 1502.05057 Theor. Comput. Sci. 864, 80-91 (2021). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{K. Cameron} et al., Theor. Comput. Sci. 864, 80--91 (2021; Zbl 1502.05057) Full Text: DOI arXiv
Yamada, Takeshi; Uehara, Ryuhei Shortest reconfiguration of sliding tokens on subclasses of interval graphs. (English) Zbl 1497.68399 Theor. Comput. Sci. 863, 53-68 (2021). MSC: 68R10 05C62 05C69 68W40 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{R. Uehara}, Theor. Comput. Sci. 863, 53--68 (2021; Zbl 1497.68399) Full Text: DOI
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 PDFBibTeX XMLCite \textit{P. Klavík} et al., Theor. Comput. Sci. 860, 51--71 (2021; Zbl 1497.68385) Full Text: DOI arXiv
Wang, Yijing; Xu, Dachuan; Du, Donglei; Ma, Ran Bicriteria algorithms to balance coverage and cost in team formation under online model. (English) Zbl 1477.68545 Theor. Comput. Sci. 854, 68-76 (2021). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{Y. Wang} et al., Theor. Comput. Sci. 854, 68--76 (2021; Zbl 1477.68545) Full Text: DOI
Bonomo-Braberman, Flavia; Chudnovsky, Maria; Goedgebeur, Jan; Maceli, Peter; Schaudt, Oliver; Stein, Maya; Zhong, Mingxian Better 3-coloring algorithms: excluding a triangle and a seven vertex path. (English) Zbl 1468.05283 Theor. Comput. Sci. 850, 98-115 (2021). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Theor. Comput. Sci. 850, 98--115 (2021; Zbl 1468.05283) Full Text: DOI arXiv
Bujtás, Csilla; Jendroľ, Stanislav; Tuza, Zsolt On caterpillar factors in graphs. (English) Zbl 1464.68276 Theor. Comput. Sci. 846, 82-90 (2020). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{C. Bujtás} et al., Theor. Comput. Sci. 846, 82--90 (2020; Zbl 1464.68276) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Peters, Joseph G.; Rescigno, Adele A.; Vaccaro, Ugo Fast and frugal targeting with incentives. (English) Zbl 1445.91041 Theor. Comput. Sci. 812, 62-79 (2020). Reviewer: Pablo Suárez-Serrato (Ciudad de México) MSC: 91D30 68W25 05C90 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Theor. Comput. Sci. 812, 62--79 (2020; Zbl 1445.91041) Full Text: DOI
Narayanan, Lata; Wu, Kangkang How to choose friends strategically. (English) Zbl 1444.91177 Theor. Comput. Sci. 811, 99-111 (2020). MSC: 91D30 68Q25 PDFBibTeX XMLCite \textit{L. Narayanan} and \textit{K. Wu}, Theor. Comput. Sci. 811, 99--111 (2020; Zbl 1444.91177) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Lafond, Manuel; Narayanan, Lata; Rescigno, Adele A.; Vaccaro, Ugo; Wu, Kangkang Whom to befriend to influence people. (English) Zbl 1444.91174 Theor. Comput. Sci. 810, 26-42 (2020). MSC: 91D30 68Q17 68W40 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Theor. Comput. Sci. 810, 26--42 (2020; Zbl 1444.91174) Full Text: DOI arXiv
Abramsky, Samson Whither semantics? (English) Zbl 1506.03078 Theor. Comput. Sci. 807, 3-14 (2020). MSC: 03C13 18C50 PDFBibTeX XMLCite \textit{S. Abramsky}, Theor. Comput. Sci. 807, 3--14 (2020; Zbl 1506.03078) Full Text: DOI arXiv
Anand, Bijo S.; Chandran S. V., Ullas; Changat, Manoj; Dourado, Mitre C.; Hossein Nezhad, Ferdoos; Narasimha-Shenoi, Prasanth G. On the Carathéodory and exchange numbers of geodetic convexity in graphs. (English) Zbl 1442.05040 Theor. Comput. Sci. 804, 46-57 (2020). MSC: 05C10 05C62 68Q17 52A10 PDFBibTeX XMLCite \textit{B. S. Anand} et al., Theor. Comput. Sci. 804, 46--57 (2020; Zbl 1442.05040) Full Text: DOI
De Luca, Felice; Hossain, Md Iqbal; Kobourov, Stephen; Lubiw, Anna; Mondal, Debajyoti Recognition and drawing of stick graphs. (English) Zbl 1435.68230 Theor. Comput. Sci. 796, 22-33 (2019). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{F. De Luca} et al., Theor. Comput. Sci. 796, 22--33 (2019; Zbl 1435.68230) Full Text: DOI arXiv
González Hermosillo de la Maza, Sebastián; Hernández-Cruz, César On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs. (English) Zbl 1431.68094 Theor. Comput. Sci. 795, 9-19 (2019). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{S. González Hermosillo de la Maza} and \textit{C. Hernández-Cruz}, Theor. Comput. Sci. 795, 9--19 (2019; Zbl 1431.68094) Full Text: DOI
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 PDFBibTeX XMLCite \textit{S. Kolay} et al., Theor. Comput. Sci. 772, 132--142 (2019; Zbl 1421.68136) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A. Active influence spreading in social networks. (English) Zbl 1417.68154 Theor. Comput. Sci. 764, 15-29 (2019). MSC: 68R10 05C82 68Q17 68Q25 91D30 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Theor. Comput. Sci. 764, 15--29 (2019; Zbl 1417.68154) Full Text: DOI
Lajou, Dimitri On the achromatic number of signed graphs. (English) Zbl 1405.05063 Theor. Comput. Sci. 759, 50-60 (2019). MSC: 05C15 05C22 68Q17 PDFBibTeX XMLCite \textit{D. Lajou}, Theor. Comput. Sci. 759, 50--60 (2019; Zbl 1405.05063) Full Text: DOI arXiv
Crespelle, Christophe Fully dynamic representations of interval graphs. (English) Zbl 1403.68158 Theor. Comput. Sci. 759, 14-49 (2019). MSC: 68R10 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{C. Crespelle}, Theor. Comput. Sci. 759, 14--49 (2019; Zbl 1403.68158) Full Text: DOI
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. (English) Zbl 1400.68078 Theor. Comput. Sci. 746, 36-48 (2018). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Theor. Comput. Sci. 746, 36--48 (2018; Zbl 1400.68078) Full Text: DOI
Guttmann, Walter An algebraic framework for minimum spanning tree problems. (English) Zbl 1401.68246 Theor. Comput. Sci. 744, 37-55 (2018). MSC: 68R10 05C22 05C85 68T15 PDFBibTeX XMLCite \textit{W. Guttmann}, Theor. Comput. Sci. 744, 37--55 (2018; Zbl 1401.68246) Full Text: DOI
Feng, Qilong; Huang, Neng; Jiang, Xiong; Wang, Jianxin Dealing with several parameterized problems by random methods. (English) Zbl 1393.68131 Theor. Comput. Sci. 734, 94-104 (2018). MSC: 68R10 05C70 05C85 68Q25 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 734, 94--104 (2018; Zbl 1393.68131) Full Text: DOI
Talmon, Nimrod Structured proportional representation. (English) Zbl 1408.91067 Theor. Comput. Sci. 708, 58-74 (2018). MSC: 91B12 05C85 68Q17 PDFBibTeX XMLCite \textit{N. Talmon}, Theor. Comput. Sci. 708, 58--74 (2018; Zbl 1408.91067) Full Text: DOI
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. (English) Zbl 1380.68219 Theor. Comput. Sci. 705, 75-83 (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 705, 75--83 (2018; Zbl 1380.68219) Full Text: DOI arXiv Link
Glaßer, Christian; Jonsson, Peter; Martin, Barnaby Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1380.68221 Theor. Comput. Sci. 703, 18-36 (2017). MSC: 68Q25 03F30 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Theor. Comput. Sci. 703, 18--36 (2017; Zbl 1380.68221) Full Text: DOI Link
Mathieson, Luke Graph editing problems with extended regularity constraints. (English) Zbl 1370.68137 Theor. Comput. Sci. 677, 56-68 (2017). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{L. Mathieson}, Theor. Comput. Sci. 677, 56--68 (2017; Zbl 1370.68137) Full Text: DOI arXiv
Ahadi, Arash; Dehghan, Ali; Mollahajiaghaei, Mohsen Algorithmic complexity of weakly semiregular partitioning and the representation number. (English) Zbl 1369.68224 Theor. Comput. Sci. 674, 60-72 (2017). MSC: 68Q25 05C07 05C70 05C85 PDFBibTeX XMLCite \textit{A. Ahadi} et al., Theor. Comput. Sci. 674, 60--72 (2017; Zbl 1369.68224) Full Text: DOI arXiv
Martin, Barnaby; Pongrácz, András; Wrona, Michał The complexity of counting quantifiers on equality languages. (English) Zbl 1359.68138 Theor. Comput. Sci. 670, 56-67 (2017). MSC: 68Q25 03B70 PDFBibTeX XMLCite \textit{B. Martin} et al., Theor. Comput. Sci. 670, 56--67 (2017; Zbl 1359.68138) Full Text: DOI Link
Xiao, Mingyu; Kou, Shaowei Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. (English) Zbl 1357.05146 Theor. Comput. Sci. 657, Part A, 86-97 (2017). MSC: 05C85 05C70 90C39 68Q25 PDFBibTeX XMLCite \textit{M. Xiao} and \textit{S. Kou}, Theor. Comput. Sci. 657, Part A, 86--97 (2017; Zbl 1357.05146) Full Text: DOI
Dourado, Mitre Costa Computing role assignments of split graphs. (English) Zbl 1339.05384 Theor. Comput. Sci. 635, 74-84 (2016). MSC: 05C85 05C82 68Q17 91D30 PDFBibTeX XMLCite \textit{M. C. Dourado}, Theor. Comput. Sci. 635, 74--84 (2016; Zbl 1339.05384) Full Text: DOI
Hon, Wing-Kai; Kloks, Ton; Liu, Ching-Hao; Liu, Hsiang-Hsuan; Poon, Sheung-Hung; Wang, Yue-Li On maximum independent set of categorical product and ultimate categorical ratios of graphs. (English) Zbl 1326.05106 Theor. Comput. Sci. 588, 81-95 (2015). MSC: 05C69 05C35 05C76 68Q17 PDFBibTeX XMLCite \textit{W.-K. Hon} et al., Theor. Comput. Sci. 588, 81--95 (2015; Zbl 1326.05106) Full Text: DOI
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. (English) Zbl 1430.68122 Theor. Comput. Sci. 590, 86-95 (2015). MSC: 68Q25 05C60 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 590, 86--95 (2015; Zbl 1430.68122) Full Text: DOI arXiv
Cicalese, Ferdinando; Cordasco, Gennaro; Gargano, Luisa; Milanič, Martin; Peters, Joseph; Vaccaro, Ugo Spread of influence in weighted networks under time and budget constraints. (English) Zbl 1327.68175 Theor. Comput. Sci. 586, 40-58 (2015). MSC: 68R10 05C85 68Q17 68Q25 91D30 PDFBibTeX XMLCite \textit{F. Cicalese} et al., Theor. Comput. Sci. 586, 40--58 (2015; Zbl 1327.68175) Full Text: DOI arXiv
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Saitoh, Toshiki Extending partial representations of subclasses of chordal graphs. (English) Zbl 1311.05133 Theor. Comput. Sci. 576, 85-101 (2015). MSC: 05C62 PDFBibTeX XMLCite \textit{P. Klavík} et al., Theor. Comput. Sci. 576, 85--101 (2015; Zbl 1311.05133) Full Text: DOI
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (English) Zbl 1315.68150 Theor. Comput. Sci. 565, 1-15 (2015). MSC: 68Q25 05C40 05C70 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 565, 1--15 (2015; Zbl 1315.68150) Full Text: DOI
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve Induced subgraph isomorphism on proper interval and bipartite permutation graphs. (English) Zbl 1303.68060 Theor. Comput. Sci. 562, 252-269 (2015). MSC: 68Q17 05C60 68Q25 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Theor. Comput. Sci. 562, 252--269 (2015; Zbl 1303.68060) Full Text: DOI
Gavruskin, Alexander; Khoussainov, Bakhadyr; Kokho, Mikhail; Liu, Jiamou Dynamic algorithms for monotonic interval scheduling problem. (English) Zbl 1303.68167 Theor. Comput. Sci. 562, 227-242 (2015). MSC: 68W40 68P05 90B35 PDFBibTeX XMLCite \textit{A. Gavruskin} et al., Theor. Comput. Sci. 562, 227--242 (2015; Zbl 1303.68167) Full Text: DOI arXiv
Baumann, Hervé; Fraigniaud, Pierre; Harutyunyan, Hovhannes A.; de Verclos, Rémi The worst case behavior of randomized gossip protocols. (English) Zbl 1303.68030 Theor. Comput. Sci. 560, Part 2, 108-120 (2014). MSC: 68M12 68Q25 90B18 PDFBibTeX XMLCite \textit{H. Baumann} et al., Theor. Comput. Sci. 560, Part 2, 108--120 (2014; Zbl 1303.68030) Full Text: DOI
Hell, Pavol; Mishra, Aurosish \(H\)-coloring degree-bounded (acyclic) digraphs. (English) Zbl 1382.68112 Theor. Comput. Sci. 554, 40-49 (2014). MSC: 68Q25 05C15 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Mishra}, Theor. Comput. Sci. 554, 40--49 (2014; Zbl 1382.68112) Full Text: DOI
Watrigant, Rémi; Bougeret, Marin; Giroudeau, Rodolphe; König, Jean-Claude On the sum-max graph partitioning problem. (English) Zbl 1418.68108 Theor. Comput. Sci. 540-541, 143-155 (2014). MSC: 68Q25 05C70 68W25 90C27 PDFBibTeX XMLCite \textit{R. Watrigant} et al., Theor. Comput. Sci. 540--541, 143--155 (2014; Zbl 1418.68108) Full Text: DOI
Cicalese, Ferdinando; Cordasco, Gennaro; Gargano, Luisa; Milanič, Martin; Vaccaro, Ugo Latency-bounded target set selection in social networks. (English) Zbl 1358.05272 Theor. Comput. Sci. 535, 1-15 (2014). MSC: 05C85 91D30 68W40 PDFBibTeX XMLCite \textit{F. Cicalese} et al., Theor. Comput. Sci. 535, 1--15 (2014; Zbl 1358.05272) Full Text: DOI arXiv
Le, Van Bang; Nevries, Ragnar Complexity and algorithms for recognizing polar and monopolar graphs. (English) Zbl 1283.05219 Theor. Comput. Sci. 528, 1-11 (2014). MSC: 05C70 05C10 68Q17 PDFBibTeX XMLCite \textit{V. B. Le} and \textit{R. Nevries}, Theor. Comput. Sci. 528, 1--11 (2014; Zbl 1283.05219) Full Text: DOI
Feng, Qilong; Wang, Jianxin; Chen, Jianer Matching and weighted \(P_2\)-packing: algorithms and kernels. (English) Zbl 1279.68101 Theor. Comput. Sci. 522, 85-94 (2014). MSC: 68Q17 05C85 05C70 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 522, 85--94 (2014; Zbl 1279.68101) Full Text: DOI
Krysztowiak, Przemysław An improved approximation ratio for the jump number problem on interval orders. (English) Zbl 1335.68295 Theor. Comput. Sci. 513, 77-84 (2013). MSC: 68W25 05C70 05C85 06A07 68Q17 90C27 PDFBibTeX XMLCite \textit{P. Krysztowiak}, Theor. Comput. Sci. 513, 77--84 (2013; Zbl 1335.68295) Full Text: DOI
Cai, Jin-Yi; Kowalczyk, Michael Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions. (English) Zbl 1300.05246 Theor. Comput. Sci. 494, 63-74 (2013). MSC: 05C70 05C85 05C60 68Q17 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{M. Kowalczyk}, Theor. Comput. Sci. 494, 63--74 (2013; Zbl 1300.05246) Full Text: DOI
Jin, Jing; Xu, Baogang; Zhang, Xiaoyan On the complexity of injective colorings and its generalizations. (English) Zbl 1277.68089 Theor. Comput. Sci. 491, 119-126 (2013). MSC: 68Q17 05C15 PDFBibTeX XMLCite \textit{J. Jin} et al., Theor. Comput. Sci. 491, 119--126 (2013; Zbl 1277.68089) Full Text: DOI
Meister, Daniel; Telle, Jan Arne Chordal digraphs. (English) Zbl 1256.05088 Theor. Comput. Sci. 463, 73-83 (2012). MSC: 05C20 05C57 91A43 91A24 PDFBibTeX XMLCite \textit{D. Meister} and \textit{J. A. Telle}, Theor. Comput. Sci. 463, 73--83 (2012; Zbl 1256.05088) Full Text: DOI
Butterfield, Jane V.; Cranston, Daniel W.; Puleo, Gregory J.; West, Douglas B.; Zamani, Reza Revolutionaries and spies: spy-good and spy-bad graphs. (English) Zbl 1257.05096 Theor. Comput. Sci. 463, 35-53 (2012). MSC: 05C57 05C80 05C65 91A43 PDFBibTeX XMLCite \textit{J. V. Butterfield} et al., Theor. Comput. Sci. 463, 35--53 (2012; Zbl 1257.05096) Full Text: DOI arXiv
Golovach, Petr A.; Paulusma, Daniël; Song, Jian Computing vertex-surjective homomorphisms to partially reflexive trees. (English) Zbl 1251.05031 Theor. Comput. Sci. 457, 86-100 (2012). MSC: 05C05 05C60 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 457, 86--100 (2012; Zbl 1251.05031) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs. (English) Zbl 1251.05173 Theor. Comput. Sci. 452, 117-131 (2012). MSC: 05C99 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Theor. Comput. Sci. 452, 117--131 (2012; Zbl 1251.05173) Full Text: DOI
Bollig, Beate On symbolic OBDD-based algorithms for the minimum spanning tree problem. (English) Zbl 1245.05125 Theor. Comput. Sci. 447, 2-12 (2012). MSC: 05C85 05C05 68R10 68P05 PDFBibTeX XMLCite \textit{B. Bollig}, Theor. Comput. Sci. 447, 2--12 (2012; Zbl 1245.05125) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs. (English) Zbl 1246.05152 Theor. Comput. Sci. 439, 41-57 (2012). MSC: 05C85 05C42 05C62 05C05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Theor. Comput. Sci. 439, 41--57 (2012; Zbl 1246.05152) Full Text: DOI
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Induced packing of odd cycles in planar graphs. (English) Zbl 1232.68064 Theor. Comput. Sci. 420, 28-35 (2012). MSC: 68Q17 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 420, 28--35 (2012; Zbl 1232.68064) Full Text: DOI
Ito, Takehiro; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Parameterizing cut sets in a graph by the number of their components. (English) Zbl 1232.05115 Theor. Comput. Sci. 412, No. 45, 6340-6350 (2011). MSC: 05C40 68Q17 PDFBibTeX XMLCite \textit{T. Ito} et al., Theor. Comput. Sci. 412, No. 45, 6340--6350 (2011; Zbl 1232.05115) Full Text: DOI
Kardoš, František; Katrenič, Ján; Schiermeyer, Ingo On computing the minimum 3-path vertex cover and dissociation number of graphs. (English) Zbl 1227.68034 Theor. Comput. Sci. 412, No. 50, 7009-7017 (2011). MSC: 68Q25 05C38 05C85 68W25 PDFBibTeX XMLCite \textit{F. Kardoš} et al., Theor. Comput. Sci. 412, No. 50, 7009--7017 (2011; Zbl 1227.68034) Full Text: DOI
Hung, Ruo-Wei; Chang, Maw-Shang An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. (English) Zbl 1235.68083 Theor. Comput. Sci. 412, No. 39, 5351-5373 (2011). Reviewer: Jean-Luc Baril (Dijon) MSC: 68Q25 68R10 05C45 PDFBibTeX XMLCite \textit{R.-W. Hung} and \textit{M.-S. Chang}, Theor. Comput. Sci. 412, No. 39, 5351--5373 (2011; Zbl 1235.68083) Full Text: DOI
Monti, A.; Sinaimeri, B. Rainbow graph splitting. (English) Zbl 1225.68137 Theor. Comput. Sci. 412, No. 39, 5315-5324 (2011). MSC: 68R10 68Q25 05C15 05C70 PDFBibTeX XMLCite \textit{A. Monti} and \textit{B. Sinaimeri}, Theor. Comput. Sci. 412, No. 39, 5315--5324 (2011; Zbl 1225.68137) Full Text: DOI
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji A computational proof of complexity of some restricted counting problems. (English) Zbl 1216.68122 Theor. Comput. Sci. 412, No. 23, 2468-2485 (2011). MSC: 68Q25 05C22 68-04 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Theor. Comput. Sci. 412, No. 23, 2468--2485 (2011; Zbl 1216.68122) Full Text: DOI
Bonato, Anthony; Chiniforooshan, Ehsan; Prałat, Paweł Cops and robbers from a distance. (English) Zbl 1200.91042 Theor. Comput. Sci. 411, No. 43, 3834-3844 (2010). MSC: 91A24 91A43 05C80 05C57 68Q25 PDFBibTeX XMLCite \textit{A. Bonato} et al., Theor. Comput. Sci. 411, No. 43, 3834--3844 (2010; Zbl 1200.91042) Full Text: DOI
Izumi, Tomoko; Izumi, Taisuke; Ono, Hirotaka; Wada, Koichi Approximability and inapproximability of the minimum certificate dispersal problem. (English) Zbl 1192.68907 Theor. Comput. Sci. 411, No. 31-33, 2773-2783 (2010). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{T. Izumi} et al., Theor. Comput. Sci. 411, No. 31--33, 2773--2783 (2010; Zbl 1192.68907) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D. A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs. (English) Zbl 1222.05117 Theor. Comput. Sci. 411, No. 7-9, 967-975 (2010). MSC: 05C38 05C85 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Theor. Comput. Sci. 411, No. 7--9, 967--975 (2010; Zbl 1222.05117) Full Text: DOI
Bodirsky, Manuel; Chen, Hubie Peek arc consistency. (English) Zbl 1186.68458 Theor. Comput. Sci. 411, No. 2, 445-453 (2010). MSC: 68T37 PDFBibTeX XMLCite \textit{M. Bodirsky} and \textit{H. Chen}, Theor. Comput. Sci. 411, No. 2, 445--453 (2010; Zbl 1186.68458) Full Text: DOI
Chen, Lei; Lu, Changhong; Zeng, Zhenbing Distance paired-domination problems on subclasses of chordal graphs. (English) Zbl 1191.68463 Theor. Comput. Sci. 410, No. 47-49, 5072-5081 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Chen} et al., Theor. Comput. Sci. 410, No. 47--49, 5072--5081 (2009; Zbl 1191.68463) Full Text: DOI
Salamon, Gábor Approximating the maximum internal spanning tree problem. (English) Zbl 1194.68177 Theor. Comput. Sci. 410, No. 50, 5273-5284 (2009). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{G. Salamon}, Theor. Comput. Sci. 410, No. 50, 5273--5284 (2009; Zbl 1194.68177) Full Text: DOI
Jonsson, Peter; Krokhin, Andrei; Kuivinen, Fredrik Hard constraint satisfaction problems have hard gaps at location 1. (English) Zbl 1176.90498 Theor. Comput. Sci. 410, No. 38-40, 3856-3874 (2009). MSC: 90C27 68W25 68Q17 PDFBibTeX XMLCite \textit{P. Jonsson} et al., Theor. Comput. Sci. 410, No. 38--40, 3856--3874 (2009; Zbl 1176.90498) Full Text: DOI
Wang, Guanghui; Liu, Guizhen Paths, cycles and circular colorings in digraphs. (English) Zbl 1168.05028 Theor. Comput. Sci. 410, No. 21-23, 1982-1985 (2009). MSC: 05C20 05C15 05C38 PDFBibTeX XMLCite \textit{G. Wang} and \textit{G. Liu}, Theor. Comput. Sci. 410, No. 21--23, 1982--1985 (2009; Zbl 1168.05028) Full Text: DOI
Bodirsky, Manuel; Chen, Hubie; Kára, Jan; von Oertzen, Timo Maximal infinite-valued constraint languages. (English) Zbl 1172.68052 Theor. Comput. Sci. 410, No. 18, 1684-1693 (2009). MSC: 68T20 03C35 08A70 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Theor. Comput. Sci. 410, No. 18, 1684--1693 (2009; Zbl 1172.68052) Full Text: DOI
Zhao, Yingchao; Teng, Shang-Hua Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces. (English) Zbl 1167.90019 Theor. Comput. Sci. 410, No. 11, 1081-1092 (2009). MSC: 90C27 68R10 PDFBibTeX XMLCite \textit{Y. Zhao} and \textit{S.-H. Teng}, Theor. Comput. Sci. 410, No. 11, 1081--1092 (2009; Zbl 1167.90019) Full Text: DOI
Li, Xueliang; Zhang, Xiaoyan On the minimum monochromatic or multicolored subgraph partition problems. (English) Zbl 1124.68079 Theor. Comput. Sci. 385, No. 1-3, 1-10 (2007). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{X. Li} and \textit{X. Zhang}, Theor. Comput. Sci. 385, No. 1--3, 1--10 (2007; Zbl 1124.68079) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D. NP-completeness results for some problems on subclasses of bipartite and chordal graphs. (English) Zbl 1188.68208 Theor. Comput. Sci. 381, No. 1-3, 248-259 (2007). MSC: 68R10 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Theor. Comput. Sci. 381, No. 1--3, 248--259 (2007; Zbl 1188.68208) Full Text: DOI
Atserias, Albert Conjunctive query evaluation by search-tree revisited. (English) Zbl 1108.68037 Theor. Comput. Sci. 371, No. 3, 155-168 (2007). MSC: 68P15 PDFBibTeX XMLCite \textit{A. Atserias}, Theor. Comput. Sci. 371, No. 3, 155--168 (2007; Zbl 1108.68037) Full Text: DOI
Tsukiji, Tatsuie; Chen, Zhi-Zhong Computing phylogenetic roots with bounded degrees and errors is NP-complete. (English) Zbl 1153.68383 Theor. Comput. Sci. 363, No. 1, 43-59 (2006). MSC: 68Q17 05C05 05C69 68R10 92D15 PDFBibTeX XMLCite \textit{T. Tsukiji} and \textit{Z.-Z. Chen}, Theor. Comput. Sci. 363, No. 1, 43--59 (2006; Zbl 1153.68383) Full Text: DOI
Krysta, Piotr; Loryś, Krzysztof Efficient approximation algorithms for the achromatic number. (English) Zbl 1102.68140 Theor. Comput. Sci. 361, No. 2-3, 150-171 (2006). MSC: 68W25 05C85 05C15 68Q17 PDFBibTeX XMLCite \textit{P. Krysta} and \textit{K. Loryś}, Theor. Comput. Sci. 361, No. 2--3, 150--171 (2006; Zbl 1102.68140) Full Text: DOI
Prieto, Elena; Sloper, Christian Looking at the stars. (English) Zbl 1087.68076 Theor. Comput. Sci. 351, No. 3, 437-445 (2006). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{E. Prieto} and \textit{C. Sloper}, Theor. Comput. Sci. 351, No. 3, 437--445 (2006; Zbl 1087.68076) Full Text: DOI
Demange, Marc; Ekim, Tınaz; de Werra, Dominique \((p,k)\)-coloring problems in line graphs. (English) Zbl 1086.05029 Theor. Comput. Sci. 349, No. 3, 462-474 (2005). MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{M. Demange} et al., Theor. Comput. Sci. 349, No. 3, 462--474 (2005; Zbl 1086.05029) Full Text: DOI
Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio List matrix partitions of chordal graphs. (English) Zbl 1084.05026 Theor. Comput. Sci. 349, No. 1, 52-66 (2005). MSC: 05C15 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 349, No. 1, 52--66 (2005; Zbl 1084.05026) Full Text: DOI
Bulatov, Andrei A. \(H\)-coloring dichotomy revisited. (English) Zbl 1086.68052 Theor. Comput. Sci. 349, No. 1, 31-39 (2005). MSC: 68Q25 05C15 05C85 68T20 PDFBibTeX XMLCite \textit{A. A. Bulatov}, Theor. Comput. Sci. 349, No. 1, 31--39 (2005; Zbl 1086.68052) Full Text: DOI
Bulatov, Andrei; Grohe, Martin The complexity of partition functions. (English) Zbl 1081.68030 Theor. Comput. Sci. 348, No. 2-3, 148-186 (2005). MSC: 68Q25 05C15 68R10 68T20 PDFBibTeX XMLCite \textit{A. Bulatov} and \textit{M. Grohe}, Theor. Comput. Sci. 348, No. 2--3, 148--186 (2005; Zbl 1081.68030) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. Generating bicliques of a graph in lexicographic order. (English) Zbl 1076.68048 Theor. Comput. Sci. 337, No. 1-3, 240-248 (2005). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Theor. Comput. Sci. 337, No. 1--3, 240--248 (2005; Zbl 1076.68048) Full Text: DOI
Fagin, Ronald; Kolaitis, Phokion G.; Miller, Renée J.; Popa, Lucian Data exchange: semantics and query answering. (English) Zbl 1080.68019 Theor. Comput. Sci. 336, No. 1, 89-124 (2005). MSC: 68P05 03B70 68P15 68Q65 PDFBibTeX XMLCite \textit{R. Fagin} et al., Theor. Comput. Sci. 336, No. 1, 89--124 (2005; Zbl 1080.68019) Full Text: DOI
Yeh, Hong-Gwa; Zhu, Xuding Resource-sharing system scheduling and circular chromatic number. (English) Zbl 1088.68144 Theor. Comput. Sci. 332, No. 1-3, 447-460 (2005). MSC: 68R10 05C15 68M20 90B35 PDFBibTeX XMLCite \textit{H.-G. Yeh} and \textit{X. Zhu}, Theor. Comput. Sci. 332, No. 1--3, 447--460 (2005; Zbl 1088.68144) Full Text: DOI
Flammini, Michele; Navarra, Alfredo; Proskurowski, Andrzej On routing of wavebands for all-to-all communications in all-optical paths and cycles. (English) Zbl 1070.68007 Theor. Comput. Sci. 333, No. 3, 401-413 (2005). MSC: 68M10 PDFBibTeX XMLCite \textit{M. Flammini} et al., Theor. Comput. Sci. 333, No. 3, 401--413 (2005; Zbl 1070.68007) Full Text: DOI
Jonsson, Peter; Krokhin, Andrei Recognizing frozen variables in constraint satisfaction problems. (English) Zbl 1086.68056 Theor. Comput. Sci. 329, No. 1-3, 93-113 (2004). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{P. Jonsson} and \textit{A. Krokhin}, Theor. Comput. Sci. 329, No. 1--3, 93--113 (2004; Zbl 1086.68056) Full Text: DOI
Feder, Tomás; Madelaine, Florent; Stewart, Iain A. Dichotomies for classes of homomorphism problems involving unary functions. (English) Zbl 1070.68133 Theor. Comput. Sci. 314, No. 1-2, 1-43 (2004). MSC: 68T20 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 314, No. 1--2, 1--43 (2004; Zbl 1070.68133) Full Text: DOI Link
Kutz, Martin The complexity of Boolean matrix root computation. (English) Zbl 1071.68031 Theor. Comput. Sci. 325, No. 3, 373-390 (2004). MSC: 68Q25 05C50 05C60 20M99 68Q17 PDFBibTeX XMLCite \textit{M. Kutz}, Theor. Comput. Sci. 325, No. 3, 373--390 (2004; Zbl 1071.68031) Full Text: DOI
Opatrny, Jaroslav Uniform multi-hop all-to-all optical routings in rings. (English) Zbl 1046.68024 Theor. Comput. Sci. 297, No. 1-3, 385-397 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{J. Opatrny}, Theor. Comput. Sci. 297, No. 1--3, 385--397 (2003; Zbl 1046.68024) Full Text: DOI
Corteel, Sylvie; Valencia-Pabon, Mario; Gardy, Danièle; Barth, Dominique; Denise, Alain The permutation-path coloring problem on trees. (English) Zbl 1044.68124 Theor. Comput. Sci. 297, No. 1-3, 119-143 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{S. Corteel} et al., Theor. Comput. Sci. 297, No. 1--3, 119--143 (2003; Zbl 1044.68124) Full Text: DOI
Puricella, Antonio; Stewart, Iain A. Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (English) Zbl 1044.68163 Theor. Comput. Sci. 290, No. 3, 1897-1913 (2003). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{A. Puricella} and \textit{I. A. Stewart}, Theor. Comput. Sci. 290, No. 3, 1897--1913 (2003; Zbl 1044.68163) Full Text: DOI
Nešetřil, Jaroslav; Tardif, Claude Density via duality. (English) Zbl 1058.05062 Theor. Comput. Sci. 287, No. 2, 585-591 (2002). MSC: 05C99 68R10 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{C. Tardif}, Theor. Comput. Sci. 287, No. 2, 585--591 (2002; Zbl 1058.05062) Full Text: DOI
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. Counting \(H-\)colorings of partial \(k-\)trees. (English) Zbl 0996.68132 Theor. Comput. Sci. 281, No. 1-2, 291-309 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Theor. Comput. Sci. 281, No. 1--2, 291--309 (2002; Zbl 0996.68132) Full Text: DOI