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
[2]
Hilfe
Suche: Author="Wang, Ying"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Plane graphs with maximum degree
\Delta\ge 8
are entirely
(\Delta+3)
-colorable
Yingqian Wang
,
Xianghua Mao
,
Zhengke Miao
Journal of Graph Theory
73
(3), 2013, pp. 305-317
Planar graphs with cycles of length neither 4 nor 6 are
(2,0,0)
-colorable
Yingqian Wang
,
Jinghan Xu
Information Processing Letters
113
(18), 2013, pp. 659-663
Improper choosability of planar graphs without 4-cycles
Yingqian Wang
,
Lingji Xu
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 2029-2037
Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs
Binlong Li
,
Zdenvek Ryjác̑ek
,
Ying Wang
,
Shenggui Zhang
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1088-1103
From Fibonacci numbers to central limit type theorems
Steven J. Miller
,
Yinghui Wang
Journal of Combinatorial Theory Series A
119
(7), 2012, pp. 1398-1413
RseqFlow: Workflows for RNA-Seq data analysis
Ying Wang
,
Gaurang Mehta
,
Rajiv Mayani
,
Jingxi Lu
,
Tade Souaiaia
,
Yangho Chen
,
Andrew Clark
,
Hee Jae Yoon
,
Lin Wan
,
Oleg V. Evgrafov
,
James A. Knowles
,
Ewa Deelman
,
Ting Chen
Bioinformatics
27
(18), 2011, pp. 2598-2600
(\Delta+1)
-total-colorability of plane graphs of maximum degree
\Delta \ge 6
, with neither chordal 5-cycle nor chordal 6-cycle
Qian Wu
,
Qiuli Lu
,
Yingqian Wang
Information Processing Letters
111
(15), 2011, pp. 767-772
(\Delta+1)
-total-colorability of plane graphs with maximum degree
\Delta
at least 6 and without adjacent short cycles
Jingwen Zhang
,
Yingqian Wang
Information Processing Letters
110
(18-19), 2010, pp. 830-834
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Lan Shen
,
Yingqian Wang
Graphs and Combinatorics
25
(3), 2009, pp. 401-407
RNATOPS-W: A web server for RNA structure searches of genomes
Yingfeng Wang
,
Zhibin Huang
,
Yong Wu
,
Russell L. Malmberg
,
Liming Cai
Bioinformatics
25
(8), 2009, pp. 1080-1081
A relaxation of Havel's 3-color problem
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
,
Yingqian Wang
Information Processing Letters
107
(3-4), 2008, pp. 107-109
Choosing where to look next in a mutation sequence space: Active Learning of Informative p53 cancer rescue mutants
Samuel A. Danziger
,
Jue Zeng
,
Ying Wang
,
Rainer K. Brachmann
,
Richard H. Lathrop
Bioinformatics
23
(13), 2007, pp. 104-114
A sufficient condition for a planar graph to be 3-choosable
Liang Shen
,
Yingqian Wang
Information Processing Letters
104
(4), 2007, pp. 146-151
A note on 3-choosability of planar graphs
Yingqian Wang
,
Huajing Lu
,
Ming Chen
Information Processing Letters
105
(5), 2007, pp. 206-211
A simple protocol for deniable authentication based on EIGamal cryptography
Yingjie Wang
,
Jianhua Li
,
Ling Tie
Networks
45
(4), 2005, pp. 193-194
Simulating a coalescent process with recombination and ascertainment
Ying Wang
,
Bruce Rannala
LNCS/LNBI
2983
, 2004, pp. 84-95