No. Title Author Year
1 Efficient Algorithms for Counting Gapped Palindromes Popa, Andrei et al. 2021
2 Complexity of Computing the Anti-Ramsey Numbers for Paths Akhoondian Amiri, Saeed et al. 2020
3 The b-Matching Problem in Distance-Hereditary Graphs and Beyond Ducoffe, Guillaume et al. 2018
4 The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes Ducoffe, Guillaume et al. 2018
5 Making "Fast" Atomic Operations Computationally Tractable Fernández Anta, Antonio et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 5

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