Marek Cygan, Alexander Kulikov, Ivan Mihajlin, Maksim Nikolaev and Grigory Reznikov: Minimum Common String Partition: Exact Algorithms Krzysztof Potępa: Faster Deterministic Modular Subset Sum Éric Colin de Verdière and Thomas Magnard: An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes R-SWAP: Relay based atomic cross-chain swap protocol Léonard Lys, Arthur Micoulet and Maria Potop-Butucaru. Leon Kellerhals, Malte Renken and Philipp Zschoche: Parameterized Algorithms for Diverse Multistage Problems Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon Pissis and Jakub Radoszewski: Faster Algorithms for Longest Common Substring Katarzyna Paluch and Mateusz Wasylkiewicz: Restricted t-matchings via half-edges Shahin Kamali and Pooya Nikbakht: On the Fault-Tolerant Online Bin Packing Problem Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, Moritz Venzin and Robert Weismantel: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity Michał Dębski, Marta Piecyk and Paweł Rzążewski: Faster 3-coloring of small-diameter graphsĬlaire Mathieu and Hang Zhou: A Simple Algorithm for Graph Reconstruction Unsure about Portugal time zone? [Please checkĮSA Track A: Graph algorithms chair: Édouard BonnetĮSA Track A: Scalable algorithms chair: Benjamin DoerrĮSA Track A: Computationally hard problems chair: Holger Dell
0 kommentar(er)
