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 254 (0,099s) •

Result

Tree-depth and Vertex-minors

IN - Informatika

  • 2016
    • •
  • Jx
    • •
  • Link
Result

A note on Fiedler value of classes with sublinear separators

BA - Obecná matematika

  • 2013
    • •
  • Jx
    • •
  • Link
Result

Modulo-counting first-order logic on bounded expansion classes

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

  • 2024
    • •
  • Jimp
    • •
  • Link
Result

On magicness and antimagicness of the union of 4-regular circulant graphs

BA - Obecná matematika

  • 2011
    • •
  • Jx
Result

Efficient connectivity testing of hypercubic networks with faults

IN - Informatika

  • 2011
    • •
  • Jx
    • •
  • Link
Result

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

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

  • 2018
    • •
  • Jimp
    • •
  • Link
Result

Finding secluded places of special interest in graphs

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

  • 2017
    • •
  • D
    • •
  • Link
Result

Schottky vertex operator cluster algebras

Pure mathematics

  • 2022
    • •
  • Jimp
    • •
  • Link
Result

Testing connectivity of faulty networks in sublinear time

IN - Informatika

  • 2012
    • •
  • Jx
    • •
  • Link
Result

Vertex-antimagic labelings of Regular Graphs

BA - Obecná matematika

  • 2012
    • •
  • Jx
    • •
  • Link
  • 1 - 10 out of 1 254