Items where Author is "Keszegh, Balázs"

Article

Gerbner, Dániel and Keszegh, Balázs and Nagy, Kartal and Patkós, Balázs and Wiener, Gábor (2024) Cooperation in combinatorial search. OPTIMIZATION LETTERS. ISSN 1862-4472 (In Press)

Ackerman, Eyal and Keszegh, Balázs and Pálvölgyi, Dömötör (2024) On tangencies among planar curves with an application to coloring L-shapes. EUROPEAN JOURNAL OF COMBINATORICS, 121. No. 103837. ISSN 0195-6698 (In Press)

Ackerman, Eyal and Keszegh, Balázs (2024) On the number of tangencies among 1-intersecting x-monotone curves. EUROPEAN JOURNAL OF COMBINATORICS, 118. ISSN 0195-6698

Ágoston, Péter and Damásdi, Gábor and Keszegh, Balázs and Pálvölgyi, Dömötör (2024) Orientation of convex sets. ELECTRONIC JOURNAL OF COMBINATORICS. ISSN 1097-1440

Gerbner, Dániel and Keszegh, Balázs and Lenger, Dániel Antal and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2023) On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. DISCRETE APPLIED MATHEMATICS, 341. pp. 196-203. ISSN 0166-218X

Bošković, Vladimir and Keszegh, Balázs (2023) Saturation of Ordered Graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801

Keszegh, Balázs (2023) A new discrete theory of pseudoconvexity. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 25 (1). ISSN 1462-7264

Keszegh, Balázs and Pálvölgyi, Dömötör (2023) The number of tangencies between two families of curves. COMBINATORICA. ISSN 0209-9683

Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2022) An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. DISCRETE AND COMPUTATIONAL GEOMETRY : AN INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE. pp. 1-29. ISSN 0179-5376 (print); 1432-0444 (online)

Keszegh, Balázs (2022) Coloring directed hypergraphs. DISCRETE MATHEMATICS, 346 (&). ISSN 0012-365X

Keszegh, Balázs (2022) Discrete Helly-type theorems for pseudohalfplanes. EUROPEAN JOURNAL OF COMBINATORICS, 101. ISSN 0195-6698

Keller, Chaya and Keszegh, Balázs and Pálvölgyi, Dömötör (2022) On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. ELECTRONIC JOURNAL OF COMBINATORICS, 29 (3). ISSN 1097-1440

Ackerman, Eyal and Keszegh, Balázs and Pálvölgyi, Dömötör (2021) Coloring Delaunay-edges and their generalizations. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 96. ISSN 0925-7721

Keszegh, Balázs and Lemons, Nathan and Martin, Ryan R. and Pálvölgyi, Dömötör and Patkós, Balázs (2021) Induced and Non-Induced Poset Saturation Problems. JOURNAL OF COMBINATORIAL THEORY, SERIES A, 184. pp. 1-20. ISSN 0097-3165 (print); 1096-0899 (online)

Radoslav, Fulek and Keszegh, Balázs (2021) Saturation problems about forbidden 0-1 submatrices. SIAM JOURNAL ON DISCRETE MATHEMATICS, 35 (3). pp. 1964-1977. ISSN 0895-4801

Damásdi, Gábor and Keszegh, Balázs and Malec, D. and Tompkins, Casey and Wang, Z. Y. (2021) Saturation problems in the Ramsey theory of graphs, posets and point sets. EUROPEAN JOURNAL OF COMBINATORICS, 95. ISSN 0195-6698

Damásdi, Gábor and Gerbner, Dániel and Katona, Gyula and Keszegh, Balázs and Lenger, Dániel and Methuku, Abhishek and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2020) Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X

Keszegh, Balázs and Pálvölgyi, Dömötör (2020) Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. JOURNAL OF COMPUTATIONAL GEOMETRY, 11 (1). pp. 354-370. ISSN 1920-180X

Gerbner, Dániel and Keszegh, Balázs and Patkós, Balázs (2020) Generalized forbidden subposet problems. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 37. pp. 389-410. ISSN 0167-8094

Gerbner, Dániel and Keszegh, Balázs and Methuku, Abhishek and Nagy, Dániel and Patkós, Balázs and Tompkins, Casey (2020) Set systems related to a house allocation problem. DISCRETE MATHEMATICS, 343 (7). ISSN 0012-365X

Keszegh, Balázs (2020) Two-coloring triples such that in each color class every element is missed at least once. GRAPHS AND COMBINATORICS. ISSN 0911-0119

Keszegh, Balázs and Zhu, X. (2020) A note about online nonrepetitive coloring k-trees. DISCRETE APPLIED MATHEMATICS, 285. pp. 108-112. ISSN 0166-218X

Damásdi, Gábor and Gerbner, Dániel and Katona, Gyula and Methuku, Abhishek and Keszegh, Balázs and Lenger, Dániel and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2019) Adaptive majority problems for restricted query graphs and for weighted sets. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 601-609. ISSN 0862-9544

Damásdi, Gábor and Gerbner, Dániel and Katona, Gyula and Keszegh, Balázs and Lenger, Dániel and Methuku, Abhishek and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2019) Adaptive Majority Problemsfor Restricted Query Graphsand for Weighted Sets. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 601-609. ISSN 0862-9544

Keszegh, Balázs and Pálvölgyi, Dömötör (2019) An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. JOURNAL OF COMPUTATIONAL GEOMETRY, 10 (1). pp. 1-26. ISSN 1920-180X

Gerbner, Dániel and Keszegh, Balázs and Methuku, Abhishek and Patkós, Balázs and Vizer, Máté (2019) An improvement on the maximum number of k-dominating independent sets. JOURNAL OF GRAPH THEORY, in pre. ISSN 0364-9024

Gerbner, Dániel and Keszegh, Balázs and Mészáros, Gábor and Patkós, Balázs and Vizer, Máté (2018) Line Percolation in Finite Projective Planes. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801

Gerbner, Dániel and Keszegh, Balázs and Palmer, Cory and Patkós, Balázs (2018) On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM JOURNAL ON DISCRETE MATHEMATICS, 32 (1). pp. 266-279. ISSN 0895-4801

Keszegh, Balázs and Zhu, Xuding (2017) Choosability and paintability of the lexicographic product of graphs. DISCRETE APPLIED MATHEMATICS, 223. pp. 84-90. ISSN 0166-218X

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2017) Coloring Points with Respect to Squares. DISCRETE AND COMPUTATIONAL GEOMETRY. pp. 1-28. ISSN 0179-5376 (In Press)

Győri, Ervin and Keszegh, Balázs (2017) On the number of edge-disjoint triangles in K4-free graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 557-560. ISSN 1571-0653

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2017) On the size of planarly connected crossing graphs. JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS. ISSN 1526-1719

Ben-Avraham, R. and Henze, M. and Jaume, R. and Keszegh, Balázs and Raz, O. E. (2017) Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. ALGORITHMICA. pp. 1-22. ISSN 0178-4617 (In Press)

Gerbner, Dániel and Keszegh, Balázs and Pálvölgyi, Dömötör and Günter, Rote and Wiener, Gábor (2017) Search for the end of a path in the d-dimensional grid and in other graphs. ARS MATHEMATICA CONTEMPORANEA, 12 (2). pp. 301-314. ISSN 1855-3966

Keszegh, Balázs and Zhu, Xuding (2016) Choosability and paintability of the lexicographic product of graphs. DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X (Submitted)

Ackerman, Eyal and Keszegh, Balázs and Vizer, Máté (2016) Coloring points with respect to squares. Leibniz International Proceedings in Informatics (LIPIcs), 2nd International Symposium on Computational Geometry (SoCG 2016), 51. 5:1-5:16. ISSN 1868-8969

Asinowski, Andrei and Keszegh, Balázs and Miltzow, Tillmann (2016) Counting houses of Pareto optimal matchings in the house allocation problem. DISCRETE MATHEMATICS, 339 (12). pp. 2919-2932. ISSN 0012-365X

Gerbner, Dániel and Keszegh, Balázs and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2016) Finding a non-minority ball with majority answers. DISCRETE APPLIED MATHEMATICS, 219 (11). pp. 18-31. ISSN 0166-218X

Győri, Ervin and Keszegh, Balázs (2016) On the number of edge-disjoint triangles in K4-free graphs. COMBINATORICA. ISSN 0209-9683 (In Press)

Ackerman, Eyal and Keszegh, Balázs and Vizer, Máté (2016) On the size of planarly connected crossing graphs. Lecture Notes in Computer Science (LNCS) : Proceedings of Graph Drawing 2016. (In Press)

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2016) On the size of planarly connected crossing graphs. LECTURE NOTES IN COMPUTER SCIENCE, 9801. pp. 311-320. ISSN 0302-9743

Cicalese, Ferdinando and Keszegh, Balázs and Lidicky, Bernard and Pálvölgyi, Dömötör and Valla, Tomáš (2016) On the tree search problem with non-uniform costs. THEORETICAL COMPUTER SCIENCE, 647. pp. 22-32. ISSN 0304-3975

Gerbner, Dániel and Keszegh, Balázs and Palmer, Cory and Pálvölgyi, Dömötör (2016) Topological orderings of weighted directed acyclic graphs. INFORMATION PROCESSING LETTERS, 116 (9). pp. 564-568. ISSN 0020-0190

Gerbner, Dániel and Keszegh, Balázs and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2015) Finding a majority ball with majority answers. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 49. megj. alatt. ISSN 1571-0653 (Submitted)

Keszegh, Balázs and Pálvölgyi, Dömötör (2015) More on decomposing coverings by octants. Journal of Computational Geometry, 6 (1). pp. 300-315. ISSN 1920-180X, ESSN: 1920-180X

Keszegh, Balázs and Lemons, Nathan and Pálvölgyi, Dömötör (2015) Online and Quasi-online Colorings of Wedges and Intervals. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1 (1). pp. 1-21. ISSN 0167-8094

Gerbner, Dániel and Keszegh, Balázs and Pálvölgyi, Dömötör and Rote, Günter and Wiener, Gábor (2015) Search for the end of a path in the d-dimensional grid and in other graphs. Ars Mathematica Contemporanea. (In Press)

Keszegh, Balázs and Pálvölgyi, Dömötör (2014) Convex Polygons are Self-Coverable. Discrete & Computational Geometry, 51 (4). pp. 885-895. ISSN 0179-5376

Asinowski, Andrei and Keszegh, Balázs and Miltzow, Tillmann (2014) Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. Fun with Algorithms Lecture Notes in Computer Science, 8496. pp. 301-312. ISSN 0302-9743

Keszegh, Balázs (2014) Covering Paths and Trees for Planar Grids. Geombinatorics Quarterly, 24 (1). pp. 1-5.

Ben-Avraham, Rinat and Henze, Matthias and Jaume, Rafel and Keszegh, Balázs and Raz, Orit E. and Sharir, Micha and Tubis, Igor (2014) Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. Algorithms - ESA 2014 Lecture Notes in Computer Science, 8737. pp. 100-111. ISSN 0302-9743

Keszegh, Balázs and Patkós, Balázs and Zhu, Xuding (2014) Nonrepetitive colorings of lexicographic product of paths and other graphs. Discrete Mathematics and Theoretical Computer Science (DMTCS), 16 (2). pp. 97-110. ISSN 1462-7264, ESSN: 1365-8050

Keszegh, Balázs and Pálvölgyi, Dömötör (2014) Octants are Cover Decomposable into Many Coverings. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 47 (5). pp. 585-588. ISSN 0925-7721

Keszegh, Balázs and Pálvölgyi, Dömötör (2014) Octants are cover-decomposable into many coverings. Computational Geometry, 47 (5). pp. 585-588. ISSN 09257721

Keszegh, Balázs and Lemons, Nathan and Pálvölgyi, Dömötör (2013) Online and quasi-online colorings of wedges and intervals. LECTURE NOTES IN COMPUTER SCIENCE, 7741. pp. 292-306. ISSN 0302-9743

Gerbner, Dániel and Keszegh, Balázs and Lemons, Nathan and Palmer, Cory and Pálvölgyi, Dömötör and Patkós, Balázs (2013) Saturating Sperner families. GRAPHS AND COMBINATORICS, 29 (5). pp. 1355-1364. ISSN 0911-0119

Cheilaris, Panagiotis and Keszegh, Balázs and Pálvölgyi, Dömötör (2013) Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM Journal on Discrete Mathematics, 27 (4). pp. 1775-1787. ISSN 0895-4801

Book Section

Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2020) An almost optimal bound on the number of intersections of two simple polygons. In: 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz-Zentrum für Informatik, Wadern. ISBN 9783959771436

Keszegh, Balázs and Pálvölgyi, Dömötör (2017) Proper coloring of geometric hypergraphs. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 471-4715. ISBN 9783959770385

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2016) Coloring points with respect to squares. In: Coloring Points with Respect to Squares. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 5.1-5.16. ISBN 978-3-95977-009-5

Cicalese, F. and Keszegh, Balázs and Lidicky, Bernard and Pálvölgyi, Dömötör and Valla, Tomáš (2016) On the tree search problem with non-uniform costs. In: Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science (9224). Springer, Berlin, pp. 90-102. ISBN 978-3-662-53173-0

Keszegh, Balázs and Pálvölgyi, Dömötör (2016) An abstract approach to polychromatic coloring. In: Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science (9224). Springer, Berlin, pp. 266-280. ISBN 978-3-662-53173-0

Conference or Workshop Item

Ackerman, Eyal and Keszegh, Balázs (2023) On the Number of Tangencies Among 1-Intersecting Curves. In: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), 2023.08.28.- 2023.09.01., Prága.

Cicalese, F. and Keszegh, Balázs and Lidicky, Bernard and Pálvölgyi, Dömötör and Valla, Tomás (2015) On the Tree Search Problem with Non-uniform Costs. In: 41st International Workshop on Graph-Theoretic Concepts in Computer Science, 2015. June 17-19., Munich, Germany.

Keszegh, Balázs and Pálvölgyi, Dömötör (2015) An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. In: 21st International Workshop on Graph-Theoretic Concepts in Computer Science, 2015. June 17-19., Munich, Germany. (In Press)