Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Daniel Mock

Daniel Mock

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1Complexity×1Discrete Math×1

Frequent co-authors

Che Cheng1×
Peter Rossmanith1×

Research Timeline

2026
On the Impact of Stability and the Helly Property on the Dominating Set Problem

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.CCcs.DMTheoreticalRecentJul 20, 2026

On the Impact of Stability and the Helly Property on the Dominating Set Problem

Che Cheng, Daniel Mock, Peter Rossmanith

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

View →