Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Paper Parameterised complexity of model checking and satisfiability in propositional dependence logic 2020-10-26 Paper Parameterised complexity of abduction...
    10 bytes (16 words) - 09:03, 25 September 2023
  • challenges of unbounded treewidth in parameterised subgraph counting problems 2015-12-07 Paper The parameterised complexity of counting connected subgraphs...
    10 bytes (16 words) - 17:20, 6 October 2023
  • Paper Parameterised complexity of model checking and satisfiability in propositional dependence logic 2022-02-14 Paper Parameterized complexity of abduction...
    10 bytes (17 words) - 13:40, 7 October 2023
  • Publication Type Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework 2023-07-18 Paper Parameterized complexity of abduction in Schaefer’s...
    10 bytes (17 words) - 13:56, 24 September 2023
  • 2022-06-14 Paper Domination chain: characterisation, classical complexity, parameterised complexity and approximability 2020-05-18 Paper The many facets of upper...
    10 bytes (16 words) - 19:32, 11 December 2023
  • Paper Modularity of Erdős‐Rényi random graphs 2020-09-16 Paper The parameterised complexity of computing the maximum modularity of a graph 2020-08-12 Paper...
    10 bytes (16 words) - 09:17, 25 September 2023
  • 2020-05-26 Paper Domination chain: characterisation, classical complexity, parameterised complexity and approximability 2020-05-18 Paper Extension of Vertex...
    10 bytes (16 words) - 12:32, 7 October 2023
  • entries 2015-02-27 Paper The parameterised complexity of counting connected subgraphs and graph motifs 2015-02-20 Paper The complexity of approximating conservative...
    10 bytes (19 words) - 02:08, 10 December 2023
  • subgraphs faster than \(2^n\) 2016-10-21 Paper On the parameterised complexity of string morphism problems 2016-09-21 Paper Output-Polynomial Enumeration...
    10 bytes (16 words) - 01:26, 11 December 2023
  • 2020-07-20 Paper Domination chain: characterisation, classical complexity, parameterised complexity and approximability 2020-05-18 Paper An FPTAS for a general...
    10 bytes (17 words) - 04:45, 9 December 2023
  • Closure properties of pattern languages 2016-11-14 Paper On the parameterised complexity of string morphism problems 2016-09-21 Paper On the Solvability...
    10 bytes (18 words) - 14:14, 7 October 2023
  • characterisation, classical complexity, parameterised complexity and approximability 2020-05-18 Paper Descriptional complexity of matrix simple semi-conditional...
    10 bytes (17 words) - 03:32, 9 December 2023
  • independent set selection and greedy colouring 2017-04-04 Paper The parameterised complexity of list problems on graphs of bounded treewidth 2016-11-18 Paper...
    10 bytes (19 words) - 11:59, 9 December 2023
  • problems: standard and parameterized complexity 2020-01-30 Paper Correction to: ``Weighted upper edge cover: complexity and approximability 2019-10-15 Paper...
    10 bytes (16 words) - 21:08, 9 December 2023
  • Paper A Denotational Semantics for Parameterised Networks of Synchronised Automata 2017-04-04 Paper Analysis of complexity of primal-dual interior-point algorithms...
    10 bytes (17 words) - 16:45, 12 December 2023
  • computational complexity of weighted voting games 2010-03-15 Paper The Complexity of Weighted Boolean #CSP 2009-11-06 Paper The complexity of weighted Boolean...
    10 bytes (19 words) - 20:44, 9 December 2023
  • Paper On parameterized exponential time complexity 2009-07-10 Paper On Parameterized Exponential Time Complexity 2009-06-03 Paper On the pseudo-achromatic...
    10 bytes (17 words) - 18:06, 9 December 2023
  • Publication Date of Publication Type Parameterised counting in logspace 2023-10-06 Paper Descriptive complexity of \#P functions: a new perspective 2021-01-22...
    10 bytes (16 words) - 02:24, 7 October 2023
  • Publication Type https://portal.mardi4nfdi.de/entity/Q6075894 2023-09-20 Paper Parameterised temporal exploration problems 2023-04-21 Paper Non-strict Temporal Exploration...
    10 bytes (17 words) - 16:41, 6 December 2023
  • (with applications to verifying anonymous protocols) 2024-02-16 Paper Complexity analysis of tree share structure 2023-08-02 Paper Quadratic word equations...
    10 bytes (18 words) - 23:47, 10 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)