default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaksim Kitsak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j1]Daniel A. Eisenberg
, David L. Alderson, Maksim Kitsak, Alexander A. Ganin, Igor Linkov:
Network Foundation for Command and Control (C2) Systems: Literature Review. IEEE Access 6: 68782-68794 (2018)
Conference and Workshop Papers
- 2025
- [c2]Davis C. Loose, Megan C. Marcellin, Igor Linkov, Gigi Pavur, Maksim A. Kitsak, Michael A. Deegan, James H. Lambert:
Order Disruption and Resilience of Cyber-Physical Systems of a Metropolitan Region. SysCon 2025: 1-6 - 2021
- [c1]Long Ma, Maksim Kitsak, Piet Van Mieghem:
Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics. COMPLEX NETWORKS 2021: 265-276
Informal and Other Publications
- 2025
- [i13]Yongding Tian, Zaid Al-Ars, Maksim Kitsak, H. Peter Hofstee:
Low-Loss Space in Neural Networks is Continuous and Fully Connected. CoRR abs/2505.02604 (2025) - 2024
- [i12]Yongding Tian, Zaid Al-Ars, Maksim Kitsak, H. Peter Hofstee:
Vanishing Variance Problem in Fully Decentralized Neural-Network Systems. CoRR abs/2404.04616 (2024) - 2023
- [i11]Gabriel Budel, Ying Jin, Piet Van Mieghem, Maksim Kitsak:
Topological properties and organizing principles of semantic networks. CoRR abs/2304.12940 (2023) - 2022
- [i10]Maksim Kitsak, Alexander A. Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov:
Finding shortest and nearly shortest path nodes in large substantially incomplete networks. CoRR abs/2204.04117 (2022) - 2021
- [i9]Long Ma, Maksim Kitsak, Piet Van Mieghem:
Two-population SIR model and strategies to reduce mortality in pandemics. CoRR abs/2109.05964 (2021) - 2020
- [i8]Maksim Kitsak:
Latent Geometry for Complementarity-Driven Networks. CoRR abs/2003.06665 (2020) - [i7]Ivan Voitalov, Pim van der Hoorn, Maksim Kitsak, Fragkiskos Papadopoulos, Dmitri V. Krioukov:
Weighted hypersoft configuration model. CoRR abs/2007.00124 (2020) - 2019
- [i6]Maksim Kitsak, Ivan Voitalov, Dmitri V. Krioukov:
Link prediction with hyperbolic geometry. CoRR abs/1903.08810 (2019) - 2016
- [i5]Maksim Kitsak, Fragkiskos Papadopoulos, Dmitri V. Krioukov:
Latent geometry of bipartite networks. CoRR abs/1610.09048 (2016) - 2015
- [i4]Maksim Kitsak, Ahmed Elmokashfi, Shlomo Havlin, Dmitri V. Krioukov:
Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing. CoRR abs/1507.07299 (2015) - 2012
- [i3]Dmitri V. Krioukov, Maksim Kitsak, Robert S. Sinkovits, David Rideout, David Meyer, Marián Boguñá:
Network Cosmology. CoRR abs/1203.2109 (2012) - 2011
- [i2]Maksim Kitsak, Dmitri V. Krioukov:
Hidden Variables in Bipartite Networks. CoRR abs/1104.3184 (2011) - 2010
- [i1]Dmitri V. Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, Marián Boguñá:
Hyperbolic Geometry of Complex Networks. CoRR abs/1006.5169 (2010)
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 2025-08-06 23:18 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:
