Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Keszegh, Bal{\'a}zs"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum partial-matching and Hausdorff RMS-distance under translation: Combinatorics and algorithms
Rinat Ben-Avraham
,
Matthias Henze
,
Rafel Jaume
,
Balázs Keszegh
,
Orit E. Raz
,
Micha Sharir
,
Igor Tubis
Lecture Notes in Computer Science
8737
, 2014, pp. 100-111
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
Panagiotis Cheilaris
,
Balázs Keszegh
,
Dömötör Pálvölgyi
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1775-1787
On polygons excluding point sets
Radoslav Fulek
,
Balázs Keszegh
,
Filip Morić
,
Igor Uljarević
Graphs and Combinatorics
29
(6), 2013, pp. 1741-1753
Saturating Sperner families
Dániel Gerbner
,
Balázs Keszegh
,
Nathan Lemons
,
Cory Palmer
,
Dömötör Pálvölgyi
,
Balázs Patkós
Graphs and Combinatorics
29
(5), 2013, pp. 1355-1364
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 1171-1183
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
Lecture Notes in Computer Science
6502
, 2011, pp. 293-304
Cubic graphs have bounded slope parameter
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
,
Géza Tóth
Lecture Notes in Computer Science
5417
, 2009, pp. 50-60
On linear forbidden submatrices
Balázs Keszegh
Journal of Combinatorial Theory Series A
116
(1), 2009, pp. 232-241
Polychromatic colorings of
n
-dimensional guillotine-partitions
Balázs Keszegh
Lecture Notes in Computer Science
5092
, 2008, pp. 110-118
Polychromatic colorings of
n
-dimensional guillotine-partitions
Balázs Keszegh
Lecture Notes in Computer Science
5092
, 2008, pp. 110-118
Drawing cubic graphs with at most five slopes
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
,
Géza Tóth
Lecture Notes in Computer Science
4372
, 2007, pp. 114-125