{"id":"https://openalex.org/W2973900959","doi":"https://doi.org/10.1142/s0129054119400252","title":"A Parametrized Analysis of Algorithms on Hierarchical Graphs","display_name":"A Parametrized Analysis of Algorithms on Hierarchical Graphs","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2973900959","doi":"https://doi.org/10.1142/s0129054119400252","mag":"2973900959"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054119400252","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400252","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5080948611","display_name":"Rachel Faran","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Rachel Faran","raw_affiliation_strings":["School of Engineering and Computer Science, Hebrew University, Jerusalem 91904, Israel"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computer Science, Hebrew University, Jerusalem 91904, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077429082","display_name":"Orna Kupferman","orcid":"https://orcid.org/0000-0003-4699-6117"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Orna Kupferman","raw_affiliation_strings":["School of Engineering and Computer Science, Hebrew University, Jerusalem 91904, Israel"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computer Science, Hebrew University, Jerusalem 91904, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080948611"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14808543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"06n07","first_page":"979","last_page":"1003"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9962000250816345,"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/T11269","display_name":"Algorithms and Data Compression","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6680411696434021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5412710309028625},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.53965824842453},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5333205461502075},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5331878662109375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5135946273803711},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4568110704421997},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4558609127998352},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4282630681991577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42130139470100403},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41081953048706055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3862517178058624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3567875921726227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33187150955200195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3117220401763916},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11763307452201843}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6680411696434021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5412710309028625},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.53965824842453},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5333205461502075},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5331878662109375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5135946273803711},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4568110704421997},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4558609127998352},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4282630681991577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42130139470100403},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41081953048706055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3862517178058624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3567875921726227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33187150955200195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3117220401763916},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11763307452201843},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054119400252","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400252","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W103336569","https://openalex.org/W1505355949","https://openalex.org/W1940010026","https://openalex.org/W1966825814","https://openalex.org/W1982538209","https://openalex.org/W1988808695","https://openalex.org/W2002644257","https://openalex.org/W2011824721","https://openalex.org/W2016056456","https://openalex.org/W2017076220","https://openalex.org/W2021380921","https://openalex.org/W2022486658","https://openalex.org/W2033356880","https://openalex.org/W2033871299","https://openalex.org/W2063414745","https://openalex.org/W2068806367","https://openalex.org/W2107552120","https://openalex.org/W2116087731","https://openalex.org/W2129391890","https://openalex.org/W2135282325","https://openalex.org/W2151670874","https://openalex.org/W2600133316","https://openalex.org/W2752596881","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2157783000","https://openalex.org/W4287117052","https://openalex.org/W4206705200","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2028363955","https://openalex.org/W3176308333","https://openalex.org/W2903402681","https://openalex.org/W2124568589","https://openalex.org/W2061237693"],"abstract_inverted_index":{"Hierarchical":[0],"graphs":[1,43,57,81],"are":[2,109,241],"used":[3],"in":[4,25,37,85,93,102,114,208,220],"order":[5],"to":[6,44,79,105,155,169,215,252],"describe":[7,189],"systems":[8],"with":[9,129],"a":[10,20,26,38,140,143,161,185,190,209],"sequential":[11],"composition":[12],"of":[13,19,22,34,62,75,121,124,146,164,179,206,229,255],"sub-systems.":[14],"A":[15],"hierarchical":[16,42,56,87,95,127,196,237],"graph":[17],"consists":[18],"vector":[21],"subgraphs.":[23,31],"Vertices":[24],"subgraph":[27],"may":[28],"\u201ccall\u201d":[29],"other":[30],"The":[32,198],"reuse":[33],"subgraphs,":[35],"possibly":[36],"nested":[39],"way,":[40],"causes":[41],"be":[45],"exponentially":[46],"more":[47],"succinct":[48],"than":[49],"equivalent":[50],"flat":[51,80],"graphs.":[52,197,257],"Early":[53],"research":[54],"on":[55,195,202,226],"and":[58,82,167,218,232,248],"the":[59,73,86,91,94,119,122,130,137,156,165,172,177,213,216,227,249,253,256],"computational":[60],"price":[61],"their":[63,83],"succinctness":[64],"suggests":[65],"that":[66,211],"there":[67],"is":[68,97,182,200],"no":[69,112],"strong":[70],"correlation":[71],"between":[72],"complexity":[74,84,92,103,123,166,173],"problems":[76,170,217,250],"when":[77,176],"applied":[78],"setting.":[88],"That":[89],"is,":[90],"setting":[96],"higher,":[98],"but":[99],"all":[100],"\u201cjumps\u201d":[101],"up":[104],"an":[106,203],"exponential":[107],"one":[108],"exhibited,":[110],"including":[111],"jumps":[113],"some":[115,246],"problems.":[116],"We":[117,159,188],"continue":[118],"study":[120],"algorithms":[125,194],"for":[126,193],"graphs,":[128,238],"following":[131],"contributions:":[132],"(1)":[133],"In":[134],"many":[135],"applications,":[136],"subgraphs":[138,207,221],"have":[139],"small,":[141],"often":[142],"constant,":[144],"number":[145,178,228],"exit":[147,180,230],"vertices,":[148,231],"namely":[149],"vertices":[150,181],"from":[151,245],"which":[152],"control":[153],"returns":[154],"calling":[157],"subgraph.":[158],"offer":[160],"parameterized":[162],"analysis":[163],"point":[168],"where":[171,239],"becomes":[174],"lower":[175],"bounded":[183],"by":[184,243],"constant.":[186],"(2)":[187],"general":[191],"methodology":[192,199],"based":[201],"iterative":[204],"compression":[205],"way":[210],"maintains":[212],"solution":[214],"results":[219],"whose":[222],"size":[223],"depends":[224],"only":[225],"(3)":[233],"we":[234],"handle":[235],"labeled":[236,242],"edges":[240],"letters":[244],"alphabet,":[247],"refer":[251],"languages":[254]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}