Domingos Dellamonica Jr.

Orcid: 0000-0003-0305-3071

Affiliations:
  • Emory University, Druid Hills, Georgia, USA


According to our database1, Domingos Dellamonica Jr. authored at least 21 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Packing Paths in Steiner Triple Systems.
SIAM J. Discret. Math., 2019

2016
On induced Ramsey numbers for <i>k</i>-uniform hypergraphs.
Random Struct. Algorithms, 2016

The number of B<sub>3</sub>-sets of a given cardinality.
J. Comb. Theory, Ser. A, 2016

On the Number of <i>B<sub>h</sub> </i>-Sets.
Comb. Probab. Comput., 2016

2015
An improved upper bound on the density of universal random graphs.
Random Struct. Algorithms, 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Comb. Probab. Comput., 2015

2012
Universality of Random Graphs.
SIAM J. Discret. Math., 2012

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
SIAM J. Discret. Math., 2012

The size-Ramsey number of trees.
Random Struct. Algorithms, 2012

Distance Preserving Ramsey Graphs.
Comb. Probab. Comput., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012

2011
On a conjecture of Thomassen concerning subgraphs of large girth.
J. Graph Theory, 2011

A note on Thomassenʼs conjecture.
J. Comb. Theory, Ser. B, 2011

Hereditary quasirandom properties of hypergraphs.
Comb., 2011

2010
Rainbow paths.
Discret. Math., 2010

2009
Hereditary quasi-random properties of hypergraphs.
Electron. Notes Discret. Math., 2009

2008
On the Resilience of Long Cycles in Random Graphs.
Electron. J. Comb., 2008

An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications.
Electron. J. Comb., 2008

Simpler Constant-Seed Condensers.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
An Exact Algorithm for Optimal MAE Stack Filter Design.
IEEE Trans. Image Process., 2007

2006
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006


  Loading...