Fun with Algorithms最新文献

筛选
英文 中文
Happy Edges: Threshold-Coloring of Regular Lattices 快乐边:规则格的阈值着色
Fun with Algorithms Pub Date : 2013-06-09 DOI: 10.1007/978-3-319-07890-8_3
M. J. Alam, S. Kobourov, S. Pupyrev, J. Toeniskoetter
{"title":"Happy Edges: Threshold-Coloring of Regular Lattices","authors":"M. J. Alam, S. Kobourov, S. Pupyrev, J. Toeniskoetter","doi":"10.1007/978-3-319-07890-8_3","DOIUrl":"https://doi.org/10.1007/978-3-319-07890-8_3","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134056710","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}
引用次数: 5
The Coolest Order of Binary Strings 二进制字符串的最酷顺序
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_32
B. Stevens, A. Williams
{"title":"The Coolest Order of Binary Strings","authors":"B. Stevens, A. Williams","doi":"10.1007/978-3-642-30347-0_32","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_32","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"18 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":"114142516","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}
引用次数: 8
Art Galleries, k-modems, and k-convexity 美术馆,k-调制解调器,k-凸度
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_3
J. Urrutia
{"title":"Art Galleries, k-modems, and k-convexity","authors":"J. Urrutia","doi":"10.1007/978-3-642-30347-0_3","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_3","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"21 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":"130400843","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}
引用次数: 1
Stability and Metastability of the Logit Dynamics of Strategic Games 策略博弈Logit动力学的稳定性和亚稳态
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_2
G. Persiano
{"title":"Stability and Metastability of the Logit Dynamics of Strategic Games","authors":"G. Persiano","doi":"10.1007/978-3-642-30347-0_2","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_2","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"93 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":"131935748","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}
引用次数: 0
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box 斯堪的纳维亚薄蛋糕的顶部:在最小的一个尺寸适合所有的盒子
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_5
E. Arkin, A. Efrat, G. Hart, I. Kostitsyna, A. Kröller, Joseph S. B. Mitchell, V. Polishchuk
{"title":"Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box","authors":"E. Arkin, A. Efrat, G. Hart, I. Kostitsyna, A. Kröller, Joseph S. B. Mitchell, V. Polishchuk","doi":"10.1007/978-3-642-30347-0_5","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_5","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"149 11 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":"130151132","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}
引用次数: 3
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns M.C.埃舍尔包裹艺术家:缎带图案的美学着色
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_21
Ellen Gethner, D. Kirkpatrick, N. Pippenger
{"title":"M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns","authors":"Ellen Gethner, D. Kirkpatrick, N. Pippenger","doi":"10.1007/978-3-642-30347-0_21","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_21","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"13 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":"124513014","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}
引用次数: 1
Algorithms and Complexity of Generalized River Crossing Problems 广义渡河问题的算法与复杂度
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_24
Hiro Ito, S. Langerman, Yuichi Yoshida
{"title":"Algorithms and Complexity of Generalized River Crossing Problems","authors":"Hiro Ito, S. Langerman, Yuichi Yoshida","doi":"10.1007/978-3-642-30347-0_24","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_24","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"536 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":"128102048","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}
引用次数: 4
Finding Good Coffee in Paris 在巴黎寻找好咖啡
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_17
P. Flocchini, Matthew Kellett, Peter C. Mason, N. Santoro
{"title":"Finding Good Coffee in Paris","authors":"P. Flocchini, Matthew Kellett, Peter C. Mason, N. Santoro","doi":"10.1007/978-3-642-30347-0_17","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_17","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"30 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":"116182327","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}
引用次数: 9
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs Kal-Toh的火神游戏:寻找或制作三连通的平面子图
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_4
Terry Anderson, T. Biedl
{"title":"The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs","authors":"Terry Anderson, T. Biedl","doi":"10.1007/978-3-642-30347-0_4","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_4","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"65 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":"126460716","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}
引用次数: 1
Train Marshalling Is Fixed Parameter Tractable 列车编组是固定参数可处理的
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_8
Leo Brueggeman, M. Fellows, R. Fleischer, M. Lackner, Christian Komusiewicz, I. Koutis, A. Pfandler, Frances A. Rosamond
{"title":"Train Marshalling Is Fixed Parameter Tractable","authors":"Leo Brueggeman, M. Fellows, R. Fleischer, M. Lackner, Christian Komusiewicz, I. Koutis, A. Pfandler, Frances A. Rosamond","doi":"10.1007/978-3-642-30347-0_8","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_8","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 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":"131179689","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}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信