{"id":"https://openalex.org/W2164770649","doi":"https://doi.org/10.1142/s0218195911003615","title":"FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS","display_name":"FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2164770649","doi":"https://doi.org/10.1142/s0218195911003615","mag":"2164770649"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195911003615","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195911003615","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://hdl.handle.net/10072/39781","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061047124","display_name":"Vladimir Estivill\u2010Castro","orcid":"https://orcid.org/0000-0001-7775-0780"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"VLADIMIR ESTIVILL-CASTRO","raw_affiliation_strings":["School of Information and Communication Technology, Griffith University, Nathan, QLD, 4111, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Griffith University, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007264608","display_name":"Apichat Heednacram","orcid":"https://orcid.org/0000-0003-0978-8343"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"APICHAT HEEDNACRAM","raw_affiliation_strings":["Institute for Integrated and Intelligent Systems, Griffith University, Nathan, QLD, 4111, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038368569","display_name":"Francis Suraweera","orcid":null},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"FRANCIS SURAWEERA","raw_affiliation_strings":["School of Information and Communication Technology, Griffith University, Nathan, QLD, 4111, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Griffith University, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I11701301"],"apc_list":null,"apc_paid":null,"fwci":1.8344,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.88399661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"02","first_page":"189","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.995199978351593,"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.9771999716758728,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8633066415786743},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7910428047180176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6259524822235107},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5797136425971985},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5647366642951965},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5380347371101379},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5312749147415161},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5215344429016113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4492335915565491},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4463808834552765},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43485522270202637},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4173825681209564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3421386778354645},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3269980251789093},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.13616973161697388},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12080177664756775}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8633066415786743},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7910428047180176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6259524822235107},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5797136425971985},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5647366642951965},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5380347371101379},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5312749147415161},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5215344429016113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4492335915565491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4463808834552765},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43485522270202637},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4173825681209564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3421386778354645},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3269980251789093},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.13616973161697388},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12080177664756775},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0218195911003615","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195911003615","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:repositori-api.upf.edu:10230/43890","is_oa":false,"landing_page_url":"http://hdl.handle.net/10230/43890","pdf_url":null,"source":{"id":"https://openalex.org/S4306402615","display_name":"Repositori digital de la UPF (Universitat Pompeu Fabra)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I170486558","host_organization_name":"Universitat Pompeu Fabra","host_organization_lineage":["https://openalex.org/I170486558"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research-repository.griffith.edu.au:10072/39781","is_oa":true,"landing_page_url":"http://hdl.handle.net/10072/39781","pdf_url":"http://hdl.handle.net/10072/39781","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"}],"best_oa_location":{"id":"pmh:oai:research-repository.griffith.edu.au:10072/39781","is_oa":true,"landing_page_url":"http://hdl.handle.net/10072/39781","pdf_url":"http://hdl.handle.net/10072/39781","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2164770649.pdf","grobid_xml":"https://content.openalex.org/works/W2164770649.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1968541942","https://openalex.org/W1973102563","https://openalex.org/W1982128583","https://openalex.org/W2000889179","https://openalex.org/W2027132034","https://openalex.org/W2027402472","https://openalex.org/W2055569927","https://openalex.org/W2067943142","https://openalex.org/W2122524123","https://openalex.org/W2328175515","https://openalex.org/W4242361212","https://openalex.org/W4249911588","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3020640542","https://openalex.org/W2476602023","https://openalex.org/W4245720151","https://openalex.org/W2381408042","https://openalex.org/W1606657688","https://openalex.org/W4301454895","https://openalex.org/W2909144890","https://openalex.org/W2161305900","https://openalex.org/W4318567365","https://openalex.org/W3013754022"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"the":[3,12,18,53,58,82,88,97,130],"\u03ba-BENDS":[4,90],"TRAVELING":[5,91],"SALESMAN":[6,92],"PROBLEM.":[7],"In":[8],"this":[9,71],"NP-complete":[10],"problem,":[11],"inputs":[13],"are":[14,27,46,64],"n":[15,38],"points":[16,39],"in":[17,33,57],"plane":[19],"and":[20,25,116,134,142],"a":[21,47,104,111,118],"positive":[22],"integer":[23],"\u03ba,":[24],"we":[26,30],"asked":[28],"whether":[29],"can":[31],"travel":[32],"straight":[34],"lines":[35],"through":[36],"these":[37,147],"with":[40,107,113,139],"at":[41],"most":[42],"\u03ba":[43,108],"bends.":[44],"There":[45],"number":[48,54],"of":[49,55,126],"applications":[50],"where":[51],"minimizing":[52],"bends":[56,63,109],"tour":[59,106],"is":[60,73,79,110],"desirable":[61],"because":[62],"considered":[65],"very":[66],"costly.":[67],"We":[68,85,122,136],"prove":[69],"that":[70,96,103],"problem":[72],"fixed-parameter":[74],"tractable":[75],"(FPT).":[76],"The":[77],"proof":[78],"based":[80],"on":[81],"kernelization":[83],"approach.":[84],"also":[86],"consider":[87],"RECTILINEAR":[89],"PROBLEM,":[93],"which":[94],"requires":[95],"line-segments":[98,133],"be":[99],"axis-parallel.":[100],"1":[101],"Note":[102],"rectilinear":[105],"cover":[112,119],"\u03ba-line":[114],"segments,":[115],"therefore":[117],"by":[120],"lines.":[121,135],"introduce":[123],"two":[124],"types":[125],"constraints":[127],"derived":[128],"from":[129],"distinction":[131],"between":[132],"derive":[137],"FPT-algorithms":[138],"different":[140],"techniques":[141],"improved":[143],"time":[144],"complexity":[145],"for":[146],"cases.":[148]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}