activity
20222026
most citedAlgorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances

8 citations · 18 across the 16 of their papers we have counts for

collaborators
Showing cs.SDShow all

1 paper · 1 filter

cs.SD2025

Longest Filled Common Subsequence for Song Identification from Degraded Audio via Construct--Merge--Solve--Adapt Optimization

Marko Djukanovic, Christian Blum, Aleksandar Kartelj +2

This paper addresses the Longest Filled Common Subsequence (LFCS) problem, a challenging NP-hard problem with applications in bioinformatics, including gene mutation prediction and…