{"id":"https://openalex.org/W2963278373","doi":"https://doi.org/10.4230/lipics.mfcs.2017.79","title":"Being Even Slightly Shallow Makes Life Hard","display_name":"Being Even Slightly Shallow Makes Life Hard","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2963278373","doi":"https://doi.org/10.4230/lipics.mfcs.2017.79","mag":"2963278373"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8125","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.79","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.79","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048273965","display_name":"Irene Muzi","orcid":"https://orcid.org/0000-0003-2410-6523"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Muzi, Irene","raw_affiliation_strings":["Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052381956","display_name":"Michael P. O\u2019Brien","orcid":"https://orcid.org/0000-0002-5942-791X"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O'Brien, Michael P.","raw_affiliation_strings":["North Carolina State University, Raleigh, United States"],"affiliations":[{"raw_affiliation_string":"North Carolina State University, Raleigh, United States","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049595624","display_name":"Felix Reidl","orcid":"https://orcid.org/0000-0002-2354-3003"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Reidl, Felix","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089650657","display_name":"Blair D. Sullivan","orcid":"https://orcid.org/0000-0001-7720-6208"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sullivan, Blair D.","raw_affiliation_strings":["North Carolina State University, Raleigh, United States"],"affiliations":[{"raw_affiliation_string":"North Carolina State University, Raleigh, United States","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048273965"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27636626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9886999726295471,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9110673666000366},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8471325635910034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5916730165481567},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5912865400314331},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5324795246124268},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46504083275794983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4642188549041748},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4499911367893219},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.44147688150405884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4323377013206482},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.4249376654624939},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3733366131782532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3496123254299164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3245447278022766},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.21344873309135437},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20914679765701294},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.12123259902000427},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.08003279566764832},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06925353407859802}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9110673666000366},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8471325635910034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5916730165481567},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5912865400314331},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5324795246124268},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46504083275794983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4642188549041748},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4499911367893219},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.44147688150405884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4323377013206482},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.4249376654624939},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3733366131782532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3496123254299164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3245447278022766},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.21344873309135437},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20914679765701294},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.12123259902000427},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.08003279566764832},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06925353407859802},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:8125","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.79","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.mfcs.2017.79","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2017.79","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8125","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.79","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2854233221","display_name":null,"funder_award_id":"GRAPHS","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4025889158","display_name":null,"funder_award_id":"GBMF4560","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"},{"id":"https://openalex.org/G6842393561","display_name":null,"funder_award_id":"N66001-14-1-4063","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306202","display_name":"Gordon and Betty Moore Foundation","ror":"https://ror.org/006wxqw41"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2810074797","https://openalex.org/W1934465368","https://openalex.org/W2000945011","https://openalex.org/W2949695375","https://openalex.org/W2266466481","https://openalex.org/W2073919081","https://openalex.org/W2951583101","https://openalex.org/W2521882261","https://openalex.org/W2143396993","https://openalex.org/W2078929674","https://openalex.org/W2964045964","https://openalex.org/W2973480363","https://openalex.org/W2040015059","https://openalex.org/W2950526382","https://openalex.org/W2086859323","https://openalex.org/W1988197393","https://openalex.org/W2951159125","https://openalex.org/W3137019665","https://openalex.org/W2898526288","https://openalex.org/W1498274310"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,19,54,93,96],"computational":[3],"complexity":[4],"of":[5,32,95],"identifying":[6],"dense":[7],"substructures,":[8],"namely":[9],"r/2-shallow":[10],"topological":[11],"minors":[12],"and":[13,65],"r-subdivisions.":[14],"Of":[15],"particular":[16],"interest":[17],"is":[18],"case":[20],"r":[21,72,100],"=":[22,73],"1,":[23],"when":[24,90],"these":[25,46],"substructures":[26],"correspond":[27],"to":[28],"very":[29,76],"localized":[30],"relaxations":[31,48],"subgraphs.":[33],"Since":[34],"Densest":[35],"Subgraph":[36],"can":[37],"be":[38],"solved":[39],"in":[40,75],"polynomial":[41],"time,":[42],"we":[43,56],"ask":[44],"whether":[45],"slight":[47],"also":[49],"admit":[50,83],"efficient":[51],"algorithms.":[52],"In":[53],"following,":[55],"provide":[57],"a":[58],"negative":[59],"answer:":[60],"Dense":[61,66],"r/2-Shallow":[62],"Topological":[63],"Minor":[64],"r-Subdivsion":[67],"are":[68],"already":[69],"NP-hard":[70],"for":[71,99],"1":[74],"sparse":[77],"graphs.":[78],"Further,":[79],"they":[80],"do":[81],"not":[82],"algorithms":[84],"with":[85],"running":[86],"time":[87],"2^(o(tw^2))":[88],"n^O(1)":[89],"parameterized":[91],"by":[92],"treewidth":[94],"input":[97],"graph":[98],">":[101],"2":[102],"unless":[103],"ETH":[104],"fails.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}