19 citations · 39 across the 12 of their papers we have counts for
13 papers
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
Maintenance of Structural Hole Spanners in Dynamic Networks
Diksha Goel, Hong Shen, Hui Tian +1
Structural Hole (SH) spanners are the set of users who bridge different groups of users and are vital in numerous applications. Despite their importance, existing work for identify…
Evolutionary Multi-Objective Diversity Optimization
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Creating diverse sets of high quality solutions has become an important problem in recent years. Previous works on diverse solutions problems consider solutions' objective quality…
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Finding diverse solutions to optimization problems has been of practical interest for several decades, and recently enjoyed increasing attention in research. While submodular optim…
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems
Diksha Goel, Aneta Neumann, Frank Neumann +2
We study a Stackelberg game between one attacker and one defender in a configurable environment. The defender picks a specific environment configuration. The attacker observes the…
Discovering Top-k Structural Hole Spanners in Dynamic Networks
Diksha Goel, Hong Shen, Hui Tian +1
Structural Hole (SH) theory states that the node which acts as a connecting link among otherwise disconnected communities gets positional advantages in the network. These nodes are…
Limited Query Graph Connectivity Test
Mingyu Guo, Jialiang Li, Aneta Neumann +2
We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are…
Effective Graph-Neural-Network based Models for Discovering Structural Hole Spanners in Large-Scale and Diverse Networks
Diksha Goel, Hong Shen, Hui Tian +1
A Structural Hole Spanner (SHS) is a set of nodes in a network that act as a bridge among different otherwise disconnected communities. Numerous solutions have been proposed to dis…
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Max Ward, Aneta Neumann +2
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…
Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation
Diksha Goel, Max Ward, Aneta Neumann +3
Active Directory (AD) is the default security management system for Windows domain networks. We study a Stackelberg game model between one attacker and one defender on an AD attack…
Analysis of Evolutionary Diversity Optimisation for Permutation Problems
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Generating diverse populations of high quality solutions has gained interest as a promising extension to the traditional optimization tasks. This work contributes to this line of r…
Gini Index based Initial Coin Offering Mechanism
Mingyu Guo, Zhenghui Wang, Yuko Sakurai
As a fundraising method, Initial Coin Offering (ICO) has raised billions of dollars for thousands of startups in the past two years. Existing ICO mechanisms place more emphasis on…
Mechanism Design for Public Projects via Neural Networks
Guanhua Wang, Runqi Guo, Yuko Sakurai +2
We study mechanism design for nonexcludable and excludable binary public project problems. We aim to maximize the expected number of consumers and the expected social welfare. For…