default search action
Dávid Hudák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Alan Chalker
, Robert L. DeLeon
Open OnDemand: Connecting Computing Power With Powerful Minds. PEARC 2024: 16:1-16:8 - 2023
- [c5]Camila Roa
End-to-end Integration of Scientific Workflows on Distributed Cyberinfrastructures: Challenges and Lessons Learned with an Earth Science Application. UCC 2023: 17 - [c4]Mats Rynge
ACCESS Pegasus: Bringing Workflows to the ACCESS Masses. PEARC 2023: 478-480 - 2022
- [c3]Lubomir Antoni, Erik Bruoth, Peter Bugata, Peter Bugata Jr., Dávid Gajdos, Simon Horvát, Dávid Hudák, Vladimíra Kmecová, Richard Stana, Monika Stanková, Alexander Szabari, Gabriela Vozáriková:
Cordelia: An Application for Automatic ECG Diagnostics. AIME 2022: 416-420 - [c2]L'ubomír Antoni, Erik Bruoth, Peter Bugata Jr., Peter Bugata, Dávid Gajdos, Dávid Hudák, Vladimíra Kmecová, Monika Stanková, Alexander Szabari, Gabriela Vozáriková:
Murmur Identification Using Supervised Contrastive Learning. CinC 2022: 1-4 - 2021
- [c1]L'ubomír Antoni, Erik Bruoth, Peter Bugata
A Two-Phase Multilabel ECG Classification Using One-Dimensional Convolutional Neural Network and Modified Labels. CinC 2021: 1-4
2010 – 2019
- 2014
- [j9]Július Czap
An upper bound on the sum of powers of the degrees of simple 1-planar graphs. Discret. Appl. Math. 165: 146-151 (2014) - [j8]Dávid Hudák, Borut Luzar
Strong edge-coloring of planar graphs. Discret. Math. 324: 41-49 (2014) - 2013
- [j7]Július Czap, Dávid Hudák:
On Drawings and Decompositions of 1-Planar Graphs. Electron. J. Comb. 20(2): 54 (2013) - 2012
- [j6]Július Czap
1-planarity of complete multipartite graphs. Discret. Appl. Math. 160(4-5): 505-512 (2012) - [j5]Dávid Hudák, Frantisek Kardos, Borut Luzar
Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. 160(9): 1356-1368 (2012) - [j4]Dávid Hudák, Peter Sugerek
Light edges in 1-planar graphs with prescribed minimum degree. Discuss. Math. Graph Theory 32(3): 545-556 (2012) - [j3]Dávid Hudák, Tomás Madaras
On properties of maximal 1-planar graphs. Discuss. Math. Graph Theory 32(4): 737-747 (2012) - 2011
- [j2]Dávid Hudák, Tomás Madaras:
On local properties of 1-planar graphs with high minimum degree. Ars Math. Contemp. 4(2): 245-254 (2011)
2000 – 2009
- 2009
- [j1]Dávid Hudák, Tomás Madaras
On local structure of 1-planar graphs of minimum degree 5 and girth 4. Discuss. Math. Graph Theory 29(2): 385-400 (2009)
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-10-07 21:24 CEST 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: