{"id":"https://openalex.org/W1581220960","doi":"https://doi.org/10.1023/a:1008791627588","title":"An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs","display_name":"An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1581220960","doi":"https://doi.org/10.1023/a:1008791627588","mag":"1581220960"},"language":"en","primary_location":{"id":"doi:10.1023/a:1008791627588","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008791627588","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5061956168","display_name":"Mrinmoy Hota","orcid":null},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Mrinmoy Hota","raw_affiliation_strings":["Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India","institution_ids":["https://openalex.org/I41549804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039205000","display_name":"Madhumangal Pal","orcid":"https://orcid.org/0000-0002-6709-836X"},"institutions":[{"id":"https://openalex.org/I251397004","display_name":"Midnapore Medical College and Hospital","ror":"https://ror.org/03p37kd86","country_code":"IN","type":"education","lineage":["https://openalex.org/I251397004"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Madhumangal Pal","raw_affiliation_strings":["Department of Mathematics, Midnapore College, Midnapore, 721 101, India","Department of Mathematics , Midnapore College , Midnapore, 721 101, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Midnapore College, Midnapore, 721 101, India","institution_ids":["https://openalex.org/I251397004"]},{"raw_affiliation_string":"Department of Mathematics , Midnapore College , Midnapore, 721 101, India","institution_ids":["https://openalex.org/I251397004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103568922","display_name":"Tapan Kumar Pal","orcid":null},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tapan K. Pal","raw_affiliation_strings":["Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India","Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, 721 102, India","institution_ids":["https://openalex.org/I41549804"]},{"raw_affiliation_string":"Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721-102, India","institution_ids":["https://openalex.org/I41549804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061956168"],"corresponding_institution_ids":["https://openalex.org/I41549804"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.9271,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.73177258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"1","first_page":"49","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7791721820831299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5273281931877136},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5190635323524475},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4426828622817993},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4244702458381653},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.41639333963394165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41169190406799316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39854544401168823},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3749978542327881},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16138309240341187},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0836496353149414}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7791721820831299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5273281931877136},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5190635323524475},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4426828622817993},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4244702458381653},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.41639333963394165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41169190406799316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39854544401168823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3749978542327881},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16138309240341187},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0836496353149414}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1008791627588","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1008791627588","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1972965975","https://openalex.org/W1979977220","https://openalex.org/W2006001074","https://openalex.org/W2010733068","https://openalex.org/W2011039300","https://openalex.org/W2054748563","https://openalex.org/W2056944493","https://openalex.org/W2062221600","https://openalex.org/W2073015256","https://openalex.org/W2111523610","https://openalex.org/W2128873679","https://openalex.org/W2143474538","https://openalex.org/W2149342630","https://openalex.org/W2160365857","https://openalex.org/W2170359320","https://openalex.org/W4232336108","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4288723498","https://openalex.org/W2350111251","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2603633312"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2016-06-24T00:00:00"}