All
All

What are you looking for?

All
Projects
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

-
19912025

Join usingOrAnd

Join usingOrAnd

SelectAll/None

    • Show more

SelectAll/None

    • Show more

        • Show more

        • Show more

        • Show more

        • Show more

      • Show more

SelectAll/None

    • Show more

More filters

Results

137 261 results (0,291s) •

Result

Fixed-parameter complexity of lambda-labelings

Computational complexity, graph labelings...

BA - Obecná matematika

  • 2001
    • •
  • Jx
Result

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)

We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique width...

IN - Informatika

  • 2016
    • •
  • D
    • •
  • Link
Result

Parameterized Complexity and Kernel Bounds for Hard Planning Problems

and at most $e$ postconditions is fixed-parameter tractable if $eleq 2$ and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; this problem has r...

BD - Teorie informace

  • 2013
    • •
  • D
    • •
  • Link
Result

Sum-of-Products with Default Values: Algorithms and Complexity Results

that the problem is fixed-parameter tractable for the combined parameter incidence treewidth in a constraint), generalizing a known result on the fixed-parameter tractability of #CSPD that the problem is ...

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

  • 2018
    • •
  • D
    • •
  • Link
Result

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed Parameter Tractable

isomorphism is fixed parameter tractable with leafage as parameter.The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is know...

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

  • 2022
    • •
  • D
    • •
  • Link
Result

Parameterized Problems Related to Seidel''s Switching

of computational complexity aspects of Seidel's switching, concentrating on Fixed Parameter Complexity. Among other results we show that switching to a graph with at mostk edges degree at least k are fixed

IN - Informatika

  • 2011
    • •
  • Jx
    • •
  • Link
Result

Parameterized Algorithms for Book Embedding Problems

are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed-Order Book Thickness is fixed-parameter tractable parameterized embedding both when the linear order of t...

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

  • 2019
    • •
  • D
    • •
  • Link
Result

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

their parameterized complexities with respect to the parameters "number of terminals", "an upper achieve several parameterized hardness as well as some fixed-parameter tractabilityWe initiate a systematic paramete...

IN - Informatika

  • 2009
    • •
  • D
Result

New Width Parameters for Model Counting

a complementary pair of literals. We show that #SAT is fixed-parameter tractable is fixed-parameter tractable.We study the parameterized complexity of the propositional model counting problem #SAT for CNF...

Computer and information sciences

  • 2017
    • •
  • D
    • •
  • Link
Result

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion

-exponential fixed-parameter tractable algorithm for vertex deletion to distance-hereditary fixed-parameter tractable algorithms for classical NP-hard problems.. Over the past years, the parameterized complexit...

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

  • 2018
    • •
  • Jimp
    • •
  • Link
  • 1 - 10 out of 137 261