Gábor Damásdi

27 papers A* 4A 1Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Saturation results around the Erdős-Szekeres problem.
Eur. J. Comb.
Gábor Damásdi, Zichao Dong, Manfred Scheucher, Ji Zeng
2025 J jnl
Coloring Geometric Hypergraphs: A Survey.
CoRR
Gábor Damásdi, Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2025 J jnl
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
Comb.
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2025 J jnl
Orientation of good covers.
Discret. Math. Theor. Comput. Sci.
Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi
2025 A* conf
The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2025 J jnl
The complexity of recognizing $ABAB$-free hypergraphs.
Discret. Math. Theor. Comput. Sci.
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh
2024 A* conf
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
On the number of digons in arrangements of pairwise intersecting circles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
Orientation of Convex Sets.
Electron. J. Comb.
Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi
2024 A* conf
Saturation Results Around the Erdős-Szekeres Problem.
SoCG
Gábor Damásdi, Zichao Dong, Manfred Scheucher, Ji Zeng
2024 J jnl
The maximum number of digons formed by pairwise crossing pseudocircles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2023 J jnl
Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen.
Discret. Math.
János Barát, Zoltán L. Blázsik, Gábor Damásdi
2023 J jnl
Odd Wheels Are Not Odd-Distance Graphs.
Discret. Comput. Geom.
Gábor Damásdi
2022 J jnl
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks.
Comb.
Gábor Damásdi, Dömötör Pálvölgyi
2022 A* conf
Three-Chromatic Geometric Hypergraphs.
SoCG
Gábor Damásdi, Dömötör Pálvölgyi
2021 J jnl
Adaptive majority problems for restricted query graphs and for weighted sets.
Discret. Appl. Math.
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2021 J jnl
Colorful Helly-type theorems for the volume of intersections of convex bodies.
J. Comb. Theory A
Gábor Damásdi, Viktória Földvári, Márton Naszódi
2021 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
SIAM J. Discret. Math.
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2021 J jnl
Saturation problems in the Ramsey theory of graphs, posets and point sets.
Eur. J. Comb.
Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora
2021 J jnl
Three-chromatic geometric hypergraphs.
CoRR
Gábor Damásdi, Dömötör Pálvölgyi
2020 A conf
Odd Wheels Are Not Odd-distance Graphs.
GD
Gábor Damásdi
2020 J jnl
Odd wheels are not odd-distance graphs.
CoRR
Gábor Damásdi
2020 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
CoRR
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2020 J jnl
Realizing an m-uniform four-chromatic hypergraph with disks.
CoRR
Gábor Damásdi, Dömötör Pálvölgyi
2020 — conf
Realizing m-uniform four-chromatic hypergraphs with disks.
CCCG
Gábor Damásdi, Dömötör Pálvölgyi
2020 J jnl
Triangle areas in line arrangements.
Discret. Math.
Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy
2019 J jnl
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.
CoRR
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener