Fields- IWOCA 2021 - 32nd International Workshop on Combinatorial Algorithms

  1. Title:
    The Tandem Duplication Distance Problem is hard over bounded alphabets
    Speaker:
    Ferdinando Cicalese*

    Link:
    https://video-archive.fields.utoronto.ca/view/14102

  2. Title:
    Isomorphic unordered labeled trees up to substitution ciphering
    Speaker:
    Florian Ingels*

    Link:
    https://video-archive.fields.utoronto.ca/view/14101

  3. Title:
    Combinatorics and algorithms for quasi-chain graphs
    Speaker:
    Bogdan Alecu

    Link:
    https://video-archive.fields.utoronto.ca/view/14100

  4. Title:
    Approximating Multistage Matching Problems
    Speaker:
    Markus Chimani

    Link:
    https://video-archive.fields.utoronto.ca/view/14099

  5. Title:
    Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
    Speaker:
    Andrea Marino

    Link:
    https://video-archive.fields.utoronto.ca/view/14086

  6. Title:
    Best Student Paper Award: Non-preemptive tree packing
    Speaker:
    Stefan Lendl

    Link:
    https://video-archive.fields.utoronto.ca/view/14098

  7. Title:
    Best Paper Award: Edge exploration of temporal graphs
    Speaker:
    Benjamin Merlin Bumpus*

    Link:
    https://video-archive.fields.utoronto.ca/view/14085

  8. Title:
    Induced subgraphs and tree decompositions
    Speaker:
    Maria Chudnovsky

    Link:
    https://video-archive.fields.utoronto.ca/view/14082

  9. Title:
    Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
    Speaker:
    Martin Kučera*

    Link:
    https://video-archive.fields.utoronto.ca/view/14096

  10. Title:
    Algorithms and Complexity of s-Club Cluster Vertex Deletion
    Speaker:
    Dibyayan Chakraborty

    Link:
    https://video-archive.fields.utoronto.ca/view/14078