Given a graph, the minimum dominating set (MinDS) problem is to identify...
The edge clique cover (ECC) problem – where the goal is to find a minimu...
We propose improved exact and heuristic algorithms for solving the maxim...
Computing maximum weight independent sets in graphs is an important NP-h...
Over the last two decades, significant advances have been made in the de...
Given a vertex-weighted graph, the maximum weight independent set proble...
Many applications rely on time-intensive matrix operations, such as
fact...
We present a practically efficient algorithm that finds all global minim...
In a confluence of combinatorics and geometry, simultaneous representati...
We present the winning solver of the PACE 2019 Implementation Challenge,...
We introduce a variant of the watchman route problem, which we call the
...
Kernelization is a general theoretical framework for preprocessing insta...
One powerful technique to solve NP-hard optimization problems in practic...
Edge-centric distributed computations have appeared as a recent techniqu...
We study the problem of convexifying drawings of planar graphs. Given an...
The maximal clique enumeration (MCE) problem has numerous applications i...
Analyzing massive complex networks yields promising insights about our
e...
Computing high quality node separators in large graphs is necessary for ...
The independent set problem is NP-hard and particularly difficult to sol...
We provide linear-time algorithms for geometric graphs with sublinearly ...