Conferences  >  Mathematics  >  Graph Theory and Combinatorics  >  Germany

Select a location
1
GSMAAC24 — 5th Graduate Student Meeting in Applied Algebra and Combinatorics
10 Apr 2024 - 12 Apr 2024 • Berlin, Germany
Organizer:
Berlin Mathematical School
Abstract:
The 2024 edition of the Graduate Student Meeting on Applied Algebra and Combinatorics will take place in Berlin, April 10-12. This is an opportunity for graduate students and postdocs interested in algebra and combinatorics and their applications to meet each other, communicate their research, and form new collaborations. Over the course of three days, participants will get the chance to take part in two minicourses held by Georg Loho (he/him) and İrem Portakal (she/her) with interactive exercise sessions, a poster session, several contributed talks, software demonstrations, as well as an open problem session. See more information on the schedule at the website: https://sites.google.com/view/gsmaac24/
Contact:
Email: appliedalgebracombinatorics24@gmail.com
Topics:
submodular functions, matroids, generalized permutahedra, tropical geometry, geometry of neural networks, algebraic game theory, convex geometry, algebraig geometry, algebraic statistics
Event listing ID:
1597919
Related subject(s):
2
Dagstuhl-Seminar — Algebraic and Analytic Methods in Computational Complexity
15 Sep 2024 - 20 Sep 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.
Event listing ID:
1589579
3
DIAGRAMS 2024 — 14th International Conference on the Theory and Application of Diagrams
27 Sep 2024 - 01 Oct 2024 • University of Münster, Münster, Germany
Abstract:
Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis. DIAGRAMS’24 is the fourteenth conference in the series that started in 2000. The multidisciplinary nature of Diagrams means it encompasses: architecture, art, artificial intelligence, biology, cartography, cognitive science, computer science, education, graphic design, history of science, human-computer interaction, linguistics, logic, mathematics, philosophy, psychology, and software modelling. The conference attracts a large number of researchers from these interrelated fields, positioning Diagrams as the major international event in the area.
Event listing ID:
1588984
4
Dagstuhl-Seminar — New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition
06 Oct 2024 - 11 Oct 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
This Dagstuhl Seminar will concentrate on developing new tools arising from the parameterized complexity of cuts, paths, and graph decompositions. The last 2 years have been very exciting for the area, with several breakthroughs.
Event listing ID:
1589517
5
Combinatorial Optimization
10 Nov 2024 - 15 Nov 2024 • Oberwolfach, Germany
Organizer:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Event listing ID:
1529886
6
Graph Theory
05 Jan 2025 - 10 Jan 2025 • Oberwolfach, Germany
Topics:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Event listing ID:
1605061
7
Dagstuhl-Seminar — Solving Problems on Graphs: From Structure to Algorithms
19 Jan 2025 - 24 Jan 2025 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
Many discrete optimization problems can be modelled as graph problems, leading to a long list of well-studied problems, which include graph partitioning, covering and packing problems, network design problems, width parameter problems, and so on. Most of these graph problems are computationally hard. However, this situation may change if we require the input to belong to some special graph class. This leads to two fundamental questions, which lie at the heart of our Dagstuhl Seminar: for which classes of graphs can a computationally hard graph problem be solved in polynomial time, and for which classes of graphs does the problem remain hard? In our seminar, we aim to discover new insights that lead to results for a whole range of problems rather than just for a single problem alone.
Topics:
Graph Algorithms, Graph Classes, Graph Containment, Relations, Parameterized Complexity, Width Parameters
Event listing ID:
1589782
8
Combinatorics, Probability and Computing
14 Sep 2025 - 19 Sep 2025 • Oberwolfach, Germany
Topics:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Event listing ID:
1605478


Conference-Service.com offers, as part of its business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events. Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!

No tracking | No pop-ups | No animations
Last updated: 7 February 2024