This is the collection for the University of Waterloo's Department of Combinatorics and Optimization .

Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).

Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.

Recent deposits

  • Spectral properties of tensor products of channels 

    Jaques, Samuel; Rahaman, Mizanur (Elsevier, 2018-09-15)
    We investigate spectral properties of the tensor products of two completely positive and trace preserving linear maps (also known as quantum channels) acting on matrix algebras. This leads to an important question of when ...
  • Action of degenerate Bethe operators on representations of the symmetric group 

    Rahman, Sifat (University of Waterloo, 2018-05-24)
    Degenerate Bethe operators are elements defined by explicit sums in the center of the group algebra of the symmetric group. They are useful on account of their relation to the Gelfand-Zetlin algebra and the Young-Jucys-Murphy ...
  • The Capacitated Matroid Median Problem 

    Kalhan, Sanchit (University of Waterloo, 2018-05-18)
    In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median problem. In the capacitated matroid median problem, ...
  • Extensions of Galvin's Theorem 

    Levit, Maxwell (University of Waterloo, 2018-04-30)
    We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin's resolution of the Dinitz problem (Galvin. J. Comb. Theory, Ser. B 63(1), 1995, 153--158). We ...
  • Thin Trees in Some Families of Graphs 

    Mousavi Haji, Seyyed Ramin (University of Waterloo, 2018-04-25)
    Let 𝐺=(𝑉,𝐸) be a graph and let 𝑇 be a spanning tree of 𝐺. The thinness parameter of 𝑇 denoted by 𝜌(𝑇) is the maximum over all cuts of the proportion of the edges of 𝑇 in the cut. Thin trees play an important role ...
  • Ideal Clutters 

    Abdi, Ahmad (University of Waterloo, 2018-04-24)
    Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member is contained in another. The clutter C is ideal if every extreme point of ...
  • On Geometric Drawings of Graphs 

    Arroyo Guevara, Alan Marcelo (University of Waterloo, 2018-04-18)
    This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ...
  • A Primal Dual Algorithm On 2-Steiner Graphs 

    Buckley, Matthew (University of Waterloo, 2018-01-23)
    The Steiner Tree Problem is a fundamental network design problem, where the goal is to connect a subset of terminals of a given network at minimum cost. A major open question regarding this problem, is proving that the ...
  • 5-Choosability of Planar-plus-two-edge Graphs 

    Mahmoud, Amena (University of Waterloo, 2018-01-02)
    We prove that graphs that can be made planar by deleting two edges are 5-choosable. To arrive at this, first we prove an extension of a theorem of Thomassen. Second, we prove an extension of a theorem Postle and Thomas. ...
  • Extending Pappus' Theorem 

    Hoersch, Florian (University of Waterloo, 2017-12-22)
    Let $M_1$ and $M_2$ be matroids such that $M_2$ arises from $M_1$ by relaxing a circuit-hyperplane. We will prove that if $M_1$ and $M_2$ are both representable over some finite field $GF(q)$, then $M_1$ and $M_2$ have ...
  • Linearly-dense classes of matroids with bounded branch-width 

    Hill, Owen (University of Waterloo, 2017-09-27)
    Let $M$ be a non-empty minor-closed class of matroids with bounded branch-width that does not contain arbitrarily large simple rank-$2$ matroids. For each non-negative integer $n$ we denote by $ex(n)$ the size of the ...
  • Combinatorial Arithmetic on Elliptic Curves 

    Gauthier-Shalom, Gabriel (University of Waterloo, 2017-09-27)
    We propose a scalar multiplication technique on an elliptic curve, which operates on triples of collinear points. The computation of this operation requires a new approach to operation chains, with similarities to Montgomery ...
  • On The Circuit Diameters of Some Combinatorial Polytopes 

    Kafer, Sean (University of Waterloo, 2017-09-20)
    The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P ...
  • A post-quantum digital signature scheme based on supersingular isogenies 

    Yoo, Youngho (University of Waterloo, 2017-09-20)
    We present the first general-purpose digital signature scheme based on supersingular elliptic curve isogenies secure against quantum adversaries in the quantum random oracle model with small key sizes. This scheme is ...
  • Circle Graph Obstructions 

    Lee, Edward (University of Waterloo, 2017-08-31)
    In this thesis we present a self-contained proof of Bouchet’s characterization of the class of circle graphs. The proof uses signed graphs and is analogous to Gerards’ graphic proof of Tutte’s excluded-minor characterization ...
  • A quadratic programming approach to find faces in robust nonnegative matrix factorization 

    Ananthanarayanan, Sai Mali (University of Waterloo, 2017-08-29)
    Nonnegative matrix factorization (NMF) is a popular dimensionality reduction technique because it is easily interpretable and can discern useful features. For a given matrix M (dimension n x m) whose entries are nonnegative ...
  • Stabilizing Weighted Graphs 

    Koh, Zhuan Khye (University of Waterloo, 2017-08-29)
    An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory ...
  • Some Upper and Lower Bounds regarding Query Complexity 

    Liu, Rui Peng (University of Waterloo, 2017-08-29)
    Query complexity is one of the several notions of complexity de ned to measure the cost of algorithms. It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical ...
  • Technology Diffusion on Spiders 

    Sharma, Charupriya (University of Waterloo, 2017-08-29)
    There has been significant research about cascade effects that occur when information is spread through a network. Most models of such cascade effects are highly-localised, which means that they assume a node’s behaviour ...
  • Generating Functions for Hyperbolic Plane Tessellations 

    Xie, Jiale (University of Waterloo, 2017-08-28)
    For a hyperbolic plane tessellation there is a generating function with respect to the distance. This generating function is the same as the growth function of a group of isometries of hyperbolic plane that acts regularly ...

View more


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages