|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Rastislav Královič , Věra KůrkováPublisher: Springer International Publishing AG Imprint: Springer International Publishing AG Volume: 15538 ISBN: 9783031826696ISBN 10: 3031826698 Pages: 363 Publication Date: 07 February 2025 Audience: Professional and scholarly , College/higher education , Professional & Vocational , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsInvited talks.- Distributed Computing by Mobile Robots: Exploring the Computational Landscape.- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs.- Contributed Papers.- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.- Online b-Matching with Stochastic Rewards.- Shortest Longest-Path Graph Orientations for Trees.- Parameterized Complexity of Generalizations of Edge Dominating Set.- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking.- On the Complexity of Minimum Membership Dominating Set.- On the Structural Parameterized Complexity of Defective Coloring.- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM.- Fast Practical Compression of Deterministic Finite Automata.- Orienteering (with Time Windows) on Restricted Graph Classes.- Massively Parallel Maximum Coverage Revisited.- Distance Vector Domination.- Sufficient conditions for polynomial-time detection of induced minors.- Pathways to Tractability for Geometric Thickness.- Minimum Monotone Spanning Trees.- Symvonis and Alexander Wol Representing Hypergraphs by Point-Line Incidences.- Reachability in temporal graphs under perturbation.- On Computational Completeness of Semi-Conditional Matrix Grammars.- Outer-(ap)RAC Graphs.- Forest Covers and Bounded Forest Covers.- Multi-Agent Search-Type Problems on Polygons.- Generation of Cycle Permutation Graphs and Permutation Snarks.- Expected Density of Random Minimizers.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |