LEADER 05250nam 22007935 450 001 9911016068003321 005 20250718130232.0 010 $a3-031-98740-3 024 7 $a10.1007/978-3-031-98740-3 035 $a(MiAaPQ)EBC32226168 035 $a(Au-PeEL)EBL32226168 035 $a(CKB)39663741200041 035 $a(DE-He213)978-3-031-98740-3 035 $a(EXLCZ)9939663741200041 100 $a20250718d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Algorithms $e36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21?24, 2025, Proceedings /$fedited by Henning Fernau, Binhai Zhu 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (0 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15885 311 08$a3-031-98739-X 327 $aGuarding 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 $4^+$-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 $n$-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 $\ell_2$ 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. 330 $aThis 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. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15885 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer engineering 606 $aComputer networks 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer graphics 606 $aNumerical analysis 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Engineering and Networks 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aComputer Graphics 606 $aNumerical Analysis 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aComputer Engineering and Networks. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 676 $a004.0151 700 $aFernau$b Henning$01731916 701 $aZhu$b Binhai$01834406 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911016068003321 996 $aCombinatorial Algorithms$94409907 997 $aUNINA