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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation 覆盖阵列生成中IPO类算法的破扎和参数排序评价
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_16
Kristoffer Kleine, I. Kotsireas, D. Simos
{"title":"Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation","authors":"Kristoffer Kleine, I. Kotsireas, D. Simos","doi":"10.1007/978-3-319-94667-2_16","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_16","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127023345","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}
引用次数: 2
Minimum Polygons for Fixed Visibility VC-Dimension 固定可见度vc维的最小多边形
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_6
Moritz Beck, Sabine Storandt
{"title":"Minimum Polygons for Fixed Visibility VC-Dimension","authors":"Moritz Beck, Sabine Storandt","doi":"10.1007/978-3-319-94667-2_6","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_6","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114892676","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
An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest 一种在线评奖节点加权斯坦纳森林的最优算法
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_18
C. Markarian
{"title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","authors":"C. Markarian","doi":"10.1007/978-3-319-94667-2_18","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_18","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129415187","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
Pattern Matching for k-Track Permutations k-径排列的模式匹配
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_9
L. Bulteau, Romeo Rizzi, Stéphane Vialette
{"title":"Pattern Matching for k-Track Permutations","authors":"L. Bulteau, Romeo Rizzi, Stéphane Vialette","doi":"10.1007/978-3-319-94667-2_9","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_9","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134295860","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
An Efficient Representation of Partitions of Integers 整数分区的一种有效表示
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_30
Kentaro Sumigawa, K. Sadakane
{"title":"An Efficient Representation of Partitions of Integers","authors":"Kentaro Sumigawa, K. Sadakane","doi":"10.1007/978-3-319-94667-2_30","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_30","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123236074","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
Separating Interaction Effects Using Locating and Detecting Arrays 利用定位和探测阵列分离相互作用效应
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_29
Stephen A. Seidel, Kaushik Sarkar, C. Colbourn, V. Syrotiuk
{"title":"Separating Interaction Effects Using Locating and Detecting Arrays","authors":"Stephen A. Seidel, Kaushik Sarkar, C. Colbourn, V. Syrotiuk","doi":"10.1007/978-3-319-94667-2_29","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_29","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581411","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}
引用次数: 18
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning 多项式时间后验查询学习的密码学限制
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_24
Mikito Nanashima
{"title":"Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning","authors":"Mikito Nanashima","doi":"10.1007/978-3-319-94667-2_24","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_24","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126070504","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
On the Expected Number of Distinct Gapped Palindromic Factors 不同间隙回文因子的期望数目
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_14
Philippe Duchon, C. Nicaud
{"title":"On the Expected Number of Distinct Gapped Palindromic Factors","authors":"Philippe Duchon, C. Nicaud","doi":"10.1007/978-3-319-94667-2_14","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_14","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114397861","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
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth 具有有界周子图和诱导子图的有效枚举
International Workshop on Combinatorial Algorithms Pub Date : 2018-06-12 DOI: 10.1007/978-3-319-94667-2_17
Kazuhiro Kurita, Kunihiro Wasa, A. Conte, Hiroki Arimura, T. Uno
{"title":"Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth","authors":"Kazuhiro Kurita, Kunihiro Wasa, A. Conte, Hiroki Arimura, T. Uno","doi":"10.1007/978-3-319-94667-2_17","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_17","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124769265","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
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs 嵌入式1-平面图上最大割问题的一种固定参数算法
International Workshop on Combinatorial Algorithms Pub Date : 2018-03-29 DOI: 10.1007/978-3-319-94667-2\_12
C. Dahn, Nils M. Kriege, Petra Mutzel
{"title":"A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs","authors":"C. Dahn, Nils M. Kriege, Petra Mutzel","doi":"10.1007/978-3-319-94667-2\\_12","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2\\_12","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114789597","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
首页 上一页 下一页 尾页
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学术官方微信