Sciweavers

117 search results - page 24 / 24
» Do You See What I Mean
Sort
View
EJC
2007
13 years 4 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ICSR
2009
Springer
13 years 2 months ago
Reusing Patterns through Design Refinement
Abstract. Refinement concepts, such as procedural and data refinement, are among the most important ideas of software engineering. In this paper, we investigate the idea of design ...
Jason O. Hallstrom, Neelam Soundarajan