No. Title Author Year
1 Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482) Dell, Holger et al. 2023
2 Front Matter, Table of Contents, Preface, Conference Organization Dell, Holger et al. 2022
3 LIPIcs, Volume 249, IPEC 2022, Complete Volume Dell, Holger et al. 2022
4 Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths Curticapean, Radu et al. 2021
5 Counting Answers to Existential Questions Dell, Holger et al. 2019
6 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
7 Lovász Meets Weisfeiler and Leman Dell, Holger et al. 2018
8 The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration Dell, Holger et al. 2018
9 Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes Curticapean, Radu et al. 2017
10 Finding Detours is Fixed-Parameter Tractable Bezáková, Ivona et al. 2017
11 Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP Brand, Cornelius et al. 2017
12 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
13 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
14 Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses Dell, Holger et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 14

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI