The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicholas C. Wormald: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicholas C. Wormald
    Analysis of Algorithms on the Cores of Random Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:2- [Conf]
  2. William Duckworth, Nicholas C. Wormald, Michele Zito
    Maximum Induced Matchings of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:34-43 [Conf]
  3. Warren D. Smith, Nicholas C. Wormald
    Geometric Separator Theorems & Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:232-243 [Conf]
  4. Alistair Moffat, Ola Petersson, Nicholas C. Wormald
    Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:499-508 [Conf]
  5. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Computation of the Bisection Width for Random d-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:49-58 [Conf]
  6. Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
    Bisection of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:114-125 [Conf]
  7. Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald
    Connectivity for Wireless Agents Moving on a Cycle or Grid. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:353-364 [Conf]
  8. George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
    Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:153-165 [Conf]
  9. Peter Eades, Xuemin Lin, Nicholas C. Wormald
    Performance Guarantees for Motion Planning with Temporal Uncertainty. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1993, v:25, n:1, pp:21-28 [Journal]
  10. Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald
    Optimal Worst Case Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:4, pp:475-489 [Journal]
  11. Alistair Moffat, Ola Petersson, Nicholas C. Wormald
    A Tree-Based Mergesort. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:9, pp:775-793 [Journal]
  12. Peter Eades, Nicholas C. Wormald
    Edge Crossings in Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:4, pp:379-403 [Journal]
  13. Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
    A Family of Perfect Hashing Methods. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:6, pp:547-554 [Journal]
  14. Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald
    The asymptotic number of acyclic diagraphs I. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:15-22 [Journal]
  15. D. de Caen, Paul Erdös, N. J. Pullmann, Nicholas C. Wormald
    Extremal clique coverings of complementary graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:4, pp:309-314 [Journal]
  16. Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald
    Infinite highly arc transitive digraphs and universal covering digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:377-396 [Journal]
  17. Alan M. Frieze, Nicholas C. Wormald
    Random k-Sat: A Tight Threshold For Moderately Growing k. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:3, pp:297-305 [Journal]
  18. Zhicheng Gao, Nicholas C. Wormald
    Sharp Concentration of the Number of Submaps in Random Planar Triangulations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:3, pp:467-486 [Journal]
  19. Brendan D. McKay, Nicholas C. Wormald
    Automorphisms of random graphs with specified vertices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:325-338 [Journal]
  20. Brendan D. McKay, Nicholas C. Wormald
    Asymptotic enumeration by degree sequence of graphs with degress o(n1/2). [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:4, pp:369-382 [Journal]
  21. Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
    The Number of Labeled 2-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  22. Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka
    Short Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  23. Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, G. Szekeres, Nicholas C. Wormald
    The Asymptotic Number of Set Partitions with Unequal Block Sizes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  24. Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
    Permutation Pseudographs And Contiguity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal]
  25. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Connectedness Of The Degree Bounded Star Process. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  26. Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
    Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
  27. Hanna D. Robalewska, Nicholas C. Wormald
    Random Star Processes. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:1, pp:- [Journal]
  28. Andrzej Rucinski, Nicholas C. Wormald
    Random Graph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:169-180 [Journal]
  29. Angelika Steger, Nicholas C. Wormald
    Generating Random Regular Graphs Quickly. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
  30. Meei Pyng Ng, Nicholas C. Wormald
    Reconstruction of Rooted Trees From Subtrees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:19-31 [Journal]
  31. Meei Pyng Ng, Mike A. Steel, Nicholas C. Wormald
    The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:98, n:3, pp:227-235 [Journal]
  32. Nicholas C. Wormald
    Analysis of greedy algorithms on graphs with bounded degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:235-260 [Journal]
  33. Hilda Assiyatun, Nicholas C. Wormald
    3-star factors in random d-regular graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1249-1262 [Journal]
  34. Noga Alon, Vanessa Teague, Nicholas C. Wormald
    Linear Arboricity and Linear k-Arboricity of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:1, pp:11-16 [Journal]
  35. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Random Hypergraph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:319-332 [Journal]
  36. Robert Castelo, Nicholas C. Wormald
    Enumeration of P 4-Free Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:467-474 [Journal]
  37. Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
    Generating and Counting Hamilton Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:176-198 [Journal]
  38. Brendan D. McKay, Nicholas C. Wormald
    Uniform Generation of Random Regular Graphs of Moderate Degree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:52-67 [Journal]
  39. Nicholas C. Wormald
    Generating Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:2, pp:247-280 [Journal]
  40. Edward A. Bender, Nicholas C. Wormald
    The asymptotic number of rooted nonseparable maps on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:370-380 [Journal]
  41. Marcus Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for 2k×2k Square Lattices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:91-110 [Journal]
  42. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for Rectangular Arrays of Lattice Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:2, pp:181-208 [Journal]
  43. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Full Minimal Steiner Trees on Lattice Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:78, n:1, pp:51-91 [Journal]
  44. William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
    To Adrian Bondy and U. S. R. Murty. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:1- [Journal]
  45. Zhicheng Gao, Nicholas C. Wormald
    The Distribution of the Maximum Vertex Degree in Random Planar Maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:201-230 [Journal]
  46. Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
    Hamiltonian decompositions of random bipartite regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:195-222 [Journal]
  47. Bill Jackson, Nicholas C. Wormald
    Longest cycles in 3-connected planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:291-321 [Journal]
  48. Bill Jackson, Nicholas C. Wormald
    Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:163-169 [Journal]
  49. Jeong Han Kim, Nicholas C. Wormald
    Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:20-44 [Journal]
  50. Boris Pittel, Joel Spencer, Nicholas C. Wormald
    Sudden Emergence of a Giantk-Core in a Random Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:111-151 [Journal]
  51. Boris Pittel, Nicholas C. Wormald
    Asymptotic enumeration of sparse graphs with a minimum degree constraint. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:101, n:2, pp:249-263 [Journal]
  52. Boris Pittel, Nicholas C. Wormald
    Counting connected graphs inside-out. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:127-172 [Journal]
  53. L. Bruce Richmond, Nicholas C. Wormald
    Almost All Maps Are Asymmetric. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:1-7 [Journal]
  54. Dudley Stark, Nicholas C. Wormald
    Asymptotic Enumeration of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:196-217 [Journal]
  55. Ian M. Wanless, Nicholas C. Wormald
    Regular Graphs with No Homomorphisms onto Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:155-160 [Journal]
  56. William Duckworth, Nicholas C. Wormald, Michele Zito
    A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:67-76 [Journal]
  57. J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald
    A polynomial algorithm for a constrained traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:2, pp:68-75 [Journal]
  58. Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
    Avoidance of a giant component in half the edge set of a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:4, pp:432-449 [Journal]
  59. Sheng Bau, Nicholas C. Wormald, Sanming Zhou
    Decycling numbers of random regular graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:397-413 [Journal]
  60. Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald
    Largest 4-Connected Components of 3-Connected Planar Triangulations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:4, pp:273-286 [Journal]
  61. William Duckworth, Nicholas C. Wormald
    Minimum independent dominating sets of random cubic graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:2, pp:147-161 [Journal]
  62. Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald
    Enumeration of Almost-Convex Polygons on the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:4, pp:445-462 [Journal]
  63. Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
    Random regular graphs of high degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:4, pp:346-363 [Journal]
  64. Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
    On the probability of independent sets in random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:1, pp:1-14 [Journal]
  65. Brendan D. McKay, Nicholas C. Wormald
    The degree sequence of a random graph. I. The models. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:2, pp:97-117 [Journal]
  66. Robert W. Robinson, Nicholas C. Wormald
    Hamilton cycles containing randomly selected edges in random regular graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:2, pp:128-147 [Journal]
  67. Robert W. Robinson, Nicholas C. Wormald
    Almost All Cubic Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:117-126 [Journal]
  68. Robert W. Robinson, Nicholas C. Wormald
    Almost All Regular Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:2, pp:363-374 [Journal]
  69. Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald
    1-Factorizations of random regular graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:3, pp:305-321 [Journal]
  70. Nicholas C. Wormald
    The perturbation method and triangle-free random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:253-269 [Journal]
  71. Nicholas C. Wormald
    Generating Random Unlabelled Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:717-727 [Journal]
  72. M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
    On the Distribution of Lengths of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:38-47 [Journal]
  73. Zhicheng Gao, Nicholas C. Wormald
    The Size of the Largest Components in Random Planar Maps. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:217-228 [Journal]
  74. J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald
    Steiner Trees for Terminals Constrained to Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:1-17 [Journal]
  75. Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
    Bounds on the max and min bisection of random cubic and random 4-regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:531-547 [Journal]
  76. Jaroslav Nesetril, Nicholas C. Wormald
    The acyclic edge chromatic number of a random d-regular graph is d + 1. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:69-74 [Journal]
  77. Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
    The generalized acyclic edge chromatic number of random regular graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:101-125 [Journal]
  78. Julie Anne Cain, Peter Sanders, Nicholas C. Wormald
    The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:469-476 [Conf]
  79. Nicholas C. Wormald
    Counting unrooted planar maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:36, n:2, pp:205-225 [Journal]
  80. Edward A. Bender, Nicholas C. Wormald
    The number of loopless planar maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:235-237 [Journal]
  81. E. Rodney Canfield, Nicholas C. Wormald
    Ménage numbers, bijections and P-recursiveness. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:117-129 [Journal]
  82. László A. Székely, Nicholas C. Wormald
    Bounds on the measurable chromatic number of Rn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:343-372 [Journal]
  83. Terri Lindquester, Nicholas C. Wormald
    Factorisation of regular graphs into forests of short paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:217-226 [Journal]
  84. Bill Jackson, Nicholas C. Wormald
    On the linear k-arboricity of cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:293-297 [Journal]
  85. Joseph Lauer, Nicholas C. Wormald
    Large independent sets in regular graphs of large girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:999-1009 [Journal]
  86. Josep Díaz, Maria J. Serna, Nicholas C. Wormald
    Bounds on the bisection width for random d -regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:120-130 [Journal]

  87. Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. [Citation Graph (, )][DBLP]


  88. Load balancing and orientability thresholds for random hypergraphs. [Citation Graph (, )][DBLP]


  89. Constrained Path Optimisation for Underground Mine Layout. [Citation Graph (, )][DBLP]


  90. Representing Small Group Evolution. [Citation Graph (, )][DBLP]


  91. Birth control for giants. [Citation Graph (, )][DBLP]


  92. Encores on Cores. [Citation Graph (, )][DBLP]


  93. Colouring Random 4-Regular Graphs. [Citation Graph (, )][DBLP]


  94. Colouring Random Regular Graphs. [Citation Graph (, )][DBLP]


  95. On the Independent Domination Number of Random Regular Graphs. [Citation Graph (, )][DBLP]


  96. Induced Forests in Regular Graphs with Large Girth. [Citation Graph (, )][DBLP]


  97. Fixed edge-length graph drawing is NP-hard. [Citation Graph (, )][DBLP]


  98. Large forbidden trade volumes and edge packings of random graphs. [Citation Graph (, )][DBLP]


  99. Expansion properties of a random regular graph after random vertex deletions. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.005secs
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