Slides for selected talks are available from the Member's Only page.
GTA Research Days
February 2nd 2012
May 30th 2011,
- Murray Elder: “ Computing in infinite groups in logspace ”
- Kashif Ali: “ Ramsey numbers of path vs wheel ”
May 23rd 2011,
- Kashif Ali: “ Ramsey numbers of path vs cycle ”
May 9th 2011,
- Leanne Rylands: “ The alpha-deficit number of a graph ”
February 15th 2011,
- Jan Goedgebeur: “ Fast Generation of Cubic Graphs and Snarks ”
February 3rd 2011,
- Paul Manuel: “ Which is more beautiful - diamond crystal or lattice?”
November 29th 2010,
November 2nd 2010,
- Brian Alspach: “Some aspects of liar domination”
September 6th 2010,
- Paul Manuel: “Locating and liar domination of circulant networks”
- Yuqing Lin: “The forcing number of fullerene graphs”
August 18th 2010,
- Kiyoshi Yoshimoto: “Independent sets and 2-factors of claw-free graphs”
- Dudu Yoshimoto: “Spanning trails of 3-connected graphs”
May 18th 2010,
- Thomas Kalinowski: “Maximal flat antichains in the Boolean lattice”
- Wal Wallis: “Totally magic labellings and injections”
May 11th 2010,
- Mauritsius Tuga: “Some results on exclusive sum labeling”
April 27th 2010,
- Hebert Perez Roses: “Properties of Groups for the Cage and Degree/Diameter”
- Oudone Phanalasy: “Using Completely Separating Systems for Antimagic Labeling of Graphs”
April 13th 2010,
- Mitchell Archibald: “Turan’s Theorem and Szemeredi’s Regularity Lemma”
- Yuqing Lin: “On the anti-Kekule number of Fullerenes”
March 16th 2010,
- Brian Alspach: “All Paley graphs are Hamilton decomposable”
October 15th 2009,
- Ljiljana Brankovic: “Moving Queries”
September 24th 2009,
- Paul Manuel: “Routing Algorithms”
August 20th 2009,
- Dominique Buset: “The Degree/Diameter Problem for Undirected Graphs”
- Prabhu Manyem: “Optimisation Problems: Duality and Computational Models”
May 11th 2009,
- Henning Fernau: “Searching Trees”.
- Jianmin Tang: “Variations on Classical Extremal Graph Theoretical Problems: Moore Bound and Connectivity”.
- Oudone Phanalasy: “Some results on covering separating systems”.
May 5th 2009,
- Helen Giggins: “Security of Genetic Databases”
- Hebert Perez-Roses: “Computer based methods for constructing large graphs with maximum degree and diameter”
April 21st 2009,
- Jan Kratchovil: “Clustered Planarity and Graph Covers”
- Guillermo Pineda-Villavicencio: “Relationship between Degree/Diameter Problem and Degree/Girth Problem”
March 31st 2009,
- Tomas Kaiser: “Perfect matchings in Cubic Graphs”
March 10th 2009,
- Henning Fernau: “Global r-alliances and total domination”
December 11th - 12th 2008,
November 26th 2008,
- Joe Ryan: “Total Irregular Labellings”
November 6th 2008,
- Mirka Miller: “Advances in the Degree/Diameter Problem”
October 30th 2008,
- Jianmin Tang: “On the Monotonicity of Order, Size and Girth”
- Yuqing Lin: “Superconductivity of Cages”
- Eyal Loz: “A (very short) talk on Graph Minors”
October 16th 2008,
- Hazrul Iswaldi: “Some open problems in the metric dimension topic”
- Lyra Yulianti: “Ramsey minimal graph”
- Tita Khalis Maryati: “H-(super) magic covering”
August 28th 2008,
- Jianmin Tang: "Construction of Extremal Graphs"
- Eyal Loz: “Extracts from my PhD”
Invited Seminars
20/05/2010
Anomaly Graphs and Champions
Emeritus Professor Wal Wallis
Southern Illinois University,
Carbondale, Illinois, USA
20/05/2010
Champions in Graphs
Emeritus Professor Wal Wallis
Southern Illinois University
Carbondale, Ill., USA
10/09/2009
Recent advances in the degree/diameter problem
Professor Mirka Miller
School of Electrical Engineering and Computer Science
University of Newcastle
and
Department of Applied Mathematics
University of West Bohemia
Pilsen, Czech Republic
and
Department of Computer Science
King's College London
London, United Kingdom
and
Department of Mathematics
ITB, Bandung
Bandung, Indonesia
27/08/2009
History of Computer Science (A Journey from Mathematics to Computer Science)
Professor Paul Manuel
Department of Information Science,
University of Kuwait,
Safat, 13060, Kuwait
20/08/2009
The degree/diameter problem: 45 years of progress
Professor Dominique Buset
Faculté des Sciences Appliqués
Université Libre de Bruxelles
Brussels, Belgium
23/04/2009
Exact Exponential Time Algorithms for Frequence Assignment
Professor Jan Kratochvil
Department of Applied Mathematics
Charles University,
Prague, Czech Republic
2/04/2009
Tree-Packaging and Nowhere-Zero Flows
Professor Tomas Kaiser
Department of Mathematics,
University of West Bohemia,
Pilsen, Czech Republic
10/03/2009
Global r-alliances and total domination
Professor Henning Fernau
Abteilung Informatik,
Universitaet Trier, Germany
12/11/2008
Bimagic Labelings
Professor Wal Wallis
Department of Mathematics,
Southern Illinois University,
Carbondale, Illinois, USA
16/10/2008
Minimising the size of union closed collection of sets – a conjecture
Dr. Leanne Rylands
School of Computing and Mathematics,
University of Western Sydney,
Penrith, NSW, Australia
Site authorised by Professor Mirka Miller mirka.miller[at]newcastle.edu.au
Site maintained by Joe Ryan joe.ryan[at]newcastle.edu.au
Last updated: 1st April, 2008
Disclaimer,
Copyright and Offensive Materials Statement