The SCEAS System
| |||||||

## Search the dblp DataBase
Hung Q. Ngo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ramkumar Chinchani, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya
**Towards a Theory of Insider Threat Assessment.**[Citation Graph (0, 0)][DBLP] DSN, 2005, pp:108-117 [Conf] - Hung Q. Ngo, Anjum Shehzad, Saad Liaquat Kiani, Maria Riaz, Sungyoung Lee
**Developing Context-Aware Ubiquitous Computing Systems with a Unified Middleware Framework.**[Citation Graph (0, 0)][DBLP] EUC, 2004, pp:672-681 [Conf] - Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivastava
**An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming.**[Citation Graph (0, 0)][DBLP] ICDCS, 2000, pp:475-483 [Conf] - Hung Q. Ngo, Srivatsan Varadarajan, Jaideep Srivastava
**Error Spreading: Reducing Bursty Errors in Continuous Media Streaming.**[Citation Graph (0, 0)][DBLP] ICMCS, Vol. 1, 1999, pp:314-319 [Conf] - Hung Q. Ngo, Dazhen Pan, Chunming Qiao
**Nonblocking WDM Switches Based on Arrayed Waveguide Grating and Limited Wavelength Conversion.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2004, pp:- [Conf] - Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
**Optical switching networks with minimum number of limited range wavelength converters.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2005, pp:1128-1138 [Conf] - Hung Q. Ngo, Van H. Vu
**Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:834-840 [Conf] - Peng Lin, Hung Ngo, Chunming Qiao, Xin Wang, Ting Wang, DaYou Qian
**Minimum Cost Wireless Broadband Overlay Network Planning.**[Citation Graph (0, 0)][DBLP] WOWMOM, 2006, pp:228-236 [Conf] - Hung Q. Ngo, Ding-Zhu Du
**New constructions of non-adaptive and error-tolerance pooling designs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:161-170 [Journal] - Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
**New bounds on a hypercube coloring problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:5, pp:265-269 [Journal] - Ramkumar Chinchani, Duc Ha, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya
**On the Hardness of Approximating the Min-Hack Problem.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:9, n:3, pp:295-311 [Journal] - Lu Ruan, Shitou Han, Deying Li, Hung Q. Ngo, Scott C.-H. Huang
**Transmission fault-tolerance of iterated line digraphs.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2004, v:5, n:4, pp:475-487 [Journal] - Hung Q. Ngo, Van H. Vu
**Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:4, pp:1040-1049 [Journal] - Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo
**Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2002, v:15, n:3, pp:305-316 [Journal] - Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu
**Super link-connectivity of iterated line digraphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:304, pp:461-469 [Journal] - Hung Q. Ngo
**A new routing algorithm for multirate rearrangeable Clos networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:290, n:3, pp:2157-2167 [Journal] - Hung Q. Ngo, Dazhen Pan, Chunming Qiao
**Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:205-217 [Journal] - Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivastava
**Error spreading: a perception-driven approach to handling error in continuous media streaming.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2002, v:10, n:1, pp:139-152 [Journal] - Joy Ghosh, Hung Q. Ngo, Seokhoon Yoon, Chunming Qiao
**On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2007, pp:1721-1729 [Conf] - Joy Ghosh, Hung Q. Ngo, Chunming Qiao
**Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN).**[Citation Graph (0, 0)][DBLP] IWCMC, 2006, pp:551-556 [Conf] - Sumesh J. Philip, Joy Ghosh, Hung Q. Ngo, Chunming Qiao
**Routing on Overlay Graphs in Mobile Ad Hoc Networks.**[Citation Graph (0, 0)][DBLP] GLOBECOM, 2006, pp:- [Conf] - Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
**Optical switching networks with minimum number of limited-range wavelength converters.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2007, v:15, n:4, pp:969-979 [Journal] **A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints.**[Citation Graph (, )][DBLP]**On the effectiveness of structural detection and defense against P2P-based botnets.**[Citation Graph (, )][DBLP]**Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints.**[Citation Graph (, )][DBLP]**Insider Threat Analysis Using Information-Centric Modeling.**[Citation Graph (, )][DBLP]**Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem.**[Citation Graph (, )][DBLP]**Analyzing Nonblocking Switching Networks using Linear Programming (Duality).**[Citation Graph (, )][DBLP]**A Data-Centric Approach to Insider Attack Detection in Database Systems.**[Citation Graph (, )][DBLP]**Efficiently Decodable Non-adaptive Group Testing.**[Citation Graph (, )][DBLP]**Strictly Nonblocking f-Cast Photonic Switching Networks under General Crosstalk Constraints.**[Citation Graph (, )][DBLP]**CRESTBOT: A New Family of Resilient Botnets.**[Citation Graph (, )][DBLP]**Crosstalk-Free Widesense Nonblocking Multicast Photonic Switching Networks.**[Citation Graph (, )][DBLP]
Search in 0.043secs, Finished in 0.046secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |