Events Archive

  1. Home
  2. Events
  3. Events Archive

Find an Event

May
3

Crossing Number vs. Pairwise Crossing number of graphs

to E1 122

Description The crossing number of a graph $G$, $\crs(G)$ is the minimum number of intersections among edges over all possible drawings on a plane. The pairwise crossing number $\pcr(G)$ is the...

May
2

Counting Independent sets up to tree threshold

to E1 102

Properly colored copies and rainbow copies of large graphs with small maximum degree Description Counting Independent sets up to tree threshold : We consider the problem of counting a given weighted...

Apr
30

Algortithms for the Min-Cut problem

to E1 102

A Polynomial Approximation to the Matrix Permanent via Markov Chain Monte Carlo. Description Algorithms for the Min-Cut problem : The project will discuss the Min-Cut problem, and introduce some...

Apr
29

Optimal Estimation of Functional Data

to LS 152

SpeakerMing YuanUniversity of Wisconsin-Madisonhttp://pages.stat.wisc.edu/~myuan/Site/Welcome.html Description We consider several estimation problems in functional data analysis. These examples...

Apr
26

Industrial Awards Dinner Brings New Friends and Support to INTM

to Maggiano鈥檚 Little Italy, 111 West Grand, Chicago

Mazin Safar, Director, Industrial Technology and Management; F. Quinn Stepan, Jr.; and Dr. Bob Carlson, Dean, IIT School of Applied Technology INTM鈥檚 2013 鈥淥utstanding Leader in Industry鈥, F. Quinn...

Apr
25

Improved Bounds on Coloring of Graphs

to E1 102

Subgraphs of random graphs with specified degrees Description Improved Bounds on Coloring of Graphs : This paper by Sokol Ndreca, Aldo Procacci, Benedetto Scoppola (2011) has several improvements on...