No. Title Author Year
1 Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk) Husfeldt, Thore 2020
2 Multivariate Analysis of Orthogonal Range Searching and Graph Distances Bringmann, Karl et al. 2019
3 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
4 Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm Björklund, Andreas et al. 2018
5 Computing Graph Distances Parameterized by Treewidth and Diameter Husfeldt, Thore 2017
6 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
7 Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors Husfeldt, Thore et al. 2015
8 LIPIcs, Volume 43, IPEC'15, Complete Volume Husfeldt, Thore et al. 2015
9 Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331) Husfeldt, Thore et al. 2013
10 10441 Abstracts Collection -- Exact Complexity of NP-hard Problems Husfeldt, Thore et al. 2011
11 Trimmed Moebius Inversion and Graphs of Bounded Degree Björklund, Andreas et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 11

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