19-25 June 2011
Bled, Slovenia
Europe/Ljubljana timezone
The minisymposia

The conference will host a number of special minisymposia, some of which may run in parallel sessions. The list of the minisymposia, together with their organizers and descriptions is:

  • Algorithmic Graph Theory
    • Organizer: Marcin Kamiński (Université Libre de Bruxelles, Belgium)
    • Description: Being the intersection of graph theory and computer science, Algorithmic Graph Theory is the study of graph-theoretical problems from a computational perspective. The goal of this minisymposium is to present the spectrum of current research in the area. The topics of interest include (but are not limited to): structural graph theory, graph classes, parameterized complexity, approximation algorithms. Additional information can be found on Marcin Kamiński's website dedicated to this minisymposium.

  • Association Schemes
    • Organizer: Ilya Ponomarenko  (Saint Petersburg Depart. of V. A. Steklov Institute of Math., Russia)
    • Description: The minisymposium is devoted to recent results in association schemes and related topics: coherent configurations, schur rings, table algebras... The list of participants includes leading researches working on these topics.

  • Cayley Graphs
    • Organizer: Joy Morris  (University of Lethbridge, Canada)
    • Description: This minisymposium is devoted to Cayley graphs. Talks may relate in any way to Cayley graphs, but specific topics of interest include Hamilton paths and cycles, characterisations of families of Cayley graphs, and automorphism groups of Cayley graphs. Talks on the broader class of vertex-transitive graphs are also welcome.

  • Coloring, independence and forbidden subgraphs
    • Organizer: Ingo Schiermeyer (Technische Universität Bergakademie Freiberg, Germany)
    • Description: There is a great variety of results for vertex-colourings and independence in graphs in terms of forbidden subgraphs. One of the most well-known is the Strong Perfect Graph Theorem. Edwards has shown the following approach: If a graph G has a dominating set D, then 3-colourability can be decided in time O(3^|D| |E(G)|). Using a result of Bacsó and Tuza that a P5-free graph has a dominating clique or a dominating P3, Randerath and Schiermeyer showed that 3-colourability can be decided in polynomial time for P5-free and P6-free graphs.
      Main topics in this minisymposium will be vertex colourings, b-colourings, minimum rainbow subgraphs, rainbow connection, independent sets and computation of ramsey numbers.

  • Coloring of Graphs
    • Organizer: Xuding Zhu  (Zhejiang Normal University, China)
    • Description: This minisymposium is devoted to all topics related to graph colorings. This includes the ordinary vertex coloring and many of its variations, such as list coloring, fractional coloring, circular coloring, game coloring, relaxed coloring, edge weighting, graph homomorphism, etc. Algorithmic aspects of graph coloring problems, flow on graphs, and graph labelings are also welcome.

  • Configurations
    • Organizer: Leah Wrenn Berman  (University of Alaska Fairbanks, USA)
    • Description: This minisymposium covers questions related to the study of configurations. A $(p_q, n_k)$ configuration of points and lines is a collection of $p$ points and $n$ lines in which every point lies on $q$ lines and every line passes through $k$ points. Such configurations may be combinatorial, topological (using pseudolines), or geometric (using straight lines). In particular, questions related to the existence of certain types of configurations, or the classification of configurations with certain properties (such as symmetry) may be addressed.

  • Crossing Number
    • Organizer: Drago Bokal  (University of Maribor, Slovenia)
    • Description: The purpose of this minisymposium is to bring together researchers interested in various aspects of graph crossing number problems. During the last ten years or so, we have witnessed a growing interest in complexity and algorithmic issues, lots of variants of crossing number were developed, as well as some relations to other graph parameters, like graph coloring, were investigated. On the complexity front, we have Grohe's surprising result that CrossingNumber is fixed parameter tractable, followed up by the recent refinement by Kawarabayashi and Reed. On the more applied side, we have the algorithms implemented by Petra Mutzel and her research team that compute the exact crossing number of relatively large graphs. Then there is a recent series of specialized constant-factor approximation algorithms for the crossing number by Hlineny, Salazar, and Chimani. Yet another really surprising, exciting result is Cabello and Mohar's proof that CrossingNumber is still NP-hard for nearly-planar graphs (that is, graphs with an edge whose removal leaves a planar graph). Furthermore, Pelsmajer, Schaefer, and Štefanković demonstrated that odd crossing number is not crossing number.

      This minisymposium presents an opportunity to reflect on these developments, with an emphasis on the interplay between all these aspects of graph crossing numbers.

  • Domination, Independence and Coloring of Product Graphs
    • Organizer: Douglas F. Rall  (Furman University, USA)
    • Description: This minisymposium will focus on how domination, independence and coloring invariants "behave" on product graphs. This area of graph theory includes several outstanding conjectures - Hedetniemi's conjecture on the chromatic number of the direct product of two graphs and Vizing's conjecture on the domination number of the Cartesian product of two graphs. Perhaps inspired by attempts to settle these conjectures numerous researchers have recently investigated related questions but for additional invariants and products. The talks in this minisymposium will present new ideas and recent results in the area.

  • Graph Spectra and its Applications
    • Organizer: Dragan Stevanović  (University of Niš, Serbia)
    • Description: The spectra of matrices associated with a graph (adjacency matrix, combinatorial Laplacian, normalized Laplacian and signless Laplacian) are nowadays widely used to characterize its properties and to extract structural information, both in graph theory and in other fields such as chemistry, theoretical physics, quantum mechanics, computer science and complex networks modelling. This minisymposium is devoted to all topics related to graph spectra and their applications.

  • Graphs and Networks in Biology
    • Organizer: Peter Stadler  (University of Leipzig, Germany)
    • Description: Graphs and graph-like discrete structures such as chemical reaction networks play an increasing role as models of biological structures and processes. The topics of the minisymposium range from phylogenetic trees and networks, network models of gene regulation and metabolism, to combinatorial landscapes. Of particular interest are contributions that characterize structural aspects of biological network, help to infer such structures from data and compare them with each other.

  • Group Actions
    • Organizer: Shaofei Du  (Capital Normal University, China)
    • Description: This minisymposium is devoted to all topics related to group actions on graphs, maps, designs and other combinatorial structures, etc. The results on permutation group theory are also included in this minisymposium. The talks in the minisymposium will present new ideas and recent results in the area.

  • Information Theory of Graphs
    • Organizer: Matthias Dehmer  (Vienna University of Technology,  Austria)
    • Description: Because investigating non-random topologies turned out to be useful, there is a need to develop quantitative methods to analyze networks (graphs). In this minisymposium, the emphasis will be put on 'information theory of networks' since it offers various techniques to quantify structural information of graphs.

      A crucial problem in this area is to characterize graphs using information-theoretic measures. For instance, graphs have been often characterized by using Shannon's entropy leading to information-theoretic complexity measures.

      Among methods to determine graph complexity based on information theory, we also appreciate the following topics:
      - Information Inequalities for Graphs
      - Graph Characterization using Information Inequalities
      - Properties of Graph Entropies
      - Other Information Measures for Networks such as Mutual Informatiom etc.
      - Information Measures for Random Graphs
      - Graph Coding and Channel Capacities
      - Network Information-theoretic Techniques from Statistical Physics

  • Maps and Symmetries
    • Organizer: Antonio Breda d'Azevedo  (University of Aveiro, Portugal)
    • Description: This minisymposium covers all aspect of maps and hypermaps and their relation to other combinatorial and topological structures. Particular emphasis is done on the symmetries of maps and hypermaps. Contributions related to Riemann surfaces and algebraic curves when connected to maps or hypermaps are accepted. In general, we welcome contributions related to group actions on surfaces that leads to cellular graphs embeddings.

  • Mathematical Chemistry
    • Organizer: Roberto Todeschini  (University of Milano-Bicocca, Italy)
    • Description: The main topics in this minisymposium are: discrete mathematics, molecular descriptors, graph theory, chemometrics, QSAR, statistics. All the lectures of the Members of the International Academy of Mathematical Chemistry (IAMC) are included in this minisymposium.

  • Metric Graph Theory
    • Organizer: Boštjan Brešar  (University of Maribor, Slovenia)
    • Description: Graphs, equipped with the shortest-path distance, present one of the fundamental models of discrete metric spaces. They are also closely related to other (discrete) structures, such as convex spaces, betweenness and interval structures, spaces with walls, ${ell}_1$-spaces, and so on. Several natural graph invariants arise from different convexities, in which the shortest-path metrics may be replaced by alternative concepts, and various dimensions have been studied with respect to isometric embeddings in graph products. Classes of graphs such as distance-hereditary graphs, bridged graphs, median graphs, and their generalizations, play an important role in the area, and in addition correspond to analogous algebraic and geometric structures. In the minisymposium we will capture different topics from this diverse and extensive area.

  • Polytopes and Incidence Geometries
    • Organizer: Isabel Hubard  (Instituto de Matematicas, UNAM, Mexico)
    • Description: This mini symposium shall convene researchers interested in geometric, topological and combinatorial properties of abstract polytopes and incidence geometries having large symmetry (automorphism) groups. During this mini symposium new ideas and recent results in the area will be presented, and a link between abstract polytopes and incidence geometry will be encourage.

  • Representations of Graphs
    • Organizer: Tomaž Pisanski and Aleksandar Jurišić  (University of Ljubljana, Slovenia)
    • Description: This minisymposium will focus on the theory and applications of representations of graphs. The interplay between geometry and discrete mathematics will play a significant role. In particular, various aspects of symmetry and regularity, such as distance-transitive or distance-regular graphs and their generalizations, will be the driving force.