Balázs Keszegh Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal Ackerman, Oswin Aichholzer, Balázs Keszegh: Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42(3): 241-249 (2009)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalázs Keszegh: On linear forbidden submatrices. J. Comb. Theory, Ser. A 116(1): 232-241 (2009)
2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalázs Keszegh: Polychromatic Colorings of n-Dimensional Guillotine-Partitions. COCOON 2008: 110-118
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalá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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalá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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEyal Ackerman, Oswin Aichholzer, Balázs Keszegh: Improved Upper Bounds on the Reflexivity of Point Sets. CCCG 2007: 29-32
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalázs Keszegh: Weak Conflict-Free Colorings of Point Sets and Simple Regions. CCCG 2007: 97-100
2006
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBalá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

Coauthor Index

1Eyal Ackerman [3] [8]
2Oswin Aichholzer [3] [8]
3János Pach [1] [4] [5]
4Dömötör Pálvölgyi [1] [4] [5]
5Géza Tóth [1] [4] [5]

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)