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

International Symposium on Parameterized and Exact Computation最新文献

筛选
英文 中文
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size 寻找最小尺寸热带连通集的精确指数算法
International Symposium on Parameterized and Exact Computation Pub Date : 2014-09-10 DOI: 10.1007/978-3-319-13524-3_13
Mathieu Chapelle, Manfred Cochefert, D. Kratsch, Romain Letourneur, M. Liedloff
{"title":"Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size","authors":"Mathieu Chapelle, Manfred Cochefert, D. Kratsch, Romain Letourneur, M. Liedloff","doi":"10.1007/978-3-319-13524-3_13","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_13","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115200542","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
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth 有界树宽cnf的无小非确定性读一次分支程序
International Symposium on Parameterized and Exact Computation Pub Date : 2014-07-02 DOI: 10.1007/978-3-319-13524-3_27
Igor Razgon
{"title":"No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth","authors":"Igor Razgon","doi":"10.1007/978-3-319-13524-3_27","DOIUrl":"https://doi.org/10.1007/978-3-319-13524-3_27","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609786","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
Algorithms for k-Internal Out-Branching k-内部外分支算法
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_30
M. Zehavi
{"title":"Algorithms for k-Internal Out-Branching","authors":"M. Zehavi","doi":"10.1007/978-3-319-03898-8_30","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_30","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115056456","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}
引用次数: 15
Upper Bounds on Boolean-Width with Applications to Exact Algorithms 布尔宽度的上界及其在精确算法中的应用
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_26
Y. Rabinovich, J. A. Telle, M. Vatshelle
{"title":"Upper Bounds on Boolean-Width with Applications to Exact Algorithms","authors":"Y. Rabinovich, J. A. Telle, M. Vatshelle","doi":"10.1007/978-3-319-03898-8_26","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_26","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128963096","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
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups 置换群中不动点自由元与基的参数化复杂度
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_2
V. Arvind
{"title":"The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups","authors":"V. Arvind","doi":"10.1007/978-3-319-03898-8_2","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_2","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122333823","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
Contracting Few Edges to Remove Forbidden Induced Subgraphs 压缩少边去除禁止诱导子图
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_10
L. Cai, Chengwei Guo
{"title":"Contracting Few Edges to Remove Forbidden Induced Subgraphs","authors":"L. Cai, Chengwei Guo","doi":"10.1007/978-3-319-03898-8_10","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_10","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131073323","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
The Fine Details of Fast Dynamic Programming over Tree Decompositions 基于树分解的快速动态规划的细节
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_5
H. Bodlaender, P. Bonsma, D. Lokshtanov
{"title":"The Fine Details of Fast Dynamic Programming over Tree Decompositions","authors":"H. Bodlaender, P. Bonsma, D. Lokshtanov","doi":"10.1007/978-3-319-03898-8_5","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_5","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977052","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
Exact Complexity and Satisfiability - (Invited Talk) 精确复杂性和可满足性-(特邀演讲)
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_1
R. Impagliazzo, R. Paturi
{"title":"Exact Complexity and Satisfiability - (Invited Talk)","authors":"R. Impagliazzo, R. Paturi","doi":"10.1007/978-3-319-03898-8_1","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_1","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133002304","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
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges 关于缩边法消除小诱导子图的硬度
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_21
D. Lokshtanov, Neeldhara Misra, Saket Saurabh
{"title":"On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges","authors":"D. Lokshtanov, Neeldhara Misra, Saket Saurabh","doi":"10.1007/978-3-319-03898-8_21","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_21","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309348","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}
引用次数: 23
FPT Algorithms for Consecutive Ones Submatrix Problems 连续一子矩阵问题的FPT算法
International Symposium on Parameterized and Exact Computation Pub Date : 2013-09-04 DOI: 10.1007/978-3-319-03898-8_25
N. Narayanaswamy, R. Subashini
{"title":"FPT Algorithms for Consecutive Ones Submatrix Problems","authors":"N. Narayanaswamy, R. Subashini","doi":"10.1007/978-3-319-03898-8_25","DOIUrl":"https://doi.org/10.1007/978-3-319-03898-8_25","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115836943","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信