Decomposition methods for discrete problems
The status, timeline and source of this project. A free account opens every field.
Source: EU Funding & Tenders Portal
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 o
- Status
- Under Construction
- Location
- Poland
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Decomposition methods for discrete problems
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ongoing |
Taiyo status | Under Construction |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | 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 sparseness in graphs and provides a wealth of tools for algorithm design. While there are still many unknowns within this field, we would like to reach beyond sparse graphs by developing a theory of well-structured dense graphs, inspired by the advances in Sparsity. Parameterized dynamic algorithms: The idea of parameterization has so far received little attention in the field of dynamic algorithms. Our goal is to establish solid foundations for the direction of parameterized dynamic algorithms by providing dynamic variants of basic decomposition tools used in parameterized complexity. Parameterization and approximation on planar graphs: The areas of parameterized algorithms and of approximation schemes on planar graphs share a core set of decomposition techniques and benefit from extensive cross-inspiration. We will approach several intriguing questions in this area while focusing on the idea of parameterized approximation schemes, where parameterization and approximation is explicitly combined. Forbidding induced subgraphs: Structural graph theory offers a wealth of tools for understanding structure in graph classes characterized by forbidding induced subgraphs. This structure, while elusive and difficult to exploit, often leads to surprising tractability results. Motivated by recent advances, we propose to focus on finding general-use techniques for designing subexponential-time, approximation, and parameterized algorithms in this setting. |
Location
Country | Poland |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Article published date | 2026-02-15 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More infrastructure projects in Poland
- Golice Wind Park
- Design and build of 18.2 km on the S19 highway between Dukla and Barwinek (Poland)
- Design and construction of 18.1 km of the S19 highway between Radzyn and Podlaski (Poland)
- Fabrication, assembly and corrosion protection of modules, piperacks and other outfitting structures (Poland)
- Design and construction of the third section of the A2 over 12 km in the Mińsk Mazowiecki bypass (Poland)
- Wierzchowice Underground Gas Storage Facility
- Lwowek-Odolanow Gas Pipeline
- Grupa Lotos Effective Refining (EFRA) Project, Gdansk
