{"id":"https://openalex.org/W2125652787","doi":"https://doi.org/10.1007/s10732-005-6999-6","title":"Heuristics for the Maximum Outerplanar Subgraph Problem","display_name":"Heuristics for the Maximum Outerplanar Subgraph Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2125652787","doi":"https://doi.org/10.1007/s10732-005-6999-6","mag":"2125652787"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-005-6999-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-005-6999-6","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","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/A5010118561","display_name":"Timo Poranen","orcid":"https://orcid.org/0000-0002-4638-0243"},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]},{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Timo Poranen","raw_affiliation_strings":["Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Finland","Department of Computer Sciences, University of Tampere, Finland FIN-33014"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Finland","institution_ids":["https://openalex.org/I4210133110"]},{"raw_affiliation_string":"Department of Computer Sciences, University of Tampere, Finland FIN-33014","institution_ids":["https://openalex.org/I166825849","https://openalex.org/I4210133110"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010118561"],"corresponding_institution_ids":["https://openalex.org/I166825849","https://openalex.org/I4210133110"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3372,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64133856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"1","first_page":"59","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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.998199999332428,"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.9980000257492065,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7250241041183472},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6795449256896973},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6731641888618469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6362608671188354},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5529416799545288},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4921719431877136},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4777452349662781},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47737643122673035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4036276936531067},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37785136699676514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3492405414581299}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7250241041183472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6795449256896973},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6731641888618469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6362608671188354},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5529416799545288},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4921719431877136},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4777452349662781},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47737643122673035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4036276936531067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37785136699676514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3492405414581299}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10732-005-6999-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-005-6999-6","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.5,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320335230","display_name":"Centre International de Math\u00e9matiques et Informatique de Toulouse","ror":"https://ror.org/017tgbk05"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W112131548","https://openalex.org/W1535967299","https://openalex.org/W1543889792","https://openalex.org/W1559215823","https://openalex.org/W1564988587","https://openalex.org/W1593394816","https://openalex.org/W1602956586","https://openalex.org/W1968592790","https://openalex.org/W1969131636","https://openalex.org/W1981470489","https://openalex.org/W1983272724","https://openalex.org/W1987374783","https://openalex.org/W1999602035","https://openalex.org/W2000109702","https://openalex.org/W2000695501","https://openalex.org/W2003965618","https://openalex.org/W2005574100","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2036037092","https://openalex.org/W2043664398","https://openalex.org/W2045027193","https://openalex.org/W2056760934","https://openalex.org/W2066623726","https://openalex.org/W2075541196","https://openalex.org/W2089070935","https://openalex.org/W2093092867","https://openalex.org/W2106171305","https://openalex.org/W2106371135","https://openalex.org/W2111635834","https://openalex.org/W2128193809","https://openalex.org/W2148824790","https://openalex.org/W2153638045","https://openalex.org/W2171261902","https://openalex.org/W2171776966","https://openalex.org/W2182183823","https://openalex.org/W2608641272","https://openalex.org/W2799004609","https://openalex.org/W3161745826","https://openalex.org/W4285719527","https://openalex.org/W4302422232","https://openalex.org/W6629172744","https://openalex.org/W6631722374","https://openalex.org/W6636112748","https://openalex.org/W6675709134","https://openalex.org/W6685168693","https://openalex.org/W6685687180"],"related_works":["https://openalex.org/W2084470113","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W3119129187","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2067280619","https://openalex.org/W2041180560"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}