Artikel dengan mandat akses publik - Balázs KeszeghPelajari lebih lanjut
Tidak tersedia di mana pun: 1
An abstract approach to polychromatic coloring
B Keszegh, D Pálvölgyi
Mandat: Magyar Tudományos Akadémia, National Office for Research, Development and …
Tersedia di suatu tempat: 56
Drawing planar graphs of bounded degree with few slopes
B Keszegh, J Pach, D Palvolgyi
SIAM Journal on Discrete Mathematics 27 (2), 1171-1183, 2013
Mandat: Swiss National Science Foundation, Hungarian Scientific Research Fund
Graphs that admit right angle crossing drawings
K Arikushi, R Fulek, B Keszegh, F Morić, CD Tóth
Computational Geometry 45 (4), 169-177, 2012
Mandat: Swiss National Science Foundation, Hungarian Scientific Research Fund
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
P Cheilaris, B Keszegh, D Pálvölgyi
SIAM Journal on Discrete Mathematics 27 (4), 1775-1787, 2013
Mandat: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
Saturating sperner families
D Gerbner, B Keszegh, N Lemons, C Palmer, D Pálvölgyi, B Patkós
Graphs and Combinatorics 29 (5), 1355-1364, 2013
Mandat: Hungarian Scientific Research Fund
Octants are cover-decomposable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 47, 598-609, 2012
Mandat: Hungarian Scientific Research Fund
Induced and non-induced poset saturation problems
B Keszegh, N Lemons, RR Martin, D Pálvölgyi, B Patkós
Journal of Combinatorial Theory, Series A 184, 105497, 2021
Mandat: US Department of Energy, Magyar Tudományos Akadémia, National Office for …
Coloring intersection hypergraphs of pseudo-disks
B Keszegh
Discrete & Computational Geometry 64 (3), 942-964, 2020
Mandat: Magyar Tudományos Akadémia, National Office for Research, Development and …
Octants are cover-decomposable into many coverings
B Keszegh, D Pálvölgyi
Computational Geometry 47 (5), 585-588, 2014
Mandat: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
Convex polygons are self-coverable
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 51 (4), 885-895, 2014
Mandat: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
E Ackerman, B Keszegh, D Pálvölgyi
SIAM Journal on Discrete Mathematics 34 (4), 2250-2269, 2020
Mandat: Magyar Tudományos Akadémia, European Commission, National Office for …
On the tree search problem with non-uniform costs
F Cicalese, B Keszegh, B Lidický, D Pálvölgyi, T Valla
Theoretical Computer Science 647, 22-32, 2016
Mandat: US National Science Foundation, Magyar Tudományos Akadémia, Hungarian …
Coloring points with respect to squares
E Ackerman, B Keszegh, M Vizer
Discrete & Computational Geometry 58, 757-784, 2017
Mandat: Magyar Tudományos Akadémia, National Office for Research, Development and …
Improved upper bounds on the reflexivity of point sets
E Ackerman, O Aichholzer, B Keszegh
Computational Geometry 42 (3), 241-249, 2009
Mandat: Austrian Science Fund
On the size of planarly connected crossing graphs
E Ackerman, B Keszegh, M Vizer
Journal of Graph Algorithms and Applications 22 (1), 11-22., 2018
Mandat: Magyar Tudományos Akadémia, National Office for Research, Development and …
On the complexity of the partial least-squares matching Voronoi diagram
M Henze, R Jaume, B Keszegh
Proc. 29th European Workshop on Computational Geometry, 193-196, 2013
Mandat: German Research Foundation, Hungarian Scientific Research Fund
Proper coloring of geometric hypergraphs
B Keszegh, D Pálvölgyi
Discrete & Computational Geometry 62 (3), 674-689, 2019
Mandat: Magyar Tudományos Akadémia, Hungarian Scientific Research Fund, European …
Counting houses of Pareto optimal matchings in the house allocation problem
A Asinowski, B Keszegh, T Miltzow
Discrete Mathematics 339 (12), 2919-2932, 2016
Mandat: German Research Foundation, Magyar Tudományos Akadémia, Hungarian Scientific …
Saturation problems about forbidden 0-1 submatrices
R Fulek, B Keszegh
SIAM Journal on Discrete Mathematics 35 (3), 1964-1977, 2021
Mandat: Magyar Tudományos Akadémia, National Office for Research, Development and …
Partial-matching RMS distance under translation: Combinatorics and algorithms
R Ben-Avraham, M Henze, R Jaume, B Keszegh, OE Raz, M Sharir, ...
Algorithmica 80, 2400-2421, 2018
Mandat: US National Science Foundation, German Research Foundation, Banking …
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer