![](img/space.gif) |
Ezen az oldalon az NKFI Elektronikus Pályázatkezelő Rendszerében nyilvánosságra hozott projektjeit tekintheti meg.
vissza »![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
|
![](img/print_ver.gif) |
Közleményjegyzék |
|
|
E Ackerman, B Keszegh, M Vizer: Coloring points with respect to squares, Proceedings of the 32nd International Symposium on Computational Geometry („közlésre elfogadva”), 2016 | B. Keszegh, D. Pálvölgyi: An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes, LNCS 9224, Proceedings of WG 2015, 266-280., 2016 | Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi: Online and Quasi-online Colorings of Wedges and Intervals, ORDER 1: (1) 1-21, 2015 | Balázs Keszegh, Dömötör Pálvölgyi: More on decomposing coverings by octants, J COMPUT GEOM 6: (1) 300-315, 2015 | Ervin Győri, Balázs Keszegh: On the number of edge-disjoint triangles in K4-free graphs, COMBINATORICA &: &, 2016 | E Ackerman, B Keszegh, M Vizer: On the size of planarly connected crossing graphs, Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization („közlésre elfogadva”), 2016 | R. Ben-Avraham, M. Henze, R. Jaume, B. Keszegh, O. E. Raz, M. Sharir, I. Tubis: Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms, Algorithmica („közlésre elfogadva”), 2016 | D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Rote, G. Wiener: Search for the end of a path in the d-dimensional grid and in other graphs, Ars Mathematica Contemporanea („közlésre elfogadva”), 2016 | F. Cicalese, B. Keszegh, B. Lidicky, D. Pálvölgyi, T. Valla: On the Tree Search Problem with Non-uniform Costs, Theoretical Computer Science („közlésre elfogadva”), 2016 | B Keszegh, B Patkos, X Zhu: Nonrepetitive colorings of lexicographic product of paths and other graphs, DISCRETE MATH THEOR 16: (2) 97-110, 2014 | Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow: Counting houses of Pareto optimal matchings in the house allocation problem, DISCRETE MATH 339: (12) 2919-2932, 2016 | B. Keszegh, D. Pálvölgyi: An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes, LNCS Proceedings of WG 2015, to appear, 2015 | D. Gerbner, B. Keszegh, D. Pálvölgyi, B. Patkós, G. Wiener and M. Vizer: Finding a majority ball with majority answers, ENDM Proceedings of Eurocomb 2015, to appear, 2015 | D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Rote, G. Wiener: Search for the end of a path in the d-dimensional grid and in other graphs, ARS MATHEMATICA CONTEMPORANEA, accepted, 2015 | D. Gerbner, B. Keszegh, D. Pálvölgyi, B. Patkós, G. Wiener and M. Vizer: Finding a majority ball with majority answers, Electronic Notes in Discrete Mathematics 49, 345-351., 2015 | Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi: Topological orderings of weighted directed acyclic graphs, INFORM PROCESS LETT 116: (9) 564-568, 2016 | Panagiotis Cheilaris, Keszegh Balázs, Pálvölgyi Dömötör: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs, SIAM J DISCRETE MATH 27: (4) 1775-1787, 2013 | Rinat Ben-Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis: Minimum Partial Matching and Hausdorff RMS-Distance Under Translation: Combinatorics and Algorithms, 22nd European Symposium on Algorithms (ESA 2014) Proceedings, 2014 | F. Cicalese, B. Keszegh, B. Lidicky, D. Pálvölgyi, T. Valla: On the Tree Search Problem with Non-uniform Costs, LNCS Proceedings of WG 2015, to appear, 2015 | B Keszegh: Covering Paths and Trees for Planar Grids, GEOMBINATORICS 24: (1) 1-5, 2014 | B. Keszegh, D. Pálvölgyi: Convex Polygons are Self-Coverable, Discrete and Computational Geometry 51(4), 885-895., 2014 | B. Keszegh: Covering Paths and Trees for Planar Grids, EuroCG 2014 booklet, 2014 | A. Asinowski, B. Keszegh, T. Miltzow: Counting Houses of Pareto Optimal Matchings in the House Allocation Problem, Seventh International Conference on Fun with Algorithms (FUN 2014), Lecture Notes in Computer Science 8496, 301-312., 2014 | Rinat Ben-Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis: Minimum Partial Matching and Hausdorff RMS-Distance Under Translation: Combinatorics and Algorithms, 22nd European Symposium on Algorithms (ESA 2014) Proceedings, 2014 | Panagiotis Cheilaris, Keszegh Balázs, Pálvölgyi Dömötör: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs, SIAM J DISCRETE MATH 27: (4) 1775-1787, 2013 | B Keszegh, D Pálvölgyi: Octants are Cover Decomposable into Many Coverings, COMP GEOM-THEOR APPL 47: (5) 585-588, 2014 |
![](img/space.gif)
|
|
|
![](img/shadow_right_up.gif)
|
![](img/shadow_left_bottom.gif)
|
![](img/shadow_right_bottom.gif)
|
![](img/space.gif) vissza »
|
![](img/space.gif) |
|