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

Format:

Book

Author/Creator:

Fernau, Henning.

Contributor:

Zhu, Binhai.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 15885

Language:

English

Subjects (All):

Computer science--Mathematics.

Computer science.

Discrete mathematics.

Computer engineering.

Computer networks.

Algorithms.

Data structures (Computer science).

Information theory.

Computer graphics.

Numerical analysis.

Discrete Mathematics in Computer Science.

Computer Engineering and Networks.

Design and Analysis of Algorithms.

Data Structures and Information Theory.

Computer Graphics.

Numerical Analysis.

Local Subjects:

Discrete Mathematics in Computer Science.

Computer Engineering and Networks.

Design and Analysis of Algorithms.

Data Structures and Information Theory.

Computer Graphics.

Numerical Analysis.

Physical Description:

1 online resource (0 pages)

Edition:

1st ed. 2025.

Place of Publication:

Cham : Springer Nature Switzerland : Imprint: Springer, 2025.

Summary:

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. .

Contents:

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 $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.

Notes:

Description based on publisher supplied metadata and other sources.

ISBN:

3-031-98740-3

OCLC:

1530380108