Combinatorial Algorithms : 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21–24, 2025, Proceedings / edited by Henning Fernau, Binhai Zhu

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Lecture Notes in Computer Science ; 15885Verlag: Cham : Springer Nature Switzerland, 2025Verlag: Cham : Imprint: Springer, 2025Auflage: 1st ed. 2025Beschreibung: 1 Online-Ressource(XVII, 460 p. 241 illus., 186 illus. in color.)ISBN:

9783031987403

Schlagwörter:

Andere physische Formen: 9783031987397 | 9783031987410 | Erscheint auch als: 9783031987397 Druck-Ausgabe | Erscheint auch als: 9783031987410 Druck-AusgabeDDC-Klassifikation:

004.0151 23

DOI: DOI: 10.1007/978-3-031-98740-3Online-Ressourcen:

Zugang im Netz des KIT

Zusammenfassung: Guarding a 1.5D terrain with Imprecise Viewpoints -- Extending simple monotone drawings -- Guarding Terrains with Guards on a Line -- Minimum-Complexity Graph Simplification under the Fréchet-Like Distance -- Drawing Reeb Graphs -- Monotone Partitions of Simple Polygons -- A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System -- Exact Learning of Weighted Graphs Using Composite Queries -- Monotone classes, even graphs and the Hamiltonian cycle problem -- Covering vertices by USD4^+USD-paths: A simpler local search coupled with a more delicate amortization -- Bicluster Editing with Overlaps: A Vertex Splitting Approach -- Vector spaces of graphs closed under isomorphism -- Average Sensitivity of Breadth-First Search Algorithms on Grids -- Permanent of bipartite graphs in terms of determinants -- Improved Approximation for Unpopularity in (3,3)-Hypergraph Matching with one-sided preferences -- Inverting Parameterized Burrows-Wheeler Transform -- A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences -- Fast Pattern Matching with Epsilon Transitions -- Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity (Extended Abstract) -- The Closed Geodetic Game: algorithms and strategies -- ETH Lower Bounds for USDnUSD-Queens: Time Waits for Nobody -- On Solving Simple Curved Nonograms -- Tile-based Knot Assembly with Celtic! -- On the existence of a subgroup magic rectangle -- Parameterized Algorithms for Power Edge Set and Zero Forcing Set -- Minimizing USD\ell_2USD Norm of Flow Time by Starvation Mitigation -- Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function -- Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs -- Optimal Random Bit Sampling for Set Partition-like Structures -- Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile -- Linear Search with Probabilistic Detection and Variable Speeds -- Streaming Algorithms for Scheduling Jobs with Priorities.Zusammenfassung: This book constitutes the refereed proceedings of the 36th International Workshop on Combinatorial Algorithms, IWOCA 2025, held in Bozeman, MT, USA, during July 21-24, 2025. The 32 full papers and two abstracts of invited talks included in this book were carefully reviewed and selected from 71 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business. .PPN: PPN: 1931459053Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-LNC

Exemplare ( 0 )
Titelinformationen ( 1 )

Dieser Titel hat keine Exemplare

Barrierefreier Inhalt: Accessibility summary: This PDF has been created in accordance with the PDF/UA-1 standard to enhance accessibility, including screen reader support, described non-text content (images, graphs), bookmarks for easy navigation, keyboard-friendly links and forms and searchable, selectable text. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. Please note that a more accessible version of this eBook is available as ePub.