The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1994, volume: 3, number:

  1. David K. Arrowsmith, John W. Essam
    Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:1-11 [Journal]
  2. József Beck
    Deterministic Graphs Games and a Probabilistic Intuition. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:13-26 [Journal]
  3. Sergei L. Bezrukov
    On Oriented Embedding of the Binary tree into the Hypercube. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:27-38 [Journal]
  4. Colin Cooper, Alan M. Frieze, Michael Molloy
    Hamilton Cycles in Random Regular Digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:39-49 [Journal]
  5. Reinhard Diestel, Imre Leader
    The Growth of Infinite Graphs: Boundedness and Finite Spreading. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:51-55 [Journal]
  6. Péter L. Erdös, Ákos Seress, László A. Székely
    On Intersecting Chains in Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:57-62 [Journal]
  7. Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman
    On the Maximum Number of Triangles in Wheel-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:63-75 [Journal]
  8. Mario Gionfriddo, Salvatore Milici, Zsolt Tuza
    Blocking Sets in SQS(2u). [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:77-86 [Journal]
  9. Roland Häggkvist, Anders Johansson
    (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:87-95 [Journal]
  10. Svante Janson
    The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:97-126 [Journal]
  11. Jaroslav Nesetril, Pavel Valtr
    A Ramsey-type Theorem in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:127-135 [Journal]
  12. D. J. A. Welsh
    Randomised Approximation in the Tutte Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:137-143 [Journal]
  13. Ron Aharoni, Reinhard Diestel
    Menger's Theorem for a Countable Source Set. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:145-156 [Journal]
  14. Martin Aigner, Regina Klimmek
    Matchings in Lattice Graphs and Hamming Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:157-165 [Journal]
  15. Andrew D. Barbour, Simon Tavaré
    A Rate for the Erdös-Turan Law. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:167-176 [Journal]
  16. Walter A. Deuber, Wolfgang Thumser
    A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:177-190 [Journal]
  17. Michel Deza, Viatcheslav P. Grishukhin
    Lattice Points of Cut Cones. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:191-214 [Journal]
  18. J. Keith Dugdale, Anthony J. W. Hilton
    Amalgemated Factorizations of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:215-231 [Journal]
  19. Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
    On Triangle Contact Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:233-246 [Journal]
  20. János Komlós, Endre Szemerédi
    Topological Cliques in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:247-256 [Journal]
  21. Wolfgang Mader
    On Vertex-Edge-Critically n-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:257-271 [Journal]
  22. J. D. Annan
    A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:273-283 [Journal]
  23. Yossi Azar
    Lower Bounds for Insertion Methods for TSP. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:285-292 [Journal]
  24. Paul Erdös, András Gyárfás, Tomasz Luczak
    Independet Transversals in Sparse Partite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:293-296 [Journal]
  25. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
    Turán-Ramsey Theorems and Kp-Independence Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:297-325 [Journal]
  26. Peter L. Hammer, Alexander K. Kelmans
    On Universal Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:327-344 [Journal]
  27. Abba M. Krieger, Paul R. Rosenbaum
    A Stochastic Comparisor for Arrangement Increasing Functions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:345-348 [Journal]
  28. Michael Krivelevich
    Ks-Free Graphs Without Large Kr-Free Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:349-354 [Journal]
  29. Manoel Lemos
    Non-Binary Madroids Having At Most Three Non-Binary Elements. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:355-369 [Journal]
  30. Allan D. Mills
    A Matroid Reconstruction Result. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:371-373 [Journal]
  31. Bojan Mohar
    Obstructions for the Disk and the Cylinder Embedding Extension Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:375-406 [Journal]
  32. Alon Nilli
    Perfect Hashing and Probability. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:407-409 [Journal]
  33. Andrzej Pelc
    Almost Safe Testing with Few Tests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:411-419 [Journal]
  34. Prasad Tetali
    An Extension of Foster's Network Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:421-427 [Journal]
  35. Rudolf Ahlswede, Ning Cai
    On Partitioning and Packing Products with Rectangles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:429-434 [Journal]
  36. Neal Brand, Steve Jackson
    Properties of Classes of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:435-454 [Journal]
  37. Moshe Dubiner, Uri Zwick
    How Do Read-Once Formulae Shrink? [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:455-469 [Journal]
  38. J. M. Hammersley, Giuseppe Mazzarino
    Properties of Large Eden Clusters in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:471-505 [Journal]
  39. Claus-Peter Schnorr
    Block Reduced Lattice Bases and Successive Minima. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:507-522 [Journal]
  40. Farhad Shahrokhi, László A. Székely
    On Canonical Concurrent Flows, Crossing Number and Graph Expansion. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:523-543 [Journal]
  41. Arthur T. White
    An Introduction to Random Topological Graphs Theory. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:545-555 [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