The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1996, volume: 5, number:

  1. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
    Perfect Matchings in Random r-regular, s-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:1-14 [Journal]
  2. Keith Edwards
    The Harmonious Chromatic Number of Bounded Degree Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:15-28 [Journal]
  3. Zoltán Füredi
    An Upper Bound on Zarankiewicz' Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:29-33 [Journal]
  4. Mihály Hujter, Zsolt Tuza
    Precoloring Extension 3: Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:35-56 [Journal]
  5. János Komlós, Endre Szemerédi
    Topological cliques in graphs 2. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:79-90 [Journal]
  6. Tomaz Slivnik
    Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:91-94 [Journal]
  7. C. C. Chen, G. P. Jin
    Cycle Partitions in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:95-97 [Journal]
  8. Anant P. Godbole, Daphne E. Skipper, Rachel A. Sunley
    t-Covering Arrays: Upper Bounds and Poisson Approximations. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:105-117 [Journal]
  9. W. T. Gowers
    An Almost m-wise Independed Random Permutation of the Cube. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:119-130 [Journal]
  10. Valery A. Liskovets
    Some Asymptotical Estimates for Planar Eulerian Maps. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:131-138 [Journal]
  11. Claudia Neuhauser
    A Phase Transition for the Distribution of Matching Blocks. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:139-159 [Journal]
  12. Laurent Saloff-Coste, Wolfgang Woess
    Computing Norms of group-Invariant Transition Operators. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:161-178 [Journal]
  13. Carsten Thomassen
    K5-Subdivisions in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:179-189 [Journal]
  14. Martin Anthony, Peter L. Bartlett, Yuval Ishai, John Shawe-Taylor
    Valid Generalisation from Approximate Interpolation. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:191-214 [Journal]
  15. C. Cooper
    Asymptotic Enumeration of Predicate-Junction Flowgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:215-226 [Journal]
  16. Bradley S. Gubser
    A Characterization of Almost-Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:227-245 [Journal]
  17. C. Douglas Howard
    Orthogonality of Measures Induced by Random Walks with Scenery. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:247-256 [Journal]
  18. Wojciech Kordecki
    Small Submatroids in Random Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:257-266 [Journal]
  19. Aleksandar Pekec
    A Winning Strategy for the Ramsey Graph Game. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:267-276 [Journal]
  20. Bruce A. Reed
    Paths, Stars and the Number Three. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:277-295 [Journal]
  21. Rachid Saad
    Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:297-306 [Journal]
  22. Janusz Szuster, Pawel Wlaz, Jerzy Zurawiecki
    On Recognition of Shift Registers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:307-315 [Journal]
  23. Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev
    Predecessors in Random Mappings. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:317-335 [Journal]
  24. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Hypercubes with Random Link and Node Failures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:337-350 [Journal]
  25. Robert P. Dobrow, James Allen Fill
    Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:351-371 [Journal]
  26. Konrad Engel
    Interval Packing and Covering in the Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:373-384 [Journal]
  27. Roland Häggkvist
    Restricted Edge-colourings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:385-392 [Journal]
  28. Norbert Hegyváeri
    Subset sums in N2. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:393-402 [Journal]
  29. Ewa Kubicka
    An Efficient Method of Examining all Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:403-413 [Journal]
  30. John Shawe-Taylor
    Fast String Matching in Stationary Ergodic Sources. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:415-427 [Journal]
  31. Zdzislaw Skupien
    Smallest sets of Longest Paths with Empty Intersection. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:429-436 [Journal]
  32. Carsten Thomassen
    On the Number of Hamiltonian Cycles in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:437-442 [Journal]
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