{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T18:27:46Z","timestamp":1703010466872},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,6]]},"abstract":"<jats:p>A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs. In this paper we study monotone drawings of series\u2013parallel graphs in a variable embedding setting. We show that a series\u2013parallel graph of n vertices has a straight-line planar monotone drawing on a grid of size O(n) \u00d7 O(n<jats:sup>2<\/jats:sup>) and such a drawing can be found in linear time.<\/jats:p>","DOI":"10.1142\/s179383091550007x","type":"journal-article","created":{"date-parts":[[2015,1,22]],"date-time":"2015-01-22T08:34:41Z","timestamp":1421915681000},"page":"1550007","source":"Crossref","is-referenced-by-count":2,"title":["Straight-line monotone grid drawings of series\u2013parallel graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Md.","family":"Iqbal Hossain","sequence":"first","affiliation":[{"name":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh"}]},{"given":"Md.","family":"Saidur Rahman","sequence":"additional","affiliation":[{"name":"Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh"}]}],"member":"219","published-online":{"date-parts":[[2015,5,25]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00249"},{"key":"rf5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista G.","year":"1999"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90123-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/s004539900017"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009264"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00059-1"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/5648"},{"key":"rf13","series-title":"Discrete Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook of Graph Drawing and Visualization","author":"Tamassia R.","year":"2013"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091550007X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T06:27:18Z","timestamp":1598682438000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091550007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,25]]},"references-count":8,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2015,5,25]]},"published-print":{"date-parts":[[2015,6]]}},"alternative-id":["10.1142\/S179383091550007X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091550007x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,25]]}}}