Conferences and Meetings on Graph Theory and Combinatorics

Casa Matemática Oaxaca (CMO)

MPI f. Mathematik, Bonn

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. GD has been the main annual event in this area for more than 25 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces.

Information Theory, Foundations of Computer Science,    Geometry and Topology

University of Oxford, Mathematical Institute

The goal of this workshop is to bring to Oxford leading experts in the various areas of mathematics and theoretical computer science with an interest in the spectral analysis of graphs and its many applications within mathematics.

The event is organised in partnership with the Clay Mathematics Institute.

SPIRE 2019 is the 26th International Symposium on String Processing and Information Retrieval. SPIRE started in 1993 as the South American Workshop on String Processing and was held in Latin America until 2000 when SPIRE travelled to Europe and was held A Coruña, Spain. Nineteen years have gone, and SPIRE is back to Spain, this time allowing attendees to visit Segovia, a beautiful historical city located very close to Madrid that was declared World Heritage City by UNESCO in 1985.

Graph theory and combinatorics are closely related to many mathematical subjects, such as, topology, geometry and number theory and have a lot of applications in applied sciences, engineering and optimization problems. The workshop focuses on all aspects of graph theory, combinatorics and their applications. It dedicates to creating a platform for exchanging the latest research results; sharing the advanced research methods and latest trends in these areas and to build & develop further collaborations.

Phone: [00971504746182];     Email: m.imran658@uaeu.ac.ae

Graph Theory, Combinatorics

Basic topics of the symposium: Graphs, Informatics, Аlgebra

Algebra,    Information Theory, Foundations of Computer Science

Centre International de Rencontres Mathématiques (CIRM)

The purpose of this workshop is to bring together researchers from different areas in order to share different points of view and to make collaborations possible, with the ultimate aim that this will result in new connections and possibly unexpected breakthroughs.

WORKSHOP

Algebra,    Geometry and Topology

Bernoulli Center (CIB)

This workshop brings together dynamicists who use techniques from, and are motivated by, combinatorics, geometry, and number theory. The topics cover a broad swath of dynamics, including ergodic theory, homogeneous dynamics, symbolic dynamics, Teichmuller theory, and billiards, and the aim of the workshop is to highlight the common features across these subjects.

Part of the Semester : Dynamics with Structures

Courses and Events for Math Students and Early Career Researchers,    Systems theory, Control and Automation

The TextGraphs series of workshops, now going on for more than a decade, have published and promoted the synergy between the field of Graph Theory (GT) and Natural Language Processing (NLP). The thirteenth edition of the TextGraphs workshop aims to extend the focus on graph-based and graph-supported machine learning and deep learning methods. We encourage the description of novel NLP problems or applications that have emerged in recent years, which can be addressed with existing and new graph-based methods.

natural language processing, graph-based methods, network science

American Institute of Mathematics

This workshop, sponsored by AIM and the NSF, will be devoted to problems in combinatorial and geometric rigidity theory arising from modeling of microstructures. The overall goal of this workshop is to formalize and start working on a graded set of problems arising from the applications, framed by specific focus topics on flexibility, tunnelling, stresses and periodicity, while connecting them with existing techniques and already formulated open problems.

Applied Mathematics (in general),    Modeling and Simulation

Casa Matemática Oaxaca (CMO)

These are a series of combinatorial workshops, held once per semester, each on a Saturday. The series began with its first meeting in spring 2010. They rotate among the universities in and around the Research Triangle. Participants come from numerous colleges and universities within a few hours drive, and some from even farther away. These workshops are funded by the National Science Foundation, in particular enabling us to bring in four exciting speakers to give one hour talks each time as well as funding travel expenses for participants.

Graph Theory has grown into a major area of Discrete Mathematics with applications in a wide variety of fields: Computer Science, Coding Theory, Cryptography, Electrical Engineering, Sociology, Psychology, Physics, Chemistry, Economics, etc. It also provides a premier interdisciplinary platform for researchers to present and discuss the most recent innovations as well as practical challenges encountered in the field of Graph Theory. In the proposed conference, we have planned to conduct a symposium on graph decompositions. Graph decompositions have a wide variety of applications such as computer architecture, designing reliable communication networks. Hypercubes, Butterfly network, and de Bruijn network are proved to be good interconnection networks.

Phone: [+919944003615/+919865082202];     Email: sampathkumars@ssn.edu.in/sundareswaranr@ssn.edu.in/rajalaxmitm@ssn.edu.in

Graph Coloring; Graph Domination; Graph Decomposition; Design Theory; Graph Embedding etc.,

4th International Conference on Combinatorics, Cryptography, Computer science and Computation (I4C2019) will be held in, Iran University of Science and Technology, Tehran, Iran 2019. Original research papers in the areas of algebra mathematics, algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is motivated by real-world problems

Email: i4c@iust.ac.ir

Algorithms and Data Structures, Algorithmic Game Theory, Approximation Algorithms and Online, Algorithms, Automata, Languages, Logic, and Computability, Complexity Theory, Computational Learning Theory and Knowledge Discovery, Cryptography, Reliability and Security, and Database Theory, Computational Biology and Bioinformatics, Computational Algebra, Geometry, and Number Theory, Graph Drawing and Information Visualization, Graph Theory, Communication Networks, and Optimization, Parallel and Distributed Computing,

Cryptography, Blockchain and Information Security,    Algebra

Graph Theory and Combinatorics

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

Algebra,    Group Theory

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

Society for Industrial and Applied Mathematics – SIAM

Applied Mathematics (in general),    Algorithms

Courses and Events for Math Students and Early Career Researchers,    Numerical Analysis and Computational Mathematics

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

Geometry and Topology,    Group Theory

Kyoto University

Centre International de Rencontres Mathématiques (CIRM)

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)

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

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.

Applied Mathematics (in general),    Systems Biology and Computational Biology

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)

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

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.

Number Theory, Arithmetic,    Geometry and Topology

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.

Courses and Events for Math Students and Early Career Researchers,    Group Theory

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

Phone: [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.

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)

Algebra,    Geometry and Topology