IWOCA 2024: 35TH INTERNATIONAL WORKSHOP ON COMBINATORIAL ALGORITHMS

A
Aboulfath, Ylene	Maximizing Minimum Cycle Bases Intersection
Adekanye, Melvin	On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
Akram, Waseem	Dominance for Enclosure Problems
Alekseyev, Max	On computing sets of integers with maximum number of pairs summing to powers of 2
Ambashankar, Akash	Broadcasting in Star of Cliques
Antić, Todor	Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar Star-Forest Decompositions of Complete Graphs
Arimura, Hiroki	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
B
Bannai, Hideo	Computing maximal palindromes in non-standard matching models
Bar-Noy, Amotz	Approximate realizations for outerplanaric degree sequences
Barth, Dominique	Maximizing Minimum Cycle Bases Intersection
Bartier, Valentin	Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
Bensmail, Julien	An Improved Bound for Equitable Proper Labellings
Bodlaender, Hans	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Bok, Jan	Resolving Sets in Temporal Graphs
Brodnik, Andrej	Improving Online Bin Covering with Little Advice
Brosse, Caroline	Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
Bury, Christopher	On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
Böhnlein, Toni	Approximate realizations for outerplanaric degree sequences
C
Cameron, Ben	On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
Christodoulou, Filippos	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Coleman, Jared	Linear Search for an Escaping Target with Unknown Speed
Conte, Alessio	Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
Couto, Fernanda	Minimizing distances between vertices and edges through tree $t$-spanners
Crescenzi, Pierluigi	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Cunha, Luis	Minimizing distances between vertices and edges through tree $t$-spanners
D
D'Angelo, Gianlorenzo	Approximation Algorithms for Node-Weighted Directed Steiner Problems
Dailly, Antoine	Resolving Sets in Temporal Graphs
Dallard, Clément	Detecting $K_{2,3}$ as an induced minor
Defrain, Oscar	Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
Delfaraz, Esmaeil	Approximation Algorithms for Node-Weighted Directed Steiner Problems
Dimitrov, Stoyan	Simple random sampling of binary forests with fixed number of nodes and trees
Dumas, Maël	Detecting $K_{2,3}$ as an induced minor
E
Eto, Hiroshi	Directed Path Partition Problems on Directed Acyclic Graphs
F
Fernau, Henning	Perfect Roman Domination: Aspects of Enumeration and Parameterization
Fink, Jiri	Matchings in hypercubes extend to long cycles
Flocchini, Paola	The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots
Fujishige, Yuta	Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
Funakoshi, Mitsuru	Computing maximal palindromes in non-standard matching models Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
Funke, Stefan	Parameterized Upper Bounds for Path-Consistent Hub Labeling
G
Georgiou, Konstantinos	Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
Ghanbari, Babak	Approximate cycle double cover
Glišić, Jelena	Star-Forest Decompositions of Complete Graphs
H
Harutyunyan, Hovhannes	Broadcasting in Star of Cliques
Harvey, Daniel J.	Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
Hilaire, Claire	Detecting $K_{2,3}$ as an induced minor
Hougardy, Stefan	The Bottom-Left Algorithm for the Strip Packing Problem
Høgemo, Svein	Lower Bounds for Leaf Rank of Leaf Powers
I
Inenaga, Shunsuke	Computing maximal palindromes in non-standard matching models Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Ivanov, Dmitry	Linear Search for an Escaping Target with Unknown Speed
J
Jansson, Jesper	Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
Jedličková, Nikola	On the Structure of Hamiltonian Graphs with Small Independence Number
Johnson, Matthew	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
K
Kawaharada, Shunsuke	Directed Path Partition Problems on Directed Acyclic Graphs
Klasing, Ralf	Bamboo Garden Trimming Problem
Knodel, Thaler	On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
Kobayashi, Yasuaki	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
Kolman, Petr	Approximating Spanning Tree Congestion on Bounded Degree Graphs
Kranakis, Evangelos	Linear Search for an Escaping Target with Unknown Speed
Kratochvil, Jan	On the Structure of Hamiltonian Graphs with Small Independence Number
Krizanc, Danny	Linear Search for an Escaping Target with Unknown Speed
Kurita, Kazuhiro	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
L
Lehtilä, Tuomo	Resolving Sets in Temporal Graphs
Limouzy, Vincent	Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
Lin, Guohui	Directed Path Partition Problems on Directed Acyclic Graphs
Lin, Tong-Nong	Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Lin, Yu-Cheng	Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Lozin, Vadim	The Hamiltonian cycle problem and monotone classes
M
Mann, Kevin	Perfect Roman Domination: Aspects of Enumeration and Parameterization
Marcille, Clara	An Improved Bound for Equitable Proper Labellings
Marciniak, Mikolaj	Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
Marino, Andrea	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Martin, Barnaby	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Matsui, Yasuko	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
Mautor, Thierry	Maximizing Minimum Cycle Bases Intersection
Mc Inerney, Fionn	Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
Mieno, Takuya	Computing maximal palindromes in non-standard matching models Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Milanič, Martin	Detecting $K_{2,3}$ as an induced minor
Milivojčević, Milan	Star-Forest Decompositions of Complete Graphs
Miyano, Eiji	Directed Path Partition Problems on Directed Acyclic Graphs
Morales-Ponce, Oscar	Linear Search for an Escaping Target with Unknown Speed
Moura, Lucia	Cover-Free Families and Generalizations Based on Hypergraphs
Murakami, Yukihiro	Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
Mütze, Torsten	Matchings in hypercubes extend to long cycles
N
Nakashima, Yuto	Computing maximal palindromes in non-standard matching models Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Nilsson, Bengt J.	Improving Online Bin Covering with Little Advice
O
Ono, Hirotaka	Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
Oostveen, Jelle	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Ozdemir, Tugce	Directed Path Partition Problems on Directed Acyclic Graphs
P
Pandey, Sukanya	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Pattanayak, Debasish	The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots
Paulusma, Daniel	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Peleg, David	Approximate realizations for outerplanaric degree sequences
Perez, Anthony	Detecting $K_{2,3}$ as an induced minor
Pinto, Edmundo	Minimizing distances between vertices and edges through tree $t$-spanners
Pisanti, Nadia	ED-strings Similarities for PanGenomes Comparison
Posner, Daniel	Minimizing distances between vertices and edges through tree $t$-spanners
Punzi, Giulia	Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
R
Ran, Yingli	Approximate realizations for outerplanaric degree sequences
Rawitz, Dror	Approximate realizations for outerplanaric degree sequences
Rucci, Davide	Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
S
Samal, Robert	Approximate cycle double cover
Santoro, Nicola	The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots
Saxena, Sanjeev	Dominance for Enclosure Problems
Schwarz, Nikolas Alexander	Efficient Computation of Crossing Components and Shortcut Hulls
Shibata, Hiroki	Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Silva, Ana	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Smith, Siani	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Storandt, Sabine	Parameterized Upper Bounds for Path-Consistent Hub Labeling Efficient Computation of Crossing Components and Shortcut Hulls
T
Takeda, Masayuki	Computing maximal palindromes in non-standard matching models
Thilikos, Dimitrios M.	Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional
Trotignon, Nicolas	Detecting $K_{2,3}$ as an induced minor
Tsai, Cheng-Chen	Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Tsai, Meng-Tsung	Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Tsai, Shih-Yu	Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers
Tsujimoto, Taketo	Computing Longest Common Subsequence under Cartesian-Tree Matching Model
V
van Leeuwen, Erik Jan	Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem
Vujovic, Gordana	Improving Online Bin Covering with Little Advice
W
Wang, Xin	Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
Watel, Dimitri	Maximizing Minimum Cycle Bases Intersection
Weisser, Marc-Antoine	Maximizing Minimum Cycle Bases Intersection
Y
Yamashita, Masafumi	The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots
Z
Zondervan, Bart	The Bottom-Left Algorithm for the Strip Packing Problem

Disclaimer | Powered by EasyChair Smart Program