Jul
8
Chris Mitillos Ph.D. Thesis Defense
Topics in Graph Fall-Coloring Host Department of Applied Mathematics Description PhD thesis defense on "Topics in Graph Fall-Coloring" Event Topic Discrete Applied Math Seminar Graduate Student Other
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Apr
19
Introduction to Minimum Cost Flow and the Network Simplex Algorithm
Host Department of Applied Mathematics Description The minimum cost network flow (MCNF) problem is an important form of linear program that can be used to model a wide variety of network design and...
Feb
24
Limiting Theorems for the Optimal Alignments Score in Multiple Random Words
Host Department of Applied Mathematics Speaker Ruoting Gong, Assistant Professor Department of Applied Mathematics, Illinois Institute of Technology Description Let X n (1),..., X n (m), where X n (i)...
Feb
19
On the List Chromatic Number of the Cartesian Product with a Traceable Graph: Using the Alon-Tarsi Method
Host Department of Applied Mathematics Description The concept of list coloring was introduced independently by Erdős and Vizing in the 1970s. It is a natural generalization of graph coloring with...
Nov
9
Extremal Results for Semi-Algebraic Hypergraphs
Host Department of Applied Mathematics Speaker Andrew H. Suk, Assistant Professor, Department of Mathematics, Statistics, and Computer Science University of Illinois at µç³µÎÞÂë http://homepages.math...
May
28
Jinyu Huang Thesis Defense
Host Hemanshu Kaul Description Jinyu will give a talk about his work on algorithmic problems in Matroids, a mathematical structure that generalizes the notion of independence in vector spaces and in...
Apr
29
Algorithms for Matroid Secretary Problem and Its Multiobjective Variant
Host Applied Mathematics Description Matroids are a mathematical structure that generalize the linear independence in vector spaces and acyclic subgraphs in graphs, and have been applied in...
Apr
15
Graph Fall-Colouring: Some New Perspectives
Host Applied Mathematics Description Graph Fall-Colouring is the problem of partitioning a graph into independent dominating sets. Unlike typical graph-theoretic problems, this partition may not...
Feb
4
Clustered Planarity Testing Revisited
Date Change Host Applied Mathematics Speaker Radoslav Fulek Columbia University https://sites.google.com/site/fulekrado/ Description Abstract: The Hanani–Tutte theorem is a classical result proved for...
Nov
13
Constant Competitive Online Algorithms for the Matroid Secretary Problem
Host Applied Mathematics Description Abstract: Matroids are a mathematical structure that generalize the linear independence in vector spaces and acyclic subgraphs in graphs, and have been applied in...