{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:25Z","timestamp":1725892585993},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"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-21204-8_39","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"375-387","source":"Crossref","is-referenced-by-count":2,"title":["An Experimental Study on Generating Planar Graphs"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Meinert","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-006-0045-4","volume":"146","author":"J. Alber","year":"2006","unstructured":"Alber, J., Betzler, N., Niedermeier, R.: Experiments on data reduction for optimal domination in networks. Annals of Operations Research\u00a0146(1), 105\u2013117 (2006)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2004.01.013","volume":"145","author":"J. Alber","year":"2005","unstructured":"Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics\u00a0145(2), 219\u2013231 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"39_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jcss.2004.03.007","volume":"71","author":"J. Alber","year":"2005","unstructured":"Alber, J., Fan, H., Fellows, M.R., Fernau, H., Niedermeier, R., Rosamond, F., Stege, U.: A refined search tree technique for dominating set on planar graphs. Journal of Computer and System Sciences\u00a071(4), 385\u2013405 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-45471-3_16","volume-title":"Algorithm Theory - SWAT 2002","author":"J. Alber","year":"2002","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Efficient data reduction for dominating set: a linear problem kernel for the planar case. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 150\u2013159. Springer, Heidelberg (2002), http:\/\/theinf1.informatik.uni-jena.de\/publications\/swat02.pdf"},{"issue":"3","key":"39_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2007.02.045","volume":"379","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Generating labeled planar graphs uniformly at random. Theor. Comput. Sci.\u00a0379(3), 377\u2013386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR6","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Preprocessing of unconstrained quadratic binary optimization. Technical report, Rutgers Center for Operations Research, RUTCOR (2006)"},{"issue":"98","key":"39_CR7","first-page":"250","volume":"21","author":"R. Bowen","year":"1967","unstructured":"Bowen, R., Fisk, S.: Generations of triangulations of the sphere. Mathematics of Computation\u00a021(98), 250\u2013252 (1967)","journal-title":"Mathematics of Computation"},{"key":"39_CR8","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.J.A.: The random planar graph. Congressus Numerantium\u00a0113, 61\u201379 (1996)","journal-title":"Congressus Numerantium"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Realizability of delaunay triangulations. Inf. Process. Lett.\u00a033, 283\u2013287 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"4-5","key":"39_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P. Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing\u00a013(4-5), 577\u2013625 (2004)","journal-title":"Combinatorics, Probability and Computing"},{"key":"39_CR11","unstructured":"Fusy, \u00c9.: Implementation of a boltzman sampler for planar graphs (2005), http:\/\/www.lix.polytechnique.fr\/~fusy\/Programs\/BoltzmannPlanarGraphs.tar.gz"},{"issue":"4","key":"39_CR12","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1002\/rsa.20275","volume":"35","author":"\u00c9. Fusy","year":"2009","unstructured":"Fusy, \u00c9.: Uniform random sampling of planar graphs in linear time. Random Structures & Algorithms\u00a035(4), 464\u2013522 (2009)","journal-title":"Random Structures & Algorithms"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Gimin\u00e9z, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. Journal of the American Mathematical Society (2008)","DOI":"10.1090\/S0894-0347-08-00624-3"},{"key":"39_CR14","unstructured":"Brinkmann, G., McKay, B.: Fast generation of planar graphs, http:\/\/cs.anu.edu.au\/~bdm\/papers\/plantri-full.pdf"},{"key":"39_CR15","unstructured":"Helden, G.: Hamiltonicity of maximal planar graphs and planar triangulations. Ph.d. thesis, RWTH Aachen (2007)"},{"key":"39_CR16","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Meinert, S., Wagner, D.: An Experimental Study on Generating Planar Graphs. Technical report, ITI Wagner, Faculty of Informatics, Karlsruhe Institute of Technology (2011)","DOI":"10.1007\/978-3-642-21204-8_39"},{"key":"39_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.7155\/jgaa.00108","volume":"9","author":"T. Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Approximating Clustering Coefficient and Transitivity. Journal of Graph Algorithms and Applications\u00a09(2), 265\u2013275 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S.B. Seidman","year":"1983","unstructured":"Seidman, S.B.: Network Structure and Minimum Degree. Social Networks\u00a05, 269\u2013287 (1983)","journal-title":"Social Networks"},{"key":"39_CR21","unstructured":"van Dijk, T., van den Heuvel, J.-P., Slob, W.: Computing treewidth with LibTW (2006), http:\/\/www.treewidth.com\/docs\/LibTW.pdf"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T08:10:35Z","timestamp":1560240635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}