{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:26:18Z","timestamp":1754162778605,"version":"3.41.2"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>\n            <jats:italic toggle=\"yes\">S<\/jats:italic>\n            -packing coloring is a generalization of proper coloring of graphs, introduced more than a decade ago. In this paper, we present algebraic and combinatorial algorithms for the problem of\n            <jats:italic toggle=\"yes\">S<\/jats:italic>\n            -packing coloring of finite undirected and unweighted graphs. We assess the upper bounds for the complexity of our algorithms and of an existing algebraic algorithm by Maarouf [Electron. J. Combin. 2017]. We also provide a comparative evaluation of these algorithms.\n          <\/jats:p>","DOI":"10.1145\/3749890.3749891","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:51:53Z","timestamp":1753890713000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic and Combinatorial Algorithms for S-Packing Coloring"],"prefix":"10.1145","volume":"59","author":[{"given":"K. Mohamed","family":"Harith","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India"}]},{"given":"A. V.","family":"Jayanthan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India"}]},{"given":"B. V. Raghavendra","family":"Rao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India"}]}],"member":"320","published-online":{"date-parts":[[2025,7,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/070683933"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2320"},{"key":"e_1_2_1_3_1","volume-title":"version 9.0","author":"Developers The Sage","year":"2020","unstructured":"The Sage Developers, William Stein, David Joyner, David Kohel, John Cremona, and Bur\u00e7in Er\u00f6cal. Sagemath, version 9.0, 2020."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.001"},{"key":"e_1_2_1_5_1","volume-title":"Springer","author":"Francisco Christopher A.","year":"2013","unstructured":"Christopher A. Francisco, Huy T\u00e0i H\u00e0, and Jeffrey Mermin. Powers of square-free monomial ideals and combinatorics. In Commutative algebra, pages 373\u2013392. Springer, New York, 2013."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2010.10.025"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.01.028"},{"key":"e_1_2_1_8_1","first-page":"33","article-title":"Broadcast chromatic numbers of graphs","volume":"86","author":"Goddard Wayne","year":"2008","unstructured":"Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, John M. Harris, and Douglas F. Rall. Broadcast chromatic numbers of graphs. Ars Combin., 86:33\u201349, 2008.","journal-title":"Ars Combin."},{"key":"e_1_2_1_9_1","unstructured":"Daniel R. Grayson and Michael E. Stillman. Macaulay2 a software system for research in algebraic geometry. Available at http:\/\/www.math.uiuc.edu\/Macaulay2\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-106-6"},{"key":"e_1_2_1_11_1","volume-title":"Jensen and Bjarne Toft. Graph coloring problems","author":"Tommy","year":"1995","unstructured":"Tommy R. Jensen and Bjarne Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York, 1995. A Wiley-Interscience Publication."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25730-3"},{"key":"e_1_2_1_13_1","volume-title":"Gr\u00f6bner bases techniques for an S-packing k-coloring of a graph. Electron. J. Combin., 24(3):Paper No. 3.33, 16","author":"Maarouf Hamid","year":"2017","unstructured":"Hamid Maarouf. Gr\u00f6bner bases techniques for an S-packing k-coloring of a graph. Electron. J. Combin., 24(3):Paper No. 3.33, 16, 2017."},{"key":"e_1_2_1_14_1","series-title":"Graduate Texts in Mathematics","volume-title":"Combinatorial commutative algebra","author":"Miller Ezra","year":"2005","unstructured":"Ezra Miller and Bernd Sturmfels. Combinatorial commutative algebra, volume 227 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2005."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.08.002"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.1999.8091"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(96)00017-1"},{"key":"e_1_2_1_19_1","volume-title":"Combinatorial secant varieties. Pure Appl. Math. Q., 2(3","author":"Sturmfels Bernd","year":"2006","unstructured":"Bernd Sturmfels and Seth Sullivant. Combinatorial secant varieties. Pure Appl. Math. Q., 2(3, Special Issue: In honor of Robert D. MacPherson. Part 1):867\u2013891, 2006."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3749890.3749891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:51:54Z","timestamp":1753890714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3749890.3749891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1145\/3749890.3749891"],"URL":"https:\/\/doi.org\/10.1145\/3749890.3749891","relation":{},"ISSN":["1932-2232","1932-2240"],"issn-type":[{"type":"print","value":"1932-2232"},{"type":"electronic","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-07-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}