School of Mathematics
,
IPM
, Tehran, Iran
May 15-21, 2009
Home
Organizers
Main Speakers
Conference Program
Title of Lectures
Contributed Talks
Registration
Registered People
News
Poster
Pictures
Contact
Information
Title of Lectures
Plenary Speakers
Eiichi Bannai
Spherical Designs and Association Schemes Versus Euclidean Designs and Coherent Configurations
[SLIDES]
Andries E. Brouwer
Cohomology of Root Systems
Richard A. Brualdi
Signed Domination
[SLIDES]
Peter Frankl
Intersection theorems for finite sets
Gyula O. H. Katona
Bounds on the Largest Families of Subsets with Forbidden Subposets
[SLIDES]
Richard P. Stanley
A Survey of Alternating Permutations
[SLIDES]
Robin Thomas
K_t minors in large t-connected graphs
[SLIDES]
Richard M. Wilson
Spreading blocks and subgraphs
[SLIDES]
Invited Speakers
Helene Barcelo
k-Equal Subspace Arrangements Revisited
[SLIDES]
Willem H. Haemers
Divisible Design Graphs
Samad Hedayat
Optimal Crossover Designs for Comparing Test Treatments to a Control Treatment When Subject Efects are Random
[SLIDES]
Hadi Kharaghani
On regularly unbiased Hadamard matrices
[SLIDES]
Jack Koolen
Geometric distance-regular graphs
[SLIDES]
William J. Martin
An ideal associated to any cometric association scheme
[SLIDES]
Brendan McKay
Random Graphs with Specified Degrees
[SLIDES]
Shahriar Shahriari
Chain Partitions of Normalized Matching Posets
[SLIDES]
Jozef Siran
Regular maps on a given surface: A survey
[SLIDES]
Qiang (Steven) Wang
Lucas Sequences, Permutation Polynomials, and Inverse Polynomials
[SLIDES]
Qing Xiang
Exterior Algebras and Two Conjectures on Finite Abelian Groups
[SLIDES]
Contributed Talks
Ghodratollah Aalipour
On the D-equivalence class of complete bipartite graphs
Omran Ahmadi
Graphs with Integral Spectrum
Saeid Alikhani
On the Zeros of Domination Polynomials
Milica Andjelic
Combinatorial properties of graphs with (K,t)-regular star set
A. R. Ashrafi
Characterization of Graphs by a Partition of Edges
Kh. Bibak
Well-Bisective Graphs
Ardeshir Dolati
On the Sphericity of 3-Connected Digraphs
Amin S. Fakhari
Cycles of length 0 modulo l in graphs
C.M. da Fonseca
Counting faces of the tridiagonal Birkhoff polytope
Maryam Ghanbari
On the Dynamic Coloring of Graphs
Mohsen Ghasemi
Normal Cayley graphs on minimal non-abelian groups of small valency
Ebrahim Ghorbani
Graphs with many \pm 1 or \sqrt(2) eigenvalues
Mahdieh Hasheminezhad
A generalized switching method for combinatorial estimation
Nader Jafari Rad
Changing and unchanging in Roman domination
M. Jamaali
An Optimal Edge Coloring of Graphs Using a Given Set of Colors
R. Kahkeshani
Codes whose automorphism groups are S11, PSL2(11) or PSL2(11) : 2
Changiz Maysoori
On the Addressing Problem
Dara Moazzami
Some results related to the Tenacity Parameter in Networks
Alireza Mofidi
Zero Sum flows on graphs and designs
Morteza Mohammad-Noori
Intersection matrices and the Johnson scheme
Mohammad Reza Oboudi
On the energy of graphs and multigraphs
Fatemeh Raee
On Unique Independence Weighted Graphs
Amir Rahnamai Barghi
Finite groups are determined by a combinatorial property
Mohammad-Reza Sadeghi
On Cycle-free Lattices
Milos Stojakovic
How fast can Maker win?
Maryam Tahmasbi
Combinatorial aspects in graph drawing