Publications by Balázs Keszegh

Adaptive majority problems for restricted query graphs and for weighted sets

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

ELSEVIER2021

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Abhishek Methuku, Balázs Keszegh

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

COMENIUS UNIV2019

Drawing Planar Graphs Of Bounded Degree With Few Slopes

János Pach, Balázs Keszegh, Doemoetoer Palvoelgyi

We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different sl ...

Siam Publications2013

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Drawing planar graphs of bounded degree with few slopes

János Pach, Balázs Keszegh, Doemoetoer Palvoelgyi

We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different sl ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Graphs that Admit Right Angle Crossing Drawings

Radoslav Fulek, Balázs Keszegh, Filip Moric

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends pe ...

2010

Polychromatic colorings of arbitrary rectangular partitions

Balázs Keszegh

A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on i ...

2010

Drawing cubic graphs with at most five slopes

János Pach, Balázs Keszegh

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice. ...

2008

Balázs Keszegh

Graph Chatbot

Chat with Graph Search

Adaptive majority problems for restricted query graphs and for weighted sets

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Drawing Planar Graphs Of Bounded Degree With Few Slopes

On Polygons Excluding Point Sets

Drawing planar graphs of bounded degree with few slopes

Graphs that Admit Right Angle Crossing Drawings

Polychromatic colorings of arbitrary rectangular partitions

Drawing cubic graphs with at most five slopes

Adaptive majority problems for restricted query graphs and for weighted sets

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Drawing Planar Graphs Of Bounded Degree With Few Slopes

Drawing planar graphs of bounded degree with few slopes

Graphs that Admit Right Angle Crossing Drawings

On Polygons Excluding Point Sets

Drawing cubic graphs with at most five slopes

Polychromatic colorings of arbitrary rectangular partitions