Pub Date : 2012-06-04DOI: 10.1007/978-3-642-30347-0_34
W. Rytter, Bartosz Szreder
{"title":"Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric","authors":"W. Rytter, Bartosz Szreder","doi":"10.1007/978-3-642-30347-0_34","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_34","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124220650","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_30
K. Pruhs, G. Woeginger
{"title":"Divorcing Made Easy","authors":"K. Pruhs, G. Woeginger","doi":"10.1007/978-3-642-30347-0_30","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_30","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734056","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_20
Martin Fürer
{"title":"Counting Perfect Matchings in Graphs of Degree 3","authors":"Martin Fürer","doi":"10.1007/978-3-642-30347-0_20","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_20","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931183","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_19
F. Fomin, P. Heggernes, E. J. V. Leeuwen
{"title":"Making Life Easier for Firefighters","authors":"F. Fomin, P. Heggernes, E. J. V. Leeuwen","doi":"10.1007/978-3-642-30347-0_19","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_19","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126736589","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_22
M. Holzer, Sebastian Jakobi
{"title":"On the Complexity of Rolling Block and Alice Mazes","authors":"M. Holzer, Sebastian Jakobi","doi":"10.1007/978-3-642-30347-0_22","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_22","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205663","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_31
J. Sgall
{"title":"A New Analysis of Best Fit Bin Packing","authors":"J. Sgall","doi":"10.1007/978-3-642-30347-0_31","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_31","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128951006","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_7
Till Bruckdorfer, M. Kaufmann
{"title":"Mad at Edge Crossings? Break the Edges!","authors":"Till Bruckdorfer, M. Kaufmann","doi":"10.1007/978-3-642-30347-0_7","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_7","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387661","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 : 2012-06-04DOI: 10.1007/978-3-642-30347-0_23
M. Holzer, Sebastian Jakobi
{"title":"Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes","authors":"M. Holzer, Sebastian Jakobi","doi":"10.1007/978-3-642-30347-0_23","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_23","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"741 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122957161","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
扫码关注我们
求助内容：
应助结果提醒方式：