The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

József Balogh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:124-128 [Conf]
  2. József Balogh, Gelasio Salazar
    Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:25-35 [Conf]
  3. Santosh Kumar, Ten-Hwang Lai, József Balogh
    On k-coverage in a mostly sleeping sensor network. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2004, pp:144-158 [Conf]
  4. József Balogh, Béla Bollobás
    Unavoidable Traces Of Set Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:6, pp:633-643 [Journal]
  5. József Balogh, Béla Bollobás, David Weinreich
    Measures on monotone properties of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:17-36 [Journal]
  6. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long Monotone Paths in Line Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:167-176 [Journal]
  7. József Balogh, Gelasio Salazar
    k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:4, pp:671-690 [Journal]
  8. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
    Game domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:23-33 [Journal]
  9. József Balogh, András Pluhár
    The interval number of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:423-429 [Journal]
  10. József Balogh
    A remark on the number of edge colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:4, pp:565-573 [Journal]
  11. József Balogh, Béla Bollobás, David Weinreich
    The Penultimate Rate of Growth for Graph Properties. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:3, pp:277-289 [Journal]
  12. József Balogh, Béla Bollobás, Robert Morris
    Hereditary properties of partitions, ordered graphs and ordered hypergraphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1263-1281 [Journal]
  13. József Balogh
    The Turan Density of Triple Systems Is Not Principal. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:100, n:1, pp:176-180 [Journal]
  14. József Balogh, Béla Bollobás, Miklós Simonovits
    The number of graphs without forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:1-24 [Journal]
  15. József Balogh, Béla Bollobás, David Weinreich
    The Speed of Hereditary Properties of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:131-156 [Journal]
  16. József Balogh, Béla Bollobás, David Weinreich
    A jump to the bell number for hereditary graph properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:29-48 [Journal]
  17. József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
    Covering planar graphs with forests. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:147-158 [Journal]
  18. József Balogh, Peter Keevash, Benny Sudakov
    Disjoint representability of sets and their complements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:12-28 [Journal]
  19. József Balogh, Peter Keevash, Benny Sudakov
    On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:919-932 [Journal]
  20. József Balogh, Gábor Pete
    Random disease on the square grid. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:409-422 [Journal]
  21. József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz
    Private computation using a PEZ dispenser. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:69-84 [Journal]
  22. József Balogh, Dhruv Mubayi, András Pluhár
    On the edge-bandwidth of graph products. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:43-57 [Journal]
  23. József Balogh, János A. Csirik
    Index assignment for two-channel quantization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2737-2751 [Journal]
  24. József Balogh, Pascal Ochem, András Pluhár
    On the interval number of special graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:4, pp:241-253 [Journal]

  25. Hereditary Properties of Tournaments. [Citation Graph (, )][DBLP]


  26. Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. [Citation Graph (, )][DBLP]


  27. Majority Bootstrap Percolation on the Hypercube. [Citation Graph (, )][DBLP]


  28. Erdos-Ko-Rado in Random Hypergraphs. [Citation Graph (, )][DBLP]


  29. Sizes of Induced Subgraphs of Ramsey Graphs. [Citation Graph (, )][DBLP]


  30. On the variance of Shannon products of graphs. [Citation Graph (, )][DBLP]


  31. The Erdos-Lovász Tihany conjecture for quasi-line graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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