The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fan R. K. Chung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:329-338 [Conf]
  2. Fan R. K. Chung, Ronald L. Graham
    Combinatorial Problems Arising in Massive Data Sets (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:2- [Conf]
  3. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Tolerating Faults in Synchronization Networks. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:1-12 [Conf]
  4. Serge Belongie, Charless Fowlkes, Fan R. K. Chung, Jitendra Malik
    Spectral Partitioning with Indefinite Kernels Using the Nyström Extension. [Citation Graph (0, 0)][DBLP]
    ECCV (3), 2002, pp:531-542 [Conf]
  5. William Aiello, Fan R. K. Chung, Linyuan Lu
    Random Evolution in Massive Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:510-519 [Conf]
  6. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Optimal Simulations of Tree Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:274-282 [Conf]
  7. Reid Andersen, Fan R. K. Chung, Kevin J. Lang
    Local Graph Partitioning using PageRank Vectors. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:475-486 [Conf]
  8. Reid Andersen, Fan R. K. Chung, Lincoln Lu
    Drawing Power Law Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:12-17 [Conf]
  9. Reid Andersen, Fan R. K. Chung, Arunabha Sen, Guoliang Xue
    On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  10. William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
    Augmented Ring Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:1-16 [Conf]
  11. Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
    Guessing secrets. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:723-726 [Conf]
  12. Fan R. K. Chung, Ronald L. Graham, Linyuan Lu
    Guessing secrets with inner product questions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:247-253 [Conf]
  13. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:85-93 [Conf]
  14. Fan R. K. Chung, Ronald L. Graham, George Varghese
    Parallelism versus memory allocation in pipelined router forwarding engines. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:103-111 [Conf]
  15. Noga Alon, Fan R. K. Chung, Ronald L. Graham
    Routing permutations on graphs via matchings. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:583-591 [Conf]
  16. William Aiello, Fan R. K. Chung, Linyuan Lu
    A random graph model for massive graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:171-180 [Conf]
  17. Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg
    Optimal Simulations by Butterfly Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:192-204 [Conf]
  18. Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
    Self-Organizing Sequential Search and Hilbert's Inequalities [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:217-223 [Conf]
  19. Fan R. K. Chung, S.-T. Yau
    A near optimal algorithm for edge separators (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:1-8 [Conf]
  20. Fan R. K. Chung, S.-T. Yau
    Eigenvalues, Flows and Separators of Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:749- [Conf]
  21. Reid Andersen, Fan R. K. Chung, Lincoln Lu
    Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:19-30 [Conf]
  22. Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg
    Partitioning Circuits for Improved Testability. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:1, pp:37-48 [Journal]
  23. Dmitri V. Krioukov, Kimberly C. Claffy, Marina Fomenkov, Fan Chung, Alessandro Vespignani, Walter Willinger
    The workshop on internet topology (wit) report. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2007, v:37, n:1, pp:69-73 [Journal]
  24. Fan R. K. Chung, Paul Erdös
    On unavoidable graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:2, pp:167-176 [Journal]
  25. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
    Minimal decompositions of graphs into mutually isomorphic subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:13-24 [Journal]
  26. Fan R. K. Chung, Ronald L. Graham
    Sparse Quasi-Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:2, pp:217-244 [Journal]
  27. Fan R. K. Chung, Ronald L. Graham
    Edge-colored complete graphs with precisely colored subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:3, pp:315-324 [Journal]
  28. Fan R. K. Chung, Ronald L. Graham, Michael E. Saks
    A dynamic location problem for graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:2, pp:111-131 [Journal]
  29. Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson
    Quasi-random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:345-362 [Journal]
  30. Fan R. K. Chung, John L. Goldwasser
    Maximum subsets of (0, 1] with no solutions to x+y = kz. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  31. Fan R. K. Chung, Ronald L. Graham
    Random walks on generating sets for finite groups. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  32. Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
    Guessing Secrets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  33. Fan R. K. Chung, J. Hutchinson
    A Tribute to Herbert S.Wilf. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  34. Fan R. K. Chung, S.-T. Yau
    Coverings, Heat Kernels and Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  35. Fan R. K. Chung, Prasad Tetali
    Isoperimetric Inequalities for Cartesian Products of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:141-148 [Journal]
  36. Fan R. K. Chung, S.-T. Yau
    Eigenvalues of Graphs and Sobolev Inequalities. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:11-25 [Journal]
  37. Fan R. K. Chung
    Graphs with Small Diameter After Edge Deletion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:73-94 [Journal]
  38. Fan R. K. Chung
    Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:183-190 [Journal]
  39. Fan R. K. Chung, Ronald L. Graham
    Forced Convex n -Gons in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:367-371 [Journal]
  40. Fan R. K. Chung, Endre Szemerédi, William T. Trotter
    The Number of Different Distances Determined by a Set of Points in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:1-11 [Journal]
  41. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1068-1071 [Journal]
  42. Fan R. K. Chung, Robert B. Ellis
    A chip-firing game and Dirichlet eigenvalues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:341-355 [Journal]
  43. Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao
    Finding Favorites [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:078, pp:- [Journal]
  44. Fan R. K. Chung, Charles Delorme, Patrick Solé
    Multidiameters and Multiplicities. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:7, pp:629-640 [Journal]
  45. Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe
    Optimal Emulations by Butterfly-Like Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:2, pp:293-330 [Journal]
  46. Fan R. K. Chung, Linyuan Lu, T. Gregory Dewey, David J. Galas
    Duplication Models for Biological Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:5, pp:677-687 [Journal]
  47. Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross
    Distance Realization Problems with Applications to Internet Tomography. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:3, pp:432-448 [Journal]
  48. Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
    Self-organizing Sequential Search and Hilbert's Inequalities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:148-157 [Journal]
  49. Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham
    Quantitative Forms of a Theorem of Hilbert. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:210-216 [Journal]
  50. Fan R. K. Chung
    On Unimodal Subsequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:267-279 [Journal]
  51. Fan R. K. Chung
    Unavoidable Stars in 3-Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:3, pp:252-262 [Journal]
  52. Fan R. K. Chung
    The Number of Different Distances Determined by n Points in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:36, n:3, pp:342-354 [Journal]
  53. Fan R. K. Chung, Richard Cleve, Paul Dagum
    A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:150-155 [Journal]
  54. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
    Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:2, pp:241-251 [Journal]
  55. Fan R. K. Chung, Paul Erdös, Joel H. Spencer
    Extremal subgraphs for two graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:248-260 [Journal]
  56. Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour
    On induced subgraphs of the cube. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:180-187 [Journal]
  57. Fan R. K. Chung, Ronald L. Graham
    On the Cover Polynomial of a Digraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:2, pp:273-290 [Journal]
  58. Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer
    Some intersection theorems for ordered sets and graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:1, pp:23-37 [Journal]
  59. Fan R. K. Chung, Ronald L. Graham, V. E. Hoggatt Jr., M. Kleiman
    The Number of Baxter Permutations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:382-394 [Journal]
  60. Fan R. K. Chung, Ronald L. Graham, James B. Shearer
    Universal caterpillars. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:348-355 [Journal]
  61. Fan R. K. Chung, Robert P. Langlands
    A Combinatorial Laplacian with Vertex Weights. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:2, pp:316-327 [Journal]
  62. Fan R. K. Chung, Linyuan Lu
    An Upper Bound for the Turán Number t3(n,4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:2, pp:381-389 [Journal]
  63. Fan R. K. Chung, David Mumford
    Chordal Completions of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:96-106 [Journal]
  64. Fan R. K. Chung, S.-T. Yau
    Discrete Green's Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:191-214 [Journal]
  65. Fan R. K. Chung, Ronald L. Graham
    Quasi-Random Subsets of Integern. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:1, pp:64-86 [Journal]
  66. Fan R. K. Chung, Ronald L. Graham
    On graphs which contain all small trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:1, pp:14-23 [Journal]
  67. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:55-68 [Journal]
  68. Fan R. K. Chung, Arnold L. Rosenberg
    Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1986, v:19, n:1, pp:1-12 [Journal]
  69. Charless Fowlkes, Serge Belongie, Fan R. K. Chung, Jitendra Malik
    Spectral Grouping Using the Nyström Method. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:2, pp:214-225 [Journal]
  70. Fan R. K. Chung
    Quasi-Random Classes of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:4, pp:363-382 [Journal]
  71. Fan R. K. Chung
    Regularity Lemmas for Hypergraphs and Quasi-randomness. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:241-252 [Journal]
  72. Fan R. K. Chung, Joshua N. Cooper
    De Bruijn cycles for covering codes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:4, pp:421-431 [Journal]
  73. Fan R. K. Chung, Ronald L. Graham
    Quasi-Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:1, pp:105-124 [Journal]
  74. Fan R. K. Chung, Ronald L. Graham
    Stratified random walks on the n-cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:3, pp:199-222 [Journal]
  75. Fan R. K. Chung, Ronald L. Graham, S.-T. Yau
    On sampling with Markov chains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:55-77 [Journal]
  76. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Efficient Embeddings of Trees in Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:151-162 [Journal]
  77. Noga Alon, Fan R. K. Chung, Ronald L. Graham
    Routing Permutations on Graphs Via Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:513-530 [Journal]
  78. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Universal Graphs for Bounded-Degree Trees and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:2, pp:145-155 [Journal]
  79. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Salvage-Embeddings of Complete Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:617-637 [Journal]
  80. Béla Bollobás, Fan R. K. Chung
    The Diameter of a Cycle Plus a Random Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:328-333 [Journal]
  81. Fan R. K. Chung
    Pebbling in Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:467-472 [Journal]
  82. Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham
    On the Fractional Covering Number of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:45-49 [Journal]
  83. Fan R. K. Chung, V. Faber, Thomas A. Manteuffel
    An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:443-457 [Journal]
  84. Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman
    Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:474-483 [Journal]
  85. Fan R. K. Chung, Prasad Tetali
    Communication Complexity and Quasi Randomness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:1, pp:110-123 [Journal]
  86. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    An Optimal Strategies for Cycle-Stealing in Networks of Workstations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:5, pp:545-557 [Journal]
  87. Fan R. K. Chung, Ronald L. Graham
    Dynamic location problems with limited look-ahead . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:213-226 [Journal]
  88. Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon
    The forwarding index of communication networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:2, pp:224-232 [Journal]
  89. Fan R. K. Chung, Jawad A. Salehi, Victor K. Wet
    Optical orthogonal codes: Design, analysis, and applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:595-604 [Journal]
  90. Fan R. K. Chung, Jawad A. Salehi, Victor K.-W. Wei
    Correction to 'Optical orthogonal codes: Design, analysis, and applications' (May 89 595-604). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1429-0 [Journal]
  91. William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
    Augmented Ring Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:6, pp:598-609 [Journal]
  92. Reid Andersen, Fan Chung
    Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:1-12 [Conf]
  93. Reid Andersen, Fan Chung, Kevin J. Lang
    Local Partitioning for Directed Graphs Using PageRank. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:166-178 [Conf]
  94. Reid Andersen, Fan Chung, Linyuan Lu
    Drawing Power Law Graphs Using a Local/Global Decomposition. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:397- [Journal]
  95. Reid Andersen, Fan Chung, Linyuan Lu
    No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:379-397 [Journal]
  96. Fan Chung, Ronald Graham, Jia Mao, Andrew Yao
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:2, pp:147-157 [Journal]
  97. Dmitri V. Krioukov, Fan Chung, Kimberly C. Claffy, Marina Fomenkov, Alessandro Vespignani, Walter Willinger
    The Workshop on Internet Topology (WIT) Report [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  98. A. Robert Calderbank, Fan R. K. Chung, D. G. Sturtevant
    Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:15-28 [Journal]
  99. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:15-19 [Journal]
  100. Fan R. K. Chung, Paul D. Seymour
    Graphs with small bandwidth and cutwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:113-119 [Journal]
  101. Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter
    The maximum number of edges in 2K2-free graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:129-135 [Journal]
  102. Fan Chung, Persi Diaconis, Ronald Graham
    Universal cycles for combinatorial structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:43-59 [Journal]
  103. Fan R. K. Chung, Ronald L. Graham
    On hypergraphs having evenly distributed subhypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:125-129 [Journal]

  104. The Diameter and Laplacian Eigenvalues of Directed Graphs. [Citation Graph (, )][DBLP]


  105. Descent polynomials for permutations with bounded drop size. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002