{"id":"https://openalex.org/W2161076233","doi":"https://doi.org/10.1007/s00453-014-9956-7","title":"PTAS for Densest $$k$$ k -Subgraph in Interval Graphs","display_name":"PTAS for Densest $$k$$ k -Subgraph in Interval Graphs","publication_year":2014,"publication_date":"2014-11-13","ids":{"openalex":"https://openalex.org/W2161076233","doi":"https://doi.org/10.1007/s00453-014-9956-7","mag":"2161076233"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9956-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9956-7","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/A5084121765","display_name":"Tim Nonner","orcid":"https://orcid.org/0000-0001-7638-5689"},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Tim Nonner","raw_affiliation_strings":["IBM Research, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"IBM Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084121765"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0967,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.79881031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"74","issue":"1","first_page":"528","last_page":"539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9977999925613403,"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/mathematics","display_name":"Mathematics","score":0.7644110918045044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6908858418464661},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.682844340801239},{"id":"https://openalex.org/keywords/perl","display_name":"Perl","score":0.6603161096572876},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6009032726287842},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5762052536010742},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5447003841400146},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5299336314201355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5274348855018616},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5201035737991333},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4686300754547119},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4525829553604126},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.43425440788269043},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.43409276008605957},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42617279291152954},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41917794942855835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19595792889595032},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15089908242225647},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12372669577598572},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.11972546577453613},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06131380796432495}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7644110918045044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6908858418464661},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.682844340801239},{"id":"https://openalex.org/C2777002779","wikidata":"https://www.wikidata.org/wiki/Q42478","display_name":"Perl","level":2,"score":0.6603161096572876},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6009032726287842},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5762052536010742},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5447003841400146},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5299336314201355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5274348855018616},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5201035737991333},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4686300754547119},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4525829553604126},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.43425440788269043},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.43409276008605957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42617279291152954},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41917794942855835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19595792889595032},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15089908242225647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12372669577598572},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11972546577453613},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06131380796432495},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-014-9956-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9956-7","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":19,"referenced_works":["https://openalex.org/W31735291","https://openalex.org/W1519679194","https://openalex.org/W2006278018","https://openalex.org/W2007362596","https://openalex.org/W2021294212","https://openalex.org/W2026891055","https://openalex.org/W2030365814","https://openalex.org/W2032279394","https://openalex.org/W2034543148","https://openalex.org/W2036836182","https://openalex.org/W2063494850","https://openalex.org/W2065641139","https://openalex.org/W2091602684","https://openalex.org/W2100440346","https://openalex.org/W2125690626","https://openalex.org/W2153952206","https://openalex.org/W2165142526","https://openalex.org/W2952763838","https://openalex.org/W2975585596"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W2282273380","https://openalex.org/W4296570398","https://openalex.org/W1498460077","https://openalex.org/W2963588823","https://openalex.org/W2113826940","https://openalex.org/W2367468405","https://openalex.org/W4381707488","https://openalex.org/W2952985052","https://openalex.org/W1533352539"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}