Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Ding, Min"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding, minimizing, and counting weighted subgraphs
Virginia Vassilevska Williams
,
Ryan Williams
SIAM Journal on Computing
42
(3), 2013, pp. 831-854
On extensions of hyperplanes of dual polar spaces
Bart De Bruyn
Journal of Combinatorial Theory Series A
118
(3), 2011, pp. 949-961
Finding, minimizing, and counting weighted subgraphs
Virginia Vassilevska
,
Ryan Williams
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 455-463
Towards patterns tree of gene coexpression in eukaryotic species
Haiyun Wang
,
Qi Wang
,
Xia Li
,
Bairong Shen
,
Min Ding
,
Ziyin Shen
Bioinformatics
24
(11), 2008, pp. 1367-1373
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Francesc Rosselló
,
Gabriel Valiente
Theoretical Computer Science
362
(1-3), 2006, pp. 33-53
Tight approximability results for test set problems in bioinformatics
Piotr Berman
,
Bhaskar DasGupta
,
Ming-Yang Kao
Journal of Computer and System Sciences
71
(2), 2005, pp. 145-162
Clustering with qualitative information
Moses Charikar
,
Venkatesan Guruswami
,
Anthony Wirth
Journal of Computer and System Sciences
71
(3), 2005, pp. 360-383
iTPS: An improved location discovery scheme for sensor networks with long-range beacons
Andrew Thaeler
,
Min Ding
,
Xiuzhen Cheng
Journal Parallel Distributed Computing
65
(2), 2005, pp. 98-106