Welcome to the Good Vibes Corner Office Website!

The Good Vibes Corner Office is a corner of the BARC offices inhabited by Christian Bertram, Théo Borém Fabris, and Mads Vestergaard Jensen. Please consider visiting us in person! We will not ask for "good vibes only"; the name should be interpreted primarily ornithologically.

Guest Book

We love it when guests sign the Good Vibes Corner Office Sofa Guest Book in person. It is located next to the comfortable Good Vibes Corner Office Sofa, which is awaiting your visit. In the meantime, feel free to leave a note in the Good Vibes Corner Office Website Guest Book.

Open problems

Please solve these problem, but leave a few for us to ponder.

• Superconstant lower bounds for deterministic dictionaries. [1]
• Tight Ω(log^dn) lower bounds for d-dimensional range counting. [1, 2, 3]
• Ω(2^klog n) parameterized (conditional) lower bound for dynamic treewidth. [4]
• P≠NP.
• Tight bounds for online sorting / online metric TSP with extra space. [5]

Publications

• Personalized PageRank Estimation in Undirected Graphs
  Christian Bertram and Mads Vestergaard Jensen.
  Preprint 2026.
• Multilinear Algebraic Branching Programs and the Min-Partition Rank Method
  Théo Borém Fabris, Nutan Limaye, Srikanth Srinivasan, and Amir Yehudayoff.
  Preprint 2026.
• Negations are powerful even in small depth
  Bruno Pasqualotto Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, and Amir Yehudayoff.
  STOC 2026.
• Dynamic Meta-Kernelization
  Christian Bertram, Deborah Haun, Mads Vestergaard Jensen, Tuukka Korhonen.
  STOC 2026.
• Online Metric TSP (Metric Online Sorting)
  Christian Bertram.
  ESA 2025.
• Estimating Random-Walk Probabilities in Directed Graphs
  Christian Bertram, Mads Vestergaard Jensen, Mikkel Thorup, Hanzhi Wang, and Shuyi Yan.
  Preprint 2025.

Construction in progress