Result 1 to 20 of 122 total
Fixed-parameter tractability, a prehistory. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 3-16 (2012).
1
Charge and reduce: A fixed-parameter algorithm for string-to-string correction. (English)
Discrete Optim. 8, No. 1, 41-49 (2011).
2
Effects of edge lifting on domination in graphs. (English)
Bull. Inst. Comb. Appl. 63, 77-86 (2011).
3
A free-space adaptive FMM-based PDE solver in three dimensions. (English)
Commun. Appl. Math. Comput. Sci. 6, No. 1, 79-122 (2011).
4
Quadratic kernelization for convex recoloring of trees. (English)
Algorithmica 61, No. 2, 362-388 (2011).
5
A systematic comparison of genome scale clustering algorithms. (Extended abstract). (English)
Chen, Jianer (ed.) et al., Bioinformatics research and applications. 7th international symposium, ISBRA 2011, Changsha, China, May 27‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21259-8/pbk). Lecture Notes in Computer Science 6674. Lecture Notes in Bioinformatics, 416-427 (2011).
6
The maximum clique enumeration problem: Algorithms, applications and implementations. (English)
Chen, Jianer (ed.) et al., Bioinformatics research and applications. 7th international symposium, ISBRA 2011, Changsha, China, May 27‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21259-8/pbk). Lecture Notes in Computer Science 6674. Lecture Notes in Bioinformatics, 306-319 (2011).
7
A complete resolution of the keller maximum clique problem (English)
SODA, 129-135 (2011).
8
A systematic comparison of genome scale clustering algorithms - (Extended abstract) (English)
ISBRA, 416-427 (2011).
9
The maximum clique enumeration problem: algorithms, applications and implementations (English)
ISBRA, 306-319 (2011).
10
A hybrid graph representation for recursive backtracking algorithms. (English)
Lee, Der-Tsai (ed.) et al., Frontiers in algorithmics. 4th international workshop, FAW 2010, Wuhan, China, August 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14552-0/pbk). Lecture Notes in Computer Science 6213, 136-147 (2010).
11
A hybrid graph representation for recursive backtracking algorithms (English)
FAW, 136-147 (2010).
12
Threshold selection in gene co-expression networks using spectral graph theory techniques. (English)
BMC Bioinform. 10, No. S-11, 4 (2009).
13
Reconstructing generalized logical networks of transcriptional regulation in mouse brain from temporal gene expression data. (English)
EURASIP J. Bioinform. Syst. Biol. 2009, Article ID 545176, 13 p. (2009).
14
Reconstructing generalized logical networks of transcriptional regulation in mouse brain from temporal gene expression data (English)
EURASIP J. Bioinformatics and Systems Biology 2009 (2009).
15
Innovative computational methods for transcriptomic data analysis: A case study in the use of FPT for practical algorithm design and implementation. (English)
Comput. J. 51, No. 1, 26-38 (2008).
16
A bounded search tree algorithm for parameterized face cover. (English)
J. Discrete Algorithms 6, No. 4, 541-552 (2008).
17
The computer journal special issue on parameterized complexity: foreword by the guest editors (English)
Comput. J. 51, No. 1, 1-6 (2008).
18
Innovative computational methods for transcriptomic data analysis: A case study in the use of FPT for practical algorithm design and implementation (English)
Comput. J. 51, No. 1, 26-38 (2008).
19
Linear-time algorithms for problems on planar graphs with fixed disk dimension. (English)
Inf. Process. Lett. 101, No. 1, 36-40 (2007).
20
Result 1 to 20 of 122 total
Start
Contact
Print
General Help
