Induced Forests in Regular Graphs with Large Girth. - Carlos Hoppen; Nicholas C. Wormald (Comb. Probab. Comput., 2008)

Kneser Colorings of Uniform Hypergraphs. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Electron. Notes Discret. Math., 2009)

Property Testing and Parameter Testing for Permutations. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Rudini Menezes Sampaio (SODA, 2010)

Every hereditary permutation property is testable. - Antônio J. O. Bastos; Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

A note on random k-dimensional posets. - Ricardo C. Corrêa; Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Electron. Notes Discret. Math., 2011)

Geodesics and almost geodesic cycles in random regular graphs. - Itai Benjamini; Carlos Hoppen; Eran Ofek; Pawel Pralat; Nicholas C. Wormald (J. Graph Theory, 2011)

Testing permutation properties through subpermutations. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Rudini Menezes Sampaio (Theor. Comput. Sci., 2011)

A note on Gao's algorithm for polynomial factorization. - Carlos Hoppen; Virginia M. Rodrigues; Vilmar Trevisan (Theor. Comput. Sci., 2011)

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Comb. Probab. Comput., 2012)

A note on permutation regularity. - Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Discret. Appl. Math., 2012)

Hypergraphs with many Kneser colorings. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Eur. J. Comb., 2012)

An Unstable Hypergraph Problem with a Unique Optimal Solution. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Information Theory, Combinatorics, and Search Theory, 2013)

Unicyclic Graphs with equal Laplacian Energy - Eliseu Fritscher; Carlos Hoppen; Vilmar Trevisan (CoRR, 2013)

Limits of permutation sequences. - Carlos Hoppen; Yoshiharu Kohayakawa; Carlos Gustavo T. de A. Moreira; Balázs Ráth; Rudini Menezes Sampaio (J. Comb. Theory B, 2013)

Large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král; Hong Liu 010 (CoRR, 2014)

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Eur. J. Comb., 2014)

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. - Carlos Hoppen; Yoshiharu Kohayakawa; Hanno Lefmann (Discret. Math., 2015)

Edge-colorings avoiding a fixed matching with a prescribed color pattern. - Carlos Hoppen; Hanno Lefmann (Eur. J. Comb., 2015)

A rainbow Erdős-Rothschild problem. - Carlos Hoppen; Hanno Lefmann; Knut Odermann (Electron. Notes Discret. Math., 2015)

Edge-colorings avoiding fixed rainbow stars. - Carlos Hoppen; Hanno Lefmann; Knut Odermann; Juliana Sanches (Electron. Notes Discret. Math., 2015)

A coloring problem for intersecting vector spaces. - Carlos Hoppen; Hanno Lefmann; Knut Odermann (Discret. Math., 2016)

Properties of regular graphs with large girth via local algorithms. - Carlos Hoppen; Nicholas C. Wormald (J. Comb. Theory B, 2016)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. - Fabrício Benevides; Carlos Hoppen; Rudini M. Sampaio (Discret. Math., 2017)

Densities in large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král'; Hong Liu 010 (Eur. J. Comb., 2017)

On graphs with a large number of edge-colorings avoiding a rainbow triangle. - Carlos Hoppen; Hanno Lefmann; Knut Odermann (Eur. J. Comb., 2017)

Stability of extremal hypergraphs with applications to an edge-coloring problem. - Lucas de Oliveira Contiero; Carlos Hoppen; Hanno Lefmann; Knut Odermann (Electron. Notes Discret. Math., 2017)

Estimating the distance to a hereditary graph property. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (Electron. Notes Discret. Math., 2017)

Packing arborescences in random digraphs. - Carlos Hoppen; Roberto F. Parente; Cristiane M. Sato (Electron. Notes Discret. Math., 2017)

A pre-test for factoring bivariate polynomials with coefficients in F2. - Luiz Emilio Allem; Carlos Hoppen (Inf. Process. Lett., 2017)

Locating the Eigenvalues for Graphs of Small Clique-Width. - Martin Fürer; Carlos Hoppen; David Pokrass Jacobs; Vilmar Trevisan (LATIN, 2018)

Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. - Carlos Hoppen; Nicholas C. Wormald (Comb., 2018)

Limits of k-dimensional poset sequences. - Ricardo Cordeiro Corrêa; Carlos Hoppen; Rudini Menezes Sampaio (Discret. Appl. Math., 2018)

Edge-colorings avoiding rainbow stars. - Carlos Hoppen; Hanno Lefmann; Knut Odermann; Juliana Sanches (J. Graph Theory, 2018)

Remarks on an Edge-coloring Problem. - Carlos Hoppen; Hanno Lefmann (LAGOS, 2019)

Total Domination in Regular Graphs. - Carlos Hoppen; Giovane Mansan (LAGOS, 2019)

Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. - Carlos Hoppen; Guilherme Oliveira Mota; Roberto F. Parente; Cristiane M. Sato (LAGOS, 2019)

Stability Results for Two Classes of Hypergraphs. - Lucas de Oliveira Contiero; Carlos Hoppen; Hanno Lefmann; Knut Odermann (SIAM J. Discret. Math., 2019)

A spectral clustering approach for the evolution of the COVID-19 pandemic in the state of Rio Grande do Sul, Brazil. - Luiz Emilio Allem; Carlos Hoppen; Matheus Micadei Marzo; Lucas Siviero Sibemberg (CoRR, 2020)

Estimating parameters associated with monotone properties. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (Comb. Probab. Comput., 2020)

Maximum number of r-edge-colorings such that all copies of Kk are rainbow. - Josefran de Oliveira Bastos; Hanno Lefmann; Andy Oertel; Carlos Hoppen; Dionatan Ricardo Schmidt (LAGOS, 2021)

An extension of the rainbow Erdős-Rothschild problem. - Carlos Hoppen; Hanno Lefmann; Denilson Nolibos (Discret. Math., 2021)

Asymptotic bounds on total domination in regular graphs. - Carlos Hoppen; Giovane Mansan (Discret. Math., 2021)

Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. - Lucas de Oliveira Contiero; Carlos Hoppen; Hanno Lefmann; Knut Odermann (J. Graph Theory, 2021)

Rainbow Erdös-Rothschild Problem for the Fano Plane. - Lucas de Oliveira Contiero; Carlos Hoppen; Hanno Lefmann; Knut Odermann (SIAM J. Discret. Math., 2021)

On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (SIAM J. Discret. Math., 2021)

Minimum 2-dominating sets in regular graphs. - Carlos Hoppen; Giovane Mansan (Discret. Appl. Math., 2022)

Counting orientations of graphs with no strongly connected tournaments. - Fábio Botler; Carlos Hoppen; Guilherme Oliveira Mota (Discret. Math., 2022)

Heilbronn triangle-type problems in the unit square [0,1]2. - Fabrício Siqueira Benevides; Carlos Hoppen; Hanno Lefmann; Knut Odermann (Random Struct. Algorithms, 2023)

Graphs with many edge-colorings such that complete graphs are rainbow. - Josefran de Oliveira Bastos; Carlos Hoppen; Hanno Lefmann; Andy Oertel; Dionatan Ricardo Schmidt (Discret. Appl. Math., 2023)

Edge-colorings avoiding patterns in a triangle. - Carlos Hoppen; Hanno Lefmann; Dionatan Ricardo Schmidt (Discret. Math., 2024)

Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. - Martin Fürer; Carlos Hoppen; Vilmar Trevisan (Theor. Comput. Sci., 2025)

A self-adjusting spectral clustering algorithm. - Luiz Emilio Allem; Carlos Hoppen; Lucas Siviero Sibemberg (Comput. Appl. Math., 2025)