Simon Fraser University

Abstract: In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90-degree turns. The class of graphs representable by intersections of k-bend paths is denoted by B_k...

Summary: Recently, Grohe and Marx proved that for every H, there exist constants k, D and t such that if G does not contain H as a topologicalminor, then G is a clique sum of graphs that either avoid K_k as a minoror contain at most t vertices of...

Abstract: Given a graph G, the vertex-arboricity of G, denoted by a(G), is the smallest integer k such that V(G) can be partitioned into k sets each of which induces an acyclic subgraph. This notion relates to the chromatic number of a graph, and was...

Abstract: A binary matrix satisfies the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that, on each row, the entries 1 are consecutive. Deciding if a matrix satisfies the C1P canbe done in linear time, and several...

Abstract: A $(k,l)$-colouring of a graph is a partition of its vertex set into $k$ independent sets and $l$ cliques. The bichromatic number $\\chi^b$ of a graph is theminimum $r$, such that the graph is $(k,l)$-colourable for all $k+l=r$.The...

The goal of this workshop is to bring together mathematicians with an interest in working on crime modeling and analysis with researchers directly connected with real-world problems. This is a workshop based on computational criminology, an emerging...

Abstract The monograph Singular Integral Equations by N.I. Muskhelishvili was published originally in Russian in 1946 and was revised and trans­lated into English in 1958. In this monograph, the solution of the Dirichlet problem is expressed in terms...

Abstract: Let D=(V,A) be adigraph. A subset K of V is k-indepenent if the (directed) distance betweenevery pair of vertices in K is at least k, we say that K is l-absorbent ifevery vertex not in K reaches a vertex in K at distance at most l and we...

The Mathematics Department at Simon Fraser University is pleased to present Computational Math Day 2012 (CMD 2012), which will be held on Wednesday, August 8th, 2012 at the IRMACS Centre, SFU Burnaby Campus. This annual event showcases the...