{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:23:18Z","timestamp":1742923398419,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510503"},{"type":"electronic","value":"9783030510510"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51051-0_17","type":"book-chapter","created":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T05:02:46Z","timestamp":1596603766000},"page":"238-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Treewidth of Planar Minor Free Graphs"],"prefix":"10.1007","author":[{"given":"Youssou","family":"Dieng","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,6]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/060802410.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebr. Discrete Methods 8, 277\u2013284 (1987). \nhttps:\/\/doi.org\/10.1137\/060802410.1137\/0608024","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$-trees. Discrete Appl. Math. 23, 11\u201324 (1989). \nhttps:\/\/doi.org\/10.1016\/0166-218X(89)90031-0","journal-title":"Discrete Appl. Math."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT Numer. Math. 25, 2\u201323 (1985). \nhttps:\/\/doi.org\/10.1007\/BF01934985","journal-title":"BIT Numer. Math."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2014.04.032","volume":"554","author":"J Babu","year":"2014","unstructured":"Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D.: $$2$$-connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554, 119\u2013134 (2014). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2014.04.032","journal-title":"Theor. Comput. Sci."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-7643-7400-6_4","volume-title":"Graph Theory in Paris","author":"\u00c9 Birmel\u00e9","year":"2007","unstructured":"Birmel\u00e9, \u00c9., Bondy, J.A., Reed, B.A.: Brambles, prisms and grids. In: Bondy, A., Fonlupt, J., Fouquet, J.L., Fournier, J.C., Ram\u00edrez Alfons\u00edn, J.L. (eds.) Graph Theory in Paris, pp. 37\u201344. Springer, Basel (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-7643-7400-6_4"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1016\/j.dam.2008.08.003","volume":"157","author":"\u00c9 Birmel\u00e9","year":"2009","unstructured":"Birmel\u00e9, \u00c9., Bondy, J.A., Reed, B.A.: Tree-width of graphs without a $$3\\times 3$$ grid minor. Discrete Appl. Math. 157, 2577\u20132596 (2009). \nhttps:\/\/doi.org\/10.1016\/j.dam.2008.08.003","journal-title":"Discrete Appl. Math."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-38016-7_22","volume-title":"Approximation and Online Algorithms","author":"TC Biedl","year":"2013","unstructured":"Biedl, T.C.: A 4-approximation for the height of drawing 2-connected outer-planar graphs. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 272\u2013285. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38016-7_22"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-662-45803-7_32","volume-title":"Graph Drawing","author":"T Biedl","year":"2014","unstructured":"Biedl, T.: Height-preserving transformations of planar graph drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 380\u2013391. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-45803-7_32"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305\u20131317 (1996). \nhttps:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a forest. J. Comb. Theory Ser. B 52, 274\u2013283 (1991). \nhttps:\/\/doi.org\/10.1016\/0095-8956(91)90068-U","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/inco.1997.2669","volume":"139","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., van Leeuwen, J., Tan, R.B., Thilikos, D.M.: On interval routing schemes and treewidth. Inf. Comput. 139, 92\u2013109 (1997). \nhttps:\/\/doi.org\/10.1006\/inco.1997.2669","journal-title":"Inf. Comput."},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In: 21st Annual ACM Symposium on Computational Geometry (SoCG), pp. 59\u201368. ACM-SIAM, June 2008. \nhttps:\/\/doi.org\/10.1145\/1377676.1377687","DOI":"10.1145\/1377676.1377687"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00453-010-9478-x","volume":"62","author":"VD Chepoi","year":"2012","unstructured":"Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62, 713\u2013732 (2012). \nhttps:\/\/doi.org\/10.1007\/s00453-010-9478-x","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). \nhttps:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inf. Comput."},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Chekuri, C., Tan, Z.: Towards tight(er) bounds for the excluded grid theorem. In: 30th Symposium on Discrete Algorithms (SODA), pp. 1445\u20131464. ACM Press, January 2019. \nhttps:\/\/doi.org\/10.1137\/1.9781611975482.88","DOI":"10.1137\/1.9781611975482.88"},{"key":"17_CR16","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G di Battista","year":"1999","unstructured":"di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.03.058","volume":"383","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383, 34\u201344 (2007). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2007.03.058","journal-title":"Theor. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 426\u2013433. ACM Press (1988). \nhttps:\/\/doi.org\/10.1145\/62212.62254","DOI":"10.1145\/62212.62254"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41\u201351 (1990). \nhttps:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"key":"17_CR20","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decomposition of graphs with small diameter bags. In: Fila, J. (ed.) 2nd European Conference on Combinatorics, Graph Theory and Applications (EuroComb), pp. 100\u2013104, September 2003"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-27796-5_12","volume-title":"Structural Information and Communication Complexity","author":"Y Dourisboure","year":"2004","unstructured":"Dourisboure, Y., Gavoille, C.: Sparse additive spanners for bounded tree-length graphs. In: Kr\u00e1lovic\u0306, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 123\u2013137. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27796-5_12"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307, 2008\u20132029 (2007). \nhttps:\/\/doi.org\/10.1016\/j.disc.2005.12.060","journal-title":"Discrete Math."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s00453-007-9138-y","volume":"54","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.-I.: Algorithmic Graph Minor Theory: improved grid minor bounds and Wagner\u2019s contraction. Algorithmica 54, 142\u2013180 (2009). \nhttps:\/\/doi.org\/10.1007\/s00453-007-9138-y","journal-title":"Algorithmica"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.7155\/jgaa.00109","volume":"9","author":"Y Dourisboure","year":"2005","unstructured":"Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. Graph Algorithms Appl. 9, 277\u2013297 (2005). \nhttps:\/\/doi.org\/10.7155\/jgaa.00109","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. SIAM J. Comput. 38, 629\u2013657 (2008). \nhttps:\/\/doi.org\/10.1137\/05064299X","journal-title":"SIAM J. Comput."},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Fellows, M.R., Langston, M.A.: On search, decision and the efficiency of polynomial-time algorithms. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 501\u2013512, ACM Press, May 1989. \nhttps:\/\/doi.org\/10.1145\/73007.73055","DOI":"10.1145\/73007.73055"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-44676-1_40","volume-title":"Algorithms \u2014 ESA 2001","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476\u2013487. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44676-1_40"},{"key":"17_CR28","unstructured":"Grohe, M.: Logic, graphs, and algorithms. In: Electronic Colloquium on Computational Complexity (ECCC), vol. TR07-091, September 2007. \nhttp:\/\/eccc.hpi-web.de\/eccc-reports\/2007\/TR07-091\/"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11523468_31","volume-title":"Automata, Languages and Programming","author":"Q-P Gu","year":"2005","unstructured":"Gu, Q.-P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n3) time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 373\u2013384. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11523468_31"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00453-012-9627-5","volume":"64","author":"Q-P Gu","year":"2012","unstructured":"Gu, Q.-P., Tamaki, H.: Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica 64, 416\u2013453 (2012). \nhttps:\/\/doi.org\/10.1007\/s00453-012-9627-5","journal-title":"Algorithmica"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discrete Appl. Math. 43, 97\u2013101 (1993). \nhttps:\/\/doi.org\/10.1016\/0166-218X(93)90171-J","journal-title":"Discrete Appl. Math."},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K.-I., Wollan, P.: A shorter proof of the Graph Minor Algorithm - the unique linkage theorem. In: 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 687\u2013694. ACM Press, June 2010. \nhttps:\/\/doi.org\/10.1145\/1806689.1806784","DOI":"10.1145\/1806689.1806784"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.dam.2009.10.007","volume":"158","author":"D Lokshtanov","year":"2010","unstructured":"Lokshtanov, D.: On the complexity of computing treelength. Discrete Appl. Math. 158, 820\u2013827 (2010). \nhttps:\/\/doi.org\/10.1016\/j.dam.2009.10.007","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983). \nhttps:\/\/doi.org\/10.1016\/0095-8956(83)90079-5","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR35","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. v. Excluding a planar graph. J. Comb. Theory Ser. B 41, 92\u2013114 (1986). \nhttps:\/\/doi.org\/10.1016\/0095-8956(86)90030-4","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Comb. Theory Ser. B 89, 43\u201376 (2003). \nhttps:\/\/doi.org\/10.1016\/S0095-8956(03)00042-X","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR37","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. J. Comb. Theory Ser. B 92, 325\u2013357 (2004). \nhttps:\/\/doi.org\/10.1016\/j.jctb.2004.08.001","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR38","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62, 323\u2013348 (1994). \nhttps:\/\/doi.org\/10.1006\/jctb.1994.1073","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR39","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: 1st Symposium on Discrete Algorithms (SODA), pp. 138\u2013148. ACM-SIAM, January 1990"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"PD Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14, 217\u2013241 (1994). \nhttps:\/\/doi.org\/10.1007\/BF01215352","journal-title":"Combinatorica"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Thilikos, D. M.: Quickly excluding a $${K}_{2, r}$$ from planar graphs. In: 6th Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, vol. 3, pp. 189\u2013194. Elsevier, May 1999. \nhttps:\/\/doi.org\/10.1016\/S1571-0653(05)80054-X","DOI":"10.1016\/S1571-0653(05)80054-X"},{"key":"17_CR42","doi-asserted-by":"publisher","first-page":"4656","DOI":"10.1016\/j.disc.2009.01.009","volume":"309","author":"K Umezawa","year":"2009","unstructured":"Umezawa, K., Yamazaki, K.: Tree-length equals branch-length. Discrete Math. 309, 4656\u20134660 (2009). \nhttps:\/\/doi.org\/10.1016\/j.disc.2009.01.009","journal-title":"Discrete Math."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Innovations and Interdisciplinary Solutions for Underserved Areas"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51051-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T05:07:53Z","timestamp":1596604073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51051-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510503","9783030510510"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51051-0_17","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"InterSol","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations and Interdisciplinary Solutions for Underserved Areas","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nairobi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kenya","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intersol2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/interdisciplinarysolutions.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}