József Balogh

According to our database, József Balogh authored at least 172 papers between 1998 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2026

Positive co-degree densities and jumps.

József Balogh, Anastasia Halfpap, Bernard Lidický, Cory Palmer

Innov. Graph Theory, 2026

Ramsey-type problems for tilings in dense graphs.

József Balogh, Andrea Freschi, Andrew Treglown

Eur. J. Comb., 2026

Maximum number of points in general position in a random subset of finite 3-dimensional spaces.

József Balogh, Haoran Luo

Comput. Geom., 2026

2025

On the Number of P-free Set Systems for Tree Posets P.

József Balogh, Ramon I. Garcia, Michael C. Wigal

Order, December, 2025

Sunflowers in Set Systems with Small VC-Dimension.

József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham

Comb., December, 2025

Packing edge disjoint cliques in graphs.

József Balogh, Michael C. Wigal

Comb., October, 2025

Almost Congruent Triangles.

József Balogh, Felix Christian Clemen, Adrian Dumitrescu

Discret. Comput. Geom., April, 2025

On the Constructor-Blocker game.

József Balogh, Ce Chen, Sean English

J. Graph Theory, March, 2025

A Sharp Threshold for a Random Version of Sperner's Theorem.

József Balogh, Robert A. Krueger

Random Struct. Algorithms, January, 2025

Rainbow connectivity of randomly perturbed graphs.

József Balogh, John Finlay, Cory Palmer

J. Graph Theory, 2025

Weighted Turán Theorems With Applications to Ramsey-Turán Type of Problems.

József Balogh, Domagoj Bradac, Bernard Lidický

J. Graph Theory, 2025

Non-degenerate hypergraphs with exponentially many extremal constructions.

József Balogh, Felix Christian Clemen, Haoran Luo

J. Comb. Theory B, 2025

On the maximum number of r-cliques in graphs free of complete r-partite subgraphs.

József Balogh, Suyun Jiang, Haoran Luo

Discret. Math., 2025

2024

Turán Density of Long Tight Cycle Minus One Hyperedge.

József Balogh, Haoran Luo

Comb., October, 2024

On a Traveling Salesman Problem for Points in the Unit Cube.

József Balogh, Felix Christian Clemen, Adrian Dumitrescu

Algorithmica, September, 2024

On oriented cycles in randomly perturbed digraphs.

Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown

Comb. Probab. Comput., March, 2024

Intersecting families of sets are typically trivial.

József Balogh, Ramon Garcia, Lina Li, Adam Zsolt Wagner

J. Comb. Theory B, January, 2024

A Note on Color-Bias Perfect Matchings in Hypergraphs.

József Balogh, Andrew Treglown, Camila Zárate-Guerén

SIAM J. Discret. Math., 2024

On Multicolor Turán Numbers.

József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison

SIAM J. Discret. Math., 2024

Ramsey-Turán problems with small independence numbers.

József Balogh, Ce Chen, Grace McCourt, Cassie Murley

Eur. J. Comb., 2024

10 problems for partitions of triangle-free graphs.

József Balogh, Felix Christian Clemen, Bernard Lidický

Eur. J. Comb., 2024

Subset Selection Problems in Planar Point Sets.

József Balogh, Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

CoRR, 2024

Grid-drawings of graphs in three-dimensions.

József Balogh, Ethan Patrick White

CoRR, 2024

Short proofs of three results about intersecting systems.

József Balogh, William Linz

Comb. Theory, 2024

2023

Maximal 3-Wise Intersecting Families.

József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran

Comb., December, 2023

The Spectrum of Triangle-Free Graphs.

József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec

SIAM J. Discret. Math., June, 2023

Lower bounds on the Erdős-Gyárfás problem via color energy graphs.

József Balogh, Sean English, Emily Heath, Robert A. Krueger

J. Graph Theory, June, 2023

An Upper Bound on the Size of Sidon Sets.

József Balogh, Zoltán Füredi, Souktik Roy

Am. Math. Mon., May, 2023

Sharp threshold for the Erdős-Ko-Rado theorem.

József Balogh, Robert A. Krueger, Haoran Luo

Random Struct. Algorithms, 2023

Improving Uniquely Decodable Codes in Binary Adder Channels.

József Balogh, The Nguyen, Patric R. J. Östergård, Ethan Patrick White, Michael C. Wigal

CoRR, 2023

On the sizes of \(t\)-intersecting \(k\)-chain-free families.

József Balogh, William Linz, Balázs Patkós

Comb. Theory, 2023

Unavoidable order-size pairs in hypergraphs - positive forcing density.

Maria Axenovich, József Balogh, Felix Christian Clemen, Lea Weber

Comb. Theory, 2023

On the Maximum $F_5$-Free Subhypergraphs of a Random Hypergraph.

Igor Araujo, József Balogh, Haoran Luo

Electron. J. Comb., 2023

Nearly All k-SAT Functions Are Unate.

József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Crossing numbers of complete bipartite graphs.

József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

On Generalized Turán Results in Height Two Posets.

József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós

SIAM J. Discret. Math., June, 2022

Monochromatic connected matchings in 2-edge-colored multipartite graphs.

József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu

J. Graph Theory, 2022

Tilings in vertex ordered graphs.

József Balogh, Lina Li, Andrew Treglown

J. Comb. Theory B, 2022

Counting <i>r</i>-graphs without forbidden configurations.

József Balogh, Felix Christian Clemen, Letícia Mattos

J. Comb. Theory B, 2022

A strengthening of the Erdős-Szekeres Theorem.

József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov

Eur. J. Comb., 2022

On the sizes of large subgraphs of the binomial random graph.

József Balogh, Maksim Zhukovskii

Discret. Math., 2022

Generalized rainbow Turán numbers of odd cycles.

József Balogh, Michelle Delcourt, Emily Heath, Lina Li

Discret. Math., 2022

Chain method for panchromatic colorings of hypergraphs.

Margarita Akhmejanova, József Balogh, Dmitrii Shabanov

Discret. Appl. Math., 2022

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.

József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu

Comb. Probab. Comput., 2022

Maximum number of almost similar triangles in the plane.

József Balogh, Felix Christian Clemen, Bernard Lidický

Comput. Geom., 2022

2021

Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree.

József Balogh, Nathan Lemons, Cory Palmer

SIAM J. Discret. Math., 2021

Independent sets in the middle two layers of Boolean lattice.

József Balogh, Ramon Garcia, Lina Li

J. Comb. Theory A, 2021

Counting independent sets in regular hypergraphs.

József Balogh, Béla Bollobás, Bhargav P. Narayanan

J. Comb. Theory A, 2021

The domination number of the graph defined by two levels of the n-cube, II.

József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza

Eur. J. Comb., 2021

An analogue of the Erdős-Gallai theorem for random graphs.

József Balogh, Andrzej Dudek, Lina Li

Eur. J. Comb., 2021

A discrepancy version of the Hajnal-Szemerédi theorem.

József Balogh, Béla Csaba, András Pluhár, Andrew Treglown

Comb. Probab. Comput., 2021

Making Kr+1-free graphs r-partite.

József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender

Comb. Probab. Comput., 2021

On the Number of Sum-Free Triplets of Sets.

Igor Araujo, József Balogh, Ramon Garcia

Electron. J. Comb., 2021

2020

Families in posets minimizing the number of comparable pairs.

József Balogh, Sárka Petrícková, Adam Zsolt Wagner

J. Graph Theory, 2020

On the number of linear hypergraphs of large girth.

József Balogh, Lina Li

J. Graph Theory, 2020

Ordered size Ramsey number of paths.

József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov

Discret. Appl. Math., 2020

The Ramsey Number of Fano Plane Versus Tight Path.

József Balogh, Felix Christian Clemen, Jozef Skokan, Adam Zsolt Wagner

Electron. J. Comb., 2020

On the Discrepancies of Graphs.

József Balogh, Béla Csaba, Yifan Jing, András Pluhár

Electron. J. Comb., 2020

2019

Closing in on Hill's Conjecture.

József Balogh, Bernard Lidický, Gelasio Salazar

SIAM J. Discret. Math., 2019

The Typical Structure of Gallai Colorings and Their Extremal Graphs.

József Balogh, Lina Li

SIAM J. Discret. Math., 2019

The number of hypergraphs without linear cycles.

József Balogh, Bhargav P. Narayanan, Jozef Skokan

J. Comb. Theory B, 2019

Packing Chromatic Number of Subdivisions of Cubic Graphs.

József Balogh, Alexandr V. Kostochka, Xujun Liu

Graphs Comb., 2019

Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs.

József Balogh, Theodore Molla

Eur. J. Comb., 2019

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs.

József Balogh, Danila D. Cherkashin, Sergei Kiselev

Eur. J. Comb., 2019

Tilings in Randomly Perturbed Dense Graphs.

József Balogh, Andrew Treglown, Zsolt Adam Wagner

Comb. Probab. Comput., 2019

Monochromatic Hilbert Cubes and Arithmetic Progressions.

József Balogh, Mikhail Lavrov, George Shakan, Adam Zsolt Wagner

Electron. J. Comb., 2019

Cubic Graphs with Small Independence Ratio.

József Balogh, Alexandr V. Kostochka, Xujun Liu

Electron. J. Comb., 2019

Structure and Supersaturation for Intersecting Families.

József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran

Electron. J. Comb., 2019

2018

Packing chromatic number of cubic graphs.

József Balogh, Alexandr V. Kostochka, Xujun Liu

Discret. Math., 2018

Two results about the hypercube.

József Balogh, Tamás Mészáros, Zsolt Adam Wagner

Discret. Appl. Math., 2018

Rainbow spanning trees in properly coloured complete graphs.

József Balogh, Hong Liu, Richard Montgomery

Discret. Appl. Math., 2018

Triangle-Tilings in Graphs Without Large Independent Sets.

József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft

Comb. Probab. Comput., 2018

2017

On Two Problems in Ramsey-Turán Theory.

József Balogh, Hong Liu, Maryam Sharifzadeh

SIAM J. Discret. Math., 2017

Transitive triangle tilings in oriented graphs.

József Balogh, Allan Lo, Theodore Molla

J. Comb. Theory B, 2017

Rainbow triangles in three-colored graphs.

József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young

J. Comb. Theory B, 2017

Stability for Vertex Cycle Covers.

József Balogh, Frank Mousset, Jozef Skokan

Electron. J. Comb., 2017

The typical structure of graphs with no large cliques.

József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh

Comb., 2017

2016

Applications of graph containers in the Boolean lattice.

József Balogh, Andrew Treglown, Zsolt Adam Wagner

Random Struct. Algorithms, 2016

Triangle factors of graphs without large independent sets and of weighted graphs.

József Balogh, Theodore Molla, Maryam Sharifzadeh

Random Struct. Algorithms, 2016

Mantel's theorem for random hypergraphs.

József Balogh, Jane Butterfield, Ping Hu, John Lenz

Random Struct. Algorithms, 2016

Hypergraphs with Zero Chromatic Threshold.

József Balogh, John Lenz

Graphs Comb., 2016

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.

József Balogh, Ping Hu, Bernard Lidický, Florian Pfender

Eur. J. Comb., 2016

Rainbow copies of C₄ in edge-colored hypercubes.

József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer

Discret. Appl. Math., 2016

On the path separation number of graphs.

József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár

Discret. Appl. Math., 2016

On the Chromatic Thresholds of Hypergraphs.

József Balogh, Jane Butterfield, Ping Hu, John Lenz, Dhruv Mubayi

Comb. Probab. Comput., 2016

2015

Book Embeddings of Regular Graphs.

József Balogh, Gelasio Salazar

SIAM J. Discret. Math., 2015

On the Decay of Crossing Numbers of Sparse Graphs.

József Balogh, Jesús Leaños, Gelasio Salazar

J. Graph Theory, 2015

Subdivisions of a large clique in C6-free graphs.

József Balogh, Hong Liu, Maryam Sharifzadeh

J. Comb. Theory B, 2015

Phase transitions in Ramsey-Turán theory.

József Balogh, Ping Hu, Miklós Simonovits

J. Comb. Theory B, 2015

Intersecting families of discrete structures are typically trivial.

József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh

J. Comb. Theory A, 2015

A sharp bound on the number of maximal sum-free sets.

József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown

Electron. Notes Discret. Math., 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.

József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec

Comb. Probab. Comput., 2015

2014

A random version of Sperner's theorem.

József Balogh, Richard Mycroft, Andrew Treglown

J. Comb. Theory A, 2014

On the number of K₄-saturating edges.

József Balogh, Hong Liu

J. Comb. Theory B, 2014

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube.

József Balogh, Ping Hu, Bernard Lidický, Hong Liu

Eur. J. Comb., 2014

Partitioning 2-edge-colored graphs by monochromatic paths and cycles.

József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy

Comb., 2014

2013

On the Tree Packing Conjecture.

József Balogh, Cory Palmer

SIAM J. Discret. Math., 2013

Coloring some finite sets in <i> Rⁿ </i>.

József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii

Discuss. Math. Graph Theory, 2013

Towards a Weighted Version of the Hajnal-Szemerédi Theorem.

József Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young

Comb. Probab. Comput., 2013

Large convex holes in random point sets.

József Balogh, Hernán González-Aguilar, Gelasio Salazar

Comput. Geom., 2013

On Perfect Packings in Dense Graphs.

József Balogh, Alexandr V. Kostochka, Andrew Treglown

Electron. J. Comb., 2013

2012

Turán Densities of Some Hypergraphs Related to K_k+1^k.

József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao

SIAM J. Discret. Math., 2012

Graph bootstrap percolation.

József Balogh, Béla Bollobás, Robert Morris

Random Struct. Algorithms, 2012

Linear algebra and bootstrap percolation.

József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan

J. Comb. Theory A, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.

József Balogh, Choongbum Lee, Wojciech Samotij

Comb. Probab. Comput., 2012

The Positive Minimum Degree Game on Sparse Graphs.

József Balogh, András Pluhár

Electron. J. Comb., 2012

Almost all triangle-free triple systems are tripartite.

József Balogh, Dhruv Mubayi

Comb., 2012

2011

Local resilience of almost spanning trees in random graphs.

József Balogh, Béla Csaba, Wojciech Samotij

Random Struct. Algorithms, 2011

Excluding induced subgraphs: Critical graphs.

József Balogh, Jane Butterfield

Random Struct. Algorithms, 2011

The number of <i>K</i>_{<i>s, t</i>}-free graphs.

József Balogh, Wojciech Samotij

J. Lond. Math. Soc., 2011

Almost all triple systems with independent neighborhoods are semi-bipartite.

József Balogh, Dhruv Mubayi

J. Comb. Theory A, 2011

The fine structure of octahedron-free graphs.

József Balogh, Béla Bollobás, Miklós Simonovits

J. Comb. Theory B, 2011

The structure of almost all graphs in a hereditary property.

Noga Alon, József Balogh, Béla Bollobás, Robert Morris

J. Comb. Theory B, 2011

Complete minors, independent sets, and chordal graphs.

József Balogh, John Lenz, Hehui Wu

Discuss. Math. Graph Theory, 2011

Large minors in graphs with given independence number.

József Balogh, Alexandr V. Kostochka

Discret. Math., 2011

On the Chvátal-Erdös Triangle Game.

József Balogh, Wojciech Samotij

Electron. J. Comb., 2011

The number of <i>K</i>_{<i>m, m</i>}-free graphs.

József Balogh, Wojciech Samotij

Comb., 2011

2010

Almost All C₄-Free Graphs Have Fewer than (1-epsilon), ex(n, C₄) Edges.

József Balogh, Wojciech Samotij

SIAM J. Discret. Math., 2010

Online Ramsey games for triangles in random graphs.

József Balogh, Jane Butterfield

Discret. Math., 2010

Bootstrap Percolation in High Dimensions.

József Balogh, Béla Bollobás, Robert Morris

Comb. Probab. Comput., 2010

Large Bounded Degree Trees in Expanding Graphs.

József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij

Electron. J. Comb., 2010

2009

On Avoider-Enforcer Games.

József Balogh, Ryan R. Martin

SIAM J. Discret. Math., 2009

The diameter game.

József Balogh, Ryan R. Martin, András Pluhár

Random Struct. Algorithms, 2009

The typical structure of graphs without given excluded subgraphs.

József Balogh, Béla Bollobás, Miklós Simonovits

Random Struct. Algorithms, 2009

The unlabelled speed of a hereditary graph property.

József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós

J. Comb. Theory B, 2009

Minimum Difference Representations of Graphs.

József Balogh, Noah Prince

Graphs Comb., 2009

The Erdos-Lovász Tihany conjecture for quasi-line graphs.

József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz

Discret. Math., 2009

Erdos-Ko-Rado in Random Hypergraphs.

József Balogh, Tom Bohman, Dhruv Mubayi

Comb. Probab. Comput., 2009

Majority Bootstrap Percolation on the Hypercube.

József Balogh, Béla Bollobás, Robert Morris

Comb. Probab. Comput., 2009

Sizes of Induced Subgraphs of Ramsey Graphs.

Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij

Comb. Probab. Comput., 2009

2008

On the bandwidth of 3-dimensional Hamming graphs.

József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress

Theor. Comput. Sci., 2008

On the First-Fit Chromatic Number of Graphs.

József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu

SIAM J. Discret. Math., 2008

A new short proof of a theorem of Ahlswede and Khachatrian.

József Balogh, Dhruv Mubayi

J. Comb. Theory A, 2008

An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n.

Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

J. Comb. Theory A, 2008

A note on harmonic subgraphs in labelled geometric graphs.

Gabriela Araujo, József Balogh, Ruy Fabila-Monroy, Gelasio Salazar, Jorge Urrutia

Inf. Process. Lett., 2008

On 2-Detour Subgraphs of the Hypercube.

József Balogh, Alexandr V. Kostochka

Graphs Comb., 2008

On the variance of Shannon products of graphs.

József Balogh, Clifford D. Smyth

Discret. Appl. Math., 2008

Edit Distance and its Computation.

József Balogh, Ryan R. Martin

Electron. J. Comb., 2008

2007

Graphs Having Small Number of Sizes on Induced k-Subgraphs.

Maria Axenovich, József Balogh

SIAM J. Discret. Math., 2007

Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position.

József Balogh, Boris G. Pittel, Gelasio Salazar

Random Struct. Algorithms, 2007

The Klee-Minty random edge chain moves with linear speed.

József Balogh, Robin Pemantle

Random Struct. Algorithms, 2007

Bootstrap percolation on the random regular graph.

József Balogh, Boris G. Pittel

Random Struct. Algorithms, 2007

Hereditary properties of combinatorial structures: Posets and oriented graphs.

József Balogh, Béla Bollobás, Robert Morris

J. Graph Theory, 2007

Hereditary Properties of Tournaments.

József Balogh, Béla Bollobás, Robert Morris

Electron. J. Comb., 2007

The convex hull of every optimal pseudolinear drawing of K_n is a triangle.

József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar

Australas. J Comb., 2007

2006

On the edge-bandwidth of graph products.

József Balogh, Dhruv Mubayi, András Pluhár

Theor. Comput. Sci., 2006

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.

József Balogh, Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2006

Hereditary properties of partitions, ordered graphs and ordered hypergraphs.

József Balogh, Béla Bollobás, Robert Morris

Eur. J. Comb., 2006

A remark on the number of edge colorings of graphs.

József Balogh

Eur. J. Comb., 2006

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n.

József Balogh, Gelasio Salazar

Discret. Comput. Geom., 2006

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups.

József Balogh, Yuval Peres, Gábor Pete

Comb. Probab. Comput., 2006

2005

Disjoint representability of sets and their complements.

József Balogh, Peter Keevash, Benny Sudakov

J. Comb. Theory B, 2005

Covering planar graphs with forests.

József Balogh, Martin Kochol, András Pluhár, Xingxing Yu

J. Comb. Theory B, 2005

A jump to the bell number for hereditary graph properties.

József Balogh, Béla Bollobás, David Weinreich

J. Comb. Theory B, 2005

Hereditary properties of words.

József Balogh, Béla Bollobás

RAIRO Theor. Informatics Appl., 2005

Unavoidable Traces Of Set Systems.

József Balogh, Béla Bollobás

Comb., 2005

2004

Index assignment for two-channel quantization.

József Balogh, János A. Csirik

IEEE Trans. Inf. Theory, 2004

On the interval number of special graphs.

József Balogh, Pascal Ochem, András Pluhár

J. Graph Theory, 2004

The number of graphs without forbidden subgraphs.

József Balogh, Béla Bollobás, Miklós Simonovits

J. Comb. Theory B, 2004

On k-coverage in a mostly sleeping sensor network.

Santosh Kumar, Ten-Hwang Lai, József Balogh

Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, 2004

Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n.

József Balogh, Gelasio Salazar

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Private computation using a PEZ dispenser.

József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz

Theor. Comput. Sci., 2003

Long monotone paths in line arrangements.

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

The Turan Density of Triple Systems Is Not Principal.

József Balogh

J. Comb. Theory A, 2002

The interval number of dense graphs.

József Balogh, András Pluhár

Discret. Math., 2002

Game domination number.

Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó

Discret. Math., 2002

Measures on monotone properties of graphs.

József Balogh, Béla Bollobás, David Weinreich

Discret. Appl. Math., 2002

2001

The Penultimate Rate of Growth for Graph Properties.

József Balogh, Béla Bollobás, David Weinreich

Eur. J. Comb., 2001

2000

The Speed of Hereditary Properties of Graphs.

József Balogh, Béla Bollobás, David Weinreich

J. Comb. Theory B, 2000

1999

A sharp edge bound on the interval number of a graph.

József Balogh, András Pluhár

J. Graph Theory, 1999

A Parallelized Sequential Random Search Global Optimization Algorithm.

Pilar Martínez Ortigosa, József Balogh, Inmaculada García

Acta Cybern., 1999

1998

Random disease on the square grid.

József Balogh, Gábor Pete

Random Struct. Algorithms, 1998