Balázs Keszegh

Dániel Simon

Discret. Math., 2026

2025

Cooperation in combinatorial search.

[BibT_eX]

[DOI]

Optim. Lett., March, 2025

The Zarankiewicz Problem for Polygon Visibility Graphs.

[BibT_eX]

[DOI]

CoRR, March, 2025

Orientation of good covers.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Query complexity of Boolean functions on the middle slice of the cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

On tangencies among planar curves with an application to coloring L-shapes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

On the number of tangencies among 1-intersecting x-monotone curves.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

The maximum number of digons formed by pairwise crossing pseudocircles.

[BibT_eX]

[DOI]

CoRR, 2024

On dual-ABAB-free and related hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Orientation of Convex Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

On the Number of Digons in Arrangements of Pairwise Intersecting Circles.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., December, 2023

The Number of Tangencies Between Two Families of Curves.

[BibT_eX]

[DOI]

Comb., October, 2023

Coloring directed hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

Saturation of Ordered Graphs.

[BibT_eX]

[DOI]

Vladimir Boskovic

SIAM J. Discret. Math., June, 2023

A new discrete theory of pseudoconvexity.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2023

The maximum size of adjacency-crossing graphs.

[BibT_eX]

[DOI]

CoRR, 2023

On the number of tangencies among 1-intersecting curves.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Discrete Helly-type theorems for pseudohalfplanes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.

[BibT_eX]

[DOI]

Chaya Keller

Electron. J. Comb., 2022

2021

Saturation Problems about Forbidden 0-1 Submatrices.

[BibT_eX]

[DOI]

Radoslav Fulek

SIAM J. Discret. Math., 2021

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Induced and non-induced poset saturation problems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Saturation problems in the Ramsey theory of graphs, posets and point sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Adaptive majority problems for restricted query graphs and for weighted sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Coloring Delaunay-edges and their generalizations.

[BibT_eX]

[DOI]

Comput. Geom., 2021

2020

Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Generalized Forbidden Subposet Problems.

[BibT_eX]

[DOI]

Dániel Gerbner

Balázs Patkós

Order, 2020

Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Set systems related to a house allocation problem.

[BibT_eX]

[DOI]

Discret. Math., 2020

A note about online nonrepetitive coloring k-trees.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Appl. Math., 2020

An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

An improvement on the maximum number of k?dominating independent sets.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

2018

On the Number of Cycles in a Graph with Restricted Cycle Lengths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Line Percolation in Finite Projective Planes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Plane drawings of the generalized Delaunay-graphs for pseudo-disks.

[BibT_eX]

[DOI]

CoRR, 2018

Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2018

Coloring Intersection Hypergraphs of Pseudo-Disks.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On the number of edge-disjoint triangles in K<sub>4</sub>-free graphs.

[BibT_eX]

[DOI]

Ervin Györi

Electron. Notes Discret. Math., 2017

Choosability and paintability of the lexicographic product of graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Appl. Math., 2017

Finding a non-minority ball with majority answers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.

[BibT_eX]

[DOI]

Ervin Györi

Comb., 2017

Search for the end of a path in the d-dimensional grid and in other graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Proper Coloring of Geometric Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Topological orderings of weighted directed acyclic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

On the Size of Planarly Connected Crossing Graphs.

[BibT_eX]

[DOI]

Máté Vizer

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Coloring Points with Respect to Squares.

[BibT_eX]

[DOI]

Máté Vizer

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

More on decomposing coverings by octants.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Finding a majority ball with majority answers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the Tree Search Problem with Non-uniform Costs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Nonrepetitive colorings of lexicographic product of graphs.

[BibT_eX]

[DOI]

Balázs Patkós

Xuding Zhu

Discret. Math. Theor. Comput. Sci., 2014

Convex Polygons are Self-Coverable.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms.

[BibT_eX]

[DOI]

CoRR, 2014

Counting One-sided Exchange Stable Matchings.

[BibT_eX]

[DOI]

Andrei Asinowski

Tillmann Miltzow

CoRR, 2014

Octants are cover-decomposable into many coverings.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Counting Houses of Pareto Optimal Matchings in the House Allocation Problem.

[BibT_eX]

[DOI]

Andrei Asinowski

Tillmann Miltzow

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Saturating Sperner Families.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Online and Quasi-online Colorings of Wedges and Intervals.

[BibT_eX]

[DOI]

Nathan Lemons

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Density-Based Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Generalizations of the tree packing conjecture.

[BibT_eX]

[DOI]

Dániel Gerbner

Cory Palmer

Discuss. Math. Graph Theory, 2012

Search for the end of a path in the d-dimensional grid and in other graphs

[BibT_eX]

[DOI]

CoRR, 2012

Coloring half-planes and bottomless rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011

Octants are Cover Decomposable.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Path-search in the pyramid and in other graphs

[BibT_eX]

[DOI]

Dániel Gerbner

CoRR, 2011

2010

Polychromatic colorings of arbitrary rectangular partitions.

[BibT_eX]

[DOI]

Discret. Math., 2010

Graphs that Admit Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Drawing Planar Graphs of Bounded Degree with Few Slopes.

[BibT_eX]

[DOI]

János Pach

Proceedings of the Graph Drawing - 18th International Symposium, 2010

On polygons excluding point sets.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

On linear forbidden submatrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

2008

Cubic Graphs Have Bounded Slope Parameter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Polychromatic Colorings of n-Dimensional Guillotine-Partitions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Weak Conflict-Free Colorings of Point Sets and Simple Regions.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Improved Upper Bounds on the Reflexivity of Point Sets.

[BibT_eX]

[DOI]

Oswin Aichholzer