Search for Author All Reviews
	Thilikos, Dimitrios M.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       An FPT 2-approximation for tree-cut decomposition Kim E., Oum S., Paul C., Sau I., Thilikos D. Algorithmica 80(1): 116-135, 2018.  Type: Article Fixed-parameter tractable (FPT) computational-complexity classification seeks to measure complexity as functions of problems’ parameters. The algorithm presented in this 20-page advanced paper concerns the FPT approach to &am...... May 7 2018     Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs Demaine E., Fomin F., Hajiaghayi M., Thilikos D. Journal of the ACM 52(6): 866-893, 2005.  Type: Article Over the last few years, the theory of parameterized complexity has developed into a useful framework for a refined analysis of hard algorithmic problems. Several researchers have obtained exponential speedups in fixed-parameter algori...... Jun 1 2006
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy