• Allocation problems with partial information 

      Tripathi, Pushkar (Georgia Institute of Technology, 2012-06-28)
      Allocation problems have been central to the development of the theory of algorithms and also find applications in several realms of computer science and economics. In this thesis we initiate a systematic study of these ...
    • Combinatorial problems for graphs and partially ordered sets 

      Wang, Ruidong (Georgia Institute of Technology, 2015-11-13)
      This dissertation has three principal components. The first component is about the connections between the dimension of posets and the size of matchings in comparability and incomparability graphs. In 1951, Hiraguchi proved ...
    • New approaches to integer programming 

      Chandrasekaran, Karthekeyan (Georgia Institute of Technology, 2012-06-28)
      Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating theoretical developments, and has improved our ability to ...