Simon Fraser University

Usage-Based Insurance (UBI) is one of the most recent innovations by auto insurance companies that links the premium rates of customers to their actual driving performance. In this program, drivers’ behaviours are monitored directly while they drive...

We consider covering graphs obtained by lifting trees as voltage graphs over cyclic groups. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing Hamiltonian cycles in the covering graphs of paths. The...

In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs of polygons. We show how to...

We will characterize members that maximize/minimize the second largest adjacency eigenvalue in certain families of trees. Joint work with H. Kumar, B. Mohar and S. Pragada.

As the underlying configuration behind many elegant finite structures, partial difference sets have been intensively studied in design theory, finite geometry, coding theory, and graph theory. In the first part of this talk, I will showcase that...

Sharpness is a generic assumption in continuous optimization that bounds the distance to the set of minimizers in terms of the suboptimality in the objective function. It leads to the acceleration of first-order optimization methods via so-called...

First example of applying tensor optimization to combinatorial problems was shown in IPCO 1992: pages 406-420. We improve and strengthen those results in several ways and obtain computational results on three problems – graph partitioning...

The Coast Combinatorics Conference Series began in 1999. In most years there has been a meeting on the Canadian west coast in February or March, featuring a collegial, collaborative, workshop-style atmosphere and a diverse collection of talks on...

In his seminal work on modular curves and the Eisenstein ideal, Mazur studied the existence of congruences between certain Eisenstein series and newforms, proving that Eisenstein ideals associated to weight 2 cusp forms of prime level are locally...

I will describe a new approach for exhaustively generating combinatorial objects by combining a satisfiability (SAT) solver with an isomorph-free exhaustive generation method such as orderly generation. The SAT solver is able to limit the search to...