{"id":"https://openalex.org/W2569617229","doi":"https://doi.org/10.1007/978-3-642-32589-2_41","title":"Obtaining Planarity by Contracting Few Edges","display_name":"Obtaining Planarity by Contracting Few Edges","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2569617229","doi":"https://doi.org/10.1007/978-3-642-32589-2_41","mag":"2569617229"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-32589-2_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1157379","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017522059","display_name":"Pim van \u2019t Hof","orcid":"https://orcid.org/0000-0002-1778-7212"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Pim van \u2019t Hof","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Durham University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7147,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83625538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"455","last_page":"466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9962000250816345,"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.9868000149726868,"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/planarity-testing","display_name":"Planarity testing","score":0.9357703328132629},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8864312767982483},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6993502378463745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6740885972976685},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.5987574458122253},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5399224162101746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5305766463279724},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5077970623970032},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.4825977087020874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40414294600486755},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3784274756908417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3241698145866394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24472752213478088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23875412344932556},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12044304609298706},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.09443801641464233},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06894135475158691},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.04566827416419983}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9357703328132629},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8864312767982483},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6993502378463745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6740885972976685},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.5987574458122253},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5399224162101746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5305766463279724},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5077970623970032},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.4825977087020874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40414294600486755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3784274756908417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3241698145866394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24472752213478088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23875412344932556},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12044304609298706},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.09443801641464233},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06894135475158691},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.04566827416419983},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-32589-2_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-32589-2_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:10691","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/10691/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Rovan, Branislav & Sassone, Vladimiro & Widmayer, Peter (Eds.). Mathematical foundations of computer science 2012 : 37th international symposium, MFCS 2012, Bratislava, Slovakia, 27-31 August 2012 ; proceedings. Berlin ; Heidelberg: Springer, pp. 455-466, Lecture notes in computer science(7464)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1157379","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1157379","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1157379","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1157379","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1111885211","display_name":null,"funder_award_id":"EP/G043434/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1495415187","https://openalex.org/W1584371244","https://openalex.org/W1913947078","https://openalex.org/W1981591809","https://openalex.org/W2005079828","https://openalex.org/W2018046803","https://openalex.org/W2028357390","https://openalex.org/W2046069847","https://openalex.org/W2047577363","https://openalex.org/W2059590924","https://openalex.org/W2062347470","https://openalex.org/W2067016370","https://openalex.org/W2085348754","https://openalex.org/W2111720465","https://openalex.org/W2168568667","https://openalex.org/W2174231092","https://openalex.org/W2180411372","https://openalex.org/W2184583947","https://openalex.org/W2399921471","https://openalex.org/W4252125530"],"related_works":["https://openalex.org/W4390681428","https://openalex.org/W4386269540","https://openalex.org/W2373079339","https://openalex.org/W2108284102","https://openalex.org/W3047848516","https://openalex.org/W4287691299","https://openalex.org/W183093845","https://openalex.org/W4297837089","https://openalex.org/W2959817076","https://openalex.org/W3134933682"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}