All
All

What are you looking for?

All
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

-
19002100

Join usingOrAnd

Join usingOrAnd

SelectAll/None
    • Show less

    • Show less

    • Show less

    • Show less

    • Show less

  • Show more

SelectAll/None

Join usingOrAnd

-

More filters

Projects

4 329 projects (0,129s)

Project

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

defined through some graph parameters. In particular, we would like to focus on classes with bounded price of connectivity for some graph parameter, that is, a ratio between a graph parameter and...

Pure mathematics

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

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

the internal structure of tractable instances of such generally hard problems on graphs, namely those dealing with structural and topological graph theory, geometric graphs algorithmic and complexity theoretical aspects 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
Project

European RailWay Infrastructure Network (OE08010)

Integration of National Railway Infrastructure Databases with Track Parameters from Network Statements, Developing Tools for Data and Graphic Processing of the European Railway Infrastructure with Functions over the Joint Rail Network Gr...

IN - Informatika

  • 2008 - 2011
  • 17 100 tis. Kč
  • 8 550 tis. Kč
  • MŠMT
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

Graph limits and inhomogeneous random graphs (GJ18-01472Y)

Theories of dense and sparse graph limits are one of the most important recent breakthroughs on old problems in extremal graph theory and random graph theory graph limits as well as the related theory of inhomogene...

Pure mathematics

  • 2018 - 2021
  • 8 941 tis. Kč
  • 8 941 tis. Kč
  • GA ČR
Project

Structural properties of graphs and graph classes (ME 418)

conditionsfor NP-hard properties and parameters of graphs. Results of this type oftenThe research will be focused on studying structural properties of graphs from some important algorithmically efficiently recognizable cla...

BA - Obecná matematika

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

Graphs and mappings -- Algebraic properties of graphs (GA16-19910S)

Main two topics of the project are vector coloring and flows in graphs number, the goal of the project is to understand other aspects of this parameter space of graphs--a linear-algebraic object that encodes many properties...

IN - Informatika

  • 2016 - 2018
  • 3 222 tis. Kč
  • 2 604 tis. Kč
  • GA ČR
Project

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

solutions of some instances - as determined by the parameter, of problems which and topological graph theory, and to logic and interpretations in graphs. Among the problems graph classes, FO interpretations in spa...

IN - Informatika

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

Colourings and connection in graphs (7AMB16DE001)

and interrelated problems in the field of graph theory: - computation of some chromatic parameters of a given graph, namely, the proper connection number, the rainbow connection to the channel assignment problem in mobile ...

BA - Obecná matematika

  • 2016 - 2017
  • 143 tis. Kč
  • 143 tis. Kč
  • MŠMT
Project

Algorithms and Complexity within and beyond Bounded Expansion (LL2005)

The project is in the area of the structural graph theory, with focus on the applications in the design of approximation and parameterized algorithms and on obtaining the corresponding complexity lower bounds. The goal is to develop the deta...

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

  • 2020 - 2022
  • 7 167 tis. Kč
  • 7 167 tis. Kč
  • MŠMT
  • 1 - 10 out of 4 329