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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
The Crossing Number of Seq-Shellable Drawings of Complete Graphs 完备图的Seq-Shellable图的交点数
International Workshop on Combinatorial Algorithms Pub Date : 2018-03-20 DOI: 10.1007/978-3-319-94667-2_23
Petra Mutzel, Lutz Oettershagen
{"title":"The Crossing Number of Seq-Shellable Drawings of Complete Graphs","authors":"Petra Mutzel, Lutz Oettershagen","doi":"10.1007/978-3-319-94667-2_23","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_23","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832204","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
The Parameterized Complexity of Happy Colorings 快乐着色的参数化复杂性
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_12
Neeldhara Misra, I. Reddy
{"title":"The Parameterized Complexity of Happy Colorings","authors":"Neeldhara Misra, I. Reddy","doi":"10.1007/978-3-319-78825-8_12","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_12","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677487","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}
引用次数: 13
Orientations of 1-Factors and the List Edge Coloring Conjecture 1-因子的取向与列表边着色猜想
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_19
U. Schauz
{"title":"Orientations of 1-Factors and the List Edge Coloring Conjecture","authors":"U. Schauz","doi":"10.1007/978-3-319-78825-8_19","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_19","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279235","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
Recent Advances of Palindromic Factorization 回文分解的最新进展
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_4
Mai Alzamel, C. Iliopoulos
{"title":"Recent Advances of Palindromic Factorization","authors":"Mai Alzamel, C. Iliopoulos","doi":"10.1007/978-3-319-78825-8_4","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_4","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116152237","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
Fully Leafed Tree-Like Polyominoes and Polycubes 全叶树状多边形和多边形
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_17
A. Massé, Julien de Carufel, A. Goupil, Maxime Samson
{"title":"Fully Leafed Tree-Like Polyominoes and Polycubes","authors":"A. Massé, Julien de Carufel, A. Goupil, Maxime Samson","doi":"10.1007/978-3-319-78825-8_17","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_17","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122291044","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
On the Parameterized Complexity of Happy Vertex Coloring 关于快乐顶点着色的参数化复杂度
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_9
A. Agrawal
{"title":"On the Parameterized Complexity of Happy Vertex Coloring","authors":"A. Agrawal","doi":"10.1007/978-3-319-78825-8_9","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_9","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236133","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}
引用次数: 20
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem 置换中值问题的启发式分支定界求解器及改进的空间约简
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_25
Robin Milosz, Sylvie Hamel
{"title":"Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem","authors":"Robin Milosz, Sylvie Hamel","doi":"10.1007/978-3-319-78825-8_25","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_25","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122203787","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
A Construction for 0, 1, -1 Orthogonal Matrices Visualized 0, 1， -1正交矩阵的可视化构造
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_5
N. Balonin, J. Seberry
{"title":"A Construction for 0, 1, -1 Orthogonal Matrices Visualized","authors":"N. Balonin, J. Seberry","doi":"10.1007/978-3-319-78825-8_5","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_5","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934470","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
The School Bus Routing Problem: An Analysis and Algorithm 校车路线问题的分析与算法
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_24
Rhyd Lewis, K. Smith‐Miles, K. Phillips
{"title":"The School Bus Routing Problem: An Analysis and Algorithm","authors":"Rhyd Lewis, K. Smith‐Miles, K. Phillips","doi":"10.1007/978-3-319-78825-8_24","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_24","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121469150","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
Computing Abelian String Regularities Based on RLE 基于RLE的阿贝尔字符串规则计算
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_34
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, H. Bannai, M. Takeda
{"title":"Computing Abelian String Regularities Based on RLE","authors":"Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, H. Bannai, M. Takeda","doi":"10.1007/978-3-319-78825-8_34","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_34","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578282","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
首页 上一页 下一页 尾页
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学术官方微信