Algorithms and Complexity:11th International Conference, CIAC 2019, Rome, Italy, May 27

图书简介

This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019.The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

Quadratic Vertex Kernel for Split Vertex Deletion.- The temporal explorer who returns to the base.- Minimum Convex Partition of Point Sets.- Parameterized Complexity of Safe Set.- Parameterized Complexity of Diameter.- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints.- Project Games.- Subgraph Isomorphism on Graph Classes that Exclude a Substructure.- Your Rugby Mates Don’t Need to Know your Colleagues: Triadic Closure with Edge Colors.- k-cuts on a path.- Extension of vertex cover and independent set in some classes of graphs.- On Hedonic Games with Common Ranking Property.- Complexity of scheduling for DARP with soft ride times.- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set.- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements.- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability.- Searching by heterogeneous agents.- Finding a Mediocre Player.- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation.- The Parameterized Position Heap of a Trie.- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set.- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.- Turing Tumble is P(SPACE)-Complete.- Linear-Time In-Place DFS and BFS on the Word RAM.- A Faster Algorithm for the Strongly Stable b-Matching Problem.- Eternal Domination in Grids.- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems.- Complexity of Vertex Switching on Edge-Bicolored Graphs.- Independent lazy better-response dynamics on network games.- Subset Feedback Vertex Set in Chordal and Split Graphs.

Trade Policy 买家须知

关于产品：
● 正版保障：本网站隶属于中国国际图书贸易集团公司，确保所有图书都是100%正版。
● 环保纸张：进口图书大多使用的都是环保轻型张，颜色偏黄，重量比较轻。
● 毛边版：即书翻页的地方，故意做成了参差不齐的样子，一般为精装版，更具收藏价值。
关于退换货：
由于预订产品的特殊性，采购订单正式发订后，买方不得无故取消全部或部分产品的订购。
由于进口图书的特殊性，发生以下情况的，请直接拒收货物，由快递返回：
● 外包装破损/发错货/少发货/图书外观破损/图书配件不全（例如：光盘等）
并请在工作日通过电话400-008-1110联系我们。
签收后，如发生以下情况，请在签收后的5个工作日内联系客服办理退换货：
● 缺页/错页/错印/脱线
关于发货时间：
一般情况下：
●【现货】下单后48小时内由北京（库房）发出快递。
●【预订】【预售】下单后国外发货，到货时间预计5-8周左右，店铺默认中通快递，如需顺丰快递邮费到付。
● 需要开具发票的客户，发货时间可能在上述基础上再延后1-2个工作日（紧急发票需求，请联系010-68433105/3213）；
● 如遇其他特殊原因，对发货时间有影响的，我们会第一时间在网站公告，敬请留意。
关于到货时间：
由于进口图书入境入库后，都是委托第三方快递发货，所以我们只能保证在规定时间内发出，但无法为您保证确切的到货时间。
● 主要城市一般2-4天
● 偏远地区一般4-7天
关于接听咨询电话的时间：
010-68433105/3213正常接听咨询电话的时间为：周一至周五上午8：30～下午5：00，周六、日及法定节假日休息，将无法接听来电，敬请谅解。
其它时间您也可以通过邮件联系我们：customer@readgo.cn,工作日会优先处理。
关于快递：
● 已付款订单：主要由中通、宅急送负责派送，订单进度查询请拨打010-68433105/3213。

Algorithms and Complexity:11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings（Theoretical Computer Science and General Issues） 算法与复杂度：第11届国际会议 2019 / 会议录 计算机软件

Algorithms and Complexity:11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings（Theoretical Computer Science and General Issues）

算法与复杂度：第11届国际会议 2019 / 会议录
计算机软件