{"id":"https://openalex.org/W4298110488","doi":"https://doi.org/10.1007/s10878-022-00917-3","title":"Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing","display_name":"Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing","publication_year":2022,"publication_date":"2022-09-30","ids":{"openalex":"https://openalex.org/W4298110488","doi":"https://doi.org/10.1007/s10878-022-00917-3"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-022-00917-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-022-00917-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5074156188","display_name":"Dekel Tsur","orcid":"https://orcid.org/0000-0001-9763-3784"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Dekel Tsur","raw_affiliation_strings":["Department of computer science, Ben-Gurion University of the Negev, Beersheba, Israel"],"raw_orcid":"https://orcid.org/0000-0001-9763-3784","affiliations":[{"raw_affiliation_string":"Department of computer science, Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074156188"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1733408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"44","issue":"5","first_page":"3701","last_page":"3710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983999729156494,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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/path","display_name":"Path (computing)","score":0.7394425868988037},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6425479054450989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5539085268974304},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5386360287666321},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5162929892539978},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.502994954586029},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.4852723777294159},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4530768096446991},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.42932960391044617},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4241585433483124},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4115842580795288},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3809199631214142},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3625267744064331}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7394425868988037},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6425479054450989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5539085268974304},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5386360287666321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5162929892539978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.502994954586029},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.4852723777294159},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4530768096446991},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42932960391044617},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4241585433483124},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4115842580795288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3809199631214142},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3625267744064331},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-022-00917-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-022-00917-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00917-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-022-00917-3","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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1987796300","https://openalex.org/W2017109153","https://openalex.org/W2042292124","https://openalex.org/W2043193111","https://openalex.org/W2125455032","https://openalex.org/W2130067129","https://openalex.org/W2134469776","https://openalex.org/W2145204415","https://openalex.org/W2148989696","https://openalex.org/W2166321766","https://openalex.org/W2199703934","https://openalex.org/W2218434618","https://openalex.org/W2226471651","https://openalex.org/W2231757830","https://openalex.org/W2264404578","https://openalex.org/W2298830675","https://openalex.org/W2407089923","https://openalex.org/W2593070308","https://openalex.org/W2751689185","https://openalex.org/W2794218108","https://openalex.org/W2963377146","https://openalex.org/W2963617229","https://openalex.org/W2963995309","https://openalex.org/W3065763739","https://openalex.org/W3102537597","https://openalex.org/W4225773357"],"related_works":["https://openalex.org/W1978586831","https://openalex.org/W2264787292","https://openalex.org/W4291607983","https://openalex.org/W2008652244","https://openalex.org/W2056436175","https://openalex.org/W2974342837","https://openalex.org/W2559426121","https://openalex.org/W4281683855","https://openalex.org/W4298110488","https://openalex.org/W3130401278"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}