Projects funded by the NCN
Structure and algorithms for graph classes defined by transduction-closed properties
2022/47/D/ST6/03421
Keywords:
FO logic bounded expansion monadic stability nowhere dense interpretations transductions model checking twin-width monadically NIP graph classes
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: SONATA 18 - announced on 2022-07-15
Amount awarded: 508 440 PLN
Project start date (Y-m-d): 2023-10-02
Project end date (Y-m-d): 2026-10-01
Project duration:: 36 months (the same as in the proposal)
Project status: Pending project
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.