This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in Graphs: From Structure to Algorithms", which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar
This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edg...
This paper studies degree-bounded vertex partitions, derives analogues for well-known results on the...
Problem podziału grafu jest jednym z podstawowych zadań w informatyce i ma wiele zastosowań, np. w s...
This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Pro...
This report documents the program and the outcomes of Dagstuhl Seminar 19271 "Graph Colouring: from ...
We survey recent trends in practical algorithms for balanced graph partitioning, point to applicatio...
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Al...
A graph partition problem is to cut a graph into 2 or more good pieces. The methods are based o
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Grap...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 “High- per-formance Gra...
Warning: these notes are still very rough. They provide more details on what we discussed in class, ...
Many problems appearing in scientific computing and other areas can be formulated as a graph parti...
This report documents the program and the outcomes of Dagstuhl Seminar 15511 "The Graph Isomorphism...
IBM invited Seminar, ZürichGraph partitioning is an ubiquitous technique which has applications in m...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edg...
This paper studies degree-bounded vertex partitions, derives analogues for well-known results on the...
Problem podziału grafu jest jednym z podstawowych zadań w informatyce i ma wiele zastosowań, np. w s...
This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Pro...
This report documents the program and the outcomes of Dagstuhl Seminar 19271 "Graph Colouring: from ...
We survey recent trends in practical algorithms for balanced graph partitioning, point to applicatio...
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Al...
A graph partition problem is to cut a graph into 2 or more good pieces. The methods are based o
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Grap...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 “High- per-formance Gra...
Warning: these notes are still very rough. They provide more details on what we discussed in class, ...
Many problems appearing in scientific computing and other areas can be formulated as a graph parti...
This report documents the program and the outcomes of Dagstuhl Seminar 15511 "The Graph Isomorphism...
IBM invited Seminar, ZürichGraph partitioning is an ubiquitous technique which has applications in m...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edg...
This paper studies degree-bounded vertex partitions, derives analogues for well-known results on the...
Problem podziału grafu jest jednym z podstawowych zadań w informatyce i ma wiele zastosowań, np. w s...