Outputs (2)

Sorting and Hypergraph Orientation under Uncertainty with Predictions (2023)
Presentation / Conference Contribution
Erlebach, T., de Lima, M., Megow, N., & Schlöter, J. (2023). Sorting and Hypergraph Orientation under Uncertainty with Predictions. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (5577-5585). https://doi.org/10.24963/ijcai.2023/619

Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of uncertain input elements can be obtained by a query and the goal is to min... Read More about Sorting and Hypergraph Orientation under Uncertainty with Predictions.

List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs (2023)
Presentation / Conference Contribution
Baklan Sen, B., Diner, Ö. Y., & Erlebach, T. (2023). List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. In Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023) (168-181). https://doi.org/10.1007/978-3-031-49190-0_12

Given a graph G = (V, E) and a list of available colors L(v) for each vertex v ∈ V, where L(v) ⊆ {1, 2, . . . , k}, LIST k-COLORING refers to the problem of assigning colors to the vertices of G so that each vertex receives a color from its own list... Read More about List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.