Conférences  >  Mathématiques  >  Théorie des graphes et combinatoire  >  Allemagne

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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.

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.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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.

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

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

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

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.

Graph Algorithms, Graph Classes, Graph Containment, Relations, Parameterized Complexity, Width Parameters

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

Statistique, Théorie des jeux,    Théorie de l'information, fondations de l'informatique