default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDomingos Dellamonica Jr.
Person information
- affiliation: Emory University, Druid Hills, Georgia, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j19]Domingos Dellamonica Jr.
, Vojtech Rödl:
Packing Paths in Steiner Triple Systems. SIAM J. Discret. Math. 33(3): 1669-1690 (2019)- 2016
- [j18]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Comb. Probab. Comput. 25(1): 108-129 (2016) - [j17]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory A 142: 44-76 (2016) - [j16]Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl:
On induced Ramsey numbers for k-uniform hypergraphs. Random Struct. Algorithms 48(1): 5-20 (2016) - 2015
- [j15]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. Comb. Probab. Comput. 24(2): 407-437 (2015) - [j14]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46(2): 274-299 (2015) - 2012
- [j13]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - [j12]Domingos Dellamonica Jr., Vojtech Rödl:
Distance Preserving Ramsey Graphs. Comb. Probab. Comput. 21(4): 554-581 (2012) - [j11]Domingos Dellamonica Jr.:
The size-Ramsey number of trees. Random Struct. Algorithms 40(1): 49-73 (2012) - [j10]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discret. Math. 26(1): 15-29 (2012) - [j9]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of Random Graphs. SIAM J. Discret. Math. 26(1): 353-374 (2012) - [c5]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN 2012: 231-242 - 2011
- [j8]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasirandom properties of hypergraphs. Comb. 31(2): 165-182 (2011) - [j7]Domingos Dellamonica Jr., Vojtech Rödl:
A note on Thomassenʼs conjecture. J. Comb. Theory B 101(6): 509-515 (2011) - [j6]Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl:
On a conjecture of Thomassen concerning subgraphs of large girth. J. Graph Theory 67(4): 316-331 (2011) - [c4]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. APPROX-RANDOM 2011: 495-506 - 2010
- [j5]Domingos Dellamonica Jr., Colton Magnant, Daniel M. Martin:
Rainbow paths. Discret. Math. 310(4): 774-781 (2010)
2000 – 2009
- 2009
- [j4]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasi-random properties of hypergraphs. Electron. Notes Discret. Math. 34: 495-499 (2009) - 2008
- [j3]Domingos Dellamonica Jr., Yoshiharu Kohayakawa:
An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications. Electron. J. Comb. 15(1) (2008) - [j2]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger:
On the Resilience of Long Cycles in Random Graphs. Electron. J. Comb. 15(1) (2008) - [c3]Domingos Dellamonica Jr.:
Simpler Constant-Seed Condensers. LATIN 2008: 664-675 - [c2]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of random graphs. SODA 2008: 782-788 - 2007
- [j1]Domingos Dellamonica Jr., Paulo J. S. Silva, Carlos Humes Jr., Nina S. T. Hirata, Junior Barrera:
An Exact Algorithm for Optimal MAE Stack Filter Design. IEEE Trans. Image Process. 16(2): 453-462 (2007) - 2006
- [c1]Domingos Dellamonica Jr., Yoshiharu Kohayakawa:
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. SODA 2006: 1038-1044
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-06-10 21:21 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:
