default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Damásdi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi:
Orientation of Convex Sets. Electron. J. Comb. 31(4) (2024)- 2023
- [j8]Gábor Damásdi
:
Odd Wheels Are Not Odd-Distance Graphs. Discret. Comput. Geom. 69(2): 327-337 (2023) - [j7]János Barát, Zoltán L. Blázsik, Gábor Damásdi:
Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen. Discret. Math. 346(4): 113281 (2023) - 2022
- [j6]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks. Comb. 42(6): 1027-1048 (2022) - 2021
- [j5]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:
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j4]Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora:
Saturation problems in the Ramsey theory of graphs, posets and point sets. Eur. J. Comb. 95: 103321 (2021) - [j3]Gábor Damásdi, Viktória Földvári, Márton Naszódi:
Colorful Helly-type theorems for the volume of intersections of convex bodies. J. Comb. Theory A 178: 105361 (2021) - [j2]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35(2): 915-927 (2021) - 2020
- [j1]Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy:
Triangle areas in line arrangements. Discret. Math. 343(12): 112105 (2020)
Conference and Workshop Papers
- 2024
- [c5]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG 2024: 3:1-3:14 - [c4]Gábor Damásdi, Zichao Dong, Manfred Scheucher, Ji Zeng:
Saturation Results Around the Erdős-Szekeres Problem. SoCG 2024: 46:1-46:14 - 2022
- [c3]Gábor Damásdi, Dömötör Pálvölgyi:
Three-Chromatic Geometric Hypergraphs. SoCG 2022: 32:1-32:13 - 2020
- [c2]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing m-uniform four-chromatic hypergraphs with disks. CCCG 2020: 258-265 - [c1]Gábor Damásdi:
Odd Wheels Are Not Odd-distance Graphs. GD 2020: 124-134
Informal and Other Publications
- 2024
- [i6]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the number of digons in arrangements of pairwise intersecting circles. CoRR abs/2406.02276 (2024) - 2021
- [i5]Gábor Damásdi, Dömötör Pálvölgyi:
Three-chromatic geometric hypergraphs. CoRR abs/2112.01820 (2021) - 2020
- [i4]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR abs/2001.06367 (2020) - [i3]Gábor Damásdi:
Odd wheels are not odd-distance graphs. CoRR abs/2008.10305 (2020) - [i2]Gábor Damásdi, Dömötör Pálvölgyi:
Realizing an m-uniform four-chromatic hypergraph with disks. CoRR abs/2011.12187 (2020) - 2019
- [i1]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:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
