2009 |
8 | EE | Eyal Ackerman,
Oswin Aichholzer,
Balázs Keszegh:
Improved upper bounds on the reflexivity of point sets.
Comput. Geom. 42(3): 241-249 (2009) |
7 | EE | Balázs Keszegh:
On linear forbidden submatrices.
J. Comb. Theory, Ser. A 116(1): 232-241 (2009) |
2008 |
6 | EE | Balázs Keszegh:
Polychromatic Colorings of n-Dimensional Guillotine-Partitions.
COCOON 2008: 110-118 |
5 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter.
Graph Drawing 2008: 50-60 |
4 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Drawing cubic graphs with at most five slopes.
Comput. Geom. 40(2): 138-147 (2008) |
2007 |
3 | | Eyal Ackerman,
Oswin Aichholzer,
Balázs Keszegh:
Improved Upper Bounds on the Reflexivity of Point Sets.
CCCG 2007: 29-32 |
2 | | Balázs Keszegh:
Weak Conflict-Free Colorings of Point Sets and Simple Regions.
CCCG 2007: 97-100 |
2006 |
1 | EE | Balázs Keszegh,
János Pach,
Dömötör Pálvölgyi,
Géza Tóth:
Drawing Cubic Graphs with at Most Five Slopes.
Graph Drawing 2006: 114-125 |