7 citations · 10 across the 3 of their papers we have counts for
4 papers
Dominating Sets and Connected Dominating Sets in Dynamic Graphs
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis +1
In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present…
Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
We consider the classic Facility Location, -Median, and -Means problems in metric spaces of doubling dimension . We give nearly linear-time approximation schemes for each…
Generating Functionally Equivalent Programs Having Non-Isomorphic Control-Flow Graphs
Rémi Géraud, Mirko Koscina, Paul Lenczner +2
One of the big challenges in program obfuscation consists in modifying not only the program's straight-line code (SLC) but also the program's control flow graph (CFG). Indeed, if o…
Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Graphs with Bounded Highway Dimension
Amariah Becker, Philip N. Klein, David Saulpic
The concept of bounded highway dimension was developed to capture observed properties of the metrics of road networks. We show that a graph with bounded highway dimension, for any…