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
[1]
Hilfe
Suche: Author="Lin, Min-Sheng"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting maximal independent sets in directed path graphs
Min-Sheng Lin
,
Sheng-Huang Su
Information Processing Letters
114
(10), 2014, pp. 568-572
Computing
K
-terminal reliability of
d
-trapezoid graphs
Min-Sheng Lin
,
Chao-Chun Ting
Information Processing Letters
113
(19-21), 2013, pp. 734-738
Counting the number of vertex covers in a trapezoid graph
Min-Sheng Lin
,
Yung-Jui Chen
Information Processing Letters
109
(21-22), 2009, pp. 1187-1192
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
Min-Sheng Lin
,
Yung-Jui Chen
Information Processing Letters
107
(6), 2008, pp. 257-264
Fast and simple algorithms to count the number of vertex covers in an interval graph
Min-Sheng Lin
Information Processing Letters
102
(4), 2007, pp. 143-146
The computational complexity of the reliability problem on distributed systems
Min-Sheng Lin
,
Deng-Jyi Chen
Information Processing Letters
64
(3), 1997, pp. 143-147