IWOCA 2026: 37TH INTERNATIONAL WORKSHOP ON COMBINATORIAL ALGORITHMS

A
Abu-Khzam, Faisal	On the Complexity of Vertex-Splitting Into an Interval Graph
Adak, Rajat	Bounds on Linear Tur\'{a}n Number for Trees
Akhtar, Sheikh Shakil	Exact Algorithms for Edge Deletion to Cactus
Amouzandeh, Aflatoun	Minimizing the Weighted Makespan with Restarts on a Single Machine
Antony, Dhanyamol	Parameterized algorithms for k-Inversion
Aráujo, Julio	On the rank and the general position number in cycle convexity
Aráujo, Samuel	On the rank and the general position number in cycle convexity
B
Bakal, Deepak	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
Bar-Noy, Amotz	Degree Realization with Maximum Matching
Beaton, Iain	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
Beisegel, Jesse	Breadth-First Search Trees with Many or Few Leaves
Bodlaender, Hans	The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Borse, Yashwant	Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs
Breitkopf, Tom-Lukas	Parameterized Algorithms for Computing MAD Trees
C
Cameron, Ben	Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
Chakraborty, Dipayan	On the Complexity of Vertex-Splitting Into an Interval Graph
Chandran, L. Sunil	Parameterized algorithms for k-Inversion
Chatterjee, Sobyasachi	Dominating Set with Quotas: Balancing Coverage and Constraints
Choudhury, Neelabjo Shubhashis	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
Cioni, Lapo	Enumerating Spanners in Directed Temporal Graphs
Custódio, Ricardo	Cryptographic applications of combinatorial ranking algorithms for integer compositions
D
D'Ascenzo, Andrea	Beer Path Problems in Temporal Graphs
da Silveira Martins, Ana Beatriz	(Even hole, triangle)-free graphs revisited
Das, Soura Sena	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Depian, Thomas	Realizing Planar Linkages in Polygonal Domains
Dobrev, Stefan	Online Drone Coverage of Targets on a Line
Dürr, Christoph	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
F
Fotakis, Dimitris	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Froese, Vincent	Parameterized Algorithms for Computing MAD Trees
Fu, Bin	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
G
Georgiou, Konstantinos	Online Drone Coverage of Targets on a Line
German, Samuel	A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast
Gourvès, Laurent	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Gremelmaier Rosa, Larissa	Cryptographic applications of combinatorial ranking algorithms for integer compositions
Gupta, Chetan	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
Gupta, Sushmita	Dominating Set with Quotas: Balancing Coverage and Constraints
H
Haase, Carolina	Realizing Planar Linkages in Polygonal Domains
Hakanen, Anni	Solid-resolving sets on directed graphs
Hamada, Shunsuke	Minimum Clique Bicoloring
Havet, Frédéric	On the $(\leq p)$-inversion diameter of oriented graphs
Herrmann, Anton	Parameterized Algorithms for Computing MAD Trees
Huo, Yumei	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
I
Isenmann, Lucas	On the Complexity of Vertex-Splitting Into an Interval Graph
Italiano, Giuseppe F.	Beer Path Problems in Temporal Graphs
J
Jacob, Dalu	Parameterized algorithms for k-Inversion
Jansen, Klaus	Hardness of SetCover Reoptimization Minimizing the Weighted Makespan with Restarts on a Single Machine
K
Kalinichev, Igor	Degree Realization with Maximum Matching
Kalyanasundaram, Subrahmanyam	Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Kanellopoulos, Sotiris	Beer Path Problems in Temporal Graphs
Kranakis, Evangelos	Online Drone Coverage of Targets on a Line
Krizanc, Danny	Online Drone Coverage of Targets on a Line
Kumar, Hitendra	Tight upper bounds on color reversal by local inversions
Kumar, Subodh	Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Köhler, Ekkehard	Breadth-First Search Trees with Many or Few Leaves
L
Lamprou, Ioannis	Domination and Coverage Problems under Vulnerability Constraints
Lazaropoulos, Nikolaos	Domination and Coverage Problems under Vulnerability Constraints
Lehtilä, Tuomo	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Liyanage, Adiesha	Fast Order Statistics with Group Inequality Testing
M
Mallem, Maher	The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Marcille, Clara	An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
Marino, Andrea	Enumerating Spanners in Directed Temporal Graphs
Medeiros, Pedro	On the rank and the general position number in cycle convexity
Merino, Arturo	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Moura, Lucia	Cryptographic applications of combinatorial ranking algorithms for integer compositions One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Mpanti, Anna	Beer Path Problems in Temporal Graphs
Mumey, Brendan	Fast Order Statistics with Group Inequality Testing
Mömke, Tobias	Hardness of SetCover Reoptimization
N
Narayanan, Lata	Online Drone Coverage of Targets on a Line
Nichterlein, André	Parameterized Algorithms for Computing MAD Trees
Nisse, Nicolas	On the rank and the general position number in cycle convexity
Nöllenburg, Martin	Realizing Planar Linkages in Polygonal Domains
O
Oijid, Nacim	An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs On the Complexity of Vertex-Splitting Into an Interval Graph
Okada, Yuto	Minimum Clique Bicoloring
Ono, Hirotaka	Minimum Clique Bicoloring
Opatrny, Jaroslav	Online Drone Coverage of Targets on a Line
Otachi, Yota	Minimum Clique Bicoloring
P
P D, Pavan	Solid-resolving sets on directed graphs
Pagourtzis, Aris	Beer Path Problems in Temporal Graphs Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Panario, Daniel	Cryptographic applications of combinatorial ranking algorithms for integer compositions
Pandey, Arti	Improved Bounds on Proper Conflict-free Coloring of Graphs
Pankratov, Denis	Online Drone Coverage of Targets on a Line
Parida, Prangya	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Patsilinakos, Panagiotis	Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes
Paul, Kaustav	Improved Bounds on Proper Conflict-free Coloring of Graphs
Peleg, David	Degree Realization with Maximum Matching
Pergaminelis, Christos	Beer Path Problems in Temporal Graphs
Philip, Geevarghese	Exact Algorithms for Edge Deletion to Cactus
Pirotton, Lis	Minimizing the Weighted Makespan with Restarts on a Single Machine
Porte, Kumud Singh	Tight upper bounds on color reversal by local inversions
R
Rambaud, Clément	On the $(\leq p)$-inversion diameter of oriented graphs
Rawitz, Dror	Degree Realization with Maximum Matching
Reddy, Sangam Balchandar	On the Complexity of Signed Domination
Richer, Camille	Parameterized Algorithms for Computing MAD Trees
S
Sandeep, R.B.	Parameterized algorithms for k-Inversion Tight upper bounds on color reversal by local inversions
Saurabh, Saket	Dominating Set with Quotas: Balancing Coverage and Constraints
Scheffler, Robert	Breadth-First Search Trees with Many or Few Leaves
Schoeters, Jason	Enumerating Spanners in Directed Temporal Graphs
Schulz, André	Realizing Planar Linkages in Polygonal Domains
Schumacher, Björn	Hardness of SetCover Reoptimization
Seetharaman, Sanjay	Dominating Set with Quotas: Balancing Coverage and Constraints
Sen, Sagnik	On $(1,\leq l)$-locating-dominating codes in infinite triangular grid
Sharma, Ankit	Improved Bounds on Proper Conflict-free Coloring of Graphs
Shende, Sunil	Online Drone Coverage of Targets on a Line
Sigalas, Ioannis	Domination and Coverage Problems under Vulnerability Constraints
Silva, Caroline	On the $(\leq p)$-inversion diameter of oriented graphs On the rank and the general position number in cycle convexity
Sopp, Braeden	Fast Order Statistics with Group Inequality Testing
Soto, José A.	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Stevens, Brett	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Strehler, Martin	Breadth-First Search Trees with Many or Few Leaves
T
Tewari, Raghunath	Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL
Trotignon, Nicolas	(Even hole, triangle)-free graphs revisited
U
Uno, Takeaki	Enumerating Spanners in Directed Temporal Graphs
Upasana, Anannya	Dominating Set with Quotas: Balancing Coverage and Constraints
V
van Stee, Rob	Minimizing the Weighted Makespan with Restarts on a Single Machine
Vaxevanakis, Ioannis	Domination and Coverage Problems under Vulnerability Constraints
Verma, Pragya	Bounds on Linear Tur\'{a}n Number for Trees
Verschae, José	Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
W
Wambsganz, Corinna	Minimizing the Weighted Makespan with Restarts on a Single Machine
Williams, Aaron	One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes
Z
Zambonin, Gustavo	Cryptographic applications of combinatorial ranking algorithms for integer compositions
Zhao, Hairong	Minimizing Makespan in Sublinear Time via Weighted Random Sampling
Zissimopoulos, Vassilis	Domination and Coverage Problems under Vulnerability Constraints

Disclaimer | Powered by EasyChair Smart Program