The Complexity of Irredundant Sets Parameterized by Size

Discrete Applied Mathematics- Netherlands

doi 10.1016/s0166-218x(99)00185-7

Full Text

Abstract

Available in

Date

Authors

Publisher

Elsevier BV

Related search

On Irredundant Sets of Postulates

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1925English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

The Parameterized Complexity of the Shared Center Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors

Computer Journal
Computer Science
2007English

Approximation and Parameterized Complexity of Minimax Approval Voting

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy