3 papers
cs.DS2021
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
David Eppstein, Siddharth Gupta, Elham Havvaei
We investigate the parameterized complexity of finding subgraphs with hereditary properties on graphs belonging to a hereditary graph class. Given a graph , a non-trivial heredi…
cs.DS2020
Simplifying Activity-on-Edge Graphs
David Eppstein, Daniel Frishberg, Elham Havvaei
We formalize the simplification of activity-on-edge graphs used for visualizing project schedules, where the vertices of the graphs represent project milestones, and the edges repr…
cs.DS2018
Parameterized Leaf Power Recognition via Embedding into Graph Products
David Eppstein, Elham Havvaei
The -leaf power graph of a tree is a graph whose vertices are the leaves of and whose edges connect pairs of leaves at unweighted distance at most~ in . Recogn…