{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T02:58:33Z","timestamp":1770433113913,"version":"3.49.0"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,10]]},"abstract":"<jats:p> In this paper we consider the problem of testing an arbitrary digraph G = (V,E) for upward planarity. In particular we describe two fixed-parameter tractable algorithms for testing the upward planarity of G. The first algorithm that we present can test the upward planarity of G in O(2<jats:sup>t<\/jats:sup> \u00b7 t! \u00b7 |V|<jats:sup>2<\/jats:sup>)-time where t is the number of triconnected components of G. The second algorithm that we present uses a standard technique known as kernelisation and can test the upward planarity of G in O(|V|<jats:sup>2<\/jats:sup> + k<jats:sup>4<\/jats:sup> \u00b7 (2k)!)-time, where k = |E| - |V|. <\/jats:p>","DOI":"10.1142\/s0129054106004285","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T12:04:43Z","timestamp":1158581083000},"page":"1095-1114","source":"Crossref","is-referenced-by-count":16,"title":["TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY"],"prefix":"10.1142","volume":"17","author":[{"given":"PATRICK","family":"HEALY","sequence":"first","affiliation":[{"name":"Department of Computer Science and Informations Systems, University of Limerick, Limerick, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KAROL","family":"LYNCH","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Informations Systems, University of Limerick, Limerick, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0083-x"},{"key":"rf2","first-page":"476","volume":"6","author":"Bertolazzi P.","journal-title":"Algorithmica"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279626"},{"key":"rf5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista G.","year":"1999"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90123-5"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s004539900017"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794280736"},{"key":"rf11","series-title":"Monographs in Computer Science","volume-title":"Parameterized Complexity","author":"Downey R. G.","year":"1997"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01108622"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794277123"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235906"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90008-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:39Z","timestamp":1565138439000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":13,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1142\/S0129054106004285"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004285","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}