The following pages link to Balázs Keszegh (Q284344):
Displaying 50 items.
- Topological orderings of weighted directed acyclic graphs (Q284347) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Finding a majority ball with majority answers (Q322261) (← links)
- Saturating Sperner families (Q367051) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- Graphs that admit right angle crossing drawings (Q419368) (← links)
- Coloring half-planes and bottomless rectangles (Q452449) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions (Q533787) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Convex polygons are self-coverable (Q741609) (← links)
- Generalized forbidden subposet problems (Q781542) (← links)
- Improved upper bounds on the reflexivity of point sets (Q1000926) (← links)
- On linear forbidden submatrices (Q1003638) (← links)
- Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- Saturation problems in the Ramsey theory of graphs, posets and point sets (Q2033927) (← links)
- Induced and non-induced poset saturation problems (Q2049440) (← links)
- Discrete Helly-type theorems for pseudohalfplanes (Q2066005) (← links)
- An almost optimal bound on the number of intersections of two simple polygons (Q2105320) (← links)
- On the number of hyperedges in the hypergraph of lines and pseudo-discs (Q2161213) (← links)
- Set systems related to a house allocation problem (Q2182206) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Path search in the pyramid and in other graphs (Q2320763) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- Octants are cover-decomposable into many coverings (Q2444310) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- Online and quasi-online colorings of wedges and intervals (Q2520715) (← links)
- On polygons excluding point sets (Q2637725) (← links)
- Two-coloring triples such that in each color class every element is missed at least once (Q2657049) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes (Q2827816) (← links)
- Octants are Cover Decomposable (Q2857395) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms (Q2921397) (← links)
- Online and Quasi-online Colorings of Wedges and Intervals (Q2927654) (← links)
- Nonrepetitive colorings of lexicographic product of graphs (Q2928584) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- More on decomposing coverings by octants (Q2970427) (← links)
- Graphs that Admit Right Angle Crossing Drawings (Q3057620) (← links)
- Coloring Points with Respect to Squares (Q3132836) (← links)
- Cubic graphs have bounded slope parameter (Q3402372) (← links)
- Polychromatic Colorings of n-Dimensional Guillotine-Partitions (Q3511319) (← links)
- Drawing Cubic Graphs with at Most Five Slopes (Q3595471) (← links)
