{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:03Z","timestamp":1750695003984,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","funder":[{"name":"National Science Foundation","award":["DMS-2144042"],"award-info":[{"award-number":["DMS-2144042"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718109","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"1933-1943","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint Paths Problem with Group-Expressable Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6271-3362","authenticated-orcid":false,"given":"Chun-Hung","family":"Liu","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3394-422X","authenticated-orcid":false,"given":"Youngho","family":"Yoo","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2023.7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Antoine Amarilli Survey of Results on the ModPath and ModCycle Problems arXiv: 2409.00770. doi:10.48550\/arXiv.2409.00770","DOI":"10.48550\/arXiv.2409.00770"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/103516.103517"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1148566"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90098-M"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90357-L"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137918"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542426"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2157-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-020-4301-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375720"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781315119601"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/090761653"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103537"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_38"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.07.001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513430"},{"key":"e_1_3_2_1_19_1","volume-title":"Paths, Flows and VLSI-Layout","author":"Frank Andr\u00e1s","year":"1990","unstructured":"Andr\u00e1s Frank, Packing paths, cuts and circuits \u2013 a survey, in: Paths, Flows and VLSI-Layout, B. Korte, L. Lov\u00e1sz, H. J. Promel and A. Schrijver (Eds.), Springer-Verlag, Berlin, 1990, 49\u2013100."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.05.001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460956"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.07.003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.03.006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5953-8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993700"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12858"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"J. Pascal Gollin Kevin Hendrey O-joung Kwon Sang-il Oum and Youngho Yoo A unified Erd\u0151s-P\u00f3sa theorem for cycles in graphs labelled by multiple abelian groups arXiv: 2209.09488. doi:10.48550\/arXiv.2209.09488","DOI":"10.48550\/arXiv.2209.09488"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Gregory Gutin and Matthias Mnich A survey on graph problems parameterized above and below guaranteed values arXiv: 2207.12278. doi:10.48550\/arXiv.2207.12278","DOI":"10.48550\/arXiv.2207.12278"},{"key":"e_1_3_2_1_29_1","volume-title":"Ph. D Thesis","author":"Huynh Tony","year":"2009","unstructured":"Tony Huynh, The linkage problem for group-labelled graphs, Ph. D Thesis, University of Waterloo, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-017-3683-z"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.137"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.12.001"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.52"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.09.006"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2019.12.001"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0370-6"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00014"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384235"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2021.06.005"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12633"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2018.05.001"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384250"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3524149"},{"key":"e_1_3_2_1_46_1","volume-title":"Theory of Graphs and Its Applications (Proc. Symp. Smolenice, 1963","author":"Nash-Williams Crispin St. J. A.","year":"1964","unstructured":"Crispin St. J. A. Nash-Williams, On well-quasi-ordering trees, in: Theory of Graphs and Its Applications (Proc. Symp. Smolenice, 1963) Publ. House Czechoslovak Acad. Sci. (1964), 83\u201384."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.08.003"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90009-9"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574704"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.37236\/6257"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2023.02.011"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120111"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.27"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:38:37Z","timestamp":1750693117000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":57,"alternative-id":["10.1145\/3717823.3718109","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718109","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}