{"id":"https://openalex.org/W2126883946","doi":"https://doi.org/10.3390/a8010060","title":"The Parameterized Complexity of the Rainbow Subgraph Problem","display_name":"The Parameterized Complexity of the Rainbow Subgraph Problem","publication_year":2015,"publication_date":"2015-02-27","ids":{"openalex":"https://openalex.org/W2126883946","doi":"https://doi.org/10.3390/a8010060","mag":"2126883946"},"language":"en","primary_location":{"id":"doi:10.3390/a8010060","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010060","pdf_url":"https://www.mdpi.com/1999-4893/8/1/60/pdf?version=1425049085","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/8/1/60/pdf?version=1425049085","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063644073","display_name":"Falk H\u00fcffner","orcid":"https://orcid.org/0000-0003-0017-1881"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Falk H\u00fcffner","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087168202","display_name":"Christian Komusiewicz","orcid":"https://orcid.org/0000-0003-0829-7032"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Komusiewicz","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061388353","display_name":"Martin R\u00f6tzschke","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin R\u00f6tzschke","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin, Ernst-Reuter-Platz 7, D-10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087168202"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.6694,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73791143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":"1","first_page":"60","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8311570882797241},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7456321716308594},{"id":"https://openalex.org/keywords/rainbow","display_name":"Rainbow","score":0.732354462146759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6102046370506287},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5910157561302185},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.5301626324653625},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5254399180412292},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4861447513103485},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.48399993777275085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47122418880462646},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.451806902885437},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4465385675430298},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.4231823682785034},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40396106243133545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21965575218200684},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21249014139175415},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1117195188999176},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08072370290756226},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0511784553527832}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8311570882797241},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7456321716308594},{"id":"https://openalex.org/C2776558979","wikidata":"https://www.wikidata.org/wiki/Q1052","display_name":"Rainbow","level":2,"score":0.732354462146759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6102046370506287},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5910157561302185},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.5301626324653625},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5254399180412292},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4861447513103485},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.48399993777275085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47122418880462646},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.451806902885437},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4465385675430298},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.4231823682785034},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40396106243133545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21965575218200684},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21249014139175415},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1117195188999176},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08072370290756226},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0511784553527832},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a8010060","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010060","pdf_url":"https://www.mdpi.com/1999-4893/8/1/60/pdf?version=1425049085","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.8349","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.8349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fpt.akt.tu-berlin.de/publications/rainbow-wg14.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:5e9fbe7d97ba43679b24df758bcad255","is_oa":true,"landing_page_url":"https://doaj.org/article/5e9fbe7d97ba43679b24df758bcad255","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 8, Iss 1, Pp 60-81 (2015)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/8/1/60/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a8010060","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a8010060","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8010060","pdf_url":"https://www.mdpi.com/1999-4893/8/1/60/pdf?version=1425049085","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1131356019","display_name":null,"funder_award_id":"HU 2139/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W204670952","https://openalex.org/W1494252438","https://openalex.org/W1517036688","https://openalex.org/W1519285721","https://openalex.org/W1922019929","https://openalex.org/W1967845089","https://openalex.org/W2012391569","https://openalex.org/W2045197802","https://openalex.org/W2045326192","https://openalex.org/W2051627428","https://openalex.org/W2058449810","https://openalex.org/W2074359677","https://openalex.org/W2077912839","https://openalex.org/W2080151389","https://openalex.org/W2097392213","https://openalex.org/W2116087731","https://openalex.org/W2123400463","https://openalex.org/W2169629105","https://openalex.org/W2170835539","https://openalex.org/W4205585032"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W1512756268","https://openalex.org/W2542507283","https://openalex.org/W2532922352","https://openalex.org/W2886672068","https://openalex.org/W167435155","https://openalex.org/W2035609387","https://openalex.org/W2953496651","https://openalex.org/W1887488684","https://openalex.org/W2604114816"],"abstract_inverted_index":{"The":[0],"NP-hard":[1],"RAINBOW":[2,36,47],"SUBGRAPH":[3,37,48],"problem,":[4],"motivated":[5],"from":[6],"bioinformatics,":[7],"is":[8,49,68,109],"to":[9,53,61],"find":[10],"in":[11,114],"an":[12],"edge-colored":[13,112],"graph":[14,108],"a":[15,82,110],"subgraph":[16],"that":[17,46],"contains":[18],"each":[19],"edge":[20],"color":[21,117],"exactly":[22],"once":[23],"and":[24,41,57,78,91],"has":[25],"at":[26,119],"most":[27,120],"\\(k\\)":[28,56],"vertices.":[29,72],"We":[30,44],"examine":[31,75],"the":[32,54,62,69,87,106],"parameterized":[33],"complexity":[34],"of":[35,71,94],"for":[38,80,86],"paths,":[39],"trees,":[40],"general":[42],"graphs.":[43],"show":[45,102],"W[1]-hard":[50],"with":[51,59,97],"respect":[52,60],"parameter":[55,64,76,89],"also":[58],"dual":[63],"\\(\\ell:=n-k\\)":[65],"where":[66],"\\(n\\)":[67],"number":[70,93],"Hence,":[73],"we":[74,101],"combinations":[77],"show,":[79],"example,":[81],"polynomial-size":[83],"problem":[84],"kernel":[85],"combined":[88],"\\(\\ell\\)":[90],"``maximum":[92],"colors":[95],"incident":[96],"any":[98],"vertex''.":[99],"Additionally,":[100],"APX-hardness":[103],"even":[104],"if":[105],"input":[107],"properly":[111],"path":[113],"which":[115],"every":[116],"occurs":[118],"twice.":[121]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}