CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project aims to advance the understanding of decomposition methods in graph theory, focusing on parameterized and approximation algorithms. It seeks to develop new techniques for analyzing dense graphs and dynamic algorithms, enhancing computational efficiency.
The main goal of the project is to radically expand our understanding of decomposition methods for discrete problems, with a particular focus on the design of parameterized and approximation algorithms on graphs.
We will concentrate on four topics where we see a potential for either establishing new directions, or reaching far beyond the current state of the art. (Beyond) Sparsity:
The field of Sparsity is a rapidly developing area of graph theory that studies abstract notions of uniform spar…
UNIWERSYTET WARSZAWSKI
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.