{"id":"https://openalex.org/W2075581822","doi":"https://doi.org/10.1137/s0097539794266171","title":"Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms","display_name":"Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2075581822","doi":"https://doi.org/10.1137/s0097539794266171","mag":"2075581822"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794266171","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794266171","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5005468020","display_name":"Stefan Felsner","orcid":"https://orcid.org/0000-0002-6150-1998"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Felsner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064848972","display_name":"Lorenz Wernisch","orcid":"https://orcid.org/0000-0003-3113-7942"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lorenz Wernisch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7529,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.74488802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"1","first_page":"192","last_page":"209"},"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.9998999834060669,"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.9998999834060669,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/planar","display_name":"Planar","score":0.6461626291275024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5869770050048828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5853604078292847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5113474726676941},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5036916136741638},{"id":"https://openalex.org/keywords/combinatorial-analysis","display_name":"Combinatorial analysis","score":0.46925923228263855},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.43849119544029236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38261982798576355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35954487323760986},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09100198745727539}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6461626291275024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5869770050048828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5853604078292847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5113474726676941},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5036916136741638},{"id":"https://openalex.org/C2987825933","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorial analysis","level":2,"score":0.46925923228263855},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.43849119544029236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38261982798576355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35954487323760986},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09100198745727539},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539794266171","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794266171","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.4412","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.fu-berlin.de/~felsner/Paper/kchains.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.592.3152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.3152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://page.math.tu-berlin.de/~felsner/Paper/kchains.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1903290558","https://openalex.org/W1931202475","https://openalex.org/W2004594020","https://openalex.org/W2006001074","https://openalex.org/W2020757245","https://openalex.org/W2021115540","https://openalex.org/W2022971294","https://openalex.org/W2035101851","https://openalex.org/W2069893028","https://openalex.org/W2075488055","https://openalex.org/W2079430407","https://openalex.org/W2583196110"],"related_works":["https://openalex.org/W1963510333","https://openalex.org/W2051286458","https://openalex.org/W1975533618","https://openalex.org/W1513153538","https://openalex.org/W2381090488","https://openalex.org/W2223806833","https://openalex.org/W3005399847","https://openalex.org/W2109410667","https://openalex.org/W1555195560","https://openalex.org/W4225524155"],"abstract_inverted_index":{"A":[0,21,36],"chain":[1,14,110,142],"of":[2,6,15,27,58,63,77,112,139,145,241,253,258,261,271,302],"a":[3,13,24,40,60,78,87,113,128,140,207,227,238,262,272],"set":[4,80,265],"P":[5,28,64,81,132],"n":[7],"points":[8,173],"in":[9,65,69,95,116,123,155,174,198,213],"the":[10,16,56,66,70,74,108,117,124,137,149,156,162,224,231,251,259,269,291,294,303],"plane":[11,125],"is":[12,23,39,106,226,266,288],"dominance":[17,157],"order":[18,158],"on":[19,248],"P.":[20],"k-chain":[22,37,42,46,62,130,209],"subset":[25],"C":[26,38],"that":[29,91,107,127,287],"can":[30,133,184,210],"be":[31,134,211],"covered":[32],"by":[33,83,195],"k":[34,121,182],"chains.":[35],"maximum":[41,61,93,114,129,165,169,192,208,281],"if":[43],"no":[44],"other":[45],"contains":[47],"more":[48],"elements":[49],"than":[50],"C.":[51],"This":[52,276],"paper":[53],"deals":[54],"with":[55,250,284],"problem":[57],"finding":[59],"cardinality":[67,295],"and":[68,100,153,203,244,299,311],"weighted":[71,273,282,306],"case.":[72,296],"Using":[73],"skeleton":[75,118,260],"S(P)":[76,119],"point":[79,264,274],"introduced":[82],"Viennot":[84],"we":[85,159],"describe":[86,188],"fairly":[88],"simple":[89],"algorithm":[90,163,190,286,292,304],"computes":[92],"k-chains":[94,166,283,307],"time":[96,175,199,214,298],"O(kn":[97,176],"log":[98,177,201,216],"n)":[99,202,217],"linear":[101,204],"space.":[102,205],"The":[103,221,256,297],"basic":[104],"idea":[105],"canonical":[109],"partition":[111],"(k-1)-chain":[115],"provides":[120],"regions":[122],"such":[126],"for":[131,164,171,180,218,223,234,293,305],"obtained":[135],"as":[136],"union":[138],"maximal":[141],"from":[143],"each":[144],"these":[146],"regions.":[147],"By":[148],"symmetry":[150],"between":[151],"chains":[152],"antichains":[154],"may":[160],"use":[161],"to":[167,230,268,279,290],"compute":[168,280],"k-antichains":[170,193],"planar":[172,263],"n).":[178],"However,":[179],"large":[181],"one":[183],"do":[185],"better.":[186],"We":[187,236],"an":[189,285],"computing":[191],"(and,":[194],"symmetry,":[196],"k-chains)":[197],"O((n2k)":[200],"Consequently,":[206],"computed":[212],"O(n3/2":[215],"arbitrary":[219],"k.":[220],"background":[222],"algorithms":[225],"geometric":[228],"approach":[229],"Greene--Kleitman":[232],"theory":[233,243,252],"permutations.":[235],"include":[237],"skeleton-based":[239],"exposition":[240],"this":[242],"give":[245],"some":[246],"hints":[247],"connections":[249],"Young":[254],"tableaux.":[255],"concept":[257],"extended":[267],"case":[270],"set.":[275],"extension":[277],"allows":[278],"similar":[289],"space":[300],"requirements":[301],"are":[308],"O(2kn":[309],"log(2kn))":[310],"O(2kn),":[312],"respectively.":[313]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}