default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrii Arman
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Andrii Arman, Andriy V. Bondarenko, Andriy Prymak, Danylo V. Radchenko:
Upper Bounds on Chromatic Number of $\mathbb{E}^n$ in Low Dimensions. Electron. J. Comb. 31(2) (2024)- 2023
- [j11]Andrii Arman
, Vojtech Rödl, Marcelo Tadeu Sales:
Colorful Matchings. SIAM J. Discret. Math. 37(2): 925-950 (2023) - 2022
- [j10]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Independent Sets in Subgraphs of a Shift Graph. Electron. J. Comb. 29(1) (2022) - [j9]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Electron. J. Comb. 29(3) (2022) - 2021
- [j8]Andrii Arman, Bradley Elliott, Vojtech Rödl:
Increasing paths in countable graphs. J. Comb. Theory A 183: 105491 (2021) - [j7]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59(3): 291-314 (2021) - [i3]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Linear-time uniform generation of random sparse contingency tables with specified marginals. CoRR abs/2104.09413 (2021) - [i2]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Every Steiner triple system contains almost spanning d-ary hypertree. CoRR abs/2105.10969 (2021)
2010 – 2019
- 2019
- [j6]Andrii Arman, Sergei Tsaturian:
The Maximum Number of Cycles in a Graph with Fixed Number of Edges. Electron. J. Comb. 26(4): 4 (2019) - [j5]Andrii Arman, Bill Kay, Vojtech Rödl:
A note on weak delta systems. Discret. Math. 342(11): 3034-3042 (2019) - [c1]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast Uniform Generation of Random Graphs with Given Degree Sequences. FOCS 2019: 1371-1379 - [i1]Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. CoRR abs/1905.03446 (2019) - 2018
- [j4]Andrii Arman, Sergei Tsaturian:
A result in asymmetric Euclidean Ramsey theory. Discret. Math. 341(5): 1502-1508 (2018) - 2017
- [j3]Andrii Arman, Vojtech Rödl:
Note on a Ramsey Theorem for Posets with Linear Extensions. Electron. J. Comb. 24(4): 4 (2017) - [j2]Andrii Arman, Troy Retter:
An upper bound for the size of a k-uniform intersecting family with covering number k. J. Comb. Theory A 147: 18-26 (2017) - 2016
- [j1]Andrii Arman, David S. Gunderson, Sergei Tsaturian:
Triangle-free graphs with the maximum number of cycles. Discret. Math. 339(2): 699-711 (2016)
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-01-20 22:57 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:
