Carlos Hoppen

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 40

Top Topics

Graph Properties

Top Venues

SIAM J. Discret. Math.

Publications

Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt
Edge-colorings avoiding patterns in a triangle. Discret. Math. 347 (4) (2024)
Fabrício Siqueira Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann
. Random Struct. Algorithms 62 (3) (2023)
Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt
Graphs with many edge-colorings such that complete graphs are rainbow. Discret. Appl. Math. 333 (2023)
Carlos Hoppen, Giovane Mansan
Minimum 2-dominating sets in regular graphs. Discret. Appl. Math. 323 (2022)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. Discret. Math. 345 (12) (2022)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Rainbow Erdös-Rothschild Problem for the Fano Plane. SIAM J. Discret. Math. 35 (3) (2021)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. CoRR (2021)
Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
Counting orientations of graphs with no strongly connected tournaments. LAGOS (2021)
Carlos Hoppen, Hanno Lefmann, Denilson Nolibos
An extension of the rainbow Erdős-Rothschild problem. Discret. Math. 344 (8) (2021)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. J. Graph Theory 98 (1) (2021)
Carlos Hoppen, Giovane Mansan
Asymptotic bounds on total domination in regular graphs. Discret. Math. 344 (4) (2021)
Martin Fürer, Carlos Hoppen, Vilmar Trevisan
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR (2021)
Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt
are rainbow. LAGOS (2021)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. 35 (2) (2021)
Luiz Emilio Allem, Carlos Hoppen, Matheus Micadei Marzo, Lucas Siviero Sibemberg
A spectral clustering approach for the evolution of the COVID-19 pandemic in the state of Rio Grande do Sul, Brazil. CoRR (2020)
Martin Fürer, Carlos Hoppen, Vilmar Trevisan
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP (2020)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29 (4) (2020)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Stability Results for Two Classes of Hypergraphs. SIAM J. Discret. Math. 33 (4) (2019)
Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. LAGOS (2019)
Carlos Hoppen, Hanno Lefmann
Remarks on an Edge-coloring Problem. LAGOS (2019)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
On the query complexity of estimating the distance to hereditary graph properties. CoRR (2019)
Carlos Hoppen, Giovane Mansan
Total Domination in Regular Graphs. LAGOS (2019)
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
Packing Arborescences in Random Digraphs. SIAM J. Discret. Math. 33 (1) (2019)
Ricardo Cordeiro Corrêa, Carlos Hoppen, Rudini Menezes Sampaio
Limits of k-dimensional poset sequences. Discret. Appl. Math. 245 (2018)
Carlos Hoppen, Nicholas C. Wormald
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. Comb. 38 (3) (2018)
Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
Edge-colorings avoiding rainbow stars. J. Graph Theory 87 (4) (2018)
Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN (2018)
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
Stability of extremal hypergraphs with applications to an edge-coloring problem. Electron. Notes Discret. Math. 61 (2017)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
On graphs with a large number of edge-colorings avoiding a rainbow triangle. Eur. J. Comb. 66 (2017)
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
Packing arborescences in random digraphs. Electron. Notes Discret. Math. 61 (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61 (2017)
Luiz Emilio Allem, Carlos Hoppen
. Inf. Process. Lett. 121 (2017)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
Densities in large permutations and parameter testing. Eur. J. Comb. 60 (2017)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A Rainbow Erdös-Rothschild Problem. SIAM J. Discret. Math. 31 (4) (2017)
Fabrício Benevides, Carlos Hoppen, Rudini M. Sampaio
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Discret. Math. 340 (9) (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. CoRR (2017)
Carlos Hoppen, Nicholas C. Wormald
Properties of regular graphs with large girth via local algorithms. J. Comb. Theory, Ser. B 121 (2016)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A coloring problem for intersecting vector spaces. Discret. Math. 339 (12) (2016)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM (2016)
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
Packing arborescences in random digraphs. CoRR (2016)
Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
Edge-colorings avoiding fixed rainbow stars. Electron. Notes Discret. Math. 50 (2015)
Carlos Hoppen, Hanno Lefmann, Knut Odermann
A rainbow Erdős-Rothschild problem. Electron. Notes Discret. Math. 49 (2015)
Carlos Hoppen, Hanno Lefmann
Edge-colorings avoiding a fixed matching with a prescribed color pattern. Eur. J. Comb. 47 (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338 (2) (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35 (2014)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
Large permutations and parameter testing. CoRR (2014)
Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan
Unicyclic Graphs with equal Laplacian Energy CoRR (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Balázs Ráth, Rudini Menezes Sampaio
Limits of permutation sequences. J. Comb. Theory, Ser. B 103 (1) (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on permutation regularity. Discret. Appl. Math. 160 (18) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33 (5) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21 (1-2) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. 38 (2011)
Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66 (2) (2011)
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
Testing permutation properties through subpermutations. Theor. Comput. Sci. 412 (29) (2011)
Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
Every hereditary permutation property is testable. Electron. Notes Discret. Math. 38 (2011)
Carlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan
A note on Gao's algorithm for polynomial factorization. Theor. Comput. Sci. 412 (16) (2011)
Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37 (2011)
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
Property Testing and Parameter Testing for Permutations. SODA (2010)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34 (2009)
Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on permutation regularity. Electron. Notes Discret. Math. 35 (2009)
Carlos Hoppen, Nicholas C. Wormald
Induced Forests in Regular Graphs with Large Girth. Comb. Probab. Comput. 17 (3) (2008)