Pub Date : 2020-08-19DOI: 10.1007/978-3-030-42071-0_9
D. Lokshtanov, Saket Saurabh, M. Zehavi
{"title":"Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths","authors":"D. Lokshtanov, Saket Saurabh, M. Zehavi","doi":"10.1007/978-3-030-42071-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_9","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132811664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-18DOI: 10.1007/978-3-030-42071-0_10
D. Marx
{"title":"Four Shorts Stories on Surprising Algorithmic Uses of Treewidth","authors":"D. Marx","doi":"10.1007/978-3-030-42071-0_10","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_10","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1007/978-3-030-42071-0_18
Johan M. M. van Rooij
{"title":"Fast Algorithms for Join Operations on Tree Decompositions","authors":"Johan M. M. van Rooij","doi":"10.1007/978-3-030-42071-0_18","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_18","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126057368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-10DOI: 10.1007/978-3-030-42071-0_5
M. D. Berg, Sándor Kisfaludi-Bak
{"title":"Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs","authors":"M. D. Berg, Sándor Kisfaludi-Bak","doi":"10.1007/978-3-030-42071-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_5","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-21DOI: 10.1007/978-3-030-42071-0_8
B. Jansen
{"title":"Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds","authors":"B. Jansen","doi":"10.1007/978-3-030-42071-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_8","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128062688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-42071-0_1
S. Arnborg, A. Proskurowski
{"title":"Seeing Arboretum for the (partial k-) Trees","authors":"S. Arnborg, A. Proskurowski","doi":"10.1007/978-3-030-42071-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_1","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123989215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-42071-0_2
M. Fellows, Frances A. Rosamond
{"title":"Collaborating with Hans: Some Remaining Wonderments","authors":"M. Fellows, Frances A. Rosamond","doi":"10.1007/978-3-030-42071-0_2","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_2","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114802336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-42071-0_4
J. Leeuwen
{"title":"Algorithms, Complexity, and Hans","authors":"J. Leeuwen","doi":"10.1007/978-3-030-42071-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_4","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116495365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-42071-0_14
Michal Pilipczuk
{"title":"Computing Tree Decompositions","authors":"Michal Pilipczuk","doi":"10.1007/978-3-030-42071-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_14","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131794847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：