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 361 (0,119s) •

Project

Efficient subgraph discovery for petabyte-scale web analysis (GA15-08916S)

observe an increasing demand for machine learning algorithms on graphs, since modeling interactions between entities by graphs is natural in context of large computer networks. A promising approach to modeling graphs that ...

IN - Informatika

  • 2015 - 2017
    • •
  • 4 386 tis. Kč
    • •
  • 4 386 tis. Kč
    • •
  • GA ČR
Project

Parameterized algorithms and kernelization in the context of discrete mathematics and logic (GA14-03501S)

to efficient algorithms on inputs characterized by such k. The project will search (graphs) and use the new findings to obtain more efficient parameterized algorithms) of problems, and search for usable geometric parameter...

IN - Informatika

  • 2014 - 2016
    • •
  • 4 458 tis. Kč
    • •
  • 4 458 tis. Kč
    • •
  • GA ČR
Project

A System for Text Analysis for the needs of the Police of the Czech Republic (VH20172017023)

to identified named entities. The search results will be visualized using an oriented interactive graphs of named entities. * Search for similar cases having the same nature functionality for the environment of the Police ...

IN - Informatika

  • 2017 - 2018
    • •
  • 1 010 tis. Kč
    • •
  • 1 010 tis. Kč
    • •
  • MV
Project

Utilization of structural and "Width" parameters in combinatorics and algorithmic complexity (GA201/08/0308)

Many practical algorithmic problems have a core based on combinatorial structures, such as graphs, digraphs, or matroids. Although it is typically infeasible to give general algorithmic solutions of (majority of) these problems, it is often ...

BA - Obecná matematika

  • 2008 - 2010
    • •
  • 946 tis. Kč
    • •
  • 946 tis. Kč
    • •
  • GA ČR
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 and to chromatic graph theory. In Hamiltonian graph theor...

Pure mathematics

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

Graph limits and beyond (GX21-21762X)

The theory of graph limits is one of the most important recently emerged tools of discrete mathematics. It has led to breakthrough solutions of many old problems in extremal graph theory, theory of random graphs and in part...

Pure mathematics

  • 2021 - 2025
    • •
  • 13 626 tis. Kč
    • •
  • 13 626 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

Graph Partitions and their Applications (MEB091037)

Many of the notions in graph theory, in particular, colorings, flows and matchings turn out to be partitions of a graph with particular properties of the methods originally developed for graph colorings are useful in the st...

BA - Obecná matematika

  • 2010 - 2011
    • •
  • 112 tis. Kč
    • •
  • 112 tis. Kč
    • •
  • MŠMT
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

Revealing structure of graphs and groups through polynomials (7AMB14FR068)

Study of graph isomorphism by means of graph polynomials. Study of reduction patterns of integral polynomials. Study of group large sieve. Study of 3-dimensional determinants.......

BA - Obecná matematika

  • 2014 - 2015
    • •
  • 108 tis. Kč
    • •
  • 108 tis. Kč
    • •
  • MŠMT
  • 1 - 10 out of 1 361