default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJúlia Komjáthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Zsolt Bartha
, Júlia Komjáthy, Järvi Raes:
Sharp bound on the truncated metric dimension of trees. Discret. Math. 346(8): 113410 (2023)- 2022
- [j7]Remco van der Hofstad, Júlia Komjáthy, Viktória Vadon:
Phase transition in random intersection graphs with communities. Random Struct. Algorithms 60(3): 406-461 (2022) - 2021
- [j6]Júlia Komjáthy, Gergely Ódor:
Metric dimension of critical Galton-Watson trees and linear preferential attachment trees. Eur. J. Comb. 95: 103317 (2021) - 2020
- [j5]Joost Jorritsma, Júlia Komjáthy:
Weighted distances in scale-free preferential attachment models. Random Struct. Algorithms 57(3): 823-859 (2020) - 2019
- [j4]Viktória Vadon, Júlia Komjáthy, Remco van der Hofstad:
A new model for overlapping communities with arbitrary internal structure. Appl. Netw. Sci. 4(1): 42:1-42:19 (2019) - [j3]Júlia Komjáthy, Roland Molontay, Károly Simon:
Transfinite fractal dimension of trees and hierarchical scale-free graphs. J. Complex Networks 7(5): 764-791 (2019) - 2017
- [j2]Enrico Baroni, Remco van der Hofstad, Júlia Komjáthy:
Nonuniversality of weighted random graphs with infinite variance degree. J. Appl. Probab. 54(1): 146-164 (2017) - 2014
- [j1]Shankar Bhamidi, Remco van der Hofstad, Júlia Komjáthy:
The front of the epidemic spread and first passage percolation. J. Appl. Probab. 51(A): 101-121 (2014)
Editorship
- 2015
- [e1]David F. Gleich, Júlia Komjáthy, Nelly Litvak:
Algorithms and Models for the Web Graph - 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015, Proceedings. Lecture Notes in Computer Science 9479, Springer 2015, ISBN 978-3-319-26783-8 [contents]
Informal and Other Publications
- 2023
- [i5]Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller:
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I. CoRR abs/2309.11840 (2023) - [i4]Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller:
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II. CoRR abs/2309.11880 (2023) - 2020
- [i3]Júlia Komjáthy, John Lapinskas, Johannes Lengler:
Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. CoRR abs/2004.01149 (2020) - 2019
- [i2]Joost Jorritsma, Júlia Komjáthy:
Weighted distances in scale-free preferential attachment models. CoRR abs/1907.01907 (2019) - 2018
- [i1]Júlia Komjáthy, Roland Molontay, Károly Simon:
Modified box dimension of trees and hierarchical scale-free graphs. CoRR abs/1808.02674 (2018)
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 22:14 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:
