All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

6 983 (0,089s)

Project

Structure of tractable instances of hard algorithmic problems on graphs (GA20-04567S)

which are intractable in their full generality. Our proposal is to investigate the internal structure of tractable instances of such generally hard problems on graphs, namely those dealing with structural and topological <...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020 - 2022
  • 8 174 tis. Kč
  • 6 521 tis. Kč
  • GA ČR
Project

Principles of combinatorial generation (GA22-15272S)

graphs, which have as vertices the objects to be generated, and edges connect objectsGeneration of combinatorial objects is a fundamental algorithmic task the theoretical foundations for combinatorial generation, ...

Applied mathematics

  • 2022 - 2024
  • 6 795 tis. Kč
  • 6 552 tis. Kč
  • GA ČR
Project

Structural properties of graph classes characterized by forbidden subgraphs (GA20-09525S)

and to chromatic graph theory. In Hamiltonian graph theory, we focus on Hamiltonian properties of line graphs and their generalizations (Thomassen’s and Matthews-Sumner’sMany important graph properties ca...

Pure mathematics

  • 2020 - 2023
  • 7 905 tis. Kč
  • 7 644 tis. Kč
  • GA ČR
Project

Paradoxical flexibility of frameworks (GF22-04381L)

is flexible. Since rigidity is a generic property, the graph itself can be called rigid if every generic realization yields a rigid framework. Nevertheless, such a rigid graph can have non-generic flexibl...

Applied mathematics

  • 2022 - 2025
  • 2 442 tis. Kč
  • 2 442 tis. Kč
  • GA ČR
Project

Structures and algorithms in highly symmetric graphs (GA19-08554S)

Highly symmetric graphs appear naturally in many different problems in computer combinatorics or in the study of Boolean functions. The algorithmic problem of generating, partitions or trees - is another source of a multitude of hig...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019 - 2022
  • 6 482 tis. Kč
  • 6 215 tis. Kč
  • GA ČR
Project

Extremal graph theory and applications (GJ16-07822Y)

Graphs are among the simplest mathematical structures. They form the foundation with the development of computer networks. Extremal graph theory focuses on interactions between different properties of graphs. In this projec...

BA - Obecná matematika

  • 2016 - 2020
  • 7 610 tis. Kč
  • 7 610 tis. Kč
  • GA ČR
Project

Structural properties of graphs with no long paths (8J19FR027)

Hereditary graph classes, that is, classes closed under vertex deletion, are an important type graph classes which is intensively studied. In the project, we intend to study structural and algorithmic and structural aspects of hered...

Pure mathematics

  • 2019 - 2021
  • 96 tis. Kč
  • 96 tis. Kč
  • MŠMT
Project

Structural properties, parameterized tractability and hardness in combinatorial problems (GA17-00837S)

are intractable in their full generality. Our proposal addresses various questions belonging and topological graph theory, and to logic and interpretations in graphs. Among the problems graph classes, FO interpret...

IN - Informatika

  • 2017 - 2019
  • 4 758 tis. Kč
  • 3 294 tis. Kč
  • GA ČR
Project

Flows and cycles in graphs on surfaces (GA22-17398S)

by Tutte's insightful conjectures and focuses on general graphs. In this project, weFlows in graphs have a long and rich history in combinatorial theory. In his by the duality to graph colorings in plane gra...

Pure mathematics

  • 2022 - 2024
  • 10 780 tis. Kč
  • 9 743 tis. Kč
  • GA ČR
Project

Quantum graphs and related systems (IAA1048101)

mechanical systems whose configuration space is a graph, or such that interact with can be modeled by a graph. They offer on apportunity to study relations between spectral of quantum graphs, both finite and infinite, incl...

BE - Teoretická fyzika

  • 2001 - 2003
  • 6 113 tis. Kč
  • 2 602 tis. Kč
  • AV ČR
  • 1 - 10 out of 6 983