
BibTeX records: K. M. Chung
@inproceedings{DBLP:conf/icita/JeongKCKYLS05, author = {Kyungsoo Jeong and S. H. Kim and K. M. Chung and J. C. Kim and J. H. Yu and J. S. Lee and S. H. Seo}, title = {Multipath Channel Models for Wireless Local and Metropolitan Area Networks}, booktitle = {Third International Conference on Information Technology and Applications {(ICITA} 2005), 4-7 July 2005, Sydney, Australia}, pages = {295--298}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/ICITA.2005.187}, doi = {10.1109/ICITA.2005.187}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/icita/JeongKCKYLS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/ChungW80, author = {K. M. Chung and C. K. Wong}, title = {Construction of a Generalized Connector with 5.8 \emph{n} log\({}_{\mbox{2}}\) \emph{n} Edges}, journal = {{IEEE} Trans. Computers}, volume = {29}, number = {11}, pages = {1029--1032}, year = {1980}, url = {https://doi.org/10.1109/TC.1980.1675501}, doi = {10.1109/TC.1980.1675501}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tc/ChungW80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChungL78, author = {K. M. Chung and C. L. Liu}, title = {A generalization of Ramsey theory for graphs}, journal = {Discret. Math.}, volume = {21}, number = {2}, pages = {117--127}, year = {1978}, url = {https://doi.org/10.1016/0012-365X(78)90084-5}, doi = {10.1016/0012-365X(78)90084-5}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChungL78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.