Domingos Dellamonica Jr.

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
On induced Ramsey numbers for k-uniform hypergraphs.
Random Struct. Algorithms, 2016

The number of B3-sets of a given cardinality.
J. Comb. Theory, Ser. A, 2016

On the Number of Bh -Sets.
Combinatorics, Probability & Computing, 2016

2015
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Combinatorics, Probability & Computing, 2015

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

Distance Preserving Ramsey Graphs.
Combinatorics, Probability & Computing, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

An Improved Upper Bound on the Density of Universal Random Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

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

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

Hereditary quasirandom properties of hypergraphs.
Combinatorica, 2011

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Rainbow paths.
Discrete Mathematics, 2010

2009
Hereditary quasi-random properties of hypergraphs.
Electronic Notes in Discrete Mathematics, 2009

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

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

Universality of random graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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 Processing, 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...