Mathwieser, Corinna; Çela, Eranda Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. (English) Zbl 07819299 Networks 83, No. 3, 587-604 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{C. Mathwieser} and \textit{E. Çela}, Networks 83, No. 3, 587--604 (2024; Zbl 07819299) Full Text: DOI arXiv OA License
Naserasr, Reza; Yu, Weiqiang On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. (English) Zbl 07812588 J. Comb. Optim. 47, No. 2, Paper No. 9, 24 p. (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{R. Naserasr} and \textit{W. Yu}, J. Comb. Optim. 47, No. 2, Paper No. 9, 24 p. (2024; Zbl 07812588) Full Text: DOI
Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann Graphs with \(G^p\)-connected medians. (English) Zbl 07807880 Math. Program. 203, No. 1-2 (B), 369-420 (2024). MSC: 05C78 90B80 90C27 PDFBibTeX XMLCite \textit{L. Bénéteau} et al., Math. Program. 203, No. 1--2 (B), 369--420 (2024; Zbl 07807880) Full Text: DOI arXiv
Ferhat, Dehia Ait; Király, Zoltán; Sebő, András; Stauffer, Gautier How many matchings cover the nodes of a graph? (English) Zbl 07807861 Math. Program. 203, No. 1-2 (B), 271-284 (2024). MSC: 90C27 05C70 05C85 PDFBibTeX XMLCite \textit{D. A. Ferhat} et al., Math. Program. 203, No. 1--2 (B), 271--284 (2024; Zbl 07807861) Full Text: DOI arXiv
Li, Shiming; Yu, Wei; Liu, Zhaohui A local search algorithm for the \(k\)-path partition problem. (English) Zbl 07792593 Optim. Lett. 18, No. 1, 279-290 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{S. Li} et al., Optim. Lett. 18, No. 1, 279--290 (2024; Zbl 07792593) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; Laureana, Federica; Serra, Domenico; Sorgente, Carmine A genetic approach for the 2-edge-connected minimum branch vertices problem. (English) Zbl 07791136 Networks 82, No. 4, 301-317 (2023). MSC: 90Cxx PDFBibTeX XMLCite \textit{F. Carrabs} et al., Networks 82, No. 4, 301--317 (2023; Zbl 07791136) Full Text: DOI
Zhang, Lei; Tu, Jianhua; Xin, Chunlin Maximum dissociation sets in subcubic trees. (English) Zbl 07731053 J. Comb. Optim. 46, No. 1, Paper No. 8, 13 p. (2023). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{L. Zhang} et al., J. Comb. Optim. 46, No. 1, Paper No. 8, 13 p. (2023; Zbl 07731053) Full Text: DOI arXiv
Snauwaert, Jakob; Van Eynde, Rob; Vanhoucke, Mario On the complexity of efficient multi-skilled team composition. (English) Zbl 07705484 Comput. Oper. Res. 157, Article ID 106277, 17 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{J. Snauwaert} et al., Comput. Oper. Res. 157, Article ID 106277, 17 p. (2023; Zbl 07705484) Full Text: DOI
Harutyunyan, Hovhannes A.; Li, Zhiyuan Broadcast graphs using new dimensional broadcast schemes for Knödel graphs. (English) Zbl 1515.05137 Discrete Appl. Math. 336, 56-67 (2023). MSC: 05C69 90B18 94A15 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Discrete Appl. Math. 336, 56--67 (2023; Zbl 1515.05137) 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
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
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
Jin, Bo; Tanaka, Shunji An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. (English) Zbl 1524.90054 Eur. J. Oper. Res. 304, No. 2, 494-514 (2023). MSC: 90B06 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{B. Jin} and \textit{S. Tanaka}, Eur. J. Oper. Res. 304, No. 2, 494--514 (2023; Zbl 1524.90054) Full Text: DOI
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
Cordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A. Pervasive domination. (English) Zbl 1528.90265 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 287-298 (2022). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Lect. Notes Comput. Sci. 13526, 287--298 (2022; Zbl 1528.90265) Full Text: DOI
Ryan, Christopher Thomas; Smith, Robert L. A greedy algorithm for finding maximum spanning trees in infinite graphs. (English) Zbl 1525.90420 Oper. Res. Lett. 50, No. 6, 655-659 (2022). MSC: 90C35 05C63 PDFBibTeX XMLCite \textit{C. T. Ryan} and \textit{R. L. Smith}, Oper. Res. Lett. 50, No. 6, 655--659 (2022; Zbl 1525.90420) Full Text: DOI
Polten, Lukas; Emde, Simon Multi-shuttle crane scheduling in automated storage and retrieval systems. (English) Zbl 1507.90067 Eur. J. Oper. Res. 302, No. 3, 892-908 (2022). MSC: 90B35 90B06 PDFBibTeX XMLCite \textit{L. Polten} and \textit{S. Emde}, Eur. J. Oper. Res. 302, No. 3, 892--908 (2022; Zbl 1507.90067) Full Text: DOI
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
Schwartz, Stephan An overview of graph covering and partitioning. (English) Zbl 1490.05220 Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022). MSC: 05C70 90C27 PDFBibTeX XMLCite \textit{S. Schwartz}, Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022; Zbl 1490.05220) Full Text: DOI
Mokeev, Dmitry B.; Malyshev, Dmitry S. On partial descriptions of König graphs for odd paths and all their spanning supergraphs. (English) Zbl 1487.90563 Optim. Lett. 16, No. 2, 481-496 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 16, No. 2, 481--496 (2022; Zbl 1487.90563) Full Text: DOI
Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura A greedy algorithm for the social golfer and the Oberwolfach problem. (English) Zbl 1495.05267 Eur. J. Oper. Res. 300, No. 1, 310-319 (2022). MSC: 05C70 05C38 90B35 90C27 05C85 PDFBibTeX XMLCite \textit{D. Schmand} et al., Eur. J. Oper. Res. 300, No. 1, 310--319 (2022; Zbl 1495.05267) Full Text: DOI arXiv
Cui, Shu-Yu; Wang, Yiqiao; Huang, Danjun; Du, Hongwei; Wang, Weifan Structure and pancyclicity of maximal planar graphs with diameter two. (English) Zbl 1485.90106 J. Comb. Optim. 43, No. 1, 1-27 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{S.-Y. Cui} et al., J. Comb. Optim. 43, No. 1, 1--27 (2022; Zbl 1485.90106) 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
Alves, Matheus S. D.; Nascimento, Julliano R.; Souza, Uéverton S. On the complexity of coloring \(( r , \ell )\)-graphs. (English) Zbl 07769642 Int. Trans. Oper. Res. 28, No. 6, 3172-3189 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{M. S. D. Alves} et al., Int. Trans. Oper. Res. 28, No. 6, 3172--3189 (2021; Zbl 07769642) Full Text: DOI
Contreras-Bolton, Carlos; Parada, Víctor An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search. (English) Zbl 07768633 Int. Trans. Oper. Res. 28, No. 3, 1190-1212 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{C. Contreras-Bolton} and \textit{V. Parada}, Int. Trans. Oper. Res. 28, No. 3, 1190--1212 (2021; Zbl 07768633) Full Text: DOI
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
Wei, Ningji; Walteros, Jose L.; Pajouh, Foad Mahdavi Integer programming formulations for minimum spanning tree interdiction. (English) Zbl 07549345 INFORMS J. Comput. 33, No. 4, 1461-1480 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{N. Wei} et al., INFORMS J. Comput. 33, No. 4, 1461--1480 (2021; Zbl 07549345) Full Text: DOI
Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 15-26 (2021). MSC: 05C15 05C70 05C85 05C90 90B10 90B15 90C27 90C35 PDFBibTeX XMLCite \textit{J. Díaz} et al., AIRO Springer Ser. 5, 15--26 (2021; Zbl 1479.05100) Full Text: DOI arXiv
Cohen, Johanne; Italiano, Giuseppe F.; Manoussakis, Yannis; Thang, Nguyen Kim; Pham, Hong Phong Tropical paths in vertex-colored graphs. (English) Zbl 1481.90273 J. Comb. Optim. 42, No. 3, 476-498 (2021). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{J. Cohen} et al., J. Comb. Optim. 42, No. 3, 476--498 (2021; Zbl 1481.90273) Full Text: DOI
He, Dan; Lin, Wensong On \(t\)-relaxed 2-distant circular coloring of graphs. (English) Zbl 1470.05057 Bull. Malays. Math. Sci. Soc. (2) 44, No. 4, 1941-1960 (2021). MSC: 05C15 05C10 90C35 68Q17 PDFBibTeX XMLCite \textit{D. He} and \textit{W. Lin}, Bull. Malays. Math. Sci. Soc. (2) 44, No. 4, 1941--1960 (2021; Zbl 1470.05057) Full Text: DOI arXiv
Carrabs, Francesco; Cerulli, Raffaele; D’Ambrosio, Ciriaco; Laureana, Federica The generalized minimum branch vertices problem: properties and polyhedral analysis. (English) Zbl 1469.90091 J. Optim. Theory Appl. 188, No. 2, 356-377 (2021). MSC: 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{F. Carrabs} et al., J. Optim. Theory Appl. 188, No. 2, 356--377 (2021; Zbl 1469.90091) Full Text: DOI
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
De Bontridder, K. M. J.; Halldórsson, B. V.; Halldórsson, M. M.; Hurkens, C. A. J.; Lenstra, J. K.; Ravi, R.; Stougie, L. Local improvement algorithms for a path packing problem: a performance analysis based on linear programming. (English) Zbl 1525.90414 Oper. Res. Lett. 49, No. 1, 62-68 (2021). MSC: 90C35 05C38 05C70 90C10 PDFBibTeX XMLCite \textit{K. M. J. De Bontridder} et al., Oper. Res. Lett. 49, No. 1, 62--68 (2021; Zbl 1525.90414) Full Text: DOI
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
Chalopin, Jérémie; Chepoi, Victor; Hirai, Hiroshi; Osajda, Damian Weakly modular graphs and nonpositive curvature. (English) Zbl 1475.05001 Memoirs of the American Mathematical Society 1309. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4362-7/pbk, 978-1-4704-6349-6/ebook). vi, 159 p. (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05-02 05C12 51K05 20F67 90C27 57M07 PDFBibTeX XMLCite \textit{J. Chalopin} et al., Weakly modular graphs and nonpositive curvature. Providence, RI: American Mathematical Society (AMS) (2020; Zbl 1475.05001) Full Text: DOI arXiv
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI
Dalfó, C.; Fiol, M. A.; López, N. New Moore-like bounds and some optimal families of abelian Cayley mixed graphs. (English) Zbl 1442.05083 Ann. Comb. 24, No. 2, 405-424 (2020). MSC: 05C25 05C12 05C20 05C35 90B10 PDFBibTeX XMLCite \textit{C. Dalfó} et al., Ann. Comb. 24, No. 2, 405--424 (2020; Zbl 1442.05083) Full Text: DOI Link
Harutyunyan, Hovhannes A.; Li, Zhiyuan A new construction of broadcast graphs. (English) Zbl 1439.05127 Discrete Appl. Math. 280, 144-155 (2020). MSC: 05C40 05C35 90B18 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Discrete Appl. Math. 280, 144--155 (2020; Zbl 1439.05127) Full Text: DOI
Melo, Alexsander A.; Figueiredo, Celina M. H.; Souza, Uéverton S. A multivariate analysis of the strict terminal connection problem. (English) Zbl 1435.90040 J. Comput. Syst. Sci. 111, 22-41 (2020). MSC: 90B10 90B18 05C82 PDFBibTeX XMLCite \textit{A. A. Melo} et al., J. Comput. Syst. Sci. 111, 22--41 (2020; Zbl 1435.90040) Full Text: DOI
Andersen, Patrick J.; Ras, Charl J. Degree bounded bottleneck spanning trees in three dimensions. (English) Zbl 1439.90058 J. Comb. Optim. 39, No. 2, 457-491 (2020). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{P. J. Andersen} and \textit{C. J. Ras}, J. Comb. Optim. 39, No. 2, 457--491 (2020; Zbl 1439.90058) Full Text: DOI arXiv
Gómez, Renzo; Wakabayashi, Yoshiko Nontrivial path covers of graphs: existence, minimization and maximization. (English) Zbl 1434.90209 J. Comb. Optim. 39, No. 2, 437-456 (2020). MSC: 90C35 05C70 90C27 PDFBibTeX XMLCite \textit{R. Gómez} and \textit{Y. Wakabayashi}, J. Comb. Optim. 39, No. 2, 437--456 (2020; Zbl 1434.90209) Full Text: DOI
Li, Yanjun; Szabó, Jácint An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem. (English) Zbl 1439.05191 Electron. J. Comb. 27, No. 1, Research Paper P1.15, 17 p. (2020). Reviewer: Sizhong Zhou (Zhenjiang) MSC: 05C70 90C27 68Q17 PDFBibTeX XMLCite \textit{Y. Li} and \textit{J. Szabó}, Electron. J. Comb. 27, No. 1, Research Paper P1.15, 17 p. (2020; Zbl 1439.05191) Full Text: DOI Link
Legay, Sylvain; Montero, Leandro On the iterated edge-biclique operator. (English) Zbl 07515213 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 577-587 (2019). MSC: 05Cxx 90Cxx PDFBibTeX XMLCite \textit{S. Legay} and \textit{L. Montero}, Electron. Notes Theor. Comput. Sci. 346, 577--587 (2019; Zbl 07515213) Full Text: DOI arXiv
Groshaus, Marina; Guedes, André L. P.; Kolberg, Fabricio Schiavon Subclasses of circular-arc bigraphs: Helly, normal and proper. (English) Zbl 07515206 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 497-509 (2019). MSC: 05Cxx 90Cxx PDFBibTeX XMLCite \textit{M. Groshaus} et al., Electron. Notes Theor. Comput. Sci. 346, 497--509 (2019; Zbl 07515206) Full Text: DOI
Andersen, Patrick J.; Ras, Charl J. Algorithms for Euclidean degree bounded spanning tree problems. (English) Zbl 1430.68353 Int. J. Comput. Geom. Appl. 29, No. 2, 121-160 (2019). MSC: 68U05 90C27 90C59 PDFBibTeX XMLCite \textit{P. J. Andersen} and \textit{C. J. Ras}, Int. J. Comput. Geom. Appl. 29, No. 2, 121--160 (2019; Zbl 1430.68353) Full Text: DOI arXiv
Ning, Baoling; Li, Jianzhong; Jiang, Shouxu Balanced tree partition problems with virtual nodes. (English) Zbl 1426.90220 J. Comb. Optim. 37, No. 4, 1249-1265 (2019). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{B. Ning} et al., J. Comb. Optim. 37, No. 4, 1249--1265 (2019; Zbl 1426.90220) Full Text: DOI
Godsil, Chris; Roberson, David E.; Rooney, Brendan; Šámal, Robert; Varvitsiotis, Antonios Graph homomorphisms via vector colorings. (English) Zbl 1414.05199 Eur. J. Comb. 79, 244-261 (2019). MSC: 05C60 05C15 90C22 PDFBibTeX XMLCite \textit{C. Godsil} et al., Eur. J. Comb. 79, 244--261 (2019; Zbl 1414.05199) Full Text: DOI arXiv Link
Singh, Kavita; Sundar, Shyam A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. (English) Zbl 1430.90553 Eur. J. Oper. Res. 276, No. 1, 88-105 (2019). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{K. Singh} and \textit{S. Sundar}, Eur. J. Oper. Res. 276, No. 1, 88--105 (2019; Zbl 1430.90553) Full Text: DOI
Gourvès, Laurent; Monnot, Jérôme; Tlilane, Lydia Subset sum problems with digraph constraints. (English) Zbl 1414.90345 J. Comb. Optim. 36, No. 3, 937-964 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{L. Gourvès} et al., J. Comb. Optim. 36, No. 3, 937--964 (2018; Zbl 1414.90345) Full Text: DOI arXiv
Merabet, Massinissa; Molnar, Miklos; Durand, Sylvain ILP formulation of the degree-constrained minimum spanning hierarchy problem. (English) Zbl 1414.90348 J. Comb. Optim. 36, No. 3, 789-811 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{M. Merabet} et al., J. Comb. Optim. 36, No. 3, 789--811 (2018; Zbl 1414.90348) Full Text: DOI Link
Santos, J. L.; Di Puglia Pugliese, Luigi; Guerriero, Francesca A new approach for the multiobjective minimum spanning tree. (English) Zbl 1391.90618 Comput. Oper. Res. 98, 69-83 (2018). MSC: 90C35 90C29 68R10 90C60 90C27 PDFBibTeX XMLCite \textit{J. L. Santos} et al., Comput. Oper. Res. 98, 69--83 (2018; Zbl 1391.90618) 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
Shalu, M. A.; Vijayakumar, S.; Yamini, S. Devi; Sandhya, T. P. On the algorithmic aspects of strong subcoloring. (English) Zbl 1400.90266 J. Comb. Optim. 35, No. 4, 1312-1329 (2018). MSC: 90C27 05C15 PDFBibTeX XMLCite \textit{M. A. Shalu} et al., J. Comb. Optim. 35, No. 4, 1312--1329 (2018; Zbl 1400.90266) Full Text: DOI
Wiener, Gábor Depth first search in claw-free graphs. (English) Zbl 1400.90292 Optim. Lett. 12, No. 2, 367-373 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{G. Wiener}, Optim. Lett. 12, No. 2, 367--373 (2018; Zbl 1400.90292) Full Text: DOI Link
Krokhin, Andrei; Zivny, Stanislav The complexity of valued CSPs. (English) Zbl 1482.68165 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 233-266 (2017). MSC: 68R07 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{A. Krokhin} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 233--266 (2017; Zbl 1482.68165) Full Text: DOI
Cooper, Martin C.; Zivny, Stanislav Hybrid tractable classes of constraint problems. (English) Zbl 1482.68107 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 113-135 (2017). MSC: 68Q25 68R05 90C27 PDFBibTeX XMLCite \textit{M. C. Cooper} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 113--135 (2017; Zbl 1482.68107) Full Text: DOI
Silvestri, Selene; Laporte, Gilbert; Cerulli, Raffaele A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. (English) Zbl 1391.90619 Comput. Oper. Res. 81, 322-332 (2017). MSC: 90C35 90C27 90C57 90C59 PDFBibTeX XMLCite \textit{S. Silvestri} et al., Comput. Oper. Res. 81, 322--332 (2017; Zbl 1391.90619) Full Text: DOI
Takazawa, Kenjiro Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. (English) Zbl 1387.90229 Discrete Optim. 26, 26-40 (2017). MSC: 90C27 05C70 05C85 68R10 05C45 68Q25 90C60 90C35 PDFBibTeX XMLCite \textit{K. Takazawa}, Discrete Optim. 26, 26--40 (2017; Zbl 1387.90229) Full Text: DOI Link
Landete, Mercedes; Marín, Alfredo; Sainz-Pardo, José Luis Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. (English) Zbl 1394.90547 Comput. Optim. Appl. 68, No. 3, 749-773 (2017). MSC: 90C35 90C10 PDFBibTeX XMLCite \textit{M. Landete} et al., Comput. Optim. Appl. 68, No. 3, 749--773 (2017; Zbl 1394.90547) Full Text: DOI
Hamilton, Kathleen E.; Humble, Travis S. Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. (English) Zbl 1373.81139 Quantum Inf. Process. 16, No. 4, Paper No. 94, 17 p. (2017). MSC: 81P68 05C90 90C59 PDFBibTeX XMLCite \textit{K. E. Hamilton} and \textit{T. S. Humble}, Quantum Inf. Process. 16, No. 4, Paper No. 94, 17 p. (2017; Zbl 1373.81139) Full Text: DOI arXiv
Turkensteen, Marcel; Malyshev, Dmitry; Goldengorin, Boris; Pardalos, Panos M. The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. (English) Zbl 1377.90081 J. Glob. Optim. 68, No. 3, 601-622 (2017). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Turkensteen} et al., J. Glob. Optim. 68, No. 3, 601--622 (2017; Zbl 1377.90081) Full Text: DOI
Daneshgar, Amir; Madani, Meysam On the odd girth and the circular chromatic number of generalized Petersen graphs. (English) Zbl 1398.90134 J. Comb. Optim. 33, No. 3, 897-923 (2017). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{A. Daneshgar} and \textit{M. Madani}, J. Comb. Optim. 33, No. 3, 897--923 (2017; Zbl 1398.90134) Full Text: DOI arXiv
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
Rey, David; Gardner, Lauren; Waller, S. Travis Finding outbreak trees in networks with limited information. (English) Zbl 1365.92130 Netw. Spat. Econ. 16, No. 2, 687-721 (2016). MSC: 92D30 91D30 90C10 90C35 PDFBibTeX XMLCite \textit{D. Rey} et al., Netw. Spat. Econ. 16, No. 2, 687--721 (2016; Zbl 1365.92130) Full Text: DOI
Melo, Rafael A.; Samer, Phillippe; Urrutia, Sebastián An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. (English) Zbl 1357.90123 Comput. Optim. Appl. 65, No. 3, 821-844 (2016). MSC: 90C27 90C59 90C57 PDFBibTeX XMLCite \textit{R. A. Melo} et al., Comput. Optim. Appl. 65, No. 3, 821--844 (2016; Zbl 1357.90123) Full Text: DOI arXiv
Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique Directed Steiner trees with diffusion costs. (English) Zbl 1356.90152 J. Comb. Optim. 32, No. 4, 1089-1106 (2016). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{D. Watel} et al., J. Comb. Optim. 32, No. 4, 1089--1106 (2016; Zbl 1356.90152) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Rescigno, Adele A.; Vaccaro, Ugo Evangelism in social networks. (English) Zbl 1478.91147 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 96-108 (2016). MSC: 91D30 68Q25 90B60 91-04 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Lect. Notes Comput. Sci. 9843, 96--108 (2016; Zbl 1478.91147) Full Text: DOI
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs. (English) Zbl 1354.90104 J. Comb. Optim. 32, No. 2, 594-607 (2016). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{M.-S. Chang} et al., J. Comb. Optim. 32, No. 2, 594--607 (2016; Zbl 1354.90104) Full Text: DOI
Carbonnel, Clément; Cooper, Martin C. Tractability in constraint satisfaction problems: a survey. (English) Zbl 1334.90220 Constraints 21, No. 2, 115-144 (2016). MSC: 90C60 90C30 PDFBibTeX XMLCite \textit{C. Carbonnel} and \textit{M. C. Cooper}, Constraints 21, No. 2, 115--144 (2016; Zbl 1334.90220) Full Text: DOI Link
Jonsson, Peter; Thapper, Johan Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. (English) Zbl 1338.68108 J. Comput. Syst. Sci. 82, No. 5, 912-928 (2016). MSC: 68Q25 90C05 PDFBibTeX XMLCite \textit{P. Jonsson} and \textit{J. Thapper}, J. Comput. Syst. Sci. 82, No. 5, 912--928 (2016; Zbl 1338.68108) Full Text: DOI arXiv
Harutyunyan, Hovhannes A.; Li, Zhiyuan A new construction of broadcast graphs. (English) Zbl 1437.05120 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 201-211 (2016). MSC: 05C40 05C35 90B18 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Lect. Notes Comput. Sci. 9602, 201--211 (2016; Zbl 1437.05120) Full Text: DOI
Marín, Alfredo Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem. (English) Zbl 1346.90789 Eur. J. Oper. Res. 245, No. 3, 680-689 (2015). MSC: 90C35 90C10 90C59 90C60 PDFBibTeX XMLCite \textit{A. Marín}, Eur. J. Oper. Res. 245, No. 3, 680--689 (2015; Zbl 1346.90789) Full Text: DOI
Cordasco, Gennaro; Gargano, Luisa; Mecchia, Marco; Rescigno, Adele A.; Vaccaro, Ugo A fast and effective heuristic for discovering small target sets in social networks. (English) Zbl 1390.91263 Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-26625-1/pbk; 978-3-319-26626-8/ebook). Lecture Notes in Computer Science 9486, 193-208 (2015). MSC: 91D30 05C85 05C82 68W40 90C59 PDFBibTeX XMLCite \textit{G. Cordasco} et al., Lect. Notes Comput. Sci. 9486, 193--208 (2015; Zbl 1390.91263) Full Text: DOI
Kolman, Petr; Koutecký, Martin Extended formulation for CSP that is compact for instances of bounded treewidth. (English) Zbl 1393.68073 Electron. J. Comb. 22, No. 4, Research Paper P4.30, 14 p. (2015). MSC: 68Q25 68Q17 68R10 90C05 PDFBibTeX XMLCite \textit{P. Kolman} and \textit{M. Koutecký}, Electron. J. Comb. 22, No. 4, Research Paper P4.30, 14 p. (2015; Zbl 1393.68073) Full Text: arXiv Link
Astromujoff, N.; Chapelle, M.; Matamala, M.; Todinca, I.; Zamora, J. Injective colorings with arithmetic constraints. (English) Zbl 1327.05098 Graphs Comb. 31, No. 6, 2003-2017 (2015). MSC: 05C15 90C39 PDFBibTeX XMLCite \textit{N. Astromujoff} et al., Graphs Comb. 31, No. 6, 2003--2017 (2015; Zbl 1327.05098) Full Text: DOI Link
Xiao, Mingyu; Kou, Shaowei Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs. (English) Zbl 1408.05129 Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9130, 282-293 (2015). MSC: 05C85 05C70 68Q25 90C39 PDFBibTeX XMLCite \textit{M. Xiao} and \textit{S. Kou}, Lect. Notes Comput. Sci. 9130, 282--293 (2015; Zbl 1408.05129) Full Text: DOI
Dovgoshey, O.; Petrov, E.; Teichert, H.-M. On spaces extremal for the Gomory-Hu inequality. (English) Zbl 1343.05072 \(p\)-Adic Numbers Ultrametric Anal. Appl. 7, No. 2, 133-142 (2015). Reviewer: David B. Gauld (Auckland) MSC: 05C22 05C30 05C38 05C45 54E25 54E99 90B10 PDFBibTeX XMLCite \textit{O. Dovgoshey} et al., \(p\)-Adic Numbers Ultrametric Anal. Appl. 7, No. 2, 133--142 (2015; Zbl 1343.05072) Full Text: DOI arXiv
Puleo, Gregory J.; Milenkovic, Olgica Correlation clustering with constrained cluster sizes and extended weights bounds. (English) Zbl 1337.68296 SIAM J. Optim. 25, No. 3, 1857-1872 (2015). MSC: 68W25 90C05 90C35 PDFBibTeX XMLCite \textit{G. J. Puleo} and \textit{O. Milenkovic}, SIAM J. Optim. 25, No. 3, 1857--1872 (2015; Zbl 1337.68296) Full Text: DOI arXiv
Ben-Ameur, Walid; Mohamed-Sidi, Mohamed-Ahmed; Neto, José The \(k\)-separator problem: polyhedra, complexity and approximation results. (English) Zbl 1348.90589 J. Comb. Optim. 29, No. 1, 276-307 (2015). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{W. Ben-Ameur} et al., J. Comb. Optim. 29, No. 1, 276--307 (2015; Zbl 1348.90589) Full Text: DOI
Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid Covering tree with stars. (English) Zbl 1328.90119 J. Comb. Optim. 29, No. 1, 141-152 (2015). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{J. Baumbach} et al., J. Comb. Optim. 29, No. 1, 141--152 (2015; Zbl 1328.90119) Full Text: DOI
van Bevern, René; Bredereck, Robert; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J. Network-based vertex dissolution. (English) Zbl 1327.68139 SIAM J. Discrete Math. 29, No. 2, 888-914 (2015). MSC: 68Q25 05C21 05C90 68Q17 90B10 91F10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., SIAM J. Discrete Math. 29, No. 2, 888--914 (2015; Zbl 1327.68139) Full Text: DOI arXiv
Kolmogorov, Vladimir; Thapper, Johan; Živný, Stanislav The power of linear programming for general-valued CSPs. (English) Zbl 1456.68059 SIAM J. Comput. 44, No. 1, 1-36 (2015). MSC: 68Q25 68Q17 68R07 90C05 90C27 PDFBibTeX XMLCite \textit{V. Kolmogorov} et al., SIAM J. Comput. 44, No. 1, 1--36 (2015; Zbl 1456.68059) Full Text: DOI arXiv
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
Rodríguez Sánchez, Ma. Guadalupe; Herrera Cortés, Silvia Circular coloring of graphs: an application to the problem of traffic intersections. (Spanish) Zbl 1439.05092 Misc. Mat. 58, 11-30 (2014). MSC: 05C15 90B20 PDFBibTeX XMLCite \textit{Ma. G. Rodríguez Sánchez} and \textit{S. Herrera Cortés}, Misc. Mat. 58, 11--30 (2014; Zbl 1439.05092) Full Text: Link
Wu, Zhaoyan; Xu, Xinjian; Chen, Guanrong; Fu, Xinchu Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics. (English) Zbl 1395.93453 J. Franklin Inst. 351, No. 9, 4584-4595 (2014). MSC: 93D05 93A15 90B10 93C40 93B52 PDFBibTeX XMLCite \textit{Z. Wu} et al., J. Franklin Inst. 351, No. 9, 4584--4595 (2014; Zbl 1395.93453) Full Text: DOI
Rossi, André; Singh, Alok; Sundar, Shyam Cutting-plane-based algorithms for two branch vertices related spanning tree problems. (English) Zbl 1364.90335 Optim. Eng. 15, No. 4, 855-887 (2014). MSC: 90C35 90B18 90C59 PDFBibTeX XMLCite \textit{A. Rossi} et al., Optim. Eng. 15, No. 4, 855--887 (2014; Zbl 1364.90335) Full Text: DOI
Li, Yanjun The nonnegative node weight \(j\)-restricted \(k\)-matching problems. (English) Zbl 1309.90088 Math. Oper. Res. 39, No. 3, 930-948 (2014). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{Y. Li}, Math. Oper. Res. 39, No. 3, 930--948 (2014; Zbl 1309.90088) Full Text: DOI
Cerrone, C.; Cerulli, R.; Raiconi, A. Relations, models and a memetic approach for three degree-dependent spanning tree problems. (English) Zbl 1305.90346 Eur. J. Oper. Res. 232, No. 3, 442-453 (2014). MSC: 90C27 90C35 05C85 90B18 PDFBibTeX XMLCite \textit{C. Cerrone} et al., Eur. J. Oper. Res. 232, No. 3, 442--453 (2014; Zbl 1305.90346) Full Text: DOI
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
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
Silva, Ricardo M. A.; Silva, Diego M.; Resende, Mauricio G. C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. (English) Zbl 1292.90305 Optim. Lett. 8, No. 4, 1225-1243 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{R. M. A. Silva} et al., Optim. Lett. 8, No. 4, 1225--1243 (2014; Zbl 1292.90305) Full Text: DOI Link
Bachoc, Christine; Pêcher, Arnaud; Thiéry, Alain On the theta number of powers of cycle graphs. (English) Zbl 1349.05100 Combinatorica 33, No. 3, 297-317 (2013). MSC: 05C15 05C85 90C27 PDFBibTeX XMLCite \textit{C. Bachoc} et al., Combinatorica 33, No. 3, 297--317 (2013; Zbl 1349.05100) Full Text: DOI arXiv
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
Pêcher, Arnaud; Wagler, Annegret K. Computing clique and chromatic number of circular-perfect graphs in polynomial time. (English) Zbl 1280.90102 Math. Program. 141, No. 1-2 (A), 121-133 (2013). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Math. Program. 141, No. 1--2 (A), 121--133 (2013; Zbl 1280.90102) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; Gaudioso, Manlio; Gentili, Monica Lower and upper bounds for the spanning tree with minimum branch vertices. (English) Zbl 1312.90038 Comput. Optim. Appl. 56, No. 2, 405-438 (2013). MSC: 90C10 90C35 90C56 05C05 PDFBibTeX XMLCite \textit{F. Carrabs} et al., Comput. Optim. Appl. 56, No. 2, 405--438 (2013; Zbl 1312.90038) Full Text: DOI
Hartvigsen, David; Li, Yanjun Polyhedron of triangle-free simple 2-matchings in subcubic graphs. (English) Zbl 1273.05175 Math. Program. 138, No. 1-2 (A), 43-82 (2013). MSC: 05C70 05C22 90C05 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{D. Hartvigsen} and \textit{Y. Li}, Math. Program. 138, No. 1--2 (A), 43--82 (2013; Zbl 1273.05175) Full Text: DOI
Kolmogorov, Vladimir; Živný, Stanislav The complexity of conservative valued CSPs. (English) Zbl 1423.68215 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 750-759 (2012). MSC: 68Q25 90C27 PDFBibTeX XMLCite \textit{V. Kolmogorov} and \textit{S. Živný}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 750--759 (2012; Zbl 1423.68215) Full Text: Link
Cymer, Radosław Dulmage-Mendelsohn canonical decomposition as a generic pruning technique. (English) Zbl 1309.90116 Constraints 17, No. 3, 234-272 (2012). MSC: 90C35 PDFBibTeX XMLCite \textit{R. Cymer}, Constraints 17, No. 3, 234--272 (2012; Zbl 1309.90116) Full Text: DOI
De Santis, Filomena; Gargano, Luisa; Hammar, Mikael; Negro, Alberto; Vaccaro, Ugo Spider covers and their applications. (English) Zbl 1257.90082 ISRN Discrete Math. 2012, Article ID 347430, 11 p. (2012). MSC: 90C27 90C35 68R10 68W25 PDFBibTeX XMLCite \textit{F. De Santis} et al., ISRN Discrete Math. 2012, Article ID 347430, 11 p. (2012; Zbl 1257.90082) Full Text: DOI
Lin, Wu-Hsiung; Chang, Gerard J. Resource-sharing systems and hypergraph colorings. (English) Zbl 1236.90106 J. Comb. Optim. 22, No. 4, 499-508 (2011). MSC: 90C27 91B32 PDFBibTeX XMLCite \textit{W.-H. Lin} and \textit{G. J. Chang}, J. Comb. Optim. 22, No. 4, 499--508 (2011; Zbl 1236.90106) Full Text: DOI Link