FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=035ot1zGiNo
013th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/
FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs
Balaram Behera (Georgia Tech)
Edin Husić (London School of Economics and Political Science)
Shweta Jain (University of Illinois, Urbana-Champaign)
Tim Roughgarden (Columbia University)
C. Seshadhri (University of California, Santa Cruz)
https://doi.org/10.4230/LIPIcs.ITCS.2022.17
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-02 | ITCS 2022 Session 13 |
| 2022-02-02 | ITCS 2022 Graduating Bits |
| 2022-02-02 | ITCS 2022 Session 12 |
| 2022-02-02 | ITCS 2022 Session 11 |
| 2022-02-02 | ITCS 2022 Session 10 |
| 2022-02-02 | ITCS 2022 Session 9 |
| 2022-02-02 | ITCS 2022 Session 8 |
| 2022-02-01 | ITCS 2022 Graduating Bits |
| 2022-02-01 | ITCS 2022 Session 7 |
| 2022-02-01 | Uniform brackets, containers, and combinatorial Macbeath regions |
| 2022-02-01 | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs |
| 2022-02-01 | Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs |
| 2022-02-01 | ITCS 2022 Session 6 |
| 2022-02-01 | ITCS 2022 Session 5 |
| 2022-02-01 | ITCS 2022 Session 4 |
| 2022-02-01 | ITCS 2022 Session 3 |
| 2022-01-31 | ITCS 2022 Session 2 |
| 2022-01-31 | ITCS 2022 Session 1 |
| 2022-01-31 | Randomness Extraction from Somewhat Dependent Sources |
| 2022-01-31 | Noisy Boolean Hidden Matching with Applications |
| 2022-01-31 | Small Circuits Imply Efficient Arthur-Merlin Protocols |