bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Space complexity of perfect matching in bounded genus bipartite graphs Samir Datta Raghav Kulkarni Raghunath Tewari N.V. Vinodchandran [github]
Reachability Is in DynFO Samir Datta Raghav Kulkarni Anish Mukherjee Thomas Schwentick Thomas Zeume [github]

Library Size: 13G (2 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]