{"id":"https://openalex.org/W3019043336","doi":"https://doi.org/10.1007/978-3-030-42071-0_11","title":"Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices","display_name":"Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3019043336","doi":"https://doi.org/10.1007/978-3-030-42071-0_11","mag":"3019043336"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-42071-0_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-42071-0_11","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/bitstream/handle/1874/414803/Nederlof2020_Chapter_AlgorithmsForNP_HardProblemsVi.pdf?sequence=1&isAllowed=y","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Eindhoven University of Technology, Utrecht University, Utrecht, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353","https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353","https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3369,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42290371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"164"},"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.9991000294685364,"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.9980000257492065,"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/rank","display_name":"Rank (graph theory)","score":0.7787691354751587},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6609069108963013},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6105584502220154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5830150842666626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5240076780319214},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.377913236618042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3330111801624298},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2588057219982147},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11284980177879333}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7787691354751587},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6609069108963013},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6105584502220154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5830150842666626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5240076780319214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.377913236618042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3330111801624298},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2588057219982147},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11284980177879333}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-42071-0_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-42071-0_11","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"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/9fb53159-9c2f-4c67-b721-bf53ae22ceca","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/9fb53159-9c2f-4c67-b721-bf53ae22ceca","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nederlof, J 2020, Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. in F V Fomin, S Kratsch & E J van Leeuwen (eds), Treewidth, Kernels, and Algorithms : Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 12160 LNCS, Springer, pp. 145-164. https://doi.org/10.1007/978-3-030-42071-0_11","raw_type":"info:eu-repo/semantics/bookPart"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/414803","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/414803","pdf_url":"https://dspace.library.uu.nl/bitstream/handle/1874/414803/Nederlof2020_Chapter_AlgorithmsForNP_HardProblemsVi.pdf?sequence=1&isAllowed=y","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Treewidth, Kernels, and Algorithms, 12160, 145. Springer Cham","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/414803","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/414803","pdf_url":"https://dspace.library.uu.nl/bitstream/handle/1874/414803/Nederlof2020_Chapter_AlgorithmsForNP_HardProblemsVi.pdf?sequence=1&isAllowed=y","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Treewidth, Kernels, and Algorithms, 12160, 145. Springer Cham","raw_type":"info:eu-repo/semantics/bookpart"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3019043336.pdf","grobid_xml":"https://content.openalex.org/works/W3019043336.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W47137029","https://openalex.org/W366602458","https://openalex.org/W1561337879","https://openalex.org/W1586904125","https://openalex.org/W1808823193","https://openalex.org/W1842913573","https://openalex.org/W1968952709","https://openalex.org/W1982283204","https://openalex.org/W2058511514","https://openalex.org/W2059273723","https://openalex.org/W2119741712","https://openalex.org/W2145501841","https://openalex.org/W2174446922","https://openalex.org/W2180988813","https://openalex.org/W2242296381","https://openalex.org/W2296148711","https://openalex.org/W2340787257","https://openalex.org/W2401929940","https://openalex.org/W2553219432","https://openalex.org/W2596605817","https://openalex.org/W2810393032","https://openalex.org/W2883325929","https://openalex.org/W2912956481","https://openalex.org/W2914414140","https://openalex.org/W2962696710","https://openalex.org/W2963282263","https://openalex.org/W2964186470","https://openalex.org/W3035322289","https://openalex.org/W3139078859","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2352794675","https://openalex.org/W1526989670","https://openalex.org/W108531593","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2111712077","https://openalex.org/W2051228988","https://openalex.org/W2162911572","https://openalex.org/W2019464130","https://openalex.org/W4312613226"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}