Conférences - Théorie des graphes et combinatoire

School of Computing Science, University of Glasgow

The PCC is an established conference organised for, and by, current research students in all areas of combinatorial and discrete mathematics, under the auspices of the British Combinatorial Committee. The PCC is mainly aimed at UK-based students, but is also open to those from abroad.

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

ISCO (Integer Symposium on Combinatorial Optimization) is a biannual symposium whose aim is to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming, operations research, stochastic optimization, graphs and combinatorics. Quality papers on all aspects of combinatorial optimization, from mathematical foundations and theory of algorithms to computational studies and practical applications, are solicited.

Centre International de Rencontres Mathématiques (CIRM)

Moscow Institute of Physics and Technology (MIPT)

The aim of the conference is to bring together specialists in extremal combinatorics, graph and hypergraph theory, additive combinatorics, complex networks, random graphs and models, approximation algorithms, optimization, and operational research. The aim of the meeting is to turn MIPT into a platform for the discussion of various challenging problems in the area, both theoretical and those that have applications in the industry.

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.

May 21-22, 2020 will see the first Alberta-Montana Combinatorics and Algorithms Day hosted at the Banff International Research Station (BIRS). The event brings together faculty and students from three Alberta universities (in Calgary, Lethbridge, and Edmonton) and the University of Montana (Missoula). Combinatorics is the branch of mathematics concerned with finite sets: their properties, structures, and number. Studying the classic Rubik's Cube reveals the number of possible positions (it's 43,252,003,274,489,856,000). Understanding the cube's structure leads to efficient algorithms for solving it (an Algorithm is a sequence of well-defined instructions for solving a problem, answering a question, or even playing a game). In 2010, a group of researchers working with Google proved that every one of that staggering number of positions could be solved in no more than 20 moves.

Centre International de Rencontres Mathématiques (CIRM)

Urmia University

Graph Theory, Algebraic Combinatorics, Algebraic Graph Theory, Matroid Theory, Combinatorics

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.

The international Conference "ULTRAMATH 2020" aims to present recent results in the whole spectrum of mathematics which are grounded on the use of ultrafilters and ultraproducts. Its main goals: • Disseminate information about the various techniques related to the use of ultrafilters and ultraproducts, and their potential to attack open problems. • Bring together researchers with different backgrounds, and encourage their collaborations and interactions, especially on topics connecting different areas of mathematics.

Additive and Combinatorial Number Theory. • Combinatorics and Ramsey Theory. • Algebra and Geometry. • General Topology. • Measure Theory. • Ergodic Theory and Dynamics. • Functional Analysis and Metric Spaces. • Nonstandard Analysis and Model Theory. • Generalized Spaces and Differential Equations. • Set Theory.

Théorie des nombres, arithmétique,    Algèbre

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

University of Haifa, Martin Charles Golumbic, chair

The workshop emphasizes the diversity of the use of combinatorial algorithms and graph theory in application areas.

Email.: Organizing Chair: Tamir Gadot

Graph Algorithms, Applied Combinatorics, Optimization - Graph Theoretic Models

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.

Mathematical Sciences Research Institute (MSRI)

The two topics, combinatorial theory of free resolutions and differential graded algebra techniques in homological algebra, each have a long and rich history in commutative algebra and its applications to algebraic geometry. Free resolutions are at the center of much of the study in the field and these two approaches give powerful tools for their study and their application to other problems. Neither of these topics is generally covered in graduate courses. Furthermore, recent developments have exhibited exciting interplay between the two subjects. The purpose of the school is to introduce the graduate students to these subjects and these new developments. The school will consist of two lectures each day and carefully planned problem sessions designed to reinforce the foundational material and to give them a chance to experiment with problems involving the interplay between the two subjects.

Cours et événements pour étudiants en physique,    Algèbre

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 Fields Institute

The inaugural Queer and Trans Mathematicians in Combinatorics Conference (QTMC) will be held at the Fields Institute in Toronto from June 12-14, 2020. We anticipate an exciting program featuring both invited talks by LGBTQ+ mathematicians, and a variety of contributed talks in combinatorics and related areas. QTMC aims to address the underrepresentation and invisibility of LGBTQ+ people in the world of research mathematics. The conference will give queer and trans mathematicians a chance to network, learn, and form collaborations, in an affirming and supportive environment. Allies are welcome to participate as well. Travel funding is available for graduate students, postdocs, and other early-career mathematicians. To register or submit a paper, please visit the conference website.

Email.: queertransmath@gmail.com

combinatorics, discrete math, graph theory, LGBT, LGBTQ+, queer, trans, diversity, outreach

BIRS-affiliated mathematics research centre, Casa Matemática Oaxaca (CMO)

The aim of our workshop is to bring together researchers in each of these areas: homotopy theory, combinatorics, algebraic K-theory, and Hall algebras, to help facilitate not only the study of higher Segal spaces themselves, but also the interplay between these different fields with the goal of opening new research directions and forming collaborations. The participants of this workshop will also be at a range of career stages, from graduate students to established researchers, from several different countries, and gender diverse.

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

University of Milano-Bicocca, Department of Mathematics

The two-year cycle of conferences "GABY - Groups & Algebras in Bicocca for Young algebraists" stems from the will to support young researchers in group theory, algebra and related topics. The convention is committed to provide an introduction to those topics of group theory and algebra that may not be readily available in any institution and that cover some of the most inviting research topics. Each conference in the series consists of three mini-courses complemented by lectures, posters, and discussion sessions. In addition, we give participants the opportunity to present their research and to expand their network of contacts with other researchers in the areas of interest to them.

Event organization;     Email.: gaby2020milan@gmail.com

representations of groups, geometric group theory, growth of groups, amenable groups, p-adic groups

Théorie des groupes,    Algèbre

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

Mathematical Sciences Research Institute (MSRI)

The topic of random graphs is at the forefront of applied probability, and it is one of the central topics in multidisciplinary science where mathematical ideas are used to model and understand the real world. At the same time, random graphs pose challenging mathematical problems that have attracted the attention from probabilists and combinatorialists since the 1960, with the pioneering work of Erd\"{o}s and R?nyi. Around the turn of the millennium, very large data sets started to become available, and several applied disciplines started to realize that many real-world networks, even though they are from various different origins, share many fascinating features.

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

The summer school runs for a full week Monday-Friday in early July when Sweden is at its best, with arrival on Sunday evening and departure Saturday morning. S3CS consists of mini-courses on The Method of Moments in Computer Science and Beyond by Ankur Moitra and Polyhedral Techniques in Combinatorial Optimization by Ola Svensson.

Recherche opérationnelle,    Formation en informatique

"Algebraic Combinatorics in" is a series of annual international conferences on Algebraic Combinatorics (in a broad sense). After the editions in Ancona and Genova, in 2020 it will take place in Grand Hotel San Michele, Cetraro. This year, the mini-courses have a special focus on positivity and log-concavity results/conjectures.

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.) .

The conference explores the web of interactions among the subjects in the title, on the occasion of Laci Babai's 70th birthday.

Email.: gggc2020@renyi.hu

Algèbre,    Théorie des groupes

Bar Ilan University in Ramat Gan, Israel

Topics include all aspects of combinatorics and their relations with other parts of mathematics, physics, computer science, and biology.

Algèbre,    Mathématiques appliquées (en général)

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).

IWCIA’20 is the twentieth of a series of International Workshop on Combinatorial Image Analysis. Image analysis is a scientific discipline providing theoretical foundations and methods for solving problems appearing in a wide range of areas, as diverse as medicine, robotics, defense, and security. As a rule, the processed data are discrete; therefore, the “discrete approach” to image analysis appears to be a natural one and has an increasing importance. It is based on studying combinatorial properties of the considered digital data sets. Combinatorial image analysis often features various advantages (in terms of efficiency and accuracy) over the more traditional approaches based on continuous models requiring numeric computation

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.

APDIO (the Portuguese Operations Research Society)

The main objective of the Optimization 2020 conference is to bring together researchers and practitioners from different areas and backgrounds, but with common interests in Optimization. This meeting has international recognition as an important forum of discussion and exchange of ideas.

The University of Sydney, School of Mathematics and Statistics

This workshop at the University of Sydney will bring together experts and emerging researchers from Australia, the USA and Europe to report on recent results and explore future directions in computational and algorithmic topology and related areas. There will be a focus on problems in computational geometric topology and computational algebraic topology. This workshop aims to stimulate interaction between researchers in order to bring about new collaborations on difficult problems that cannot be tackled from one viewpoint alone.

We plan to have talks by our invited speakers in the mornings, and open problem sessions, a poster session, and plenty of time for collaboration in the afternoons.

Invited Speakers:

Herbert Edelsbrunner (Institute of Science and Technology Austria)

Brittany Fasy (Montana State University)

Gregory Henselman (Princeton University)

Feng Luo (Rutgers University)

Zuzana Patáková (Institute of Science and Technology Austria)

Jessica Purcell (Monash University)

Vanessa Robins (Australian National University)

Organizers:

Jonathan Spreer (The University of Sydney)

Stephan Tillmann (The University of Sydney)

Katharine Turner (Australian National University)

Email.: jonathan.spreer@sydney.edu.au

Computational topology, Low-dimensional topology, Topological Data Analysis, Computational geometry, Algebraic topology, Algorithms

Géométrie et topologie,    Algorithmes

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.

University of Bath

Exact optimization methods, Approximation algorithms, Heuristics, metaheuristics, and hyperheuristics, Decomposition-based algorithms, Column generation, Valid inequalities, Computational complexity, Polyhedral analysis, Interior-point methods, Bilevel programming, Graph theory, Game theory, Applications

Centre International de Rencontres Mathématiques (CIRM)

A permutation is an ordering or arrangement of a set of objects. One might think of shuffling a pack of cards, or sorting a list of options into order of preference, or arranging the seating of passengers on an aeroplane or guests at a dinner. Permutations are central objects in many areas of mathematics. This workshop will explore aspects of permutations which arise in probability theory and related fields. This is a highly active area of study, with a variety of striking results in the last few years and many challenging problems outstanding. Random permutations have applications ranging from genetics to comupter science to economics, and arise in many challenging questions throughout mathematics. Many interesting random processes can be thought of as permutations evolving over time. The workshop will bring together researchers from many backgrounds including probability, combinatorics, physics and theoretical computer science, with the goal of advancing our understanding of random permutations and permutation processes, and of sharing ideas from across the many disparate fields where they are studied.

We would like to invite you to the Workshop on Spectral Graph Theory 2020. The aim is to bring together young and experienced researchers in subjects related to spectral graph theory and its applications. Recent developments and an opportunity to exchange new ideas are expected as outcomes of this workshop.

In honor of Nair Abreu for her 70th birthday.

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

Algèbre,    Géométrie et topologie

Augusta University, Augusta, Georgia

The Integers conferences are international conferences held for the purpose of bringing together mathematicians, students, and others interested in combinatorics and number theory.

The Integers conferences are international conferences held for the purpose of bringing together mathematicians, students, and others interested in combinatorics and number theory.

Mathematical forum of Montenegro and Faculty of Information Studies, Novo mesto, Slovenia

MESIGMA is a symposium that brings together researchers from several fields of mathematics and computer science. As the scientific framework for MESIGMA is widely set, we consider it to be an incentive environment for finding “shared territory” of diverse scientific disciplines.

Géométrie et topologie,    Algèbre

All aspects of string processing, information retrieval, computational biology, and related applications are covered.

Mathématiques appliquées (en général),    Gestion des connaissances, Big Data Computing

Hosted at the University of Nevada, Las Vegas

The Midwestern Conference on Combinatorics and Combinatorial Computing (MCCCC) originally started as the Carbondale Combinatorics Conferences and were held (1986-1990) at the Southern Illinois University, Carbondale. The conference has since evolved to a prestigious national conference in the areas of Combinatorics and Computing and has achieved recognition and attracted scholars and researchers of various backgrounds from different institutions. Here they coalesce their individual contributions into a collection of ideas and inspirations for the advancement of combinatorics and combinatorial computing.

Dynamics is the study of systems that evolve over time. Combinatorics is the study of discrete structures such as binary strings, well-formed expressions in simple languages, data trees, colorings of graphs, etc. In Dynamical Algebraic Combinatorics, we study key parameters associated with these systems as they evolve, which helps us make sense of the underlying dynamics.

CMM - Center for Mathematical Modeling | FCFM | Universidad de Chile

The LAWCG 2020 edition is supported by the Center for Mathematical Modeling. It will take place at the Termas del Corazón resort located near the city of Los Andes, Chile. The official languages are English, Portuguese, and Spanish. Originally the workshop mostly focused on research in cliques and clique graphs, but now includes all areas of graph theory. We expect mostly Latin-American participants, but everybody is welcome!

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

Cours et évènements pour étudiants en mathématiques,    Géométrie et topologie

Two groups of mathematicians, who specialize either in topological combinatorics or in combinatorial commutative algebra, are organizing a workshop in order to identify and to work on problems in the intersection of both fields. Topological combinatorics uses tools from topology to study discrete structures, while combinatorial commutative algebra also studies discrete structures but uses algebraic tools. As a result, the two groups of mathematicians may be studying the exact same problem about discrete structures, but using completely different tools and mathematical language. As an example, questions about the enumeration of the faces of a topological object called a Cohen--Macaulay flag complex can be translated into questions about Hilbert functions of ideals. The goal of this workshop is to bring together 21 mathematicians in both fields to facilitate discussions and encourage new collaborations between these two groups. The organizers have identified five possible themes that will bring an additional focus to the direction of the workshop.

The University of Melbourne

Previously known as the Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC), the Australasian Combinatorics Conference (ACC) is the annual conference of the Combinatorial Mathematics Society of Australasia. It covers all areas of combinatorics in mathematics and computer science.

Email.: 43acc@ms.unimelb.edu.au

The Department of Mathematics, School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore, is organizing an "International Conference on Graph Theory and its Applications" during December 16-19, 2020.

This will be a four-day Conference in Graph Theory, Graph Algorithms and its applications. It will be focusing on all the topics graph theory and its applications in Optimization, Computing Techniques, Image Processing and Network Communications. The goal of this conference is to bring top researchers in this area to Amrita to foster collaboration and to expose students to important problems in the growing field.

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

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.

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

Cours et évènements pour étudiants en mathématiques,    Recherche opérationnelle

CIRM – Centre International de Rencontres Mathématiques