No. Title Author Year
1 Parameterized Complexity of Equality MinCSP Osipov, George et al. 2023
2 On the Parameterized Complexity of Symmetric Directed Multicut Eiben, Eduard et al. 2022
3 Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs He, Zhiyang et al. 2021
4 Component Order Connectivity in Directed Graphs Bang-Jensen, Jørgen et al. 2020
5 Many Visits TSP Revisited Kowalik, Łukasz et al. 2020
6 On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems Wahlström, Magnus 2020
7 Parameterized Pre-Coloring Extension and List Coloring Problems Gutin, Gregory et al. 2020
8 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
9 Parameterized Algorithms for Zero Extension and Metric Labelling Problems Reidl, Felix et al. 2018
10 k-Distinct In- and Out-Branchings in Digraphs Gutin, Gregory et al. 2017
11 Path-Contractions, Edge Deletions and Connectivity Preservation Gutin, Gregory et al. 2017
12 Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) Cygan, Marek et al. 2017
13 Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem Wahlström, Magnus 2013
14 Subexponential Parameterized Odd Cycle Transversal on Planar Graphs Lokshtanov, Daniel et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 14

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