{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/4c65e080-c631-4d9a-b1a4-02a9ca065f5a\" width=\"1280\" height=\"480\" title=\"Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/4c65e080-c631-4d9a-b1a4-02a9ca065f5a/episode.poster.webp","title":"Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds","type":"rich","version":"1.0","width":1280}