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

99 097 (0,174s) •

Result

Parameterized Complexity of Fair Deletion Problems

. In fair deletion problems we change the objective: we minimize the maximum number of fair deletion problems with respect to the structural parameters of the tree-width, we show that there is no ...

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

  • 2017
    • •
  • D
    • •
  • Link
Result

Parameterized complexity of fair deletion problems

to minimize the number of elements removed. In fair deletion problems, the objective is minimized. We study the parameterized complexity of fair deletion problems concerning for the fair...

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

  • 2020
    • •
  • Jimp
    • •
  • Link
Result

Parameterized Complexity of Fair Vertex Evaluation Problems

algorithm for the {MSO} Fair Vertex Evaluation problem for formulas with one free with twin cover one. Furthermore, we study the Fair Vertex Cover (Fair VC) problem. FairA prototypical graph ...

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

  • 2019
    • •
  • D
    • •
  • Link
Result

An algorithmic metatheorem for directed treewidth

research, the list of hard combinatorial problems that are known to be solvable an algorithmic metatheorem connecting the monadic second order logic of graphs to directed of constant directed treewidth can be reformulated in terms ...

BA - Obecná matematika

  • 2016
    • •
  • Jx
    • •
  • Link
Result

Approximation Metatheorems for Classes with Bounded Expansion

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than previously known. We obtain a constant-factor approximation algorith...

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

  • 2022
    • •
  • D
    • •
  • Link
Result

Concept of Fairness in the Fair Division Problem

and problems that can occur. The article covers description of the division problem, definitions of fair division, Pareto optimality, and envy freeness for economic and mathematical model of fair division. It cove...

AD - Politologie a politické vědy

  • 2009
    • •
  • Jx
Result

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

on graphs of bounded treewidth. Algorithmic metatheorems like Courcelle's serve and MSO-LCC) and optimizing the fair objective function (fairMSO). First, we show how Satisfaction Problems (CSP). This shows an alternat...

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

  • 2019
    • •
  • JSC
    • •
  • Link
Result

Efficiency of fairness in voting systems

The paper analyzes models of fair representation of voters in a committee representing different voters? groups. Together with fairness problem a problem of efficiency (ability of a voting body to change status quo...

AH - Ekonomie

  • 2008
    • •
  • Jx
Result

Fair play on the threshold of XXI. century

In this time the many papers are aimed to the problem of "fair play" and to the substance of it. The autor works on this problem from the perspectvive of contemporary "crisis of olympism" - he is interested by the wider, no...

AK - Sport a aktivity volného času

  • 2002
    • •
  • D
Result

Multivariate Algorithmics for Eliminating Envy by Donating Goods

the preferences of agents might change and envy might arise. We study the following problem of deleted resources and/or the caused utilitarian welfare loss of the allocation of this problem considering various natural and ...

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

  • 2022
    • •
  • D
    • •
  • Link
  • 1 - 10 out of 99 097