{"id":"https://openalex.org/W2136451944","doi":"https://doi.org/10.1007/978-3-540-74839-7_15","title":"Approximation Algorithms for Geometric Intersection Graphs","display_name":"Approximation Algorithms for Geometric Intersection Graphs","publication_year":2007,"publication_date":"2007-12-06","ids":{"openalex":"https://openalex.org/W2136451944","doi":"https://doi.org/10.1007/978-3-540-74839-7_15","mag":"2136451944"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74839-7_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74839-7_15","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":"book-chapter","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Olshausenstr. 40, D-24098 Kiel, Germany","Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Kiel, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Olshausenstr. 40, D-24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.21630616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9919000267982483,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7299408912658691},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6568968892097473},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.6349866390228271},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5550042390823364},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5483121275901794},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5221962332725525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5199976563453674},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.513715386390686},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5034682154655457},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.46405068039894104},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.43054714798927307},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4203081727027893},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4185114800930023},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.41138404607772827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30775752663612366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23225250840187073},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13092583417892456}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7299408912658691},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6568968892097473},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.6349866390228271},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5550042390823364},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5483121275901794},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5221962332725525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5199976563453674},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.513715386390686},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5034682154655457},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.46405068039894104},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.43054714798927307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4203081727027893},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4185114800930023},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.41138404607772827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30775752663612366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23225250840187073},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13092583417892456},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-74839-7_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74839-7_15","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1970118687","https://openalex.org/W2028738060","https://openalex.org/W2030087828","https://openalex.org/W2056979696","https://openalex.org/W2063572899","https://openalex.org/W2064530627","https://openalex.org/W2065483028","https://openalex.org/W2065641139","https://openalex.org/W2073705438","https://openalex.org/W2088647669","https://openalex.org/W2094511120","https://openalex.org/W2110282707","https://openalex.org/W2139349113","https://openalex.org/W2156760067"],"related_works":["https://openalex.org/W1592899943","https://openalex.org/W2950770309","https://openalex.org/W2952205479","https://openalex.org/W4298855452","https://openalex.org/W2091843659","https://openalex.org/W2094511120","https://openalex.org/W2120229098","https://openalex.org/W2566327053","https://openalex.org/W3037291746","https://openalex.org/W2134616818"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}