发布求助
文献互助 智能选刊 最新文献

Fun with Algorithms最新文献

筛选
英文 中文
Mapping an Unfriendly Subway System 绘制一个不友好的地铁系统
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_20
P. Flocchini, Matthew Kellett, Peter C. Mason, N. Santoro
{"title":"Mapping an Unfriendly Subway System","authors":"P. Flocchini, Matthew Kellett, Peter C. Mason, N. Santoro","doi":"10.1007/978-3-642-13122-6_20","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_20","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115178942","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}
引用次数: 16
The Urinal Problem 小便池问题
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_28
E. Kranakis, D. Krizanc
{"title":"The Urinal Problem","authors":"E. Kranakis, D. Krizanc","doi":"10.1007/978-3-642-13122-6_28","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_28","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116829273","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
Urban Hitchhiking 城市搭便车
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_9
M. Bressan, E. Peserico
{"title":"Urban Hitchhiking","authors":"M. Bressan, E. Peserico","doi":"10.1007/978-3-642-13122-6_9","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_9","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130304834","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
Computational Complexity of Two-Dimensional Platform Games 二维平台游戏的计算复杂度
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_22
Michal Forisek
{"title":"Computational Complexity of Two-Dimensional Platform Games","authors":"Michal Forisek","doi":"10.1007/978-3-642-13122-6_22","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_22","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126833880","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}
引用次数: 38
A Hat Trick 帽子戏法
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_6
Oren Ben-Zwi, Guy Wolfovitz
{"title":"A Hat Trick","authors":"Oren Ben-Zwi, Guy Wolfovitz","doi":"10.1007/978-3-642-13122-6_6","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_6","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131965206","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
Symmetric Monotone Venn Diagrams with Seven Curves 七曲线对称单调维恩图
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_32
T. Cao, Khalegh Mamakani, F. Ruskey
{"title":"Symmetric Monotone Venn Diagrams with Seven Curves","authors":"T. Cao, Khalegh Mamakani, F. Ruskey","doi":"10.1007/978-3-642-13122-6_32","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_32","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133313359","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}
引用次数: 6
A Fun Application of Compact Data Structures to Indexing Geographic Data 紧凑数据结构在地理数据索引中的有趣应用
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_10
N. Brisaboa, M. R. Luaces, G. Navarro, Diego Seco
{"title":"A Fun Application of Compact Data Structures to Indexing Geographic Data","authors":"N. Brisaboa, M. R. Luaces, G. Navarro, Diego Seco","doi":"10.1007/978-3-642-13122-6_10","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_10","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122419033","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}
引用次数: 17
Leveling-Up in Heroes of Might and Magic III 在《魔法门英雄3》中升级
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_16
Dimitrios I. Diochnos
{"title":"Leveling-Up in Heroes of Might and Magic III","authors":"Dimitrios I. Diochnos","doi":"10.1007/978-3-642-13122-6_16","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_16","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107822","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
Do We Need a Stack to Erase a Component in a Binary Image? 我们需要一个堆栈来擦除二进制图像中的组件吗?
Fun with Algorithms Pub Date : 2010-05-29 DOI: 10.1007/978-3-642-13122-6_4
T. Asano
{"title":"Do We Need a Stack to Erase a Component in a Binary Image?","authors":"T. Asano","doi":"10.1007/978-3-642-13122-6_4","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_4","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"66 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113961297","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
Kaboozle Is NP-complete, Even in a Strip Kaboozle是np完全的，即使在一个地带
Fun with Algorithms Pub Date : 2010-05-29 DOI: 10.1007/978-3-642-13122-6_5
T. Asano, E. Demaine, M. Demaine, Ryuhei Uehara
{"title":"Kaboozle Is NP-complete, Even in a Strip","authors":"T. Asano, E. Demaine, M. Demaine, Ryuhei Uehara","doi":"10.1007/978-3-642-13122-6_5","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_5","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123830739","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
首页 上一页
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学术官方微信