Conferences and Meetings on Graph Theory and Combinatorics

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

The topic of the workshop is domination in graphs and closely related areas.

hosted by the Royal Academy of Exact, Physics and Natural Sciences

The ECCO annual meetings aim to bring together researchers in the field of Combinatorial Optimization to present their work, share experiences, and discuss recent advances in theory and applications.

For the past fifteen years, the workshops in the TextGraphs series have published and promoted the synergy between the field of Graph Theory (GT) and Natural Language Processing (NLP). The mix between the two started small, with graph theoretical frameworks providing efficient and elegant solutions for NLP applications. Graph-based solutions initially focused on single-document part-of-speech tagging, word sense disambiguation, and semantic role labeling, and became progressively larger to include ontology learning and information extraction from large text collections. The fifteenth edition of the TextGraphs workshop aims to extend the focus on graph-based representations for (1) large-scale knowledge bases and reasoning about them and (2) graph-based and graph-supported machine learning and deep learning methods. We are organizing a shared task on multi-hop inference before the workshop!

Organizers;     Email: textgraphsoc@gmail.com

natural language processing, graphs, shared task, graph embeddings, machine learning, knowledge graphs

Heuristic search and other forms of combinatorial search optimization are a very active areas of research in artificial intelligence, robotics, planning and other areas of computer science. The International Symposium on Combinatorial Search (SoCS) is meant to bring researchers in such areas together to exchange their ideas and cross-fertilize the field. SoCS is targeting researchers and submissions in all fields that use combinatorial search, including artificial intelligence, planning, robotics, constraint programming, meta-reasoning, operations research, navigation and bioinformatics. We especially invite submissions presenting real-world applications of heuristic search.

Algorithms and Data Structues,    Database Technology and Design, Search Engines and Data Mining

Faculty of Applied Mathematics, AGH University of Science and Technology, Kraków

This is a subsequent meeting in the series of former Cracow Conferences on Graph Theory, from this event on merged with the Workshop on Graph Theory - CID. We believe our joint traditions and mutual synergy shall result in a new quality conference devoted to a wide range of subjects within graph theory and beyond. This event is also otherwise exceptional, as it shall provide opportunity to celebrate 80th birthday of Mieczysław Borowiecki and 70th birthday of Mariusz Woźniak — two fundamental figures in the history of the both conferences.

CIRM – Centre International de Rencontres Mathématiques

Applied and computational topology, one of the most rapidly growing branches of mathematics, is becoming a key tool in applied sciences. It is making impact not only in mathematics, but on the wide interdisciplinary environment including material and medical sciences, data science, robotics.

CIRM – Centre International de Rencontres Mathématiques

The Fields Institute for Research in Mathematical Sciences

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), the International Workshop on Combinatorial Algorithms (IWOCA) has provided a forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business. IWOCA's ongoing goal is to advance this area of scientific achievement by bringing together the most creative and successful practitioners in this fundamental intersection between mathematics and computer science. IWOCA's sessions provide for the dissemination of new results as well as for discussion and analysis of new problems and problem areas. Both complete papers and problem submissions are subject to a rigorous refereeing process that seeks to maintain the highest standards of academic research.

Durham University, Departments of Computer Science and Mathematical Sciences

The British Combinatorial Conference is a biennial event organized in the UK attracting international researchers in all areas of combinatorics. The 2021 is the 28th conference in the series and is being held online organized by the Departments of Computer Science and Mathematical Sciences in Durham under the auspices of the ACiD research group. The conference is overseen by the British Combinatorial Committee

Conference enquiries;     Email: bcc.2021@durham.ac.uk

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.

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

The systematic study of random graphs commenced with the seminal work of Erd" os and Renyi in the 1960s. Beyond the classical connections and synergies between random graphs and computer science, over the last few years a new exciting connection between random graphs and statistical inference has been discovered. These connections have led to important new insights on computational problems and statistical inference problems and to new methods for the analysis of random graphs or random discrete structures in general. In addition, since the late 1990s an insightful approach called the cavity method by physicists has been applied to put forward predictions on structural properties of random graphs and their phase transitions. More recently, it has inspired new algorithms for statistical inference problems such as message passing algorithms and novel spectral algorithms. With this workshop we hope to stimulate research and foster new exciting interdisciplinary collaborations between researchers with different backgrounds and expertise in random graphs, computer science, probability, statistics, statistical inference and information theory.

Courses and Events for Math Students and Early Career Researchers,    Probability and Statistics, Game Theory

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

Despite the enormous commercial potential that quantum computing presents, the existence of large-scale quantum computers also has the potential to destroy current security infrastructures. Post-quantum cryptography aims to develop new security protocols that will remain secure even after powerful quantum computers are built. This workshop focuses on isogeny-based cryptography, one of the most promising areas in post-quantum cryptography. In particular, we will examine the security, feasibility and development of new protocols in isogeny-based cryptography, as well as the intricate and beautiful pure mathematics of the related isogeny graphs and elliptic curve endomorphism rings. To address the goals of both training and research, the program will be comprised of keynote speakers and working group sessions.

Courses and Events for Math Students and Early Career Researchers,    Cryptography, Blockchain and Information Security

The Fields Institute for Research in Mathematical Sciences

Quantum mechanics has led to some revolutionary changes in computing and information processing. Over the past decades, there has been a surge of research, mostly by physicists and computer scientists, on how quantum computers could outperform their classical counterparts. It is becoming apparent, however, that many of the problems considered have mathematical aspects, and a number of questions in combinatorics are arising as the field of quantum information theory matures. The goal of this workshop is to foster cross-collaboration among mathematicians, physicists and computer scientists, in order to explore the deep connections between quantum information and algebraic graph theory.

Algebra,    Quantum Mechanics and Quantum Information Theory

Universitat Politècnica de Catalunya

In the spirit of EUROCOMB’01 (Barcelona), EUROCOMB’03 (Prague), EUROCOMB’05 (Berlin), EUROCOMB’07 (Seville), EUROCOMB’09 (Bordeaux), EUROCOMB’11 (Budapest), EUROCOMB’13 (Pisa), EUROCOMB’15 (Bergen), EUROCOMB’17 (Vienna) and EUROCOMB’19 (Bratislava), the current edition of the conference will be a showcase of the most recent advances in Combinatorics and Graph Theory including applications in other areas of Mathematics, Computer Science and Engineering.

Email: eurocomb.2021@event.upc.edu

Algebraic Combinatorics, Combinatorial Geometry, Combinatorial Number Theory, Combinatorial Optimization, Designs and Configurations, Enumerative Combinatorics, Extremal Combinatorics, Graph Theory, Ordered Sets, Probabilistic Combinatorics, Random Discrete Structures, Topological Combinatorics

University of Tübingen

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, web computing, information systems, biology, geography, business intelligence, information security, or software engineering. GD has been the main annual event in this area for more than 20 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute papers and posters and to participate in the symposium and the graph drawing contest.

graph drawing, network visualization, combinatorics, experiments

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

Advances in data collection and social media have led to network and graph data becoming available in many areas, including social sciences, biological sciences, and engineering. Understanding and modeling network structure, as well as conducting rigorous statistical inference to assess uncertainty, can provide crucial insights into the dynamics and interaction mechanisms of the system. Statistical network analysis to date has largely focused on the setting where a single network is observed as a noisy version of some underlying structure of interest. This setting in itself is challenging, requiring adaptation of existing statistical frameworks to networks and bridging the gap between theoretically optimal performance and computational feasibility. The workshop will start by covering recent advances in this setting.

Courses and Events for Math Students and Early Career Researchers,    Probability and Statistics, Game Theory

Friedrich-Schiller-University Jena

We are pleased to announce the 8th German-Polish Conference on Optimization – Methods and Applications, organized by the Friedrich Schiller University Jena and held at "Hotel am Schloss" in Apolda, Germany on September 20–24, 2021. The present conference is a continuation of the German-Polish Conference on Optimization series held in Żagań (1999), Cottbus (2002), Będlewo (2005), Moritzburg (2009), Kraków (2011), Wittenberg (2014) and Będlewo (2017).

Conference Office;     Phone: [+49 3641 946200];     Email: nadin.friebe@uni-jena.de

theory of smooth and non-smooth optimization, variational problems and variational inequalities, optimal control, inverse and ill-posed problems, combinatorial optimization, vector optimization, solution methods and applications of optimization

Operational research,    Analysis

CIRM – Centre International de Rencontres Mathématiques

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

Courses and Events for Math Students and Early Career Researchers,    Operational research

University of North Carolina, Greensboro, NC

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.

Paderborn University, Paderborn, Germany

The Colloquium on Combinatorics is a forum that brings together young researchers and well established scientists. The colloquium will cover all areas of Combinatorics and Discrete Mathematics in a broad sense, including combinatorial aspects in Algebra, Geometry, Optimization and Computer Science. All participants are cordially invited to give a scientific talk

Courses and Events for Math Students and Early Career Researchers,    Algebra

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

Graphs are the standard mathematical model of many real-world entities: computer networks, road and highway networks, drainage systems, river networks, electrical networks, and so on. In some cases, these highly-complicated graphs are contained in the product of two or more much simpler graphs. In a recent breakthrough, it was shown that this is the case for planar or near-planar graphs like those that model river, road, and highway networks; any such graph is contained in the product of a simple tree-like graph and a path. This product structure gives deep insight into these graphs and their properties, allowing a host of mathematical and algorithmic tools to be applied to these graphs. The goal of this workshop is to continue the search for product structure in more general classes of graphs as well as to find new methods to exploit such product structure mathematically and algorithmically, when it is present.

The Fields Institute for Research in Mathematical Sciences

Scheduled as part of the Thematic Program on Trends in Pure and Applied Model Theory

Algebra,    Courses and Events for Math Students and Early Career Researchers

The Fields Institute for Research in Mathematical Sciences

Algebra,    Courses and Events for Math Students and Early Career Researchers

CIRM – Centre International de Rencontres Mathématiques

The University of Melbourne

The 43rd Australasian Combinatorics Conference (43ACC) will be held at The University of Melbourne, Australia, 13-17 December 2021. Researchers in any area of discrete mathematics and its applications are warmly invited to attend this conference and give talks. Contributed talks will be around 20 - 25 minutes in length including time for questions. ACC is the annual conference of the Combinatorial Mathematics Society of Australasia (CMSA), which was called the Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC) from 1989 to 2019. Past and future editions of this international conference can be found at http://combinatorics-australasia.org/conferences.html.

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

ICERM

Braid groups and their generalizations play a central role in a number of places in 21st-century mathematics. In modern representation theory, braid groups have come to play an important organizing role, somewhat analogous to the role played by Weyl groups in classical representation theory. Recent advances have established strong connections between homological algebra (t-structures and stability conditions), geometric representation theory (Hilbert schemes, the Hecke category, and link homologies), and algebraic combinatorics (shuffle algebras, symmetric functions, and also Garside theory). Braid groups appear prominently in many of these connections. The goal of this workshop will be to bring experts in these different areas together to both communicate recent advances and also to formulate important questions for future work.

Phone: [401 863 5030];     Email: info@icerm.brown.edu

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

CIRM – Centre International de Rencontres Mathématiques

CONFERENCE

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

Courses and Events for Math Students and Early Career Researchers,    Probability and Statistics, Game Theory

UiT - The Arctic University of Norway

The Nordic Combinatorial Conference (NORCOM) is a triennial scientific meeting covering the fields of combinatorics and discrete mathematics, interpreted broadly, with the arrangement rotated among the five Nordic countries. The conference is a venue for Nordic as well as foreign combinatorialists to get together and interact in a relaxed atmosphere. Plenary talks are given by distinguished international scholars, and short presentations are given by participants.

Local organizer Trygve Johnsen;     Phone: [+4792891013];     Email: Trygve.Johnsen@uit.no

Combinatorics, coding theory, discrete mathematics.

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

distance-regular graphs, association schemes, the subconstituent algebra, Leonard pairs, tridiagonal pairs, billiard arrays, lowering-raising triples, the tetrahedron algebra, the Onsager algebra, the equitable presentation of Uq(sl2), the q-tetrahedron algebra, the q-Onsager algebra in mathematical physics, the universal Askey-Wilson algebra

Mathematical Physics,    Algebra

CIRM – Centre International de Rencontres Mathématiques

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