{"id":"https://openalex.org/W2081642180","doi":"https://doi.org/10.1007/s00453-012-9671-1","title":"Approximation Algorithms for Intersection Graphs","display_name":"Approximation Algorithms for Intersection Graphs","publication_year":2012,"publication_date":"2012-07-03","ids":{"openalex":"https://openalex.org/W2081642180","doi":"https://doi.org/10.1007/s00453-012-9671-1","mag":"2081642180"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9671-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9671-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5078740848","display_name":"Frank Kammer","orcid":"https://orcid.org/0000-0002-2662-3471"},"institutions":[{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]},{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Frank Kammer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Augsburg University, Universit\u00e4tsstr. 6a, 86159, Augsburg, Germany","Augsburg Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Augsburg University, Universit\u00e4tsstr. 6a, 86159, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Augsburg Univ","institution_ids":["https://openalex.org/I119916105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077112807","display_name":"Torsten Tholey","orcid":null},"institutions":[{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]},{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Torsten Tholey","raw_affiliation_strings":["Institut f\u00fcr Informatik, Augsburg University, Universit\u00e4tsstr. 6a, 86159, Augsburg, Germany","Augsburg Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Augsburg University, Universit\u00e4tsstr. 6a, 86159, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Augsburg Univ","institution_ids":["https://openalex.org/I119916105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077112807"],"corresponding_institution_ids":["https://openalex.org/I119916105","https://openalex.org/I179225836"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.9128,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.91338583,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"68","issue":"2","first_page":"312","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8036377429962158},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7735135555267334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7563624382019043},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6313728094100952},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5878936648368835},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5567910075187683},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5545008182525635},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5346454977989197},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5221331715583801},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5218523740768433},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48343098163604736},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4692753851413727},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.44074100255966187},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4284304976463318},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42352625727653503},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4147527813911438},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2938111424446106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21547406911849976},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.18116429448127747}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8036377429962158},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7735135555267334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7563624382019043},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6313728094100952},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5878936648368835},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5567910075187683},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5545008182525635},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5346454977989197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5221331715583801},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5218523740768433},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48343098163604736},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4692753851413727},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.44074100255966187},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4284304976463318},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42352625727653503},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4147527813911438},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2938111424446106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21547406911849976},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.18116429448127747},{"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.1007/s00453-012-9671-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9671-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1482161067","https://openalex.org/W1492613353","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1576548681","https://openalex.org/W1964336531","https://openalex.org/W1973310391","https://openalex.org/W1975731451","https://openalex.org/W1983151348","https://openalex.org/W2005412366","https://openalex.org/W2013451793","https://openalex.org/W2021754931","https://openalex.org/W2028357390","https://openalex.org/W2028738060","https://openalex.org/W2030087828","https://openalex.org/W2031149390","https://openalex.org/W2031347356","https://openalex.org/W2038225707","https://openalex.org/W2053372822","https://openalex.org/W2054897957","https://openalex.org/W2059372025","https://openalex.org/W2063572899","https://openalex.org/W2069532962","https://openalex.org/W2086551550","https://openalex.org/W2094511120","https://openalex.org/W2095263228","https://openalex.org/W2095785938","https://openalex.org/W2103985627","https://openalex.org/W2106322572","https://openalex.org/W2117624717","https://openalex.org/W2134616818","https://openalex.org/W2139349113","https://openalex.org/W2143474538","https://openalex.org/W2147465311","https://openalex.org/W2320198223","https://openalex.org/W2571163292","https://openalex.org/W2610183793","https://openalex.org/W2610782124","https://openalex.org/W2913688336","https://openalex.org/W2914843939","https://openalex.org/W3176255773","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2359923140","https://openalex.org/W3037291746","https://openalex.org/W3164644441","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2991587872","https://openalex.org/W3118753906","https://openalex.org/W2561239406","https://openalex.org/W2954109725"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}