{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:47:25Z","timestamp":1747136845164,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":58,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_25","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"350-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Enumeration of\u00a0Drawings and\u00a0Combinatorial Structures for\u00a0Maximal Planar Graphs"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Grosso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S., Ueckerdt, T.: Computing cartograms with optimal complexity. Discrete Comput. Geom. 50(3), 784\u2013810 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9521-1","journal-title":"Discrete Comput. Geom."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/s00454-022-00475-9","volume":"70","author":"P Angelini","year":"2023","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Roselli, V.: Morphing triangle contact representations of triangulations. Discrete Comput. Geom. 70, 991\u20131024 (2023). https:\/\/doi.org\/10.1007\/s00454-022-00475-9","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"25_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1\u20133), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Math. 11, 369\u2013391 (2006)","journal-title":"Documenta Math."},{"issue":"1\u20132","key":"25_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-010-9452-7","volume":"62","author":"J Barbay","year":"2012","unstructured":"Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62(1\u20132), 224\u2013257 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9452-7","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"25_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"VC Barbosa","year":"1999","unstructured":"Barbosa, V.C., Szwarcfiter, J.L.: Generating all the acyclic orientations of an undirected graph. Inf. Process. Lett. 72(1\u20132), 71\u201374 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"25_CR7","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TVCG.2006.136","volume":"12","author":"K Been","year":"2006","unstructured":"Been, K., Daiches, E., Yap, C.: Dynamic map labeling. IEEE Trans. Vis. Comput. Graph. 12(5), 773\u2013780 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-37623-2_26","volume-title":"Graph Drawing","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Marks, J., Ryall, K., Whitesides, S.: Graph multidrawing: finding nice drawings without defining nice. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 347\u2013355. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_26"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/S0012-7094-37-00334-X","volume":"3","author":"G Birkhoff","year":"1937","unstructured":"Birkhoff, G.: Rings of sets. Duke Math. J. 3(3), 443\u2013454 (1937)","journal-title":"Duke Math. J."},{"issue":"12","key":"25_CR10","doi-asserted-by":"publisher","first-page":"3588","DOI":"10.1007\/s00453-020-00738-y","volume":"82","author":"S Blind","year":"2020","unstructured":"Blind, S., Knauer, K., Valicov, P.: Enumerating $$k$$-arc-connected orientations. Algorithmica 82(12), 3588\u20133603 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00738-y","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00373-006-0647-2","volume":"22","author":"N Bonichon","year":"2006","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Poulalhon, D., Schaeffer, G.: Planar graphs, via well-orderly maps and trees. Graphs Comb. 22(2), 185\u2013202 (2006). https:\/\/doi.org\/10.1007\/s00373-006-0647-2","journal-title":"Graphs Comb."},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s00454-008-9125-3","volume":"42","author":"P Bose","year":"2009","unstructured":"Bose, P., Dujmovic, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.R.: A polynomial bound for untangling geometric planar graphs. Discrete Comput. Geom. 42(4), 570\u2013585 (2009). https:\/\/doi.org\/10.1007\/s00454-008-9125-3","journal-title":"Discrete Comput. Geom."},{"issue":"3\u20134","key":"25_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.H.M.: Constructing plane spanners of bounded degree and low weight. Algorithmica 42(3\u20134), 249\u2013264 (2005). https:\/\/doi.org\/10.1007\/s00453-005-1168-8","journal-title":"Algorithmica"},{"key":"25_CR14","unstructured":"Brehm, E.: 3-orientations and Schnyder 3-tree-decompositions. Master\u2019s thesis, Freie Universit\u00e4t Berlin (2000)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00222-002-0234-y","volume":"150","author":"J Cantarella","year":"2002","unstructured":"Cantarella, J., Kusner, R.B., Sullivan, J.M.: On the minimum ropelength of knots and links. Invent. Math. 150, 257\u2013286 (2002). https:\/\/doi.org\/10.1007\/s00222-002-0234-y","journal-title":"Invent. Math."},{"key":"25_CR16","unstructured":"Castelli Aleardi, L.: Algorithms for graphs on surfaces: from graph drawing to graph encoding. Habilitation thesis, Universit\u00e9 de Paris (2021)"},{"issue":"4","key":"25_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995)","journal-title":"Inf. Process. Lett."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0055046","volume-title":"ICALP 1998","author":"RC Chuang","year":"1998","unstructured":"Chuang, R.C., Garg, A., He, X., Kao, M., Lu, H.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 118\u2013129. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055046"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2017.08.002","volume":"246","author":"A Conte","year":"2018","unstructured":"Conte, A., Grossi, R., Marino, A., Rizzi, R.: Efficient enumeration of graph orientations with sources. Discrete Appl. Math. 246, 22\u201337 (2018)","journal-title":"Discrete Appl. Math."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-58150-3_35","volume-title":"COCOON 2020","author":"G Da Lozzo","year":"2020","unstructured":"Da Lozzo, G., D\u2019Angelo, A., Frati, F.: On the area requirements of planar greedy drawings of triconnected planar graphs. In: Kim, D., Uma, R., Cai, Z., Lee, D. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 435\u2013447. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58150-3_35"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Grosso, F., Patrignani, M.: Efficient enumeration of drawings and combinatorial structures for maximal planar graphs. CoRR, abs\/2310.02247 (2023)","DOI":"10.1007\/978-981-97-0566-5_25"},{"issue":"1\u20133","key":"25_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H de Fraysseix","year":"2001","unstructured":"de Fraysseix, H., de Mendez, P.O.: On topological aspects of orientations. Discrete Math. 229(1\u20133), 57\u201372 (2001)","journal-title":"Discrete Math."},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H de Fraysseix","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"issue":"2\u20133","key":"25_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","volume":"56","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Appl. Math. 56(2\u20133), 157\u2013179 (1995)","journal-title":"Discrete Appl. Math."},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting F\u00e1ry embeddings of planar graphs. In: Simon, J. (ed.) STOC 1998, pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"25_CR26","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(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/BF02122694","journal-title":"Combinatorica"},{"issue":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete Comput. Geom. 43(2), 375\u2013392 (2010). https:\/\/doi.org\/10.1007\/s00454-009-9235-6","journal-title":"Discrete Comput. Geom."},{"key":"25_CR28","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph drawing: algorithms for the visualization of graphs (1999)"},{"issue":"4","key":"25_CR29","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica 23(4), 302\u2013340 (1999). https:\/\/doi.org\/10.1007\/PL00009264","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR30","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovic","year":"2007","unstructured":"Dujmovic, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"issue":"1","key":"25_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S Felsner","year":"2001","unstructured":"Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18(1), 19\u201337 (2001)","journal-title":"Order"},{"issue":"1","key":"25_CR32","doi-asserted-by":"publisher","first-page":"R15","DOI":"10.37236\/1768","volume":"11","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electron. J. Comb. 11(1), R15 (2004)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder woods and orthogonal surfaces. Discrete Comput. Geom. 40(1), 103\u2013126 (2008). https:\/\/doi.org\/10.1007\/s00454-007-9027-9","journal-title":"Discrete Comput. Geom."},{"key":"25_CR34","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.jctb.2015.09.001","volume":"116","author":"R Ganian","year":"2016","unstructured":"Ganian, R., et al.: Are there any good digraph width measures? J. Comb. Theory Ser. B 116, 250\u2013286 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2\u20133","key":"25_CR35","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0166-218X(00)00258-4","volume":"110","author":"M Habib","year":"2001","unstructured":"Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Appl. Math. 110(2\u20133), 169\u2013187 (2001)","journal-title":"Discrete Appl. Math."},{"key":"25_CR36","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1090\/S0894-0347-01-00358-7","volume":"14","author":"J Hass","year":"2001","unstructured":"Hass, J., Lagarias, J.C.: The number of Reidemeister moves needed for unknotting. J. Am. Math. Soc. 14, 399\u2013428 (2001)","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"25_CR37","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/301970.301971","volume":"46","author":"J Hass","year":"1999","unstructured":"Hass, J., Lagarias, J.C., Pippenger, N.: The computational complexity of knot and link problems. J. ACM 46(2), 185\u2013211 (1999)","journal-title":"J. ACM"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Hayes, T.P.: A simple condition implying rapid mixing of single-site dynamics on spin systems. In: FOCS 2006, pp. 39\u201346 (2006)","DOI":"10.1109\/FOCS.2006.6"},{"issue":"3","key":"25_CR39","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S0895480197325031","volume":"12","author":"X He","year":"1999","unstructured":"He, X., Kao, M., Lu, H.: Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. Discrete Math. 12(3), 317\u2013325 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"11","key":"25_CR40","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"A Kahn","year":"1962","unstructured":"Kahn, A.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"issue":"1","key":"25_CR41","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"key":"25_CR42","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 (2011)"},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"Kobourov, S.G.: Canonical orders and Schnyder realizers. In: Encyclopedia of Algorithms, pp. 277\u2013283 (2016)","DOI":"10.1007\/978-1-4939-2864-4_650"},{"issue":"1","key":"25_CR44","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129054105002905","volume":"16","author":"K Miura","year":"2005","unstructured":"Miura, K., Azuma, M., Nishizeki, T.: Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs. Int. J. Found. Comput. Sci. 16(1), 117\u2013141 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR45","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing, Volume 12 of Lecture Notes Series on Computing (2004)","DOI":"10.1142\/5648"},{"issue":"1","key":"25_CR46","first-page":"47","volume":"7","author":"M N\u00f6llenburg","year":"2016","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016)","journal-title":"J. Comput. Geom."},{"key":"25_CR47","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11537311_39","volume-title":"FCT 2005","author":"A Ono","year":"2005","unstructured":"Ono, A., Nakano, S.: Constant time generation of linear extensions. In: Liskiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 445\u2013453. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_39"},{"issue":"3","key":"25_CR48","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01110545","volume":"10","author":"G Pruesse","year":"1993","unstructured":"Pruesse, G., Ruskey, F.: Gray codes from antimatroids. Order 10(3), 239\u2013252 (1993). https:\/\/doi.org\/10.1007\/BF01110545","journal-title":"Order"},{"issue":"2","key":"25_CR49","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G Pruesse","year":"1994","unstructured":"Pruesse, G., Ruskey, F.: Generating linear extensions fast. SIAM J. Comput. 23(2), 373\u2013386 (1994)","journal-title":"SIAM J. Comput."},{"key":"25_CR50","unstructured":"Ruskey, F.: Combinatorial generation. University of Victoria, Victoria BC, Canada (2003). Preliminary working draft"},{"issue":"2","key":"25_CR51","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jcss.2003.07.002","volume":"68","author":"M Schaefer","year":"2004","unstructured":"Schaefer, M., Stefankovic, D.: Decidability of string graphs. J. Comput. Syst. Sci. 68(2), 319\u2013334 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR52","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) SODA 1990, pp. 138\u2013148 (1990)"},{"issue":"10","key":"25_CR53","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1587\/transfun.E94.A.1965","volume":"94","author":"A Setiawan","year":"2011","unstructured":"Setiawan, A., Nakano, S.-I.: Listing all $$st$$-orientations. IEICE Trans. Fund. Electr. Comm. Comp. Sci. 94(10), 1965\u20131970 (2011)","journal-title":"IEICE Trans. Fund. Electr. Comm. Comp. Sci."},{"key":"25_CR54","unstructured":"Squire, M.B.: Gray codes and efficient generation of combinatorial structures. Ph.D. thesis, North Carolina State University (1995)"},{"issue":"2","key":"25_CR55","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1006\/jagm.1997.0891","volume":"26","author":"MB Squire","year":"1998","unstructured":"Squire, M.B.: Generating the acyclic orientations of a graph. J. Algorithms 26(2), 275\u2013290 (1998)","journal-title":"J. Algorithms"},{"issue":"6","key":"25_CR56","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G Steiner","year":"1986","unstructured":"Steiner, G.: An algorithm to generate the ideals of a partial order. Oper. Res. Lett. 5(6), 317\u2013320 (1986)","journal-title":"Oper. Res. Lett."},{"key":"25_CR57","doi-asserted-by":"crossref","unstructured":"Tamassia, R. (ed.): Handbook on Graph Drawing and Visualization (2013)","DOI":"10.1201\/b15385"},{"key":"25_CR58","unstructured":"Wasa, K.: Enumeration of enumeration algorithms. CoRR, abs\/1605.05102 (2016)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:09:59Z","timestamp":1709654999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}