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”
EN
ČeštinaEnglish

Filters

1 114 (0,144s) •

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 ...

Pure mathematics

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

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

Many important graph properties can be characterized in terms of forbidden induced subgraphs, or become more tractable when considered in such graph classes. The problems considered in such classes under this proje...

Pure mathematics

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

Topological and geometric approaches to classes of permutations and graph properties (GJ16-01602Y)

, the topological obstructions characterizing certain minor-closed graph classes, such as the class of graphs embeddable on a given surface, and we will also focus on properties to combinatorial and graph-...

BA - Obecná matematika

  • 2016 - 2018
    • •
  • 4 949 tis. Kč
    • •
  • 4 949 tis. Kč
    • •
  • GA ČR
Project

Structural properties of graphs and graph classes (ME 418)

The research will be focused on studying structural properties of graphs from some important algorithmically efficiently recognizable classes of graphs, especially on those that are related to some algorithmically very diff...

BA - Obecná matematika

  • 2001 - 2003
    • •
  • 402 tis. Kč
    • •
  • 190 tis. Kč
    • •
  • MŠMT
Project

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

graph classes, FO interpretations in sparse classes and their structural characterizations, parameterized tractability of graph crossing number and planar insertion problems, structural characterization of crossin...

IN - Informatika

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

Special graph, hypergraph and algorithmic structures (GA201/98/1451)

relationships between various (above mentioned and also other) classes of graphs (embeddability), to construct efficient algorithms for corresponding graph and hypergraphThe project involves study selected graph, ...

BA - Obecná matematika

  • 1998 - 2000
    • •
  • 1 237 tis. Kč
    • •
  • 1 077 tis. Kč
    • •
  • GA ČR
Project

Geometric Representations of Graphs (GC19-17314J)

The project is motivated by graph drawing, i.e. representing pairwise interaction between objects that is suitable either for human recognition or for further. In the area of planar graph we shall explore the maximum crossing number...

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

  • 2019 - 2021
    • •
  • 4 683 tis. Kč
    • •
  • 3 335 tis. Kč
    • •
  • GA ČR
Project

Colourings, cycles and closures (MEB101014)

them exactly. However, if we restrict the input class of graphs, these problems for the class of graphs with maximum degree two. The planned research is a continuation of Graph Theory. The first problem a...

BA - Obecná matematika

  • 2010 - 2011
    • •
  • 90 tis. Kč
    • •
  • 90 tis. Kč
    • •
  • MŠMT
Project

Ramsey-like aspects of graph coloring (GA17-04611S)

areas, for example, size of independent sets in sparse graph classes (in relation the size of homogeneous subsets in hereditary classes of graphs. with given properties. This gives a natural connection between

BA - Obecná matematika

  • 2017 - 2019
    • •
  • 4 923 tis. Kč
    • •
  • 3 737 tis. Kč
    • •
  • GA ČR
Project

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

of graph classes, properties of geometric representations of graphs, tractable instances for the FO model checking problem, and the detailed structure of the graph the internal structure of tractable instances of ...

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
  • 1 - 10 out of 1 114