Weekly Seminars

  1. Improving Maximum k-Plex Solver via Second-Order Reduction and Graph Color Bounding
  2. PPSZ on unique-kSAT
  3. A Fast Algorithm for SAT in Terms of Formula Length
  4. Random Sampling of Important Separators: New Bounds and New Applications
  5. Kernelization for Feedback Vertex Set based on linear programming
  6. Kernels for Planar Vertex-Disjoint Triangle Packing
  7. Approximation Algorithms for the Traveling Tournament Problem with Maximum Tour Length Two
  8. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
  9. An Experimental Study of the Feedback Arc Set Problem
  10. Random sampling in social network auction