{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:01:50Z","timestamp":1776146510438,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642184680","type":"print"},{"value":"9783642184697","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_11","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"117-128","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Regular Edge Labelings"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search Methodologies","author":"E. Aarts","year":"2005","unstructured":"Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, pp. 187\u2013210. Springer, Heidelberg (2005)"},{"issue":"12","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1016\/j.dam.2006.03.018","volume":"154","author":"E. Ackerman","year":"2006","unstructured":"Ackerman, E., Barequet, G., Pinter, R.Y.: A bijection between permutations and floorplans, and its applications. Disc. Appl. Math.\u00a0154(12), 1674\u20131684 (2006)","journal-title":"Disc. Appl. Math."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane graphs. In: Proc. 17th SODA, pp. 504\u2013513 (2006)","DOI":"10.1145\/1109557.1109613"},{"key":"11_CR4","unstructured":"Amano, K., Nakano, S., Yamanaka, K.: On the number of rectangular drawings: Exact counting and lower and upper bounds. TR 2007-AL-115, IPSJ SIG (2007)"},{"issue":"1","key":"11_CR5","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. Disc. Appl. Math.\u00a065(1), 21\u201346 (1996)","journal-title":"Disc. Appl. Math."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/net.3230170306","volume":"7","author":"J. Bhasker","year":"1987","unstructured":"Bhasker, J., Sahni, S.: A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks\u00a07, 307\u2013317 (1987)","journal-title":"Networks"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","first-page":"198","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2006","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 198\u2013209. Springer, Heidelberg (2006)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-73545-8_12","volume-title":"Computing and Combinatorics","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 97\u2013107. Springer, Heidelberg (2007)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Buchin, K., Schulz, A.: On the number of spanning trees a planar graph can have. In: Proc. 18th ESA (to appear, 2010), arXiv\/0912.0712","DOI":"10.1007\/978-3-642-15775-2_10"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F.R.K. Chung","year":"1986","unstructured":"Chung, F.R.K., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. J. Comb. Theory, Ser. A\u00a043(1), 23\u201337 (1986)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-03367-4_5","volume-title":"Algorithms and Data Structures","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., Mumford, E.: Orientation-constrained rectangular layouts. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 49\u201360. Springer, Heidelberg (2009)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. In: Proc. 25th ACM Symp. Comp. Geom., pp. 267\u2013276 (2009)","DOI":"10.1145\/1542362.1542411"},{"issue":"1","key":"11_CR13","first-page":"41","volume":"15","author":"S. Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: On the number of planar orientations with prescribed degrees. Electron. J. Comb.\u00a015(1), Research paper R77, 41 (2008)","journal-title":"Electron. J. Comb."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Fujimaki, R., Inoue, Y., Takahashi, T.: An asymptotic estimate of the numbers of rectangular drawings or floorplans. In: Proc. ISCAS, pp. 856\u2013859 (2009)","DOI":"10.1109\/ISCAS.2009.5117891"},{"issue":"7","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"\u00c9. Fusy","year":"2009","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Disc. Math.\u00a0309(7), 1870\u20131894 (2009)","journal-title":"Disc. Math."},{"key":"11_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R. Horn","year":"1985","unstructured":"Horn, R., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"issue":"1\u20132","key":"11_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. TCS\u00a0172(1-2), 175-193 (1997)","journal-title":"TCS"},{"issue":"5","key":"11_CR18","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S. Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S.: Optimization by simulated annealing: Quantitative studies. J. Statistical Physics\u00a034(5), 975\u2013986 (1984)","journal-title":"J. Statistical Physics"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"5","author":"K. Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular dual of planar graphs. Networks\u00a05, 145\u2013157 (1985)","journal-title":"Networks"},{"key":"11_CR20","volume-title":"Nonnegative Matrices","author":"H. Minc","year":"1988","unstructured":"Minc, H.: Nonnegative Matrices. Wiley-Interscience, Hoboken (1988)"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0031-3203(87)90018-5","volume":"20","author":"D. Peuquet","year":"1987","unstructured":"Peuquet, D., Ci-Xiang, Z.: An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane. Pattern Rec.\u00a020(1), 65\u201374 (1987)","journal-title":"Pattern Rec."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Speckmann, B., van Kreveld, M., Florisson, S.: A linear programming approach to rectangular cartograms. In: Progress in Spatial Data Handling: Proc. 12th International Symposium on Spatial Data Handling, pp. 529\u2013546 (2006)","DOI":"10.1007\/3-540-35589-8_34"},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M. Kreveld van","year":"2007","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Computational Geometry: Theory and Applications\u00a037(3), 175\u2013187 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480191266700","volume":"8","author":"G.K.H. Yeap","year":"1995","unstructured":"Yeap, G.K.H., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM J. Discrete Mathematics\u00a08(2), 258\u2013280 (1995)","journal-title":"SIAM J. Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T03:30:24Z","timestamp":1553398224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}