IWOCA 2026: 37TH INTERNATIONAL WORKSHOP ON COMBINATORIAL ALGORITHMS

This page contains an index consisting of author-provided keywords.

$
$P_4$- Sparse graphs	Improved Bounds on Proper Conflict-free Coloring of Graphs
3
3-degenerate graphs	Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
A
Adaptive Online Algorithms	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Algorithms	(Even hole, triangle)-free graphs revisited
all-to-all connectivity enumeration	Enumerating Spanners in Directed Temporal Graphs
Approximation	Hardness of SetCover Reoptimization
Approximation Algorithms	Fast Order Statistics with Group Inequality Testing Domination and Coverage Problems under Vulnerability Constraints
approximation scheme	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
AT-free graphs	Improved Bounds on Proper Conflict-free Coloring of Graphs
B
Beer path	Beer Path Problems in Temporal Graphs
BFS layers	A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast
Bicolored graph	Tight upper bounds on color reversal by local inversions
Bipartite Perfect Matching	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
bondage	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
C
Cactus	Exact Algorithms for Edge Deletion to Cactus
certifying algorithm	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
Chordal graph	On the Complexity of Vertex-Splitting Into an Interval Graph
Chordal graphs	An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
clique coloring	Minimum Clique Bicoloring
clique transversal	Minimum Clique Bicoloring
Color reversal	Tight upper bounds on color reversal by local inversions
combinatorial generation	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
combinatorial optimization	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Competitive Ratio	Online Drone Coverage of Targets on a Line
computational complexity	Minimum Clique Bicoloring Realizing Planar Linkages in Polygonal Domains
Conflict-free Coloring	Improved Bounds on Proper Conflict-free Coloring of Graphs
Conflict-free cut	Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Coverage	Domination and Coverage Problems under Vulnerability Constraints
critical graph	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
cycle convexity	On the rank and the general position number in cycle convexity
D
Degree realization	Degree Realization with Maximum Matching
Density	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
diameter	On the $(\leq p)$-inversion diameter of oriented graphs
Digraph	Solid-resolving sets on directed graphs
directed acyclic graphs	Parameterized algorithms for k-Inversion A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast
Directed Bandwidth	The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
directed graph	Enumerating Spanners in Directed Temporal Graphs
Distance hereditary graphs	Improved Bounds on Proper Conflict-free Coloring of Graphs
dominating set	Dominating Set with Quotas: Balancing Coverage and Constraints
domination	Domination and Coverage Problems under Vulnerability Constraints Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
Drones	Online Drone Coverage of Targets on a Line
Dual-hardness	Enumerating Spanners in Directed Temporal Graphs
E
edge deletion	Exact Algorithms for Edge Deletion to Cactus
Enumerative coding	Cryptographic applications of combinatorial ranking algorithms for integer compositions
Even-hole-free graphs	(Even hole, triangle)-free graphs revisited
Exact exponential algorithms	Exact Algorithms for Edge Deletion to Cactus
Existential Theory of the Reals	Realizing Planar Linkages in Polygonal Domains
Expansion	Bounds on Linear Tur\'{a}n Number for Trees
F
Feedback vertex set number	On the Complexity of Signed Domination
forbidden induced subgraphs	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
forbidden pairs	A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast
Forced vertices	Solid-resolving sets on directed graphs
FPT	On the Complexity of Signed Domination
G
Gaussian law	Cryptographic applications of combinatorial ranking algorithms for integer compositions
general position number	On the rank and the general position number in cycle convexity
Generalized locating-dominating sets	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Generalized locating-dominating sets - type A	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Generalized locating-dominating sets - type B	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Genus	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
graph algorithms	Beer Path Problems in Temporal Graphs Minimum Clique Bicoloring Exact Algorithms for Edge Deletion to Cactus
graph coloring	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
graph colouring	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
graph convexity	On the rank and the general position number in cycle convexity
graph modification problems	Parameterized algorithms for k-Inversion
Graph operations	Tight upper bounds on color reversal by local inversions
graph search	Breadth-First Search Trees with Many or Few Leaves
Gray codes	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
greedy algorithms	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Group Inequality Testing	Fast Order Statistics with Group Inequality Testing
I
Infinite triangular grid	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Influence maximization	Domination and Coverage Problems under Vulnerability Constraints
Interval graph	On the Complexity of Vertex-Splitting Into an Interval Graph
Interval graphs	Improved Bounds on Proper Conflict-free Coloring of Graphs
inversion graph	On the $(\leq p)$-inversion diameter of oriented graphs
Inverted prefix lemma	Degree Realization with Maximum Matching
K
k-Inversion	Parameterized algorithms for k-Inversion
L
Linear Tur\'{a}n Number	Bounds on Linear Tur\'{a}n Number for Trees
Linkages	Realizing Planar Linkages in Polygonal Domains
Local inversion	Tight upper bounds on color reversal by local inversions
Locating-dominating sets	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
loopless algorithms	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
M
makespan minimization	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
many-to-all connectivity enumeration	Enumerating Spanners in Directed Temporal Graphs
maximum matching	Degree Realization with Maximum Matching
Metric dimension	Solid-resolving sets on directed graphs
mixed-radix words	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Monitoring edge-geodetic	An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
N
Neighbourhood diversity	On the Complexity of Signed Domination
Network Design	Parameterized Algorithms for Computing MAD Trees
NP-complete	On the Complexity of Signed Domination
NP-completeness	A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts Enumerating Spanners in Directed Temporal Graphs
O
Online Algorithms	Minimizing the Weighted Makespan with Restarts on a Single Machine Online Drone Coverage of Targets on a Line
Optimum Distance Spanning Trees	Parameterized Algorithms for Computing MAD Trees
oracle	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Order Statistics	Fast Order Statistics with Group Inequality Testing
orientation	On the $(\leq p)$-inversion diameter of oriented graphs
Oriented graph	Solid-resolving sets on directed graphs
output-polynomial	Enumerating Spanners in Directed Temporal Graphs
P
parallel algorithms	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
parallel machines	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
parameterized algorithms	Parameterized algorithms for k-Inversion
parameterized complexity	Breadth-First Search Trees with Many or Few Leaves Minimum Clique Bicoloring Dominating Set with Quotas: Balancing Coverage and Constraints Realizing Planar Linkages in Polygonal Domains The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Path-Planning	Online Drone Coverage of Targets on a Line
Planar graphs	Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Polygonal Domain	Realizing Planar Linkages in Polygonal Domains
Polynomial-time algorithm	An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
Proper Conflict-free Coloring	Improved Bounds on Proper Conflict-free Coloring of Graphs
Q
queries	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
R
Randomized Algorithms	Fast Order Statistics with Group Inequality Testing
rank	On the rank and the general position number in cycle convexity
Reachability	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
Realization algorithm	Degree Realization with Maximum Matching
reconfiguration	On the $(\leq p)$-inversion diameter of oriented graphs
Recourse	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
reinforcement	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
Removable Items	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Reoptimization	Hardness of SetCover Reoptimization
Resolving set	Solid-resolving sets on directed graphs
restarts	Minimizing the Weighted Makespan with Restarts on a Single Machine
reverse search	Enumerating Spanners in Directed Temporal Graphs
Routing Cost	Parameterized Algorithms for Computing MAD Trees
S
scheduling	Minimizing the Weighted Makespan with Restarts on a Single Machine The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Set cover	Hardness of SetCover Reoptimization
set selection	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Shortest paths	Beer Path Problems in Temporal Graphs
Shuffle Product	The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Signed domination	On the Complexity of Signed Domination
Solid-metric dimension	Solid-resolving sets on directed graphs
Solid-resolving set	Solid-resolving sets on directed graphs
spanning tree	Breadth-First Search Trees with Many or Few Leaves
sparse graph classes	Dominating Set with Quotas: Balancing Coverage and Constraints
sparse graphs	Exact Algorithms for Edge Deletion to Cactus
Split graphs	On the Complexity of Signed Domination Improved Bounds on Proper Conflict-free Coloring of Graphs
Steiner System	Bounds on Linear Tur\'{a}n Number for Trees
Structure	(Even hole, triangle)-free graphs revisited
sublinear time algorithm	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
Surface Non-separating Cycles	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
T
Target Coverage	Online Drone Coverage of Targets on a Line
temporal graph	Enumerating Spanners in Directed Temporal Graphs
Temporal graphs	Beer Path Problems in Temporal Graphs
temporal spanner	Enumerating Spanners in Directed Temporal Graphs
Tight bound	Tight upper bounds on color reversal by local inversions
total bondage	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
total reinforcement	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
Treewidth	(Even hole, triangle)-free graphs revisited
Triangle-free graphs	(Even hole, triangle)-free graphs revisited
U
Unambiguous Logspace	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
uncertainty	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Uniform Linear Hypergraph	Bounds on Linear Tur\'{a}n Number for Trees
Uniform sampling	Cryptographic applications of combinatorial ranking algorithms for integer compositions
Unweighted Knapsack	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
V
Vertex splitting	On the Complexity of Vertex-Splitting Into an Interval Graph
vertex-critical graph	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
Vulnerable	Domination and Coverage Problems under Vulnerability Constraints
W
W[1]-hard	On the Complexity of Signed Domination
weighted makespan	Minimizing the Weighted Makespan with Restarts on a Single Machine
weighted random sampling	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
Width Parameters	A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast Parameterized Algorithms for Computing MAD Trees
Wiener Index	Parameterized Algorithms for Computing MAD Trees
X
XNLP	The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth

Disclaimer | Powered by EasyChair Smart Program