{"id":"https://openalex.org/W2035471954","doi":"https://doi.org/10.1137/0222068","title":"An $O(m\\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem","display_name":"An $O(m\\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2035471954","doi":"https://doi.org/10.1137/0222068","mag":"2035471954"},"language":"en","primary_location":{"id":"doi:10.1137/0222068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222068","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102583280","display_name":"Jiazhen Cai","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiazhen Cai","raw_affiliation_strings":["New York University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017126504","display_name":"Xiaofeng Han","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaofeng Han","raw_affiliation_strings":["New York University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["New York University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":6.7208,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.96958002,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"22","issue":"6","first_page":"1142","last_page":"1162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6675516366958618},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6199138164520264},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5833695530891418},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5112600326538086},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5016815662384033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49403125047683716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47389334440231323},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4384806454181671},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.418617308139801},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41002246737480164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4009438157081604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3317454755306244},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22798123955726624}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6675516366958618},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6199138164520264},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5833695530891418},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5112600326538086},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5016815662384033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49403125047683716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47389334440231323},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4384806454181671},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.418617308139801},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41002246737480164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4009438157081604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3317454755306244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22798123955726624},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0222068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222068","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W175929181","https://openalex.org/W204417607","https://openalex.org/W1513400187","https://openalex.org/W1554000130","https://openalex.org/W1605190445","https://openalex.org/W1908738628","https://openalex.org/W1964700557","https://openalex.org/W1987374783","https://openalex.org/W2024491681","https://openalex.org/W2034463279","https://openalex.org/W2091252880","https://openalex.org/W2118382442","https://openalex.org/W3126328266"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W1482551403","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W2255102592"],"abstract_inverted_index":{"Previous":[0,422],"article":[1,3,423,425],"Next":[2,424],"An":[4,310,518,778,805,980],"$O(m\\log":[5,50],"n)$-Time":[6],"Algorithm":[7,522,683,730,806,882,963],"for":[8,68,107,265,312,363,430,450,523,594,619,643,684,709,731,782,807,823,964,984,1027,1095,1130,1145,1200,1219],"the":[9,39,69,378,401,431,595,666,711,825,856,865,1096,1146],"Maximal":[10,687,734],"Planar":[11,433,452,540,688,735,811,966],"Subgraph":[12,434,736],"ProblemJiazhen":[13],"Cai,":[14,21],"Xiaofeng":[15,22],"Han,":[16,23],"and":[17,24,41,62,75,100,128,153,174,179,184,196,215,236,257,282,306,324,340,359,365,455,483,505,528,544,626,740,788,793,863,948,989,1007,1024,1048,1101,1135,1202,1221],"Robert":[18,25,155,217,336,355],"E.":[19,26,234],"TarjanJiazhen":[20],"Tarjanhttps://doi.org/10.1137/0222068PDFBibTexSections":[27],"ToolsAdd":[28],"to":[29,53,287,377,665,1081],"favoritesExport":[30],"CitationTrack":[31],"CitationsEmail":[32],"SectionsAboutAbstractBased":[33],"on":[34,142,479,497,503,539,556,624,693,738,786,885,933,942,1011,1114,1184],"a":[35,55,289,383,686,714,733,828,935],"new":[36,639,899],"version":[37],"of":[38,144,241,315,317,380,382,404,437,546,564,578,713,750,827,873,945,968,982,987,1030,1111,1153,1168,1174],"Hopcroft":[40,214],"Tarjan":[42],"planarity":[43,77,133,220,313,900],"testing":[44,134,314],"algorithm,":[45],"this":[46],"paper":[47],"develops":[48],"an":[49,159],"n)$-time":[51],"algorithm":[52,106,311,468,593,642,708,781,822,1094,1129],"find":[54],"maximal":[56,290,936,1097,1132],"planar":[57,109,291,402,937,1046,1098,1133,1148],"subgraph.[1]":[58],"Kellogg":[59],"S.":[60,65,238,261,280,304],"Booth":[61],",":[63,94,97,101,129,154,175,197,216,237,254,258,279,283,303,307],"George":[64],"Lueker,":[66],"Testing":[67],"consecutive":[70],"ones":[71],"property,":[72],"interval":[73],"graphs,":[74],"graph":[76,266,342,466,985],"using":[78,111,469,560,939],"$PQ$-tree":[79],"algorithms,":[80,343],"J.":[81,113,222,345,374,408],"Comput.":[82,114,162,224],"System":[83,115,618],"Sci.,":[84,116,163,412],"13":[85],"(1976),":[86,165],"335\u2013379":[87],"55:6932":[88],"0367.68034":[89],"CrossrefISIGoogle":[90,123,232,275],"Scholar[2]":[91],"Norishige":[92],"Chiba,":[93],"Takao":[95,102],"Nishizeki,":[96],"Shigenobu":[98],"Abe":[99],"Ozawa,":[103],"A":[104,464,591,615,638,662,681,727,820,898,919,931,960,1078,1092,1126],"linear":[105,341,405,1093,1127],"embedding":[108],"graphs":[110,1029,1112],"$PQ$-trees,":[112],"30":[117],"(1985),":[118,414],"54\u201376":[119],"10.1016/0022-0000(85)90004-2":[120],"86g:05030":[121],"0605.68060":[122],"Scholar[3]":[124],"G.":[125,198],"Di":[126,1005],"Battista":[127,1006],"R.":[130,252],"Tamassia,":[131],"Incremental":[132],"(extended":[135],"abstract),":[136],"Proc.":[137],"30th":[138],"Annual":[139],"IEEE":[140,268,476],"Symposium":[141],"Foundations":[143],"Computer":[145,244,902,1118,1154],"Science,":[146,903],"1989,":[147],"436\u2013441":[148],"Google":[149,192,211,250,299,334,371,396,418],"Scholar[4]":[150],"Shimon":[151],"Even":[152,305],"Endre":[156],"Tarjan,":[157,218,337,356],"Computing":[158,484,527],"$st$-numbering,":[160],"Theoret.":[161],"2":[164,674,699,973,1121],"339\u2013344":[166],"10.1016/0304-3975(76)90086-4":[167],"54:2508":[168],"0341.68029":[169],"CrossrefGoogle":[170],"Scholar[5]":[171],"M.":[172,259],"Garey":[173],"D.":[176,194],"Johnson,":[177],"Computers":[178],"intractability,":[180],"W.":[181,398],"H.":[182],"Freeman":[183],"Co.,":[185],"San":[186],"Francisco,":[187],"Calif.,":[188],"1979x+338":[189],"80g:68056":[190],"0411.68039":[191],"Scholar[6]":[193],"Hall":[195],"Spencer,":[199],"Elementary":[200],"topology,":[201],"John":[202,213,386],"Wiley":[203,387],"&":[204,388,1210],"Sons":[205,389],"Inc.,":[206,390],"New":[207,326,391],"York,":[208,327,392],"1955xii+303":[209],"17,649a":[210],"Scholar[7]":[212],"Efficient":[219],"testing,":[221],"Assoc.":[223],"Mach.,":[225],"21":[226,458,815],"(1974),":[227],"549\u2013568":[228],"10.1145/321850.321852":[229],"50:11841":[230],"0307.68025":[231],"Scholar[8]":[233],"Horowitz":[235],"Sahni,":[239],"Fundamentals":[240],"Data":[242,357,1102],"Structure,":[243],"Science":[245,858,1119],"Press,":[246],"Rockville,":[247],"MD,":[248],"1983":[249],"Scholar[9]":[251],"Jayakumar,":[253],"K.":[255],"Thulasiraman":[256],"N.":[260,277,690],"Swamp,":[262],"$O(n^2)$":[263],"algorithms":[264],"planarization,":[267],"Trans.":[269],"CAD,":[270],"8":[271,1073],"(1989),":[272],"257\u2013267":[273],"10.1109/43.21845":[274],"Scholar[10]":[276],"Kobayashi,":[278],"Masuda":[281],"T.":[284],"Kashiwabara,":[285],"Algorithms":[286,429,454],"obtain":[288],"Hamilton":[292],"subgraph,":[293],"IEICE":[294],"Transactions,":[295],"E74":[296],"(1991),":[297],"657\u2013664":[298],"Scholar[11]":[300],"A.":[301],"Lempel,":[302],"I.":[308],"Cederbaum,":[309],"graphsTheory":[316],"Graphs":[318,843],"(Internat.":[319],"Sympos.,":[320],"Rome,":[321],"1966),":[322],"Gordon":[323],"Breach,":[325],"1967,":[328],"215\u2013232,":[329],"Italy,":[330],"July":[331,764,1019,1074,1193],"36:3669":[332],"0197.50204":[333],"Scholar[12]":[335],"Depth-first":[338],"search":[339,500],"SIAM":[344],"Comput.,":[346],"1":[347,487,511,531,550,570,586,610,633,676,701,722,743,773,800,836,877,893,909,926,955,975,995,997,1040,1057,1059,1087,1105,1161],"(1972),":[348],"146\u2013160":[349],"10.1137/0201010":[350],"46:3313":[351],"0251.05107":[352],"LinkGoogle":[353],"Scholar[13]":[354],"Structures":[358,1103],"Network":[360],"Algorithms,":[361,969],"Society":[362,1199],"Industrial":[364,1201,1220],"Applied":[366,1033,1203,1222],"Mathematics,":[367,580,695,1034,1155],"Philadelphia,":[368],"PA,":[369],"1984":[370],"Scholar[14]":[372],"Wolfgang":[373],"Thron,":[375],"Introduction":[376],"theory":[379],"functions":[381],"complex":[384],"variable,":[385],"1953x+230":[393],"14,857b":[394],"0050.07503":[395],"Scholar[15]":[397],"Wu,":[399],"On":[400],"imbedding":[403],"graphs.":[406],"I,":[407],"Systems":[409,789],"Sci.":[410],"Math.":[411],"5":[413,1016],"290\u2013302":[415],"87i:05091a":[416],"0601.05017":[417],"ScholarKeywordsalgorithmcomplexitydepth-first-searchembeddingplanar":[419],"graphselection":[420,1205],"tree":[421],"FiguresRelatedReferencesCited":[426],"ByDetails":[427],"Exact":[428],"Maximum":[432,451,1045],"ProblemACM":[435],"Journal":[436,563,692,1010,1152,1183],"Experimental":[438,565],"Algorithmics,":[439,566],"Vol.":[440,508,567,581,605,628,652,671,696,717,758,795,831,888,904,950,970,992,1013,1035,1054,1156],"24":[441],"|":[442,457,486,512,530,549,569,585,609,632,656,675,700,721,742,762,772,799,814,835,844,876,892,908,925,954,974,996,1017,1039,1058,1072,1086,1104,1120,1137,1160],"17":[443],"Dec":[444,488,571],"2019":[445],"Cross":[446,461,490,516,534,553,573,589,613,636,660,679,725,746,766,776,803,818,839,848,880,896,912,929,958,978,1000,1043,1062,1076,1090,1108,1124,1141,1164,1170,1176],"Ref":[447,462,491,517,535,554,574,590,614,637,661,680,726,747,767,777,804,819,840,849,881,897,913,930,959,979,1001,1044,1063,1077,1091,1109,1125,1142,1165,1171,1177],"Finding":[448,685,732,808,965],"Triangles":[449],"SubgraphsWALCOM:":[453],"Computation":[456],"February":[459,816],"2017":[460],"PMPSO:":[463],"near-optimal":[465],"planarization":[467,493,597,644,783],"probability":[470],"model":[471],"based":[472,496],"particle":[473],"swarm":[474],"optimization2015":[475],"International":[477],"Conference":[478],"Progress":[480],"in":[481,599,646,754,853,1117],"Informatics":[482],"(PIC)":[485],"2015":[489],"Graph":[492,524,541,620,850,1064,1166,1172],"problem":[494,598,1150],"optimization":[495],"triple-valued":[498],"gravitational":[499],"algorithmIEEJ":[501],"Transactions":[502,623,785,884,941],"Electrical":[504],"Electronic":[506],"Engineering,":[507],"9,":[509],"No.":[510,583,607,630,654,673,698,719,760,797,833,890,906,952,972,994,1015,1037,1056,1158],"9":[513,1138],"December":[514],"2013":[515],"Effective":[519],"Ant":[520],"Colony":[521],"Planarization":[525,621,1110],"ProblemBio-Inspired":[526],"Applications":[529],"Jan":[532,551,634,744,774,878,927,998,1162],"2012":[533],"Metamodel":[536],"Matching":[537],"Based":[538,737],"Edit":[542],"DistanceTheory":[543],"Practice":[545],"Model":[547],"Transformations":[548],"2010":[552],"Experiments":[555],"exact":[557],"crossing":[558,667],"minimization":[559],"column":[561],"generationACM":[562],"14":[568],"2009":[572,588,612,635],"Non-planar":[575],"core":[576],"reduction":[577],"graphsDiscrete":[579,1032],"309,":[582],"7":[584,953],"Apr":[587,611],"self-stabilizing":[592],"maximum":[596,1147],"complete":[600],"bipartite":[601],"networksInformation":[602],"Processing":[603],"Letters,":[604],"109,":[606],"10":[608],"Multi-Layered":[616],"Immune":[617],"ProblemIEICE":[622],"Information":[625,650,988],"Systems,":[627,949],"E92-D,":[629],"12":[631,655],"neural":[640],"network":[641],"problemsScience":[645],"China":[647],"Series":[648],"F:":[649],"Sciences,":[651,716,830,991],"51,":[653],"27":[657],"August":[658,702],"2008":[659,678],"branch-and-cut":[663],"approach":[664,1080],"number":[668],"problemDiscrete":[669],"Optimization,":[670],"5,":[672],"May":[677,976],"Linear-Time":[682],"SubgraphHristo":[689],"DjidjevSIAM":[691],"Discrete":[694],"20,":[697],"2006AbstractPDF":[703,1020],"(200":[704],"KB)A":[705],"simulated":[706],"annealing":[707],"determining":[710,824],"thickness":[712,826],"graphInformation":[715,829],"172,":[718],"1-2":[720,907,1038],"Jun":[723],"2005":[724,745,1075,1089,1107,1123,1140],"Linear":[728],"Time":[729],"PC-TreesComputing":[739],"Combinatorics":[741],"Automatic":[748],"Layout":[749],"UML":[751],"Class":[752],"Diagrams":[753],"Orthogonal":[755],"StyleInformation":[756],"Visualization,":[757],"3,":[759],"3":[761,798,891],"22":[763],"2004":[765,775],"Technical":[768],"FoundationsGraph":[769],"Drawing":[770,813,1085],"Software":[771,841],"efficient":[779],"parallel":[780],"problemIEEE":[784],"Circuits":[787,947],"I:":[790],"Fundamental":[791],"Theory":[792],"Applications,":[794],"49,":[796],"Mar":[801],"2002":[802,817],"Large":[809],"Induced":[810],"SubgraphsGraph":[812],"genetic":[821],"138,":[832],"1-4":[834],"Oct":[837],"2001":[838,847],"PackagesDrawing":[842],"25":[845],"April":[846,1190],"Drawing**Work":[851],"supported":[852],"part":[854],"by":[855,864],"National":[857],"Foundation":[859],"under":[860,870],"grant":[861,871],"CCR-9732327,":[862],"U.S.":[866],"Army":[867],"Research":[868,922],"Office":[869],"DAAH04-96-1-0013.Handbook":[872],"Computational":[874],"Geometry":[875],"2000":[879],"797ACM":[883],"Mathematical":[886],"Software,":[887],"25,":[889,1014],"Sep":[894],"1999":[895,911,928],"testTheoretical":[901],"223,":[905],"Jul":[910,956,1060],"The":[914],"Constrained":[915],"Crossing":[916],"Minimization":[917],"Problem":[918],"First":[920],"ApproachOperations":[921],"Proceedings":[923],"1998":[924,957,977],"note":[932],"computing":[934],"subgraph":[938,1099,1149],"PQ-treesIEEE":[940],"Computer-Aided":[943],"Design":[944],"Integrated":[946],"17,":[951],"Better":[961],"Approximation":[962],"SubgraphsJournal":[967],"27,":[971],"analysis":[981],"heuristics":[983],"planarizationJournal":[986],"Optimization":[990,1169,1175],"18,":[993],"1997":[999],"On-Line":[1002],"Planarity":[1003],"TestingGiuseppe":[1004],"Roberto":[1008],"TamassiaSIAM":[1009],"Computing,":[1012],"31":[1018],"(5139":[1021],"KB)Gap":[1022],"strings":[1023],"spanning":[1025],"forests":[1026],"bridge":[1028],"biconnected":[1031],"69,":[1036],"Aug":[1041],"1996":[1042,1061],"subgraphs":[1047],"nice":[1049],"embeddings:":[1050],"Practical":[1051],"layout":[1052],"toolsAlgorithmica,":[1053],"16,":[1055],"drawing":[1065],"methodsConceptual":[1066],"Structures:":[1067],"Knowledge":[1068],"Representation":[1069],"as":[1070],"Interlingua":[1071],"practical":[1079],"static":[1082],"node":[1083],"positioningGraph":[1084],"June":[1088,1106,1122,1139,1188],"problemAlgorithms":[1100],"embedded":[1113],"surfacesGraph-Theoretic":[1115],"Concepts":[1116],"time":[1128],"finding":[1131],"subgraphsAlgorithms":[1134],"Computations":[1136],"Branch-and-bound":[1143],"techniques":[1144],"\u2217International":[1151],"53,":[1157],"3-4":[1159],"1994":[1163],"PlanarizationEncyclopedia":[1167,1173],"Volume":[1178],"22,":[1179],"Issue":[1180],"6|":[1181],"1993SIAM":[1182],"Computing1117-1349":[1185],"History":[1186],"Submitted:05":[1187],"1989Accepted:01":[1189],"1992Published":[1191],"online:31":[1192],"2006":[1194],"InformationCopyright":[1195],"\u00a9":[1196,1198],"1993":[1197],"MathematicsKeywordsalgorithmcomplexitydepth-first-searchembeddingplanar":[1204],"treeMSC":[1206],"codes68R1068Q3594C15PDF":[1207],"Download":[1208],"Article":[1209],"Publication":[1211],"DataArticle":[1212],"DOI:10.1137/0222068Article":[1213],"page":[1214],"range:pp.":[1215],"1142-1162ISSN":[1216],"(print):0097-5397ISSN":[1217],"(online):1095-7111Publisher:Society":[1218],"Mathematics":[1223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}