{"id":"https://openalex.org/W2136923206","doi":"https://doi.org/10.1145/2213977.2213996","title":"Structure theorem and isomorphism test for graphs with excluded topological subgraphs","display_name":"Structure theorem and isomorphism test for graphs with excluded topological subgraphs","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2136923206","doi":"https://doi.org/10.1145/2213977.2213996","mag":"2136923206"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2213996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","[Humboldt Universitat zu Berlin, Berlin, Germany]"],"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"[Humboldt Universitat zu Berlin, Berlin, Germany]","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","Computer and Automation Research Institute, Hungarian Academy of Sciences, (MTA SZTAKI), Budapest, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences, (MTA SZTAKI), Budapest, Hungary#TAB#","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":12.1141,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.99091535,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9991999864578247,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.77013099193573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7021105289459229},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6839837431907654},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6824606657028198},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5655012130737305},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4776681363582611},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4502328634262085},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4339856803417206},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.31141459941864014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30215156078338623},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3017895221710205},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.178390234708786},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08463019132614136}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.77013099193573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7021105289459229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6839837431907654},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6824606657028198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5655012130737305},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4776681363582611},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4502328634262085},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4339856803417206},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.31141459941864014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30215156078338623},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3017895221710205},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.178390234708786},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08463019132614136},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2213996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W132145278","https://openalex.org/W179577048","https://openalex.org/W1553391053","https://openalex.org/W1812837484","https://openalex.org/W1965012931","https://openalex.org/W1965737603","https://openalex.org/W1967546560","https://openalex.org/W1973322735","https://openalex.org/W1974672137","https://openalex.org/W1988652875","https://openalex.org/W1998811202","https://openalex.org/W2005079828","https://openalex.org/W2013522700","https://openalex.org/W2015321560","https://openalex.org/W2016588822","https://openalex.org/W2021156120","https://openalex.org/W2026005637","https://openalex.org/W2035409201","https://openalex.org/W2039732465","https://openalex.org/W2047871605","https://openalex.org/W2067016370","https://openalex.org/W2075516513","https://openalex.org/W2078674325","https://openalex.org/W2112686605","https://openalex.org/W2115607023","https://openalex.org/W2119044694","https://openalex.org/W2121641644","https://openalex.org/W2129907634","https://openalex.org/W2130481157","https://openalex.org/W2159366821","https://openalex.org/W2160167461","https://openalex.org/W2253740506","https://openalex.org/W2336629689","https://openalex.org/W2743930031","https://openalex.org/W2991385428"],"related_works":["https://openalex.org/W2339922093","https://openalex.org/W2169699292","https://openalex.org/W1971319751","https://openalex.org/W2079856162","https://openalex.org/W2131850161","https://openalex.org/W2172037773","https://openalex.org/W4299444428","https://openalex.org/W2559777123","https://openalex.org/W4292501833","https://openalex.org/W2092103617"],"abstract_inverted_index":{"We":[0,27],"generalize":[1],"the":[2,62],"structure":[3],"theorem":[4],"of":[5,64,68],"Robertson":[6],"and":[7],"Seymour":[8],"for":[9,30],"graphs":[10,20],"excluding":[11,21,36],"a":[12,17,24,31,39,43,54,65,72],"fixed":[13,32,55],"graph":[14,35],"H":[15,22,37],"as":[16,23,38],"minor":[18],"to":[19,53],"topological":[25,40],"subgraph.":[26],"prove":[28],"that":[29,79],"H,":[33],"every":[34],"subgraph":[41],"has":[42,58],"tree":[44],"decomposition":[45,73],"where":[46],"each":[47],"part":[48],"is":[49,74,80],"either":[50],"\"almost":[51],"embeddable\"":[52],"surface":[56],"or":[57],"bounded":[59,66],"degree":[60],"with":[61,83],"exception":[63],"number":[67],"vertices.":[69],"Furthermore,":[70],"such":[71],"computable":[75],"by":[76],"an":[77],"algorithm":[78],"fixed-parameter":[81],"tractable":[82],"parameter":[84],"|H|.":[85]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}