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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Solving Group Interval Scheduling Efficiently 有效地解决组间隔调度问题
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_9
A. Biswas, Venkatesh Raman, Saket Saurabh
{"title":"Solving Group Interval Scheduling Efficiently","authors":"A. Biswas, Venkatesh Raman, Saket Saurabh","doi":"10.1007/978-3-030-25005-8_9","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_9","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130510900","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
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings 对运行长度编码字符串的最短唯一回文子字符串查询
International Workshop on Combinatorial Algorithms Pub Date : 2019-03-14 DOI: 10.1007/978-3-030-25005-8_35
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda
{"title":"Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings","authors":"Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda","doi":"10.1007/978-3-030-25005-8_35","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_35","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116463803","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
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs 稀疏图中弦二部诱导子图的一种高效枚举算法
International Workshop on Combinatorial Algorithms Pub Date : 2019-03-06 DOI: 10.1007/978-3-030-25005-8_28
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, T. Uno
{"title":"An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs","authors":"Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, T. Uno","doi":"10.1007/978-3-030-25005-8_28","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_28","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131813827","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
Stable Noncrossing Matchings 稳定的非交叉匹配
International Workshop on Combinatorial Algorithms Pub Date : 2019-03-06 DOI: 10.1007/978-3-030-25005-8_33
Suthee Ruangwises, T. Itoh
{"title":"Stable Noncrossing Matchings","authors":"Suthee Ruangwises, T. Itoh","doi":"10.1007/978-3-030-25005-8_33","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_33","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130077318","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
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs 关于k-毛虫和小次平面图上彩色分量问题的复杂性二分法
International Workshop on Combinatorial Algorithms Pub Date : 2019-02-28 DOI: 10.1007/978-3-030-25005-8_12
J. Chlebíková, C. Dallard
{"title":"Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs","authors":"J. Chlebíková, C. Dallard","doi":"10.1007/978-3-030-25005-8_12","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_12","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125212802","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
Holes in 2-Convex Point Sets 2-凸点集中的孔
International Workshop on Combinatorial Algorithms Pub Date : 2018-10-01 DOI: 10.1007/978-3-319-78825-8_14
O. Aichholzer, M. Balko, T. Hackl, Alexander Pilz, P. Ramos, P. Valtr, B. Vogtenhuber
{"title":"Holes in 2-Convex Point Sets","authors":"O. Aichholzer, M. Balko, T. Hackl, Alexander Pilz, P. Ramos, P. Valtr, B. Vogtenhuber","doi":"10.1007/978-3-319-78825-8_14","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_14","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124562282","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
Linear Clique-Width of Bi-complement Reducible Graphs 双补可约图的线性团宽度
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_2
Bogdan Alecu, V. Lozin, V. Zamaraev
{"title":"Linear Clique-Width of Bi-complement Reducible Graphs","authors":"Bogdan Alecu, V. Lozin, V. Zamaraev","doi":"10.1007/978-3-319-94667-2_2","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_2","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"8 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":"115272650","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
Linear Ramsey Numbers 线性拉姆齐数
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_3
A. Atminas, V. Lozin, V. Zamaraev
{"title":"Linear Ramsey Numbers","authors":"A. Atminas, V. Lozin, V. Zamaraev","doi":"10.1007/978-3-319-94667-2_3","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_3","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"44 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":"123894914","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
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem 3个置换的中位数、3个循环和3个命中集问题
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_19
Robin Milosz, Sylvie Hamel, A. Pierrot
{"title":"Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem","authors":"Robin Milosz, Sylvie Hamel, A. Pierrot","doi":"10.1007/978-3-319-94667-2_19","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_19","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"4 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114008242","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 Robot Arm Simulation Problems 机械臂仿真问题的计算复杂度
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_15
T. Feng, T. Horiyama, Y. Okamoto, Y. Otachi, Toshiki Saitoh, T. Uno, Ryuhei Uehara
{"title":"Computational Complexity of Robot Arm Simulation Problems","authors":"T. Feng, T. Horiyama, Y. Okamoto, Y. Otachi, Toshiki Saitoh, T. Uno, Ryuhei Uehara","doi":"10.1007/978-3-319-94667-2_15","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_15","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"36 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":"133193440","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
首页 上一页 下一页 尾页
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学术官方微信