{"id":"https://openalex.org/W7166899526","doi":"https://doi.org/10.4230/lipics.icalp.2026.137","title":"Determining the Outerthickness of Graphs Is NP-Hard","display_name":"Determining the Outerthickness of Graphs Is NP-Hard","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166899526","doi":"https://doi.org/10.4230/lipics.icalp.2026.137"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26526","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.137","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.137/LIPIcs.ICALP.2026.137.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.137/LIPIcs.ICALP.2026.137.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125540713","display_name":"Pin-Hsian Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lee, Pin-Hsian","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0009-0009-2677-4614","affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139849902","display_name":"Te-Cheng Liu","orcid":"https://orcid.org/0009-0002-3031-3238"},"institutions":[{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Liu, Te-Cheng","raw_affiliation_strings":["Academia Sinica, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0009-0002-3031-3238","affiliations":[{"raw_affiliation_string":"Academia Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I84653119"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064418445","display_name":"Meng-Tsung Tsai","orcid":"https://orcid.org/0000-0002-2243-8666"},"institutions":[{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsai, Meng-Tsung","raw_affiliation_strings":["Academia Sinica, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-2243-8666","affiliations":[{"raw_affiliation_string":"Academia Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I84653119"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72985696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8870999813079834,"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.8870999813079834,"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.03849999979138374,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.025699999183416367,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/partition","display_name":"Partition (number theory)","score":0.49459999799728394},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4903999865055084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45320001244544983},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4011000096797943},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.39469999074935913},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.39250001311302185},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3921000063419342},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.38670000433921814},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.3499999940395355},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.34709998965263367}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7976999878883362},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7501000165939331},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5856999754905701},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4903999865055084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4011000096797943},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.39469999074935913},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.38670000433921814},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.34709998965263367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.31839999556541443},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.30239999294281006},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2896000146865845},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2842000126838684},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27630001306533813},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.26660001277923584},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.2540000081062317},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26526","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.137","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.137/LIPIcs.ICALP.2026.137.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.137","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.137","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26526","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.137","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.137/LIPIcs.ICALP.2026.137.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.41534700989723206}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166899526.pdf","grobid_xml":"https://content.openalex.org/works/W7166899526.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,14,21,37,50,171],"short,":[3],"self-contained,":[4],"and":[5,133,167],"easily":[6],"verifiable":[7],"proof":[8],"that":[9,87,99,140,147,249,318],"determining":[10,212],"the":[11,26,71,76,109,151,176,195,204,209,219,233,239,252,261,274,286,302,321],"outerthickness":[12],"of":[13,29,111,150,173,197,211,221,251,263,276,288,297,320],"general":[15,39],"graph":[16,52,66,144],"is":[17,73,102,108,156,163,180,245,256,260,273,285,306],"NP-hard.":[18],"This":[19],"resolves":[20],"long-standing":[22,205],"open":[23,206],"problem":[24,41,177,207,303],"on":[25,208],"computational":[27],"complexity":[28,210],"outerthickness.":[30,213],"Moreover,":[31],"our":[32,201,225],"hardness":[33],"result":[34,138,202,226,230],"applies":[35,236],"to":[36,74,96,194,218,238],"more":[38],"covering":[40,132],"P_{\u2131,":[42,178,304],"k},":[43],"defined":[44],"as":[45],"follows.":[46],"Let":[47,54],"\u2131":[48,101,107,146,155,162,169,192,216,259,272,284],"be":[49,58,119,325],"proper":[51,143],"class.":[53],"k":[55,83,185,241,314],"\u2265":[56,186,315],"1":[57],"an":[59,63,122],"integer":[60,184,313],"parameter.":[61],"Given":[62],"undirected":[64],"simple":[65],"G":[67],"=":[68,242,329],"(V,":[69],"E),":[70],"task":[72],"cover":[75,117],"edge":[77,123],"set":[78],"E(G)":[79],"by":[80,125],"at":[81],"most":[82],"subsets":[84],"E\u2081,\u2026,E_k":[85],"such":[86,116],"each":[88,250,296],"subgraph":[89],"(V(G),E_i)":[90],"for":[91,141,182,232,311],"i":[92],"\u2208":[93],"[k]":[94],"belongs":[95],"\u2131.":[97],"Note":[98],"if":[100],"monotone":[103],"(in":[104],"particular,":[105],"when":[106],"class":[110,145,196,220,262,275,287],"all":[112,149,198,222,264,277,289],"outerplanar":[113,199],"graphs),":[114],"any":[115],"can":[118,324],"converted":[120],"into":[121],"partition":[124],"deleting":[126],"overlaps;":[127],"hence,":[128],"in":[129,308],"this":[130],"case,":[131],"partitioning":[134],"are":[135],"equivalent.":[136],"Our":[137],"shows":[139],"every":[142,183,312],"satisfies":[148],"following":[152],"conditions:":[153],"(a)":[154,269],"closed":[157,164],"under":[158,165],"topological":[159],"minors,":[160],"(b)":[161,281],"1-sums,":[166],"(c)":[168,293],"contains":[170],"cycle":[172],"length":[174],"3,":[175,316],"k}":[179,305],"NP-hard":[181],"3.":[187],"In":[188],"particular:":[189],"-":[190,214],"For":[191,215,295],"equal":[193,217],"graphs,":[200,224,266],"settles":[203],"planar":[223],"complements":[227],"Mansfield\u2019s":[228],"NP-hardness":[229],"(1983)":[231],"thickness,":[234],"which":[235],"only":[237],"case":[240],"2.":[243],"It":[244],"also":[246],"worth":[247],"noting":[248],"three":[253,299,322],"conditions":[254,323],"above":[255],"necessary.":[257],"If":[258,271,283],"eulerian":[265],"then":[267,279,291],"condition":[268,280,292],"fails.":[270,282,294],"pseudoforests,":[278],"forests,":[290],"these":[298],"classes":[300],"\u2131,":[301],"solvable":[307],"polynomial":[309],"time":[310],"showing":[317],"none":[319],"dropped":[326],"unless":[327],"P":[328],"NP.":[330]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2026-07-02T00:00:00"}