Seminars

  1. Approximation Algorithms for the Traveling Tournament Problem with Maximum Tour Length Two
  2. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
  3. Constant Approximating k-Clique is W[1]-hard
  4. Mathematical Principles of Information Sciences, II: Mathematical Theory of Intuitive Reasoning
  5. An Experimental Study of the Feedback Arc Set Problem
  6. Mathematical Principles of Information Sciences, I: The Laws of Information
  7. Random sampling in social network auction
  8. Random sampling in auction with budget
  9. How fast can we solve NP-complete problems?
  10. Random sampling in auction