{"id":"https://openalex.org/W1936855748","doi":"https://doi.org/10.1137/1.9781611973099.124","title":"Bidimensionality and Geometric Graphs","display_name":"Bidimensionality and Geometric Graphs","publication_year":2012,"publication_date":"2012-01-17","ids":{"openalex":"https://openalex.org/W1936855748","doi":"https://doi.org/10.1137/1.9781611973099.124","mag":"1936855748"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973099.124","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.124","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.124","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.124","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["University of Bergen , Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen , Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California,  San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,  San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["The Institute of Mathematical Sciences,Chennai,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences,Chennai,India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1563","last_page":"1575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937999844551086,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7806432247161865},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6664013862609863},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6043341755867004},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5078678727149963},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5018815994262695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4988434314727783},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48095598816871643},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4401642084121704},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.42303574085235596},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4203421175479889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36946770548820496},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35762012004852295},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.24741625785827637},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12525343894958496}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7806432247161865},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6664013862609863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6043341755867004},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5078678727149963},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5018815994262695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4988434314727783},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48095598816871643},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4401642084121704},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42303574085235596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4203421175479889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36946770548820496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35762012004852295},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.24741625785827637},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12525343894958496}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/1.9781611973099.124","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.124","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.124","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.1815","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.1815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Edaniello/papers/bidimensionalityGeometric.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.343","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012SODA/data/papers/574.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.766.2927","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.766.2927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1107.2221.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1137/1.9781611973099.124","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.124","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.124","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W2157783000","https://openalex.org/W2903402681","https://openalex.org/W4283803822","https://openalex.org/W4287117052","https://openalex.org/W2061237693","https://openalex.org/W4206705200","https://openalex.org/W2966902162","https://openalex.org/W2125939925"],"abstract_inverted_index":{"Bidimensionality":[0,67],"theory":[1,26],"was":[2],"introduced":[3],"by":[4,185,207],"Demaine":[5],"et":[6,209],"al.":[7,210],"[JACM":[8],"2005]":[9,188],"as":[10,53,268],"a":[11,49,54,70,96,138,141,170],"framework":[12],"to":[13,31,68,74,260,331,362,366],"obtain":[14],"algorithmic":[15,337],"results":[16,159,198,330],"for":[17,41,82,109,126,145,179,320,352,371],"hard":[18],"problems":[19,43,83],"on":[20,44,84,118,130,148,175,201,231,286],"minor":[21,91],"closed":[22],"graph":[23,51,234],"classes.":[24],"The":[25],"has":[27],"been":[28],"successfully":[29],"applied":[30],"yield":[32],"subexponential":[33,78,105,142,171,297,349],"time":[34,79,106,143,172,298,350],"parameterized":[35,80,107,173],"algorithms,":[36],"EPTASs":[37,76,103,347],"and":[38,77,104,121,133,137,140,169,189,191,214,221,235,323,348,355,365],"linear":[39],"kernels":[40],"many":[42],"families":[45],"of":[46,62,86,155,166,242,264,271,328],"graphs":[47,87,120,132,178,223,270,288,322,333,364,368],"excluding":[48],"fixed":[50,373],"H":[52],"minor.":[55],"In":[56,99],"this":[57],"paper":[58],"we":[59,101,280,307,343],"use":[60],"several":[61],"the":[63,153,164,167,202,232,239,243,301,310,340],"key":[64],"ideas":[65],"from":[66],"give":[69],"new":[71,336],"generic":[72],"approach":[73,251,315],"design":[75],"algorithms":[81,108,228,299,351],"classes":[85,263],"which":[88,182,313],"are":[89,199],"not":[90,237,253],"closed,":[92],"but":[93],"instead":[94],"exhibit":[95],"geometric":[97,240,265],"structure.":[98],"particular":[100],"present":[102],"Feedback":[110,283],"Vertex":[111,113,116,180,284,353,357],"Set,":[112],"Cover,":[114,117,181],"Connected":[115,356],"map":[119,131,222],"unit":[122,134,149,176,219,272],"disk":[123,135,150,177,220,321,332,363],"graphs,":[124,136,266],"PTASs":[125,293],"Diamond":[127],"Hitting":[128],"Set":[129,285],"PTAS":[139],"algorithm":[144,174],"Cycle":[146],"Packing":[147],"graphs.":[151],"To":[152],"best":[154],"our":[156,250,314,329,346],"knowledge,":[157],"these":[158],"were":[160,183],"previously":[161],"unknown,":[162],"with":[163],"exception":[165],"EPTAS":[168],"obtained":[184],"Marx":[186],"[ESA":[187],"Alber":[190],"Fiala":[192],"[J.":[193],"Algorithms":[194],"2004],":[195],"respectively.":[196],"Our":[197,227],"based":[200,317],"recent":[203],"decomposition":[204,311],"theorems":[205,217,312],"proved":[206],"Fomin":[208],"in":[211,218,256,274,289,369],"[SODA":[212],"2011]":[213],"novel":[215],"grid-excluding":[216],"without":[224],"large":[225],"cliques.":[226],"work":[229],"directly":[230],"input":[233,244],"do":[236],"require":[238,335],"representations":[241],"graph.":[245],"We":[246],"also":[247],"show":[248,308],"that":[249,282,309,324,345],"can":[252],"be":[254],"extended":[255],"its":[257],"full":[258],"generality":[259],"more":[261],"general":[262],"such":[267],"intersection":[269],"balls":[273],"\u211dd,":[275],"d":[276],"\u2265":[277],"3.":[278],"Specifically,":[279],"prove":[281,344],"unit-ball":[287,367],"\u211d3":[290],"neither":[291],"admits":[292],"unless":[294,300],"P=NP,":[295],"nor":[296],"Exponential":[302],"Time":[303],"Hypothesis":[304],"fails.":[305],"Additionally,":[306],"is":[316],"on,":[318],"fail":[319],"therefore":[325],"any":[326],"extension":[327],"would":[334],"ideas.":[338],"On":[339],"other":[341],"hand,":[342],"Cover":[354,358],"carry":[359],"over":[360],"both":[361],"\u211dd":[370],"every":[372],"d.":[374]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}