Brakensiek, Joshua; Davies, Sami Robust factorizations and colorings of tensor graphs. (English) Zbl 07818430 SIAM J. Discrete Math. 38, No. 1, 883-916 (2024). MSC: 05C70 05C76 05C15 05C85 05C60 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{J. Brakensiek} and \textit{S. Davies}, SIAM J. Discrete Math. 38, No. 1, 883--916 (2024; Zbl 07818430) Full Text: DOI arXiv
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
Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna Geometric network creation games. (English) Zbl 07793140 SIAM J. Discrete Math. 38, No. 1, 277-315 (2024). MSC: 91A43 91A68 91A11 68Q17 PDFBibTeX XMLCite \textit{D. Bilò} et al., SIAM J. Discrete Math. 38, No. 1, 277--315 (2024; Zbl 07793140) Full Text: DOI arXiv
Bonomo-Braberman, Flavia; Brettell, Nick; Munaro, Andrea; Paulusma, Daniël Solving problems on generalized convex graphs via mim-width. (English) Zbl 07783118 J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024; Zbl 07783118) Full Text: DOI
Abuadas, Tala; Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs. (English) Zbl 07781878 Discrete Appl. Math. 344, 179-187 (2024). MSC: 05C15 68Q25 68R10 05C85 PDFBibTeX XMLCite \textit{T. Abuadas} et al., Discrete Appl. Math. 344, 179--187 (2024; Zbl 07781878) Full Text: DOI arXiv
Xi, Wenying; Lin, Wensong; Lin, Yuquan Packing 2- and 3-stars into cubic graphs. (English) Zbl 07748299 Appl. Math. Comput. 460, Article ID 128287, 10 p. (2024). MSC: 05Cxx 68Qxx 68Rxx PDFBibTeX XMLCite \textit{W. Xi} et al., Appl. Math. Comput. 460, Article ID 128287, 10 p. (2024; Zbl 07748299) Full Text: DOI
Barsukov, Alexey; Madelaine, Florent R. On guarded extensions of MMSNP. (English) Zbl 07787582 Della Vedova, Gianluca (ed.) et al., Unity of logic and computation. 19th conference on computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13967, 202-213 (2023). MSC: 03B70 68Qxx PDFBibTeX XMLCite \textit{A. Barsukov} and \textit{F. R. Madelaine}, Lect. Notes Comput. Sci. 13967, 202--213 (2023; Zbl 07787582) Full Text: DOI arXiv
Gargano, Luisa; Rescigno, Adele A. Spanning trees with few branch vertices in graphs of bounded neighborhood diversity. (English) Zbl 07786533 Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 502-519 (2023). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{L. Gargano} and \textit{A. A. Rescigno}, Lect. Notes Comput. Sci. 13892, 502--519 (2023; Zbl 07786533) Full Text: DOI
Chawin, Dror; Haviv, Ishay Improved NP-hardness of approximation for orthogonality dimension and minrank. (English) Zbl 1527.05060 SIAM J. Discrete Math. 37, No. 4, 2670-2688 (2023). MSC: 05C15 05C20 03D15 05C50 68Q25 PDFBibTeX XMLCite \textit{D. Chawin} and \textit{I. Haviv}, SIAM J. Discrete Math. 37, No. 4, 2670--2688 (2023; Zbl 1527.05060) Full Text: DOI arXiv
Cordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A. Groups burning: analyzing spreading processes in community-based networks. (English) Zbl 07770303 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 330-342 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{G. Cordasco} et al., Lect. Notes Comput. Sci. 13973, 330--342 (2023; Zbl 07770303) Full Text: DOI
Kawahara, Jun; Saitoh, Toshiki; Takeda, Hirokazu; Yoshinaka, Ryo; Yoshioka, Yui Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs. (English) Zbl 07770289 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 151-163 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Kawahara} et al., Lect. Notes Comput. Sci. 13973, 151--163 (2023; Zbl 07770289) Full Text: DOI arXiv
Kratochvíl, Jan Graph covers: where topology meets computer science, and simple means difficult. (English) Zbl 07770276 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 3-11 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Kratochvíl}, Lect. Notes Comput. Sci. 13973, 3--11 (2023; Zbl 07770276) Full Text: DOI
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
Mezei, Balázs F.; Wrochna, Marcin; Živný, Stanislav PTAS for sparse general-valued CSPs. (English) Zbl 07753165 ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{B. F. Mezei} et al., ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023; Zbl 07753165) Full Text: DOI arXiv
Sokolov, Georgy Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs. (English) Zbl 1521.05048 Mosc. J. Comb. Number Theory 12, No. 3, 247-258 (2023). MSC: 05C15 68Q17 05D10 PDFBibTeX XMLCite \textit{G. Sokolov}, Mosc. J. Comb. Number Theory 12, No. 3, 247--258 (2023; Zbl 1521.05048) Full Text: DOI
Bodirsky, Manuel; Bulín, Jakub; Starke, Florian; Wernthaler, Michael The smallest hard trees. (English) Zbl 1521.05019 Constraints 28, No. 2, 105-137 (2023). MSC: 05C05 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Constraints 28, No. 2, 105--137 (2023; Zbl 1521.05019) Full Text: DOI arXiv
Yuan, Lili; Meng, Jixiang Ore conditions for antistrong digraphs. (English) Zbl 07736205 Appl. Math. Comput. 457, Article ID 128181, 6 p. (2023). MSC: 05Cxx 05Bxx 68Rxx PDFBibTeX XMLCite \textit{L. Yuan} and \textit{J. Meng}, Appl. Math. Comput. 457, Article ID 128181, 6 p. (2023; Zbl 07736205) 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
Takhanov, Rustem Computing a partition function of a generalized pattern-based energy over a semiring. (English) Zbl 07729117 Theory Comput. Syst. 67, No. 4, 760-784 (2023). MSC: 68Qxx 68Txx 08Axx PDFBibTeX XMLCite \textit{R. Takhanov}, Theory Comput. Syst. 67, No. 4, 760--784 (2023; Zbl 07729117) Full Text: DOI arXiv
Barish, Robert D.; Shibuya, Tetsuo Proper colorability of segment intersection graphs. (English) Zbl 07724778 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 573-584 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{R. D. Barish} and \textit{T. Shibuya}, Lect. Notes Comput. Sci. 13595, 573--584 (2023; Zbl 07724778) Full Text: DOI
Huang, Jing; Ye, Ying Ying Semi-strict chordal digraphs. (English) Zbl 07724752 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 280-291 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{J. Huang} and \textit{Y. Y. Ye}, Lect. Notes Comput. Sci. 13595, 280--291 (2023; Zbl 07724752) Full Text: DOI arXiv
Gasarch, William; Laskowski, Michael; Zhu, Shaopeng \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP’s. (English) Zbl 07722839 Du, Ding-Zhu (ed.) et al., Theory and applications of models of computation. 17th annual conference, TAMC 2022, Tianjin, China, September 16–18, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13571, 155-175 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Gasarch} et al., Lect. Notes Comput. Sci. 13571, 155--175 (2023; Zbl 07722839) 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
Grilliette, Will; Rusnak, Lucas J. Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials. (English) Zbl 1518.05144 J. Algebr. Comb. 58, No. 1, 1-36 (2023). MSC: 05C65 05C76 68R10 18A40 18B25 PDFBibTeX XMLCite \textit{W. Grilliette} and \textit{L. J. Rusnak}, J. Algebr. Comb. 58, No. 1, 1--36 (2023; Zbl 1518.05144) Full Text: DOI arXiv
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
Heo, Cheolwon; Kim, Hyobin; Mark, Siggers The complexity of the matroid homomorphism problem. (English) Zbl 1516.05021 Electron. J. Comb. 30, No. 2, Research Paper P2.28, 17 p. (2023). MSC: 05B35 52B40 68Q25 PDFBibTeX XMLCite \textit{C. Heo} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.28, 17 p. (2023; Zbl 1516.05021) Full Text: DOI
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
de Melo, Alexsander A.; de Figueiredo, Celina M. H.; Souza, Uéverton S. On the computational difficulty of the terminal connection problem. (English) Zbl 1511.68201 RAIRO, Theor. Inform. Appl. 57, Paper No. 3, 20 p. (2023). MSC: 68R10 05C40 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{A. A. de Melo} et al., RAIRO, Theor. Inform. Appl. 57, Paper No. 3, 20 p. (2023; Zbl 1511.68201) Full Text: DOI
Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_k\)-coloring in hereditary classes of graphs. (English) Zbl 07687210 Inf. Comput. 292, Article ID 105015, 19 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Inf. Comput. 292, Article ID 105015, 19 p. (2023; Zbl 07687210) 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
Cai, Jin-Yi; Fan, Austen Z.; Liu, Yin Bipartite 3-regular counting problems with mixed signs. (English) Zbl 07677365 J. Comput. Syst. Sci. 135, 15-31 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., J. Comput. Syst. Sci. 135, 15--31 (2023; Zbl 07677365) Full Text: DOI
Francis, Mathew C.; Jacob, Dalu The lexicographic method for the threshold cover problem. (English) Zbl 1511.05194 Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023). MSC: 05C70 05C85 90C10 68R10 PDFBibTeX XMLCite \textit{M. C. Francis} and \textit{D. Jacob}, Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023; Zbl 1511.05194) 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
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
Krokhin, Andrei; Opršal, Jakub; Wrochna, Marcin; Živný, Stanislav Topology and adjunction in promise constraint satisfaction. (English) Zbl 07672224 SIAM J. Comput. 52, No. 1, 38-79 (2023). MSC: 68Q17 68Q25 68R05 05C15 PDFBibTeX XMLCite \textit{A. Krokhin} et al., SIAM J. Comput. 52, No. 1, 38--79 (2023; Zbl 07672224) Full Text: DOI arXiv
Ciardo, Lorenzo; Živný, Stanislav CLAP: a new algorithm for promise CSPs. (English) Zbl 07672223 SIAM J. Comput. 52, No. 1, 1-37 (2023). MSC: 68Q25 68R01 90C05 PDFBibTeX XMLCite \textit{L. Ciardo} and \textit{S. Živný}, SIAM J. Comput. 52, No. 1, 1--37 (2023; Zbl 07672223) Full Text: DOI arXiv
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 1508.05054 Discrete Appl. Math. 328, 97-107 (2023). MSC: 05C15 68R10 68W10 68M14 68P05 PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Discrete Appl. Math. 328, 97--107 (2023; Zbl 1508.05054) Full Text: DOI
Barkowsky, Matthias; Giese, Holger Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions. (English) Zbl 1512.68064 J. Log. Algebr. Methods Program. 131, Article ID 100841, 25 p. (2023). MSC: 68P05 68Q42 68R10 PDFBibTeX XMLCite \textit{M. Barkowsky} and \textit{H. Giese}, J. Log. Algebr. Methods Program. 131, Article ID 100841, 25 p. (2023; Zbl 1512.68064) Full Text: DOI
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
Alves, Sancrey R.; Couto, Fernanda; Faria, Luerbio; Gravier, Sylvain; Klein, Sulamita; Souza, Uéverton S. Partitions and well-coveredness: the graph sandwich problem. (English) Zbl 1506.05166 Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023). MSC: 05C70 05C69 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023; Zbl 1506.05166) Full Text: DOI
Govorov, Artem; Cai, Jin-Yi; Dyer, Martin A dichotomy for bounded degree graph homomorphisms with nonnegative weights. (English) Zbl 07639675 J. Comput. Syst. Sci. 132, 1-15 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Govorov} et al., J. Comput. Syst. Sci. 132, 1--15 (2023; Zbl 07639675) Full Text: DOI arXiv
Lindeberg, Anna; Hellmuth, Marc Construction of \(k\)-matchings in graph products. (English) Zbl 1502.05214 Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023). MSC: 05C76 05C70 68Q17 90C27 PDFBibTeX XMLCite \textit{A. Lindeberg} and \textit{M. Hellmuth}, Art Discrete Appl. Math. 6, No. 2, Paper No. P2.02, 36 p. (2023; Zbl 1502.05214) Full Text: DOI arXiv
Chin, Francis Y. L.; Ting, Hing-Fung; Tsin, Yung H.; Zhang, Yong A linear-time certifying algorithm for recognizing generalized series-parallel graphs. (English) Zbl 1504.05275 Discrete Appl. Math. 325, 152-171 (2023). MSC: 05C85 68R10 68W10 PDFBibTeX XMLCite \textit{F. Y. L. Chin} et al., Discrete Appl. Math. 325, 152--171 (2023; Zbl 1504.05275) Full Text: DOI
Guzmán-Pro, Santiago; Hell, Pavol; Hernández-Cruz, César Describing hereditary properties by forbidden circular orderings. (English) Zbl 1510.05249 Appl. Math. Comput. 438, Article ID 127555, 14 p. (2023). MSC: 05C75 05C60 68R10 PDFBibTeX XMLCite \textit{S. Guzmán-Pro} et al., Appl. Math. Comput. 438, Article ID 127555, 14 p. (2023; Zbl 1510.05249) Full Text: DOI arXiv
Pliszka, Zbigniew On some similarity of finite sets (and what we can say today about certain old problem). (English) Zbl 07810465 Inf. Sci. 590, 296-321 (2022). MSC: 68-XX 90-XX PDFBibTeX XMLCite \textit{Z. Pliszka}, Inf. Sci. 590, 296--321 (2022; Zbl 07810465) Full Text: DOI
Bhyravarapu, Sriram; Jana, Satyabrata; Panolan, Fahad; Saurabh, Saket; Verma, Shaily List homomorphism: beyond the known boundaries. (English) Zbl 07719369 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 593-609 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{S. Bhyravarapu} et al., Lect. Notes Comput. Sci. 13568, 593--609 (2022; Zbl 07719369) Full Text: DOI
Bok, Jan; Brewster, Richard C.; Hell, Pavol; Jedličková, Nikola; Rafiey, Arash Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13568, 510--526 (2022; Zbl 07719364) Full Text: DOI arXiv
Brewster, Richard C.; Kidner, Arnott; MacGillivray, Gary The 2-colouring problem for \((m,n)\)-mixed graphs with switching is polynomial. (English) Zbl 1515.05063 Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022). Reviewer: Paola Bonacini (Catania) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022; Zbl 1515.05063) Full Text: DOI arXiv
Barros, Bruno José S.; Ochi, Luiz Satoru; Pinheiro, Rian Gabriel S.; Souza, Uéverton S. On conflict-free spanning tree: algorithms and complexity. (English) Zbl 07683165 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, 91-102 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. J. S. Barros} et al., Lect. Notes Comput. Sci. 13179, 91--102 (2022; Zbl 07683165) Full Text: DOI
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphisms to separable signed graphs. (English) Zbl 07683160 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, 22-35 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13179, 22--35 (2022; Zbl 07683160) Full Text: DOI
Fiala, Jiří; Rutter, Ignaz; Stumpf, Peter; Zeman, Peter Extending partial representations of circular-arc graphs. (English) Zbl 07682413 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 230-243 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Fiala} et al., Lect. Notes Comput. Sci. 13453, 230--243 (2022; Zbl 07682413) Full Text: DOI arXiv
Bulteau, Laurent; Dabrowski, Konrad K.; Köhler, Noleen; Ordyniak, Sebastian; Paulusma, Daniël An algorithmic framework for locally constrained homomorphisms. (English) Zbl 07682405 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 114-128 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 13453, 114--128 (2022; Zbl 07682405) Full Text: DOI arXiv
Adams, Henry; Coldren, Sophia; Willmot, Sean The persistent homology of cyclic graphs. (English) Zbl 07633849 Int. J. Comput. Geom. Appl. 32, No. 1-2, 1-37 (2022). MSC: 68U05 PDFBibTeX XMLCite \textit{H. Adams} et al., Int. J. Comput. Geom. Appl. 32, No. 1--2, 1--37 (2022; Zbl 07633849) Full Text: DOI arXiv
Brandts, Alex; Živný, Stanislav Beyond PCSP (1-in-3, NAE). (English) Zbl 07629147 Inf. Comput. 289, Part A, Article ID 104954, 14 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Brandts} and \textit{S. Živný}, Inf. Comput. 289, Part A, Article ID 104954, 14 p. (2022; Zbl 07629147) Full Text: DOI
Millani, Marcelo Garlet; Steiner, Raphael; Wiederrecht, Sebastian Colouring non-even digraphs. (English) Zbl 1503.05044 Electron. J. Comb. 29, No. 4, Research Paper P4.9, 40 p. (2022). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C15 05C20 05C10 05C70 05C72 05C83 05C85 68Q17 PDFBibTeX XMLCite \textit{M. G. Millani} et al., Electron. J. Comb. 29, No. 4, Research Paper P4.9, 40 p. (2022; Zbl 1503.05044) Full Text: DOI arXiv
Wang, Yijing; Xu, Dachuan; Du, Donglei; Jiang, Yanjun Bicriteria streaming algorithms to balance gain and cost with cardinality constraint. (English) Zbl 1502.91031 J. Comb. Optim. 44, No. 4, 2946-2962 (2022). MSC: 91B39 68W27 PDFBibTeX XMLCite \textit{Y. Wang} et al., J. Comb. Optim. 44, No. 4, 2946--2962 (2022; Zbl 1502.91031) Full Text: DOI
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg On the Weisfeiler-Leman dimension of fractional packing. (English) Zbl 07601280 Inf. Comput. 288, Article ID 104803, 17 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Arvind} et al., Inf. Comput. 288, Article ID 104803, 17 p. (2022; Zbl 07601280) Full Text: DOI
Kazda, Alexandr; Mayr, Peter; Zhuk, Dmitriy Small promise CSPs that reduce to large CSPs. (English) Zbl 07596573 Log. Methods Comput. Sci. 18, No. 3, Paper No. 25, 14 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{A. Kazda} et al., Log. Methods Comput. Sci. 18, No. 3, Paper No. 25, 14 p. (2022; Zbl 07596573) Full Text: DOI arXiv
Lonc, Zbigniew; Petryshyn, Nataliya Edge decompositions and rooted packings of graphs. (English) Zbl 1504.05235 Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022). Reviewer: Zan-Bo Zhang (Guangzhou) MSC: 05C70 05C75 68Q25 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{N. Petryshyn}, Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022; Zbl 1504.05235) Full Text: DOI
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
Havet, Frédéric; Mazauric, Dorian; Nguyen, Viet-Ha; Watrigant, Rémi Overlaying a hypergraph with a graph with bounded maximum degree. (English) Zbl 1494.05079 Discrete Appl. Math. 319, 394-406 (2022). MSC: 05C65 68Q25 92B99 PDFBibTeX XMLCite \textit{F. Havet} et al., Discrete Appl. Math. 319, 394--406 (2022; Zbl 1494.05079) Full Text: DOI
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 PDFBibTeX XMLCite \textit{M. A. Shalu} et al., Discrete Appl. Math. 319, 81--91 (2022; Zbl 1494.05093) Full Text: DOI
Grüttemeier, Niels; Komusiewicz, Christian Learning Bayesian networks under sparsity constraints: a parameterized complexity analysis. (English) Zbl 07566011 J. Artif. Intell. Res. (JAIR) 74, 1225-1267 (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{N. Grüttemeier} and \textit{C. Komusiewicz}, J. Artif. Intell. Res. (JAIR) 74, 1225--1267 (2022; Zbl 07566011) Full Text: DOI arXiv
Kobayashi, Kenya; Lin, Guohui; Miyano, Eiji; Saitoh, Toshiki; Suzuki, Akira; Utashima, Tadatoshi; Yagita, Tsuyoshi Path cover problems with length cost. (English) Zbl 07556587 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 396-408 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{K. Kobayashi} et al., Lect. Notes Comput. Sci. 13174, 396--408 (2022; Zbl 07556587) Full Text: DOI
Gerasimova, Olga; Kikot, Stanislav; Kurucz, Agi; Podolskii, Vladimir; Zakharyaschev, Michael A tetrachotomy of ontology-mediated queries with a covering axiom. (English) Zbl 07554486 Artif. Intell. 309, Article ID 103738, 46 p. (2022). MSC: 68T30 PDFBibTeX XMLCite \textit{O. Gerasimova} et al., Artif. Intell. 309, Article ID 103738, 46 p. (2022; Zbl 07554486) Full Text: DOI arXiv
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
Böhm, Martin; Hoeksma, Ruben; Megow, Nicole; Nölke, Lukas; Simon, Bertrand On hop-constrained Steiner trees in tree-like metrics. (English) Zbl 07537556 SIAM J. Discrete Math. 36, No. 2, 1249-1273 (2022). MSC: 68Q25 90C27 05C12 PDFBibTeX XMLCite \textit{M. Böhm} et al., SIAM J. Discrete Math. 36, No. 2, 1249--1273 (2022; Zbl 07537556) 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
Brešar, Boštjan; Dravec, Tanja; Gorzkowska, Aleksandra; Kleszcz, Elżbieta Graphs with a unique maximum independent set up to automorphisms. (English) Zbl 1490.05198 Discrete Appl. Math. 317, 124-135 (2022). MSC: 05C69 05C35 05C05 05C76 05C85 68Q25 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Appl. Math. 317, 124--135 (2022; Zbl 1490.05198) Full Text: DOI
Malyshev, D. S.; Pristavchenko, O. V. An intractability result for the vertex 3-colourability problem. (English) Zbl 1495.05101 Optim. Lett. 16, No. 5, 1403-1409 (2022). Reviewer: Tanja Dravec (Maribor) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{O. V. Pristavchenko}, Optim. Lett. 16, No. 5, 1403--1409 (2022; Zbl 1495.05101) 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
Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four. (English) Zbl 1485.05053 Discrete Appl. Math. 312, 106-115 (2022). MSC: 05C15 68Q25 05C85 05D10 68R10 PDFBibTeX XMLCite \textit{B. Cameron} et al., Discrete Appl. Math. 312, 106--115 (2022; Zbl 1485.05053) Full Text: DOI
Bonomo-Braberman, Flavia; Gonzalez, Carolina L.; Oliveira, Fabiano S.; Sampaio, Moysés S. Jr.; Szwarcfiter, Jayme L. Thinness of product graphs. (English) Zbl 1485.05049 Discrete Appl. Math. 312, 52-71 (2022). MSC: 05C15 05C76 05C35 05C99 68Q25 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 312, 52--71 (2022; Zbl 1485.05049) Full Text: DOI
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
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
Gavril, Fanica; Shalom, Mordechai; Zaks, Shmuel Approximation algorithms for maximum weight \(k\)-coverings of graphs by packings. (English) Zbl 1491.68269 Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022). Reviewer: K. Subramani (Morgantown) MSC: 68W25 05C70 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{F. Gavril} et al., Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022; Zbl 1491.68269) 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
Carbonnel, Clément; Romero, Miguel; Živný, Stanislav The complexity of general-valued constraint satisfaction problems seen from the other side. (English) Zbl 07470541 SIAM J. Comput. 51, No. 1, 19-69 (2022). MSC: 68Q25 68R01 03B70 90C05 PDFBibTeX XMLCite \textit{C. Carbonnel} et al., SIAM J. Comput. 51, No. 1, 19--69 (2022; Zbl 07470541) Full Text: DOI arXiv
Jones, Átila A.; Protti, Fábio; Del-Vecchio, Renata R. Edge clique partition in \((k,\ell)\)-graphs. (English) Zbl 1477.05143 Discrete Appl. Math. 306, 89-97 (2022). MSC: 05C70 68Q17 05C69 PDFBibTeX XMLCite \textit{Á. A. Jones} et al., Discrete Appl. Math. 306, 89--97 (2022; Zbl 1477.05143) Full Text: DOI
Guttmann, Walter; Robinson-O’Brien, Nicolas Relation-algebraic verification of Borůvka’s minimum spanning tree algorithm. (English) Zbl 07670521 Fahrenberg, Uli (ed.) et al., Relational and algebraic methods in computer science. 19th international conference, RAMiCS 2021, Marseille, France, November 2–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13027, 225-240 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Guttmann} and \textit{N. Robinson-O'Brien}, Lect. Notes Comput. Sci. 13027, 225--240 (2021; Zbl 07670521) Full Text: DOI
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r,\ell )\)-well-coveredness. (English) Zbl 07670478 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 375-386 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Lect. Notes Comput. Sci. 13025, 375--386 (2021; Zbl 07670478) Full Text: DOI
Brakensiek, Joshua; Guruswami, Venkatesan Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy. (English) Zbl 1494.68094 SIAM J. Comput. 50, No. 6, 1663-1700 (2021). MSC: 68Q25 08A70 68R07 68W25 PDFBibTeX XMLCite \textit{J. Brakensiek} and \textit{V. Guruswami}, SIAM J. Comput. 50, No. 6, 1663--1700 (2021; Zbl 1494.68094) Full Text: DOI arXiv
Harutyunyan, Hovhannes A.; Li, Zhiyuan The complexity of finding a broadcast center. (English) Zbl 1498.68204 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 57-70 (2021). MSC: 68R10 68Q17 90B18 90C35 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Lect. Notes Comput. Sci. 13153, 57--70 (2021; Zbl 1498.68204) Full Text: DOI
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 07538592 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 388-401 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Jelínek} et al., Lect. Notes Comput. Sci. 12911, 388--401 (2021; Zbl 07538592) Full Text: DOI arXiv
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 07538588 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 336-348 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Brause} et al., Lect. Notes Comput. Sci. 12911, 336--348 (2021; Zbl 07538588) Full Text: DOI arXiv
Ducoffe, Guillaume Beyond Helly graphs: the diameter problem on absolute retracts. (English) Zbl 07538587 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 321-335 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Ducoffe}, Lect. Notes Comput. Sci. 12911, 321--335 (2021; Zbl 07538587) Full Text: DOI arXiv
Vortmeier, Nils; Kokkinis, Ioannis The dynamic complexity of acyclic hypergraph homomorphisms. (English) Zbl 07538580 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 232-244 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Vortmeier} and \textit{I. Kokkinis}, Lect. Notes Comput. Sci. 12911, 232--244 (2021; Zbl 07538580) Full Text: DOI arXiv
Cai, Jin-Yi; Fan, Austen Z.; Liu, Yin Bipartite 3-regular counting problems with mixed signs. (English) Zbl 07530229 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 135-148 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Lect. Notes Comput. Sci. 12867, 135--148 (2021; Zbl 07530229) Full Text: DOI arXiv
de Melo, Alexsander A.; de Figueiredo, Celina M. H.; Souza, Uéverton S. On the terminal connection problem. (English) Zbl 1490.68150 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, 278-292 (2021). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. A. de Melo} et al., Lect. Notes Comput. Sci. 12607, 278--292 (2021; Zbl 1490.68150) Full Text: DOI
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 07497552 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, 452-470 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Lect. Notes Comput. Sci. 12601, 452--470 (2021; Zbl 07497552) Full Text: DOI
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 PDFBibTeX XMLCite \textit{F. Gurski} et al., Lect. Notes Comput. Sci. 12601, 95--108 (2021; Zbl 07497524) Full Text: DOI
Bousquet, Nicolas; Esperet, Louis; Pirot, François Distributed algorithms for fractional coloring. (English) Zbl 07495131 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 15-30 (2021). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{N. Bousquet} et al., Lect. Notes Comput. Sci. 12810, 15--30 (2021; Zbl 07495131) Full Text: DOI arXiv
Bar-Noy, Amotz; Böhnlein, Toni; Peleg, David; Perry, Mor; Rawitz, Dror Relaxed and approximate graph realizations. (English) Zbl 07495010 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, 3-19 (2021). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Lect. Notes Comput. Sci. 12757, 3--19 (2021; Zbl 07495010) Full Text: DOI
Barkowsky, Matthias; Giese, Holger Host-graph-sensitive RETE nets for incremental graph pattern matching. (English) Zbl 1512.68063 Gadducci, Fabio (ed.) et al., Graph transformation. 14th international conference, ICGT 2021, held as part of STAF 2021, virtual event, June 24–25, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12741, 145-163 (2021). MSC: 68P05 68Q42 68R10 PDFBibTeX XMLCite \textit{M. Barkowsky} and \textit{H. Giese}, Lect. Notes Comput. Sci. 12741, 145--163 (2021; Zbl 1512.68063) Full Text: DOI
Bok, Jan; Jedličková, Nikola; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Injective colouring for H-free graphs. (English) Zbl 07493522 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 18-30 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 12730, 18--30 (2021; Zbl 07493522) Full Text: DOI
Focke, Jacob; Goldberg, Leslie Ann; Roth, Marc; Živný, Stanislav Counting homomorphisms to \(K_4\)-minor-free graphs, modulo 2. (English) Zbl 07436465 SIAM J. Discrete Math. 35, No. 4, 2749-2814 (2021). MSC: 68R10 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Focke} et al., SIAM J. Discrete Math. 35, No. 4, 2749--2814 (2021; Zbl 07436465) Full Text: DOI arXiv
Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. I: Graph classes with a forbidden structure. (English) Zbl 1479.05308 SIAM J. Discrete Math. 35, No. 4, 2618-2646 (2021). MSC: 05C75 05C05 05C69 05C83 05C40 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dallard} et al., SIAM J. Discrete Math. 35, No. 4, 2618--2646 (2021; Zbl 1479.05308) Full Text: DOI arXiv
Koch, Sebastian Miscellaneous graph preliminaries. I. (English) Zbl 1473.68208 Formaliz. Math. 29, No. 1, 21-38 (2021). MSC: 68V20 05C99 PDFBibTeX XMLCite \textit{S. Koch}, Formaliz. Math. 29, No. 1, 21--38 (2021; Zbl 1473.68208) Full Text: DOI