Posts

  1. Prof. Zhilin Wu’s Visit from 16 to 18 June, 2021
  2. A Fast Algorithm for SAT in Terms of Formula Length
  3. Score aggregation in social choice
  4. Random Sampling of Important Separators: New Bounds and New Applications
  5. Kernelization for Feedback Vertex Set based on linear programming
  6. Some efficient algorithms for the k-vertex cover problem
  7. Kernels for Planar Vertex-Disjoint Triangle Packing
  8. Approximation Algorithms for the Traveling Tournament Problem with Maximum Tour Length Two
  9. Prof. Yijia Chen’s Visit from 19 to 22 May, 2021
  10. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set