COMS

Un listing de conférences scientifiques et techniques

Accueil | Logiciel de gestion de conférence | Calendrier des conférences | Annonces publicitaires | Nous contacter | Qui nous sommes
Deutsch Français English
Vous êtes ici: AccueilCalendrier des conférencesMathématiques → Théorie des graphes et combinatoire

Logiciel de gestion de conférences

Notre système de gestion de conférences en ligne (COMS) vous permet de:

  • gérer l'organisation de la conférence en ligne
  • gérer les inscriptions
  • gérer les paiements
  • gérer les soumissions de présentations
  • gérer la procédure de revue
  • sélectionner les présentations
  • produire le livre des résumés

Pour en savoir plus ...

Conférences - Théorie des graphes et combinatoire

Conference-Service.com met à la disposition de ses visiteurs des listes de conférences et réunions dans le domaine scientifique. Ces listes sont publiées pour le bénéfice des personnes qui cherchent une conférence, mais aussi, bien sûr, pour celui des organisateurs. Noter que, malgré tout le soin que nous apportons à la vérification des données entrées dans nos listes, nous ne pouvons accepter de responsabilité en ce qui concerne leur exactitude ou étendue. Pensez donc à vérifier les informations présentées avec les organisateurs de la conférence ou de la réunion avant de vous engager à y participer!

Les organisateurs peuvent soumettre une réunion ou une conférence pour inclusion dans nos listes, et ceci gratuitement.

TOUS LES PAYS

1.Threshold phenomena and random graphs
 Dates 27 Mai 2013 → 31 Mai 2013
[ID=536780] Haut de la page
 LieuParis, France
 Résumé This Spring School will consist in two courses given by professors Chatterjee and Kahn on threshold phenomena and random graphs.
 Page web http://wiki-math.univ-mlv.fr/gemecod/doku.php/springschool2013
 Sujets apparentés Cours et évènements pour étudiants en mathématiques
2.CanaDAM 2013 — Canadian Discrete and Algorithmic Mathematics Conference
 Dates 10 Jui 2013 → 13 Jui 2013
[ID=440518] Haut de la page
 LieuSt. John's, Newfoundland, Canada
 Page web http://canadam.math.ca/2013/
3.Combinatorial Algebraic Geometry
 Dates 10 Jui 2013 → 15 Jui 2013
[ID=529439] Haut de la page
 LieuLevico Terme, Italie
 Résumé Combinatorics and Algebraic Geometry have classically enjoyed a fruitful interplay. The aim of this series of lectures is to introduce recent development in this research area. The topics involve classical algebraic varieties endowed with a rich combinatorial structure, such as toric and tropical varieties. Combinatorial methods in problems such as syzygies, projective duality, compactifications and recent applications to neighboring fields, such as algebraic statistics, will be presented.
 Page web http://web.math.unifi.it/users/ottavian/cimecirmcag/cimecirmcag.html
 Sujets apparentés Algèbre; Géométrie et topologie
  
4.NORCOM2013 — Nordic Combinatorics Conference
 Dates 17 Jui 2013 → 19 Jui 2013
[ID=490670] Haut de la page
 LieuStockholm, Suède
 Page web http://www.math.kth.se/NORCOM13/
  
5.COMB2013 — Random structures and Algorithms
 Dates 17 Jui 2013 → 17 Jul 2013
[ID=532013] Haut de la page
 LieuHanoi, Viêt Nam
 Sujets Random polynomials, Algorithms: Design and Analysis, Computational geometry – randomized algorithms
 Page web http://viasm.edu.vn/activities/summer-school?lang=en
 Contact PHAN Thi Ha Duong, Vietnam Institute for Advanced Study in Mathematics (VIASM). 7fl., Ta Quang Buu Library, Hanoi University of Science & Technology, 1 Dai Co Viet street, Hanoi, Vietnam.; Tél.: [(+84 989 555 294)]; Email.: comb2013@viasm.edu.vn
 Sujets apparentés Statistique; Algorithmes
  
6.BCC24 — 24th British Combinatorial Conference
 Dates 30 Jui 2013 → 05 Jul 2013
[ID=430537] Haut de la page
 LieuEgham, Royaume-Uni
 Page web http://www.ma.rhul.ac.uk/BCC24/
  
7.24th British Combinatorial Conference
 Dates 30 Jui 2013 → 05 Jul 2013
[ID=497898] Haut de la page
 LieuEgham, États-Unis
 Page web http://www.ma.rhul.ac.uk/BCC24/
  
8.Erdos Centennial
 Dates 01 Jul 2013 → 05 Jul 2013
[ID=479001] Haut de la page
 LieuBudapest, Hongrie
 Sujets Number Theory, Analysis, Combinatorics, Probability Theory, Set Theory
 Page web http://www.renyi.hu/conferences/erdos100/
 Contact Email.: erdos100@renyi.mta.hu
 Sujets apparentés Analyse; Théorie des nombres, arithmétique
  
9.Palanga Conference in Combinatorics and Number Theory
 Dates 01 Jul 2013 → 07 Jul 2013
[ID=533363] Haut de la page
 LieuPalanga, Lituanie
 Page web http://mjcnt.phystech.edu/conference/palanga/
 Sujets apparentés Théorie des nombres, arithmétique
  
10.7th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications
 Dates 07 Jul 2013 → 13 Jul 2013
[ID=506219] Haut de la page
 LieuKošice, Slovaquie
 Page web http://csgt13.upjs.sk/
  
11.Combinatorics, Algebra, and More: A Conference in Celebration of Peter Cameron
 Dates 08 Jul 2013 → 10 Jul 2013
[ID=536485] Haut de la page
 LieuLondres, Royaume-Uni
 Résumé To mark Peter Cameron's retirement and to celebrate his many mathematical achievements (so far), the School of Mathematical Sciences at Queen Mary, University of London is hosting this conference in Peter's honour. The conference will feature 16 world experts speaking on topics in combinatorics, algebra and related fields.
 Sujets combinatorics, algebra, Peter Cameron
 Page web http://www.maths.qmul.ac.uk/~camconf/
 Sujets apparentés Algèbre
  
12.AIM Workshop: Generalizations of chip-firing and the critical group
 Dates 08 Jul 2013 → 12 Jul 2013
[ID=507889] Haut de la page
 LieuAmerican Institute of Mathematics, Palo Alto, États-Unis
 Résumé This workshop, sponsored by AIM and the NSF, will center around the abelian sandpile model and related chip-firing games on graphs, including generalizations to higher dimension, abelian networks, and pattern formation.
 Page web http://www.aimath.org/ARCC/workshops/chipfiring.html
  
13.Graph Theory and Interactions
 Dates 15 Jul 2013 → 25 Jul 2013
[ID=536969] Haut de la page
 LieuDurham University, Durham, Royaume-Uni
 Page web http://www.maths.dur.ac.uk/events/Meetings/LMS/2013/GTI13/
  
14.LMS-EPSRC Short Instructional Course - Random Graphs, Geometry & Asymptotic Structures
 Dates 19 Aou 2013 → 23 Aou 2013
[ID=537019] Haut de la page
 LieuUniversity of Birmingham, Royaume-Uni
 Page web http://web.mat.bham.ac.uk/combinatorics/LMS-EPSRC/index.html
 Sujets apparentés Cours et évènements pour étudiants en mathématiques; Géométrie et topologie
  
15.APPROX'2013 — 16th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
 Dates 21 Aou 2013 → 23 Aou 2013
[ID=533340] Haut de la page
 LieuBerkeley, Californie, États-Unis
 Résumé APPROX'2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.
 Page web http://cui.unige.ch/tcs/random-approx/2013/index.php
 Sujets apparentés Algorithmes
  
16.Combinatorial Methods in Topology and Algebra
 Dates 08 Sep 2013 → 14 Sep 2013
[ID=525166] Haut de la page
 LieuCortona, Italie
 Résumé CoMeTA is an opportunity of meeting and sharing ideas among emerging european researchers, enhanced by the interaction with a small group of experts. We plan to organize talks, poster sessions, and thematic discussions. The proceedings of the conference will be published in the "Springer INdAM series". We particularly welcome young researchers, and female researchers.
 Page web http://www.cometa2013.org/
 Sujets apparentés Géométrie et topologie
  
17.EUROCOMB 2013 — European Conference on Combinatorics, Graph Theory and Applications
 Dates 09 Sep 2013 → 13 Sep 2013
[ID=529077] Haut de la page
 LieuPise, Italie
 Résumé In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this conference will cover the full range of Combinatorics and Graph Theory including applications in other areas of Mathematics, Computer Science and Engineering
 Sujets Algebraic Combinatorics, Combinatorial Geometry, Combinatorial Number Theory, Combinatorial Optimization, Designs and Configurations, Enumerative Combinatorics, Extremal Combinatorics, Graph Theory, Ordered Sets, Random Methods, Topological Combinatorics
 Page web http://www.eurocomb2013.it/
 Contact Marco Pellegrini; Tél.: [+390503152410]; Email.: eurocomb2013@iit.cnr.it
  
18.CID 2013 — Colourings, Independence and Domination
 Dates 15 Sep 2013 → 20 Sep 2013
[ID=533408] Haut de la page
 LieuSzklarska Poreba, Pologne
 Résumé The Colourings, Independence and Domination (CID) is a biennial international conference. It continues a series of international workshops in mathematics with a section of Graph Theory, held annualy since 1993. The CID workshops encourage high-quality research in all aspects of Graph Theory, especially concerning the following topis: colourings, partitions (general colourings), hereditary properties, independence and dominating structures, local properties, products of graphs as well as graph algorithms and applications related to these topics.
 Page web http://www.cid.uz.zgora.pl/2013/
  
19.gd2013 — 21st International Symposium on Graph Drawing
 Dates 23 Sep 2013 → 25 Sep 2013
[ID=533310] Haut de la page
 LieuBordeaux, France
 Résumé Graph Drawing is concerned with the geometric representation of graphs and networks, and algorithmic methods for visualizing them. It is motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include social sciences, Internet and Web computing, information systems, computational biology, networking, VLSI circuit design, and software engineering. The International Symposium on Graph Drawing is the main annual event in this area. The symposium will be hosted by the University of Bordeaux, September 23-25, 2013. Researchers and practitioners working on any aspect of graph drawing are invited to contribute papers and posters, and participate in the graph drawing contest.
 Page web http://gd2013.labri.fr/
  
20.Topological and Combinatorial Problems in One-dimensional Complex Dynamics
 Dates 14 Oct 2013 → 18 Oct 2013
[ID=546449] Haut de la page
 LieuCentro di Ricerca Matematica "Ennio De Giorgi", PI, Italie
 Résumé Financial support available for young participants upon selection. On-line application through the website.
 Page web http://www.crm.sns.it/adm/event/271/
 Sujets apparentés Géométrie et topologie
  
21.Mathematical Technology of Networks - QGraphs 2013
 Dates 04 Dec 2013 → 07 Dec 2013
[ID=540132] Haut de la page
 LieuCenter for Interdisciplinary Research, Bielefeld, Allemagne
 Résumé This conference aims at bringing together functional analysts, mathematical physicists, experts of dynamical systems, and probabilists who have research interests in graph theory, networks, complex systems, and/or random walks. It will ideally follow the path of previous meetings on differential equations on networks held in the past years in Blaubeuren (Germany) and Castro Urdiales (Spain) as well as the QGraph meeting series that has taken place in several German and Swedish venues since 2009.
 Page web http://www.uni-ulm.de/mawi/analysis/mitglieder/jun-prof-pd-dr-delio-mugnolo/mtn2013.html
 Sujets apparentés Mathématiques appliquées: Réseaux complexes
  
22.ICERM Semester Program on "Network Science and Graph Algorithms"
 Dates 03 Fév 2014 → 09 Mai 2014
[ID=517235] Haut de la page
 LieuICERM, Providence, Rhode Island, États-Unis
 Résumé The study of computational problems on graphs has long been a central area of research in computer science. However, recent years have seen qualitative changes in both the problems to be solved and the tools available to do so. Application areas such as computational biology, the web, social networks, and machine learning give rise to large graphs and complex statistical questions that demand new algorithmic ideas and computational models. At the same time, techniques such as semidefinite programming and combinatorial preconditioners have been emerging for addressing these challenges.
 Page web http://icerm.brown.edu/sp-s14
 Sujets apparentés Cours et évènements pour étudiants en mathématiques; Mathématiques appliquées: Réseaux complexes
  
23.ICERM Workshop: Semidefinite Programming and Graph Algorithms
 Dates 10 Fév 2014 → 14 Fév 2014
[ID=542069] Haut de la page
 LieuProvidence, États-Unis
 Résumé Semidefinite programming is playing an ever increasing role in many areas of computer science and mathematics, including complexity theory, approximation algorithms for hard graph problems, discrete geometry, machine learning, and extremal combinatorics.

This workshop will bring together researchers from these different fields. The goal is to explore connections, learn and share techniques, and build bridges.

 Page web http://icerm.brown.edu/sp-s14-w1
 Sujets apparentés Cours et évènements pour étudiants en mathématiques
  
24.ICERM Workshop: Stochastic Graph Models
 Dates 17 Mar 2014 → 21 Mar 2014
[ID=542026] Haut de la page
 LieuProvidence, États-Unis
 Résumé Random graphs, stochastic processes on graphs and algorithms for computations on these structures continue to play a dominant role in algorithmic research and discrete mathematics, with recent applications ranging from web search and recommendation engines to social networks and system biology.

This workshop will be an opportunity for researchers from diverse fields to get together and share problems and techniques for handling and analyzing graphs structures. The connections---mathematical, computational, and practical---that arise between these seemingly-diverse problems and approaches will be emphasized.

 Page web http://icerm.brown.edu/sp-s14-w2
 Sujets apparentés Cours et évènements pour étudiants en mathématiques
  
25.ICERM Workshop: Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond
 Dates 07 Avr 2014 → 11 Avr 2014
[ID=541994] Haut de la page
 LieuProvidence, États-Unis
 Résumé Spectral graph theory, which studies how the eigenvalues and eigenvectors of the graph Laplacian (and other related matrices) interact with the combinatorial structure of a graph, is a classical tool in both the theory and practice of algorithm design. The success of this approach has been rooted in the efficiency with which eigenvalues and eigenvectors can be computed, and in the surprisingly large number of ways that a graph's properties are connected to the Laplacian's spectrum---particularly to the value of its second smallest eigenvalue, ?2.

However, while the eigenvalues and eigenvectors of the Laplacian capture a striking amount of the structure of the graph, they certainly do not capture all of it. Recent work in the field suggests that we have only scratched the surface of what can be done if we are willing to broaden our investigation to include more general linear-algebraic properties of the matrices we associate to graphs.

A particularly fruitful example of this has been the study of Laplacian linear systems, where the interplay between linear algebra and graph theory has led to progress in both fields. On the one hand, researchers have used the combinatorial structure of the corresponding graphs to facilitate the solution of these linear systems, resulting in solvers that run in nearly-linear time. On the other hand, one can use these linear systems to describe the behavior of electrical flows on a graph, which has provided a powerful new primitive for algorithmic graph theory. This interaction has already led to improved algorithmic results for many of the basic problems in algorithmic graph theory, including finding maximum flows and minimum cuts, solving traveling salesman problems, sampling random trees, sparsifying graphs, computing multicommodity flows, and approximately solving a wide range of general clustering and partitioning problems. In addition, researchers have recently shown how to exploit a wide range of other algebraic properties of matrices associated to graphs, such as the threshold rank, cut norm, sensitivity to perturbation, or hypercontractivity of the eigenspaces, to achieve impressive algorithmic results.

In this workshop, we will bring researchers together to study and advance this new emerging frontier in algorithmic graph theory.

 Page web http://icerm.brown.edu/sp-s14-w3
 Sujets apparentés Cours et évènements pour étudiants en mathématiques
  
26.IWCIA 2014 — 16th Internation Workshop on Combinational Image Analysis
 Dates 28 Mai 2014 → 30 Mai 2014
[ID=544308] Haut de la page
 LieuBrno, République tchèque
 Résumé The Internation Workshop on Combinational Image Analysis will be hosted by the Brno University of Technology, Faculty of Mechanical Engineering. The researchers from all areas of image analysis and its applications are cordially invited to participate.
 Sujets Combinatorial problems in the discrete plane and space related to image analysis; lattice polygons and polytopes, Discrete/combinatorial geometry and topology and their use in image analysis, Digital geometry of curves and surfaces, Tilings and patterns; combinatorial pattern matching, Image representation, segmentation, grouping, and reconstruction, Methods for image compression, Discrete tomography, Applications of integer programming, linear programming, and computational geometry to problems of image analysis, Parallel architectures and algorithms for image analysis, Fuzzy and stochastic image analysis, Grammars and models for image or scene analysis and recognition; cellular automata, Mathematical morphology and its applications to image analysis, Applications in medical imaging, biometrics, and others
 Page web http://iwcia2014.fme.vutbr.cz
 Contact Pavla Sehnalova, Institute of Mathematics, Faculty of Mechanical Engineering, Brno University of Technology, Brno, Czech Republic; Tél.: [00420 541 142 800]; Email.: sehnalova@fme.vutbr.cz
 Sujets apparentés Géométrie et topologie; Mathématiques appliquées: Reconnaissance de formes et traitement d'image
  
27.Algebraic Combinatorics: Spectral Graph Theory, Erdos-Ko-Rado Theorems and Quantum Information Theory
 Dates 23 Jui 2014 → 27 Jui 2014
[ID=549481] Haut de la page
 LieuWaterloo, Canada
 Résumé This will be a conference in honour of Chris Godsil's 65th birthday. His imprint on mathematics goes beyond his traditional mathematical area of algebraic combinatorics, merging theory and application, problems and solutions, emerging research areas and well-developed mathematical tools. The goal of this conference is not just to honour his contributions and his impact on mathematics, but to also bring together researchers in discrete math whose work he has influenced, to share recent advances, and to forge stronger connections between researchers. This conference will be a celebration for the Canadian mathematical community and we invite researchers in combinatorics, matrix theory, and quantum information theory from all over the world to join us.
 Sujets Godsil, algebraic combinatorics, association schemes, EKR, quantum information
 Page web http://www.fields.utoronto.ca/programs/scientific/13-14/godsil65/
 Sujets apparentés Mécanique quantique et l'information quantique
  
28.FPSAC — 26th International Conference on Formal Power Series and Algebraic Combinatorics
 Dates 29 Jui 2014 → 03 Jul 2014
[ID=488321] Haut de la page
 LieuChicago, IL, États-Unis
 Sujets Topics include all aspects of combinatorics and their relations with other parts of mathematics, physics, computer science, and biology.
 Page web https://sites.google.com/site/fpsac2014/
 Contact Bridget Tenner; Email.: fpsac2014@gmail.com
  
29.ICGT 2014 — 9th International colloquium on graph theory and combinatorics
 Dates 30 Jui 2014 → 05 Jul 2014
[ID=518239] Haut de la page
 LieuGrenoble, France
 Résumé This conference is the 9th edition of a well-known event initiated by Claude Berge in 1976, and organized by the french community in Graph Theory every 4 or 5 years since then. The most recent editions were held in Orsay in 2010 (8FCC), Hyères in 2005 (ICGT05), and Marseille in 2000 (ICGT 2000). The 2014 version will be organized by members from different research groups of Grenoble.
 Sujets Graph theory, combinatorics
 Page web http://oc.inpg.fr/conf/icgt2014/
  

Dernière mise à jour: 08 mai 2013