{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:36:43Z","timestamp":1767314203761,"version":"3.48.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_32","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:33:53Z","timestamp":1767314033000},"page":"445-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial-Time Recognition and\u00a0Maximum Independent Set in\u00a0Burling Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5761-2564","authenticated-orcid":false,"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/24M1659960","volume":"39","author":"T Abrishami","year":"2025","unstructured":"Abrishami, T., et al.: Excluding a clique or a biclique in graphs of bounded induced matching treewidth. SIAM J. Discret. Math. 39(2), 1189\u20131200 (2025). https:\/\/doi.org\/10.1137\/24M1659960","journal-title":"SIAM J. Discret. Math."},{"key":"32_CR2","doi-asserted-by":"publisher","unstructured":"Abrishami, T., et al.: Burling graphs in graphs with large chromatic number (2025). https:\/\/doi.org\/10.48550\/arXiv.2510.19650 to appear at SODA 2026","DOI":"10.48550\/arXiv.2510.19650"},{"key":"32_CR3","doi-asserted-by":"publisher","unstructured":"Abrishami, T., Chudnovsky, M., Pilipczuk, M., Rz\u0105\u017cewski, P.: Max weight independent set in sparse graphs with no long claws. In: Beyersdorff, O., Kant\u00e9, M.M., Kupferman, O., Lokshtanov, D. (eds.) 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12\u201314, 2024, Clermont-Ferrand, France, Leibniz International Proceedings in Informatics, vol.\u00a0289, pp. 4:1\u201315. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2024.4","DOI":"10.4230\/LIPIcs.STACS.2024.4"},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a coloring problem. Mathematica Scandinavica 8, 181\u2013188 (1960). https:\/\/doi.org\/10.7146\/math.scand.a-10607","DOI":"10.7146\/math.scand.a-10607"},{"key":"32_CR5","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Bourneuf, R., Duron, J., Geniet, C., Thomass\u00e9, S., Trotignon, N.: A tamed family of triangle-free graphs with unbounded chromatic number. arXiv:2304.04296 (2023). https:\/\/doi.org\/10.48550\/arXiv.2304.04296","DOI":"10.48550\/arXiv.2304.04296"},{"key":"32_CR6","unstructured":"Bonnet, \u00c9., Bourneuf, R., Duron, J., Geniet, C., Thomass\u00e9, S., Trotignon, N.: Unpublished results announced in [5]"},{"key":"32_CR7","unstructured":"Burling, J.P.: On coloring problems of families of polytopes. Ph.D. thesis, University of Colorado, Boulder (1965)"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(02)00418-3","volume":"131","author":"E \u010cenek","year":"2003","unstructured":"\u010cenek, E., Stewart, L.: Maximum independent set and maximum clique algorithms for overlap graphs. Discret. Appl. Math. 131(1), 77\u201391 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00418-3","journal-title":"Discret. Appl. Math."},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Chalopin, J., Esperet, L., Li, Z., Ossona\u00a0de Mendez, P.: Restricted frame graphs and a conjecture of Scott. Electron. J. Comb. 23(1), Article P1.30 (2016). https:\/\/doi.org\/10.37236\/4424","DOI":"10.37236\/4424"},{"key":"32_CR10","doi-asserted-by":"publisher","unstructured":"Chudnovsky, M., Scott, A., Seymour, P.: Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory, Ser.\u00a0B 150, 195\u2013243 (2021). https:\/\/doi.org\/10.1016\/j.jctb.2021.05.001","DOI":"10.1016\/j.jctb.2021.05.001"},{"key":"32_CR11","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG 1998, Smolenice Castle, Slovak Republic, 18\u201320 June 1998, Proceedings, Lecture Notes in Computer Science, vol.\u00a01517, pp. 1\u201316. Springer (1998). https:\/\/doi.org\/10.1007\/10692760_1","DOI":"10.1007\/10692760_1"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/S002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/S002249910009","journal-title":"Theory Comput. Syst."},{"issue":"16","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1016\/j.disc.2005.09.020","volume":"306","author":"M Cropper","year":"2006","unstructured":"Cropper, M., Gy\u00e1rf\u00e1s, A., Lehel, J.: Hall ratio of the Mycielski graphs. Discret. Math. 306(16), 1988\u20131990 (2006). https:\/\/doi.org\/10.1016\/j.disc.2005.09.020","journal-title":"Discret. Math."},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/jgt.22906","volume":"103","author":"J Davies","year":"2023","unstructured":"Davies, J.: Triangle-free graphs with large chromatic number and no induced wheel. J. Graph Theory 103(1), 112\u2013118 (2023). https:\/\/doi.org\/10.1002\/jgt.22906","journal-title":"J. Graph Theory"},{"key":"32_CR15","doi-asserted-by":"publisher","unstructured":"Descartes, B.: Solution to advanced problem no. 4526. Am. Math. Monthly 61(5), 352\u2013353 (1954). https:\/\/doi.org\/10.2307\/2307489","DOI":"10.2307\/2307489"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ejc.2011.12.005","volume":"33","author":"Z Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D.: Classes of graphs with small rank decompositions are $$\\chi $$-bounded. Eur. J. Comb. 33(4), 679\u2013683 (2012). https:\/\/doi.org\/10.1016\/j.ejc.2011.12.005","journal-title":"Eur. J. Comb."},{"issue":"3","key":"32_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90111-3","journal-title":"Inf. Process. Lett."},{"key":"32_CR18","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Nash-Williams, C., Sheehan, J. (eds.) Proceedings of the Fifth British Combinatorial Conference, Congressus Numerantium, vol.\u00a0XV, pp. 211\u2013226. Utilitas Mathematica (1976)"},{"issue":"3","key":"32_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261\u2013273 (1973). https:\/\/doi.org\/10.1002\/net.3230030305","journal-title":"Networks"},{"issue":"5\u20136","key":"32_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5\u20136), 181\u2013188 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00025-9","journal-title":"Inf. Process. Lett."},{"key":"32_CR21","doi-asserted-by":"publisher","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs, North-Holland Mathematics Studies, vol.\u00a088, pp. 325\u2013356. North-Holland (1984). https:\/\/doi.org\/10.1016\/S0304-0208(08)72943-8","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"32_CR22","doi-asserted-by":"publisher","unstructured":"Grzesik, A., Klimo\u0161ov\u00e1, T., Pilipczuk, M., Pilipczuk, M.: Polynomial-time algorithm for maximum weight independent Set on $$P_6$$-free graphs. ACM Trans. Algorithms 18(1), Article 4 (2022). https:\/\/doi.org\/10.1145\/3414473","DOI":"10.1145\/3414473"},{"issue":"2","key":"32_CR23","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 55(2), 161\u2013166 (1985). https:\/\/doi.org\/10.1016\/0012-365X(85)90044-5","journal-title":"Discret. Math."},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Applicationes Mathematicae 19(3\u20134), 413\u2013441 (1987), https:\/\/eudml.org\/doc\/265405","DOI":"10.4064\/am-19-3-4-413-441"},{"issue":"3","key":"32_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52(3), 233\u2013252 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90143-0","journal-title":"Discret. Appl. Math."},{"key":"32_CR26","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Mathematicae Universitatis Carolinae 31(1), 85\u201393 (1990), https:\/\/eudml.org\/doc\/17810"},{"key":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-45043-3_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Krawczyk","year":"2013","unstructured":"Krawczyk, T., Pawlik, A., Walczak, B.: Coloring triangle-free rectangular frame intersection graphs with O(loglogn) colors. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 333\u2013344. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45043-3_29"},{"key":"32_CR28","doi-asserted-by":"publisher","unstructured":"Krawczyk, T., Pawlik, A., Walczak, B.: Coloring triangle-free rectangle overlap graphs with $$O(\\log \\log n)$$ colors. Discrete Comput. Geom. 53(1), 199\u2013220 (2015). https:\/\/doi.org\/10.1007\/s00454-014-9640-3","DOI":"10.1007\/s00454-014-9640-3"},{"issue":"6","key":"32_CR29","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s00493-016-3414-x","volume":"37","author":"T Krawczyk","year":"2017","unstructured":"Krawczyk, T., Walczak, B.: On-line approach to off-line coloring problems on graphs with geometric representations. Combinatorica 37(6), 1139\u20131179 (2017). https:\/\/doi.org\/10.1007\/s00493-016-3414-x","journal-title":"Combinatorica"},{"key":"32_CR30","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in $$P_5$$-free graphs in polynomial time. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 570\u2013581. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.43","DOI":"10.1137\/1.9781611973402.43"},{"issue":"4","key":"32_CR31","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.jda.2008.04.001","volume":"6","author":"VV Lozin","year":"2008","unstructured":"Lozin, V.V., Milani\u010d, M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4), 595\u2013604 (2008). https:\/\/doi.org\/10.1016\/j.jda.2008.04.001","journal-title":"J. Discrete Algorithms"},{"key":"32_CR32","unstructured":"Marin, M., Thomass\u00e9, S., Trotignon, N., Watrigant, R.: A structural description of Zykov and Blanche Descartes graphs. In: Fernau, H., Kindermann, P. (eds.) Graph-Theoretic Concepts in Computer Science, 51st International Workshop, WG 2025, Otzenhausen, Germany, 11\u201313 June 2025, pp. 377\u2013389, Revised Papers. LNCS, Springer (2025)"},{"issue":"3","key":"32_CR33","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory, Ser. B 28(3), 284\u2013304 (1980). https:\/\/doi.org\/10.1016\/0095-8956(80)90074-X","journal-title":"J. Comb. Theory, Ser. B"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Mycielski, J.: Sur le coloriage des graphs. Colloquium Mathematicae 3(2), 161\u2013162 (1955), https:\/\/eudml.org\/doc\/210000","DOI":"10.4064\/cm-3-2-161-162"},{"issue":"3","key":"32_CR35","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00454-013-9534-9","volume":"50","author":"A Pawlik","year":"2013","unstructured":"Pawlik, A., et al.: Triangle-free geometric intersection graphs with large chromatic number. Discret. Comput. Geom. 50(3), 714\u2013726 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9534-9","journal-title":"Discret. Comput. Geom."},{"key":"32_CR36","doi-asserted-by":"publisher","unstructured":"Pawlik, A., et al.: Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory, Ser. B 105, 6\u201310 (2014). https:\/\/doi.org\/10.1016\/j.jctb.2013.11.001","DOI":"10.1016\/j.jctb.2013.11.001"},{"key":"32_CR37","doi-asserted-by":"publisher","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part I: new characterizations. Eur. J. Comb. 110, Article 103686 (2023). https:\/\/doi.org\/10.1016\/j.ejc.2023.103686","DOI":"10.1016\/j.ejc.2023.103686"},{"key":"32_CR38","doi-asserted-by":"publisher","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part II: structure. Eur. J. Comb. 116, Article 103849 (2024). https:\/\/doi.org\/10.1016\/j.ejc.2023.103849","DOI":"10.1016\/j.ejc.2023.103849"},{"key":"32_CR39","doi-asserted-by":"publisher","unstructured":"Pournajafi, P., Trotignon, N.: Burling graphs revisited, part III: applications to $$\\chi $$-boundedness. Eur. J. Comb. 116, Article 103850 (2024). https:\/\/doi.org\/10.1016\/j.ejc.2023.103850","DOI":"10.1016\/j.ejc.2023.103850"},{"key":"32_CR40","doi-asserted-by":"publisher","unstructured":"Rz\u0105\u017cewski, P., Walczak, B.: Polynomial-time recognition and maximum independent set in Burling graphs. arXiv:2407.16666 (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.16666","DOI":"10.48550\/arXiv.2407.16666"},{"issue":"1","key":"32_CR41","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discret. Math. 29(1), 53\u201376 (1980). https:\/\/doi.org\/10.1016\/0012-365X(90)90287-R","journal-title":"Discret. Math."},{"key":"32_CR42","doi-asserted-by":"crossref","unstructured":"Scott, A.D.: Induced trees in graphs of large chromatic number. J. Graph Theory 24(4), 297\u2013311 (1997). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-J","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.3.CO;2-X"},{"issue":"3","key":"32_CR43","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00453-015-0083-x","volume":"77","author":"S Thomass\u00e9","year":"2017","unstructured":"Thomass\u00e9, S., Trotignon, N., Vu\u0161kovi\u0107, K.: A polynomial Turing-kernel for weighted independent set in bull-free graphs. Algorithmica 77(3), 619\u2013641 (2017). https:\/\/doi.org\/10.1007\/s00453-015-0083-x","journal-title":"Algorithmica"},{"key":"32_CR44","doi-asserted-by":"publisher","unstructured":"Yolov, N.: Minor-matching hypertree width. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 219\u2013233. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.16","DOI":"10.1137\/1.9781611975031.16"},{"key":"32_CR45","unstructured":"Zykov, A.A.: O\u00a0nekotorykh svoystvakh lineynykh kompleksov. Matematicheskii Sbornik, Novaya Seriya 24(66)(2), 163\u2013188 (1949), https:\/\/www.mathnet.ru\/eng\/sm5974"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:33:58Z","timestamp":1767314038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}