{"id":"https://openalex.org/W1986808428","doi":"https://doi.org/10.1016/s1571-0653(05)80034-4","title":"Solving Frequency Assignment Problems via Tree-Decomposition1","display_name":"Solving Frequency Assignment Problems via Tree-Decomposition1","publication_year":1999,"publication_date":"1999-05-01","ids":{"openalex":"https://openalex.org/W1986808428","doi":"https://doi.org/10.1016/s1571-0653(05)80034-4","mag":"1986808428"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0653(05)80034-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(05)80034-4","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/123f82fc-0c53-4686-a40b-f0edf14b7406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043443150","display_name":"Arie M. C. A. Koster","orcid":"https://orcid.org/0000-0002-8035-7012"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Arie M.C.A. Koster","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108610047","display_name":"Stan P.M. van Hoesel","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Stan P.M. van Hoesel","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031381317","display_name":"Antoon Kolen","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Antoon W.J. Kolen","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200, MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht, University, P.O. Box 616, 6200 MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043443150"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":null,"apc_paid":null,"fwci":2.4424,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.88005083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"102","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9919999837875366,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9782999753952026,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7925479412078857},{"id":"https://openalex.org/keywords/frequency-assignment","display_name":"Frequency assignment","score":0.73029625415802},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6509690284729004},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5875553488731384},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5435622930526733},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.527623176574707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5102550983428955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4714661240577698},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4122752547264099},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40726250410079956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38900333642959595},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2334941327571869},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08451083302497864}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7925479412078857},{"id":"https://openalex.org/C2776628324","wikidata":"https://www.wikidata.org/wiki/Q22222748","display_name":"Frequency assignment","level":2,"score":0.73029625415802},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6509690284729004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5875553488731384},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5435622930526733},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.527623176574707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5102550983428955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4714661240577698},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4122752547264099},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40726250410079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38900333642959595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2334941327571869},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08451083302497864},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s1571-0653(05)80034-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(05)80034-4","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:unm:umamet:1999011","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"preprint"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/123f82fc-0c53-4686-a40b-f0edf14b7406","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/123f82fc-0c53-4686-a40b-f0edf14b7406","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Koster , A , van Hoesel , C P M & Kolen , A W J 1999 ' Solving frequency assignment problems via tree-decomposition ' METEOR Research Memorandum , no. 011 , METEOR, Maastricht University School of Business and Economics , Maastricht . https://doi.org/10.26481/umamet.1999011","raw_type":"workingPaper"}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/123f82fc-0c53-4686-a40b-f0edf14b7406","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/123f82fc-0c53-4686-a40b-f0edf14b7406","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Koster , A , van Hoesel , C P M & Kolen , A W J 1999 ' Solving frequency assignment problems via tree-decomposition ' METEOR Research Memorandum , no. 011 , METEOR, Maastricht University School of Business and Economics , Maastricht . https://doi.org/10.26481/umamet.1999011","raw_type":"workingPaper"},"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2029448190","https://openalex.org/W2040147369","https://openalex.org/W2056979696","https://openalex.org/W2085550081","https://openalex.org/W2144306116","https://openalex.org/W2159003936","https://openalex.org/W2883159441","https://openalex.org/W2986773320","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W3166204570","https://openalex.org/W3121246613","https://openalex.org/W2798482732","https://openalex.org/W350499458","https://openalex.org/W2132137594","https://openalex.org/W2062170304","https://openalex.org/W1586178866","https://openalex.org/W3124636711","https://openalex.org/W1986808428","https://openalex.org/W3007288445"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}