Coronavirus (Covid-19): Latest updates and information
Skip to main content Skip to navigation

CGT 2011 - Program

Please note that this is only a tentative schedule. It is likely to change.

Monday 4 April 2011
8:30 – 8:55 Registration. Warwick Mathematics Institute
8:55 – 9:00 Opening
Plenary talk. Room MS.02
9:00 – 10:00 Jaroslav Nesetril
Charles University
Asymptotic Counting of Subgraphs in Sparse Graphs
10:00 – 10:30 Coffee break
Morning Session. Room MS.02
10:30 – 10:50 Sergey Kitaev
Reykjavik University and University of Strathclyde
On (2+2)-free Posets and Equinumerous Objects
10:50 – 11:10 Vitaliy Koshelev
Steklov Mathematical Institute, Russian Academy of Sciences
On the Erdős-Szekeres Problem for Colored Sets with Various Numbers of Internal Points
11:10 – 11:30 Andrei Raigorodskii
Moscow State University
From Combinatorial Geometry to Ramsey Theory
11:30 – 11:40 Short break
11:40 – 12:00 Demetres Christofides
Charles University
Guessing Numbers of Graphs
12:00 – 12:20 Eric Sopena
LaBRI, Université Bordeaux 1
CGT Inspired Tools for Studying the Game Chromatic Number of Trees
12:20 – 14:00 Lunch
 
Early Afternoon Session. Room MS.02
14:00 – 14:20 Richard Mycroft
Queen Mary, University of London
Perfect Matchings and Packings in Hypergraphs
14:20 – 14:40 Frantisek Kardos
Pavol Jozef Safarik University in Kosice
Exponentially Many Perfect Matchings in Cubic Graphs
14:40 – 15:00 Clemens Heuberger
TU Graz
The Number of Maximum Matchings in a Tree
15:00 – 15:30 Coffee break
Late Afternoon Session. Room MS.02
15:30 – 15:50 David Hartman
Charles University
Homomorphism-homogeneous Edge-colored Graphs
15:50 – 16:10 Florian Pfender
Universitaet Rostock
Complete Subgraphs in Multipartite Graphs
16:10 – 16:30 Teresa Sousa
FCT-UNL and CMA-UNL
Minimum Weight H-decompositions of Graphs
16:30 – 16:40 Short break
16:40 – 17:00 Robert Brignall
The Open University
Infinite Antichains: From Permutations to Graphs
17:00 – 17:20 Tobias Mueller
CWI
The Smallest Grid Needed to Represent a Geometric Intersection Graph


Tuesday 5 April 2011
Plenary talk. Room MS.02
9:00 – 10:00 Carsten Thomassen
Technical University of Denmark
The Weak 3-flow Conjecture and Graph Decomposition
10:00 – 10:30 Coffee break
Morning Session. Room MS.02
10:30 – 10:50 Carol Zamfirescu
TU Dortmund
(2)-pancyclic Graphs
10:50 – 11:10 Dieter Rautenbach
University of Ulm
The Potential of Greed for Independence
11:10 – 11:30 Vadim Levit
Ariel University
A Set and Collection Lemma
11:30 – 11:40 Short break
11:40 – 12:00 Martin Milanic
FAMNIT, University of Primorska
Towards a Combinatorial Characterization of Equistable Graphs - Partial Results on a Conjecture of Orlin
12:00 – 12:20 Matthias Hamann
Universität Hamburg
On the Tree-likeness of Hyperbolic Graphs
12:20 – 14:00 Lunch
 
Afternoon Session. Excursion and dinner.
14:00 – Social events (excursion and conference dinner)


Wednesday 6 April 2011
Plenary talk. Room MS.02
9:00 – 10:00 Michael Fellows
Charles Darwin University
Inside FPT: Kernelization Lower Bounds
10:00 – 10:30 Coffee break
Morning Session. Room MS.02
10:30 – 10:50 Matthias Mnich
International Computer Science Institute
Domination When the Stars Are Out
10:50 – 11:10 Petr Golovach
Durham University
Algorithmic Bounds for Problems Parameterized by Clique-width
11:10 – 11:30 Igor Razgon
University of Leicester
A New Upper Bound on the Number of Important Separators and an Alternative Parameterization of the Multiway Cut Problem
11:30 – 11:40 Short break
11:40 – 12:00 Marcin Kaminski
Université Libre de Bruxelles
Deciding (More) Containment Relations in Planar Graphs in FPT Time
12:00 – 12:20 Pim van 't Hof
University of Bergen
Edge Contractions in Subclasses of Chordal Graphs
12:20 – 14:00 Lunch
 
Early Afternoon Session. Room MS.02
14:00 – 14:20 Chinh Hoang
Wilfrid Laurier University
Finding and Listing Induced Paths
14:20 – 14:40 Daniel Paulusma
Durham University
Coloring Graphs Without a Fixed Induced Linear Forest
14:40 – 15:00 Marc Demange
Essec Business School
On Some Coloring Problems on Grids
15:00 – 15:30 Coffee break
Late Afternoon Session. Room MS.02
15:30 – 15:50 Michel Habib
LIAFA-Universite Paris 7
An O(mn^2) Algorithm for Computing All Maximal Homogeneous Pairs in a Graph
15:50 – 16:10 Dieter Kratsch
Universite Paul Verlaine - Metz
Counting in AT-free Graphs: Independence and Domination
16:10 – 16:30 Christophe Picouleau
CEDRIC-CNAM
Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs
16:30 – 16:40 Short break
16:40 – 17:00 Ross Kang
Durham University
Improper Choosability and Property B
17:00 – 17:20 Frank Gurski
Heinrich-Heine-University Duesseldorf
Binary Linear Programming Formulations and Hardness for Control Problems in Voting Systems


Thursday 7 April 2011
Plenary talk. Room MS.02
9:00 – 10:00 Reinhard Diestel
Universität Hamburg
Infinite Graphs with Ends: A Topological Approach
10:00 – 10:30 Coffee break
Morning Session. Room MS.02
10:30 – 10:50 Michał Adamaszek
DIMAP, University of Warwick
Clique Complexes of Cycle Powers
10:50 – 11:10 Jayme Szwarcfiter
Universidade Federal do Rio de Janeiro
On Hull Sets of Graphs: A Short Survey
11:10 – 11:30 Jan Foniok
Laboratoire d'Informatique de l'Ecole Polytechnique (LIX)
Cherlin-Shelah-Shi Classes are Ramsey
11:30 – 11:40 Short break
11:40 – 12:00 Oleg Verbitsky
Institute for Applied Problems of Mechanics and Mathematics
Canonical Representations of Interval and Circular-arc Hypergraphs
12:00 – 12:20 Jessica Enright
University of Alberta
Only the Important Bits of the Tree
12:20 – 14:00 Lunch