The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1998, volume: 7, number: 4

  1. Malgorzata Bednarska
    On Biased Positional Games. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:339-351 [Journal]
  2. Tuhao Chen, E. Seneta
    Lower Bounds for the Probability of Intersection of Several Unions of Events. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:353-364 [Journal]
  3. Vlado Dancík
    Common Subsequences and Supersequences and their Expected Length. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:365-373 [Journal]
  4. Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter
    Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:375-386 [Journal]
  5. Petros Hadjicostas
    The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:387-396 [Journal]
  6. Olle Häggström
    On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:397-401 [Journal]
  7. Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño
    On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:403-412 [Journal]
  8. Chris Jagger
    Distant Vertex Partitions of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:413-422 [Journal]
  9. Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
    Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:423-436 [Journal]
  10. Brendan D. McKay, Robert W. Robinson
    Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:437-449 [Journal]
  11. Petr Savický
    Complexity and Probability of Some Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:451-463 [Journal]
  12. Kyle Siegrist
    Expected Value Expansions in Random Subgraphs with Applications to Network Reliability. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:465-483 [Journal]
  13. Haidong Wu
    On Vertex-Triads in 3-Connected Binary Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:485-497 [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