{"id":"https://openalex.org/W2113684989","doi":"https://doi.org/10.1007/978-3-642-28050-4_19","title":"Parameterized Maximum Path Coloring","display_name":"Parameterized Maximum Path Coloring","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2113684989","doi":"https://doi.org/10.1007/978-3-642-28050-4_19","mag":"2113684989"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28050-4_19","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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kth.diva-portal.org/smash/get/diva2:473377/FULLTEXT01","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["GRADUATE CENTER, CITY UNIVERSITY OF NEW YORK"],"affiliations":[{"raw_affiliation_string":"GRADUATE CENTER, CITY UNIVERSITY OF NEW YORK","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":1.242,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"245"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9997,"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":"Graph Theory and Algorithms","score":0.9997,"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.9956,"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":"Combinatorial Optimization and Complexity Theory","score":0.9888,"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/parameterized-complexity","display_name":"Parameterized Complexity","score":0.610512},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge Coloring","score":0.559553},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph Labeling","score":0.521702},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.507963},{"id":"https://openalex.org/keywords/constraint-satisfaction-problems","display_name":"Constraint Satisfaction Problems","score":0.501032}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.89625597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.77583426},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6068509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35192072},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08047339}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28050-4_19","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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58575","pdf_url":"https://kth.diva-portal.org/smash/get/diva2:473377/FULLTEXT01","source":{"id":"https://openalex.org/S4306401560","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58575","pdf_url":"https://kth.diva-portal.org/smash/get/diva2:473377/FULLTEXT01","source":{"id":"https://openalex.org/S4306401560","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1876564799","https://openalex.org/W1985572324","https://openalex.org/W1987681136","https://openalex.org/W1992479755","https://openalex.org/W2000227351","https://openalex.org/W2012200612","https://openalex.org/W2019062750","https://openalex.org/W2019905418","https://openalex.org/W2021180976","https://openalex.org/W2062769315","https://openalex.org/W2074937107","https://openalex.org/W2075594733","https://openalex.org/W2142055019","https://openalex.org/W2296148711","https://openalex.org/W2913688336","https://openalex.org/W36639738","https://openalex.org/W4292230561","https://openalex.org/W85139696"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4255576661","https://openalex.org/W2748952813","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W2132921321","https://openalex.org/W2051058708","https://openalex.org/W1983207144","https://openalex.org/W154868527","https://openalex.org/W1494268238"],"abstract_inverted_index":{"We":[0,20],"study":[1,77],"the":[2,22,31,35,41,44,50,65,73,82],"well-known":[3],"Max":[4],"Path":[5],"Coloring":[6],"problem":[7,83],"from":[8],"a":[9,25],"parameterized":[10,79],"point":[11],"of":[12,24,27,40,46,52,67,69,81],"view,":[13],"focusing":[14],"on":[15,72],"trees":[16],"and":[17,38,49,87,93],"low-treewidth":[18],"networks.":[19],"observe":[21],"existence":[23],"variety":[26],"reasonable":[28],"parameters":[29,71],"for":[30,91],"problem,":[32],"such":[33],"as":[34],"maximum":[36],"degree":[37],"treewidth":[39],"network":[42],"graph,":[43],"number":[45,51],"available":[47],"colors":[48],"requests":[53],"one":[54],"seeks":[55],"to":[56,63],"satisfy":[57],"or":[58],"reject.":[59],"In":[60],"an":[61],"effort":[62],"understand":[64],"impact":[66],"each":[68],"these":[70],"problem's":[74],"complexity":[75],"we":[76],"various":[78],"versions":[80],"deriving":[84],"fixed-parameter":[85],"tractability":[86],"hardness":[88],"results":[89],"both":[90],"undirected":[92],"bi-directed":[94],"graphs.":[95]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2113684989","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-10-05T20:15:21.326769","created_date":"2016-06-24"}
