7 citations · 11 across the 6 of their papers we have counts for
6 papers
Confluence: A Robust Non-IoU Alternative to Non-Maxima Suppression in Object Detection
Andrew Shepley, Greg Falzon, Paul Kwan
Confluence is a novel non-Intersection over Union (IoU) alternative to Non-Maxima Suppression (NMS) in bounding box post-processing in object detection. It overcomes the inherent l…
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
Yi Fan, Chengqian Li, Zongjie Ma +3
The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem. Recently there has been great interest in solving this problem on real-world massive graphs. For such grap…
Algorithmic Aspects of Upper Domination
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel +6
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a…
Linear-Time Superbubble Identification Algorithm for Genome Assembly
Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu +3
DNA sequencing is the process of determining the exact order of the nucleotide bases of an individual's genome in order to catalogue sequence variation and understand its biologica…
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
Mousa Alfalayleh, Ljiljana Brankovic
It is well recognised that data mining and statistical analysis pose a serious treat to privacy. This is true for financial, medical, criminal and marketing research. Numerous tech…
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
Ljiljana Brankovic, Henning Fernau, Joachim Kneis +1
The lower and the upper irredundance numbers of a graph , denoted and respectively, are conceptually linked to domination and independence numbers and have numer…