• Current Events
  • Past Events

  • Nov08

    K-Center is a well known optimization problem that is inspired by facility location and clustering. For more than three decades, researchers have studied algorithms for computing approximately optimal solutions for variations of this problem. We will discuss some of these variants, focusing on the algorithmic approaches that have been employed.

    Research Interests

    4:30pm to 5:30pm
    W401 PBB
    Kasturi Varadarajan
    University of Iowa Computer Science
  • Nov08

    The Computer Science (CS) department welcomes prospective students interested in our graduate programs to our annual Prospective Student Visit Day on Fri, Nov 8.

    9:30am to 5:30pm
    W401 PBB
    UI CS Grad Students and Faculty
    University of Iowa Computer Science Department
  • Nov06

    Need something to beef up your resume, but have no idea where to start? Join us as we discuss how to start a side project and what kind you can start! You can then start to add those projects to your resume and gain industry skills to talk about in your interviews!

    As always, be sure to check out our social medias and websites for more updates:



    6:30pm to 7:30pm
    N104 LC
    SiTS - Students in Technology and Sciences
  • Nov01

    Three transformations are underway in the global practice of online information control: commoditization of filtering technologies, the decentralization of filtering from government-run technical chokepoints to legally mandatory distributed enforcement by private ISPs, and political normalization and transnational spread of new filtering practices — often in the name of “data sovereignty” or national security.

    4:00pm to 5:00pm
    110 MLH
    Roya Ensafi
    Computer Science & Engineering | University of Michigan
  • Oct30

    The interplay between discrete and continuous optimization has been an exciting theme in recent years. This talk will focus on submodular function maximization as a case study to demonstrate the power of this interplay. Some of the main results in this space have been obtained almost a decade ago. Recently there has been a new direction of interest, namely to find parallel and low-adaptivity algorithms. The talk will describe some of these recent developments. No prior background on submodular functions will be assumed.

    4:00pm to 5:00pm
    2229 SC
    Chandra Chekuri
    Computer Science | University of Illinois, Urbana-Champaign
Subscribe to Events