Algorithms and complexity : 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings /: 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. (2019)

• Record Type: Book
• Other Titles: CIAC 2019
• Further Information: Note: Pinar Heggernes (ed.).
• Editors: Heggernes, Pinar
• Other Names: International Conference on Algorithms and Complexity, 11th
• Contents: 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (xiii, 378 pages), illustrations (some color)
• Subjects: 518.1; Algorithms -- Congresses; Computational complexity -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030174026; 3030174026
• Related ISBNs: 9783030174019
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed June 18, 2019).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.