Conférences - Théorie des graphes et combinatoire

Institute of Mathematics, Vietnam Academy of Science and Technology

The event is organized in the purpose of introducing knowledge and newest results to domestic mathematics, to create a forum for international and domestic experts sharing ideas as well as research results in recent strongly developing areas. The open problems attracting the world mathematics society also will be mentioned.

The 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (42ACCMCC) will be held at the University of New South Wales in Sydney, Australia, 9-13 December 2019. ACCMCC is the annual conference of the Combinatorial Mathematics Society of Australasia. The conference covers all areas of combinatorics in mathematics and computer science.

Kyoto University/Kobe University

Algèbre,    Théorie des groupes

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Society for Industrial and Applied Mathematics – SIAM

Mathématiques appliquées (en général),    Algorithmes

Cours et évènements pour étudiants en mathématiques,    Mathématiques numériques

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Géométrie et topologie,    Théorie des groupes

Kyoto University

Centre International de Rencontres Mathématiques (CIRM)

The workshop is funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 749022, PROXNET project, and by the University of Bergen.

The workshop intends to provide a forum for the exchange and emergence of new ideas and approaches on the topic of graph modification problems, for both researchers and students. The program will include presentations of new results, tutorials and free time for discussions and working sessions. We encourage all participants to give a talk and invite them to submit an abstract of their talk. The scope of the workshop covers all the aspects of graph modification, studied either from a theoretic point of view or for practical purposes, by either formal methods or experimental approaches.

Algorithms for graph modification problems (parameterized, kernels, approximation, heuristics, inclusion minimal, etc.) New types of modifications (edge contraction, vertex merge, swap of edges, rewiring, etc.) Use of edit distances for other problems Structural results and characterisations Experiments on real-world graphs and random graphs Evaluation and comparison of methods Concrete use of graph modification problems

Institute for Pure and Applied Mathematics (IPAM), UCLA

Algebraic Combinatorics has recently been energized through inAAC2020_imageteractions with Probability, Mathematical Physics, and Theoretical Computer Science. Of great interest is how classical algebro-combinatorial objects behave when their defining parameters become large or random. This new perspective has birthed the rapidly developing subject of Asymptotic Algebraic Combinatorics, the subject of this workshop.

This workshop, sponsored by AIM and the NSF, will be devoted to the topology of configuration spaces of graphs.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

SIAM Activity Group on Applied and Computational Discrete Algorithms

Calcul scientifique,    Algorithmes

The International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), held under aegis of the Association for Computer Science and Discrete Mathematics (ACSDM), is intended to bring together researchers working in the areas of algorithms and applied discrete mathematics and provide a high-quality forum for the dissemination and discussion of research results in these broad areas. CALDAM has originated from the ongoing efforts for promoting research in Algorithms and Discrete Mathematics.

Approximation Algorithms, Combinatorial Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Data Structures, Experimental Algorithm Methodologies, Graph Algorithms, Graph Drawing, Parallel and Distributed Algorithms, Parameterized Complexity, Network Optimization, Online Algorithms, Randomized Algorithms, Graph Theory, Combinatorics, Discrete Geometry

Kyoto University/Seikei University

A one day conference on the interactions of algebra, geometry and combinatorics. Some NSF supported funding is available for graduate students and postdocs to travel to the event.

Algèbre,    Géométrie et topologie

Institute for Mathematical Sciences/National University of Singapore

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. It finds applications in various domains. In particular, due to advances in biotechnology, applications in biology and medical research have increased, many of which arose from the study of bio-molecular sequences and their interaction. This program aims to investigate the combinatorial problems in strings and graphs and their applications in biological science, hoping to explore new ideas and techniques in analyzing these big datasets.

Mathématiques appliquées (en général),    Biologie des systèmes

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Centre International de Rencontres Mathématiques (CIRM)

The goal is to air fresh perspectives and open problems in combinatorics and algebra, those that the speakers think will be important for the future.

Centre International de Rencontres Mathématiques (CIRM)

CGT 2020 will cover issues on Algebraic graph theory, Applications of combinatorics and graph theory, Coding theory, Combinatorial algorithms, Combinatorial designs, Combinatorial matrix theory, Combinatorial optimization, Cryptography, Enumerative combinatorics, Finite geometry, Structure graph theory, Topological graph theory, etc.

American Matheamtical Society

The new and rapidly expanding area of Analytic Combinatorics in Several Variables (ACSV) concerns enumeration problems in such areas as lattice walks, statistical mechanical models, quantum walks and other exactly solvable models where asymptotic estimation of coefficients of a bivariate or multivariate generating function is required. The multivariate setting incorporates a wider swath of mathematics. including singularity theory, algebraic topology, and computational algebra. Participants in this MRC will be introduced to problems from these areas of mathematics whose solutions have direct applications to ACSV. These problems are not hard to state in the language of disciplines such as Morse theory, harmonic analysis, or commutative algebra, but they ask questions not typical in those fields. A long-term goal is to advance and automate this work, so that its benefits can be used by other researchers in mathematics and the natural sciences through implementations in computer algebra packages. Problems for this MRC will be arranged around five central topics: effective computer algebra methods, algorithms using computational topology, multivariate asymptotic phase transitions, singular transforms for degenerate saddle-point integrals, and applications of harmonic analysis and singularity theory. Researchers with knowledge in any one of these areas are encouraged to apply to this MRC.

The Highlights of Algorithms (HALG) conference is designed to be a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms.

ECCO (European Chapter on Combinatorial Optimization) is a working group of EURO (Association of European Operational Research Societies) that provides an excellent opportunity to discuss recent and important issues in Combinatorial Optimization and its a

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.

The Tenth International Conference on Fun with Algorithms (FUN 2020) will be held in Island of Favignana, Trapani, Sicily, Italy, on June 8 – 10, 2020. FUN is dedicated to the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.

Workshop is organized by Faculty of Mathematics and Physics, University of Ljubljana and Institute of Mathematics, Physics and Mechanics, Ljubljana.

Facultad de Ciencias of the Universidad de Cantabria

Algorithms and Complexity, Combinatorics, Coding Theory, Cryptography, Discrete and Computational Geometry, Discrete Optimization, Graph Theory, Location and Related Problems

Mathématiques numériques,    Algorithmes

The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2020 welcomes contributions on theory and applications of discrete algorithms, graphs and combinatorial optimization in the wider sense. The series of Cologne-Twente Workshops on Graphs and Combinatorial Optimization started with meetings organized every two years by the universities of Cologne and Twente. The organizational base was later expanded by other universities. Since 2003 the workshop is held (almost) every year.

Alpen-Adria-Universität, Klagenfurt

The 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020) will take place June 15–19, 2020 at Alpen-Adria-Universität Klagenfurt. It is part of the series of annual meetings on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.

Algorithmes,    Théorie de l'information, fondations de l'informatique

SGH Warsaw School of Economics, Warsaw, Poland

The World Wide Web has become part of our everyday life, and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, hosts and users. The aim of the 17th Workshop on Algorithms and Models for the Web Graph (WAW 2020) is to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop will also welcome the researchers who are working on graph-theoretic and algorithmic aspects of citation networks, social networks, biological networks, molecular networks, and the Internet.

Algorithmes,    Réseaux complexes

Università dell'Insubria

The conference GASCom brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from a theoretical point of view. In connection with this main theme, the conference is also interested in contributions in enumerative or analytic combinatorics, and interactions with other areas of mathematics, computer science, physics or biology. The conference is both interested in methods for random or exhaustive generation and in original results on combinatorial or algorithmic questions, whose solution has been made possible by an approach involving random or exhaustive generation.

Théorie de l'information, fondations de l'informatique,    Algorithmes

University of Leeds

International Centre for Mathematical Sciences, Edinburgh; UK

Andrew Ranicki and his theory of algebraic surgery played a central role in linking manifold theory, algebraic K-theory, and its close cousin L-theory. These areas have seen great developments and advances in the last decade from distinct research communities. This workshop will bring together mathematicians working on the topology of high-dimensional manifolds and their automorphisms with those working on the algebraic K-theory (and its cousins hermitian K-theory and L-theory) of rings and ring spectra, in order to share recent progress in these areas and kindle a fresh interaction between them.

Géométrie et topologie,    Algèbre

The purpose of the present workshop is to expose fundamental, introductory aspects of combinatorial anabelian geometry, as well as more recent developments related to the Grothendieck-Teichmüller group and the absolute Galois groups of number fields and mixed-characteristic local fields.

Théorie des nombres, arithmétique,    Géométrie et topologie

Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Science, Russia

G2G2-Summer School is associated with G2G2-Minisymposia of 8ECM. It belongs to the G2-series that are about strong and beautiful mathematics, especially those involving group actions on combinatorial objects. The main goal of G2G2-Summer School is to bring together experts and students to exchange ideas and to enrich their mathematical horizon. We organize two short courses and four colloquium talks to let participants see order and simplicity from possibly new perspectives and share insights with experts.

Cours et évènements pour étudiants en mathématiques,    Théorie des groupes

Graph problems have applications in many fields and typically require multidisciplinary approaches. The fifth edition of this school aims to bring together leading scientists, junior researchers and PhD students from several areas in order to discuss, possibly in a systematic and organic way, different approaches for solving graph problems. The school is organized in plenary lectures held by internationally renowned speakers. The intended audience consists of PhD students and junior researchers interested in graph problems, coming from several areas including (but not limited to) the design, analysis and experimentation of algorithms, operations research, optimization, and discrete mathematics.

Cours et évènements pour étudiants en mathématiques,    Algorithmes

Each of three main courses consists of 5 hours of lectures and 1 hour of exercises.

Tél.: [48693218569];     Email.: psniady@impan.pl

random Young tableaux, shifted symmetric groups, reflection groups, crystal bases

University of Rijeka, Croatia

The goal of the conference is to bring together researchers interested in combinatorial designs, algebraic combinatorics, finite geometry, graphs, and their applications to communication and cryptography, especially to codes (error-correcting codes, quantum codes, network codes, etc.) .

University of Primorska, Andrej Marušič Institute, Slovenia

At the conference we will be celebrating the 65th birthday of Paul Terwilliger. As such, the general theme of this conference will be the mathematical topics that Paul has worked on over the years (which all have relationships to the q-Onsager algebra).

The Young Researchers in Combinatorics workshop is aimed at PhD students and early-career academics working in Extremal and Probabilistic Combinatorics and related fields. By building an environment without senior researchers, we hope the participants will feel free to contribute their ideas openly, thus preparing them to undertake their own research projects. The workshop consists mostly of working sessions in which participants collaborate on research problems, and a limited number of talks and lectures. We aim to host around 10 invited participants and about 25 PhD students for a week between 19 and 25 July 2020 at ICMS Edinburgh. Accommodation and refreshments are provided for all participants, as well as a conference dinner. A registration fee of 100GBP is payable by all non-invited participants. We expect to start accepting applications in October 2019.

The third edition of Prague Summer School on Discrete Mathematics will be held on August 24-28, 2020 in the historical building of the Computer Science Department of Charles University in the very heart of Prague. Lecture series will be given by Subhash Khot (New York University) and Shayan Oveis Gharan (University of Washington). The School is primarily intended for PhD students and early career researchers. There is no registration fee and a number of travel stipends will be available.

Cours et évènements pour étudiants en mathématiques,    Mathématiques numériques

This workshop, sponsored by AIM and the NSF, is devoted to the Albertson conjecture and other problems related to crossing numbers. The crossing number of a graph is the minimum number of edge crossings in a drawing of the graph in the plane. Determining or estimating the crossing number of a graph is one of the oldest problems in graph theory.

Centre International de Rencontres Mathématiques (CIRM)

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Algèbre,    Géométrie et topologie

Indian Institute of Science, Bangalore

FPSAC/SFCA is a series of annual international conferences on Formal Power Series and Algebraic Combinatorics. The principal topics featured during FPSAC conferences are algebraic and enumerative combinatorics and their applications and relations with other areas of mathematics, physics, biology and computer science. This interdisciplinary nature is reinforced by the choice of plenary speakers.