Fields- IWOCA 2021 - 32nd International Workshop on Combinatorial Algorithms
-
Title: Approximation Algorithms for Hitting Subgraphs
Speaker:
Link:
-
Title: The Pony Express Communication Problem
Speaker:
Link:
-
Title: A study on the existence of null labelling for 3-hypergraphs
Speaker:
Link:
-
Title: Disjoint Paths and Connected Subgraphs for H-free Graphs
Speaker:
Link:
-
Title: Vertex Cover at Distance on H-free Graphs
Speaker:
Link:
-
Title: Token Swapping
Speaker:
Link:
-
Title: A triangle process on regular graphs
Speaker:
Link:
-
Title: Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
Speaker:
Link:
-
Title: Card-based Cryptographic Protocols for Three-input Functions Using Private Operations
Speaker:
Link:
-
Title: Piercing All Translates of a Set of Axis-Parallel Rectangles
Speaker:
Link:
-
Title: Intersecting Disks using Two Congruent Disks
Speaker:
Link:
-
Title: Reconfiguring Simple s,t Hamiltonian Paths in Rectangular Grid Graphs
Speaker:
Link:
-
Title: Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs
Speaker:
Link:
-
Title: Heuristically enhanced IPO Algorithms for Covering Array Generation
Speaker:
Link:
-
Title: Backtrack search for parallelisms of projective spaces
Speaker:
Link:
-
Title: Search for combinatorial objects using lattice algorithms - revisited
Speaker:
Link:
-
Title: On the oriented coloring of the disjoint union of graphs
Speaker:
Link:
-
Title: All Subgraphs of a Wheel are 5-coupled-choosable
Speaker:
Link:
-
Title: Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Speaker:
Link:
-
Title: Complexity and Algorithms for MUL-Tree Pruning
Speaker:
Link: