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

4 476 (0,153s) •

Project

Matroid theory problems underpinning discrete optimization (GA24-11098S)

The proposed project aims at exploring an undeveloped link between matroid theory and combinatorial optimization. We will use matroid tools to analyze matrices with particular circuit structure, improve existing matroid decomposition algorithms, and ...

Pure mathematics

  • 2024 - 2026
    • •
  • 8 265 tis. Kč
    • •
  • 7 390 tis. Kč
    • •
  • GA ČR
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
Project

New Frontiers in Computational Social Choice (GA22-19557S)

Fixed-parameter tractability and approximation algorithms are nowadays standard tools for design of algorithms for hard problems in the area of Computational Social Choice. Surprisingly, kernelization, a prominent technique...

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

  • 2022 - 2024
    • •
  • 5 819 tis. Kč
    • •
  • 5 819 tis. Kč
    • •
  • GA ČR
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 algorithmic and complexity theoretical aspects of new width and sparsity parameters of graph classes, properties of geometric representations o...

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

Parameterized Algorithms for Fundamental Network Problems Related to Connectivity (GP14-13017P)

Parameterized algorithmics became in the last two decades a standard tool in terms of a secondary measure (the parameter) additionally to the input size, which. Parameterized complexity provides a mathematical framework to ...

IN - Informatika

  • 2014 - 2016
    • •
  • 1 649 tis. Kč
    • •
  • 1 649 tis. Kč
    • •
  • GA ČR
Project

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

The concept of parameterized tractability allows for guaranteed efficient solutions of some instances - as determined by the parameter, of problems which characterizations, parameterized tractability of gr...

IN - Informatika

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

Structural properties and algorithmic complexity of discrete problems (GA201/05/0050)

of the structural methods in design of fixed parameter tractable...

BA - Obecná matematika

  • 2005 - 2007
    • •
  • 472 tis. Kč
    • •
  • 453 tis. Kč
    • •
  • GA ČR
Project

Structural graph theory and parameterized complexity (GC201/09/J021)

Many real-world algorithmic problems turn out to be intractable in their full generality. Theory of parameterized complexity, however, provides a useful framework graph theory has already proved very useful in parameterized algorith...

IN - Informatika

  • 2009 - 2010
    • •
  • 1 014 tis. Kč
    • •
  • 1 014 tis. Kč
    • •
  • GA ČR
Project

Empirical distributions and large sample theory in stochastic geometry (GP201/06/P075)

tessellations could be tractable models of this kind. Other large sample regimes, for example replicated independent observations in a fixed window, will be studied as well.......

BA - Obecná matematika

  • 2006 - 2008
    • •
  • 510 tis. Kč
    • •
  • 510 tis. Kč
    • •
  • GA ČR
Project

Model theory, structural combinatorics, and algorithms (GM24-12591M)

Our research will study the emerging connections between model theory and structural graph theory. Model theory provides a collection of concepts and tools for analyzing the complexity of infinite structures, and these are mirrored in the analysis o...

Pure mathematics

  • 2024 - 2028
    • •
  • 14 077 tis. Kč
    • •
  • 14 077 tis. Kč
    • •
  • GA ČR
  • 1 - 10 out of 4 476