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

552 (0,098s) •

Project

Geometric Representations of Graphs (GC19-17314J)

The project is motivated by graph drawing, i.e. representing pairwise. In the area of planar graph we shall explore the maximum crossing number and its consequences in related algorithms. In the direction of graph ...

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

Algorithmic, structural and complexity aspects of geometric configurations (GA21-32817S)

and complexity questions on basic combinatorial and convex properties of graph drawings with various types of graph drawings in the plane, crossing numbers. Erdős-Szekeres theoremConfigurations of points, lines, c...

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

  • 2021 - 2024
    • •
  • 4 397 tis. Kč
    • •
  • 3 920 tis. Kč
    • •
  • GA ČR
Project

Graph Drawings and Representations (GEGIG/11/E023)

of graph drawing and geometric representations of graphs. By coordinating and unifying planarity issues (properties of planar graphs, constrained drawings of planar graphs number, and angular sch...

BA - Obecná matematika

  • 2011 - 2013
    • •
  • 11 595 tis. Kč
    • •
  • 11 595 tis. Kč
    • •
  • GA ČR
Project

Algorithmic, structural and complexity aspects of geometric and other configurations (GA18-19158S)

questions on basic combinatorial and convex properties of graph drawings in the plane and of other planar and related configurations. Areas of our interest include graph drawings, crossing numbers, Erdös-Szekeres ...

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

  • 2018 - 2021
    • •
  • 4 846 tis. Kč
    • •
  • 3 657 tis. Kč
    • •
  • GA ČR
Project

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

to combinatorial and graph-theoretic problems. We plan to pursue two main lines of research of topological and geometric methods in graph theory. Within the first line of research, we, the topological obstructions characterizing ce...

BA - Obecná matematika

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

Fundamental questions of discrete geometry (GX23-04949X)

The project is focused on selected fundamental questions of discrete and computational geometry. These fundamental questions include questions around the Erdős-Szekeres Happy Ending theorem, on crossing numbers of graphs, on visibility in Eu...

Pure mathematics

  • 2023 - 2027
    • •
  • 47 866 tis. Kč
    • •
  • 47 866 tis. Kč
    • •
  • GA ČR
Project

EMBEDS II – Mapping and embedding of simplicial complexes II (7AMB17FR029)

for the projective plane. SHORTEST-PATHS DRAWINGS We would like to decide the existence of the universal hyperbolic metric for shortest-path drawings of graphs on surfaces. KUHNEL'S defined, to enrich the theory of geome...

BA - Obecná matematika

  • 2017 - 2018
    • •
  • 108 tis. Kč
    • •
  • 108 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 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
  • 1 - 10 out of 552