{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:00Z","timestamp":1720201080886},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"vor","delay-in-days":1467,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"SNF","doi-asserted-by":"publisher","award":["20GG21 134318\/1"],"award-info":[{"award-number":["20GG21 134318\/1"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.tcs.2014.04.024","type":"journal-article","created":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T10:30:32Z","timestamp":1398508232000},"page":"32-59","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On the number of upward planar orientations of maximal planar graphs"],"prefix":"10.1016","volume":"544","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.04.024_br0010","series-title":"19th International Symposium on Graph Drawing (GD 2011)","first-page":"415","article-title":"Classification of planar upward embedding","volume":"vol. 7034","author":"Auer","year":"2012"},{"issue":"6","key":"10.1016\/j.tcs.2014.04.024_br0020","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/BF01188716","article-title":"Upward drawings of triconnected digraphs","volume":"12","author":"Bertolazzi","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2014.04.024_br0030","series-title":"Matroid Applications","first-page":"123","article-title":"The Tutte polynomial and its applications","volume":"vol. 40","author":"Brylawski","year":"1992"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2014.04.024_br0040","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","article-title":"Bipolar orientations revisited","volume":"56","author":"de Fraysseix","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2014.04.024_br0050","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"10","author":"de Fraysseix","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2014.04.024_br0060","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","year":"1999"},{"key":"10.1016\/j.tcs.2014.04.024_br0070","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","article-title":"Algorithms for plane representations of acyclic digraphs","volume":"61","author":"Di Battista","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2014.04.024_br0080","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00224-005-1143-4","article-title":"Simultaneous embedding of a planar graph and its dual on the grid","volume":"38","author":"Erten","year":"2005","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2014.04.024_br0090","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.endm.2007.07.049","article-title":"Bijective counting of plane bipolar orientations","volume":"29","author":"Fusy","year":"2007","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2014.04.024_br0100","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/S0097539794277123","article-title":"On the computational complexity of upward and rectilinear planarity testing","volume":"31","author":"Garg","year":"2001","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2014.04.024_br0110","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/322203.322206","article-title":"Information bounds are weak in the shortest distance problem","volume":"27","author":"Graham","year":"1980","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2014.04.024_br0120","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0012-365X(00)00249-1","article-title":"Digraph embedding","volume":"233","author":"Hashemi","year":"2001","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2014.04.024_br0130","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/S0097539792235906","article-title":"Upward planarity testing of single-source acyclic digraphs","volume":"25","author":"Hutton","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2014.04.024_br0140","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01261322","article-title":"Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph","volume":"16","author":"Kahale","year":"1996","journal-title":"Combinatorica"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2014.04.024_br0150","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","article-title":"Fundamentals of planar ordered sets","volume":"63","author":"Kelly","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2014.04.024_br0160","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0607036","article-title":"Hard enumeration problems in geometry and combinatorics","volume":"7","author":"Linial","year":"1986","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"10.1016\/j.tcs.2014.04.024_br0170","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0213008","article-title":"The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem","volume":"13","author":"Manber","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2014.04.024_br0180","series-title":"Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry","volume":"vol. 3","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/j.tcs.2014.04.024_br0190","series-title":"Orientations bipolaires","author":"Ossona de Mendez","year":"1994"},{"issue":"1","key":"10.1016\/j.tcs.2014.04.024_br0200","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1111\/j.1749-6632.1989.tb22470.x","article-title":"Embedding in the plane with orientation constraints: the angle graph","volume":"555","author":"Rosenstiehl","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/j.tcs.2014.04.024_br0210","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.tcs.2014.04.024_br0220","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","article-title":"Acyclic orientations of graphs","volume":"5","author":"Stanley","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2014.04.024_br0230","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representation of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514003296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514003296?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T11:59:13Z","timestamp":1538654353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514003296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":23,"alternative-id":["S0304397514003296"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.024","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the number of upward planar orientations of maximal planar graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.04.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}