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

International Symposium on Parameterized and Exact Computation最新文献

筛选
英文 中文
Randomized Techniques for Parameterized Algorithms 参数化算法的随机化技术
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_2
D. Marx
{"title":"Randomized Techniques for Parameterized Algorithms","authors":"D. Marx","doi":"10.1007/978-3-642-33293-7_2","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_2","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129124471","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
Enumerating Neighbour and Closest Strings 枚举邻接字符串和最近字符串
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_24
N. Nishimura, Narges Simjour
{"title":"Enumerating Neighbour and Closest Strings","authors":"N. Nishimura, Narges Simjour","doi":"10.1007/978-3-642-33293-7_24","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_24","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131674365","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}
引用次数: 7
Instance Compression for the Polynomial Hierarchy and beyond 多项式层次结构及以后的实例压缩
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_13
Chiranjit Chakraborty, R. Santhanam
{"title":"Instance Compression for the Polynomial Hierarchy and beyond","authors":"Chiranjit Chakraborty, R. Santhanam","doi":"10.1007/978-3-642-33293-7_13","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_13","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129925718","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
The Exponential Time Hypothesis and the Parameterized Clique Problem 指数时间假设与参数化团问题
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_4
Yijia Chen, Kord Eickmeyer, J. Flum
{"title":"The Exponential Time Hypothesis and the Parameterized Clique Problem","authors":"Yijia Chen, Kord Eickmeyer, J. Flum","doi":"10.1007/978-3-642-33293-7_4","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_4","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128930846","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
Computing Directed Pathwidth in O(1.89 n ) Time 在O(1.89 n)时间内计算有向路径宽度
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_18
Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, H. Tamaki, Toshihiro Tano
{"title":"Computing Directed Pathwidth in O(1.89 n ) Time","authors":"Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, H. Tamaki, Toshihiro Tano","doi":"10.1007/978-3-642-33293-7_18","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_18","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036765","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}
引用次数: 31
Finding Dense Subgraphs of Sparse Graphs 寻找稀疏图的密集子图
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_23
Christian Komusiewicz, Manuel Sorge
{"title":"Finding Dense Subgraphs of Sparse Graphs","authors":"Christian Komusiewicz, Manuel Sorge","doi":"10.1007/978-3-642-33293-7_23","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_23","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129399995","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
A New Algorithm for Parameterized MAX-SAT 一种新的参数化MAX-SAT算法
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_6
I. Bliznets, Alexander Golovnev
{"title":"A New Algorithm for Parameterized MAX-SAT","authors":"I. Bliznets, Alexander Golovnev","doi":"10.1007/978-3-642-33293-7_6","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_6","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132317256","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
Restricted and Swap Common Superstring: A Parameterized View 限制和交换公共超字符串:一个参数化的视图
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_7
P. Bonizzoni, R. Dondi, G. Mauri, I. Zoppis
{"title":"Restricted and Swap Common Superstring: A Parameterized View","authors":"P. Bonizzoni, R. Dondi, G. Mauri, I. Zoppis","doi":"10.1007/978-3-642-33293-7_7","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_7","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"9 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120842976","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
Weighted Counting of k-Matchings Is #W[1]-Hard k-匹配的加权计数是困难的
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_17
M. Bläser, Radu Curticapean
{"title":"Weighted Counting of k-Matchings Is #W[1]-Hard","authors":"M. Bläser, Radu Curticapean","doi":"10.1007/978-3-642-33293-7_17","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_17","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128184514","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
An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem 无向平面反馈顶点集问题的改进核
International Symposium on Parameterized and Exact Computation Pub Date : 2012-09-12 DOI: 10.1007/978-3-642-33293-7_25
F. Abu-Khzam, M. B. Khuzam
{"title":"An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem","authors":"F. Abu-Khzam, M. B. Khuzam","doi":"10.1007/978-3-642-33293-7_25","DOIUrl":"https://doi.org/10.1007/978-3-642-33293-7_25","url":null,"abstract":"","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124352425","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学术官方微信