The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Topologically Faithful Fitting of Simple Closed Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
The Complexity of Proving the Discrete Jordan Curve Theorem
ACM Transactions on Computational Logic (TOCL)
Discrete Applied Mathematics
Hi-index | 0.00 |