Planar Steiner Tree With Terminals On Few Faces
S\'andor Kisfaludi-Bak (Max Planck Institute for Informatics)
18-Mar-2021, 16:00-17:00 (5 years ago)
data structures and algorithms
Audience: researchers in the topic
Frontiers of Parameterized Complexity
Series comments: Link to the zoom meeting: uib.zoom.us/j/4231169675 Meeting ID: 423 116 9675 Password: Name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.
| Organizers: | Fedor Fomin, Saket Saurabh, Roohani Sharma* |
| *contact for this listing |
Export talk to