LFCS Seminar: Tuesday, 27 June - Sushmita Gupta Title: Gerrymandering on graphs: Computational complexity and parameterized algorithms Abstract: Gerrymandering, the practice of partitioning a region into areas to favor a particular candidate or a party in an election has been known to exist for over a century. Recently, the problem has been modeled combinatorially in terms of graphs and several results have been proved pertaining to its complexity. In this talk we will survey the known results with the focus on exact-exponential and parameterized algorithms. Jun 27 2023 16.00 - 17.00 LFCS Seminar: Tuesday, 27 June - Sushmita Gupta Sushmita Gupta, National Institute of Science Education and Research (NISER), India https://sites.google.com/view/sushmitagupta/home Venue: IF G.03
LFCS Seminar: Tuesday, 27 June - Sushmita Gupta Title: Gerrymandering on graphs: Computational complexity and parameterized algorithms Abstract: Gerrymandering, the practice of partitioning a region into areas to favor a particular candidate or a party in an election has been known to exist for over a century. Recently, the problem has been modeled combinatorially in terms of graphs and several results have been proved pertaining to its complexity. In this talk we will survey the known results with the focus on exact-exponential and parameterized algorithms. Jun 27 2023 16.00 - 17.00 LFCS Seminar: Tuesday, 27 June - Sushmita Gupta Sushmita Gupta, National Institute of Science Education and Research (NISER), India https://sites.google.com/view/sushmitagupta/home Venue: IF G.03
Jun 27 2023 16.00 - 17.00 LFCS Seminar: Tuesday, 27 June - Sushmita Gupta Sushmita Gupta, National Institute of Science Education and Research (NISER), India https://sites.google.com/view/sushmitagupta/home
