Carlos Hoppen - RankMe

67 papers A* 2A 1B 1C 5Journal 56Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Separating path systems for cubic graphs and for complete bipartite graphs. Discret. Math. Cristina G. Fernandes, Carlos Hoppen, George Kontogeorgiou, Guilherme Oliveira Mota, Danni Peng
2025	J	`jnl`	A self-adjusting spectral clustering algorithm. Comput. Appl. Math. Luiz Emilio Allem, Carlos Hoppen, Lucas Siviero Sibemberg
2025	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. Theor. Comput. Sci. Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2025	A	`conf`	Fast Gaussian Elimination for Low Treewidth Matrices. ESA Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2025	J	`jnl`	Multi-Community Spectral Clustering for Geometric Graphs. CoRR Luiz Emilio Allem, Konstantin Avrachenkov, Carlos Hoppen, Hariprasad Manjunath, Lucas Siviero Sibemberg
2024	J	`jnl`	Edge-colorings avoiding patterns in a triangle. Discret. Math. Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt
2023	J	`jnl`	Graphs with many edge-colorings such that complete graphs are rainbow. Discret. Appl. Math. Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt
2023	J	`jnl`	Heilbronn triangle-type problems in the unit square [0,1] Random Struct. Algorithms Fabrício Siqueira Benevides, Carlos Hoppen, Hanno Lefmann, Knut Odermann
2022	J	`jnl`	Counting orientations of graphs with no strongly connected tournaments. Discret. Math. Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2022	J	`jnl`	Minimum 2-dominating sets in regular graphs. Discret. Appl. Math. Carlos Hoppen, Giovane Mansan
2021	J	`jnl`	An extension of the rainbow Erdős-Rothschild problem. Discret. Math. Carlos Hoppen, Hanno Lefmann, Denilson Nolibos
2021	J	`jnl`	Asymptotic bounds on total domination in regular graphs. Discret. Math. Carlos Hoppen, Giovane Mansan
2021	C	`conf`	Counting orientations of graphs with no strongly connected tournaments. LAGOS Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2021	J	`jnl`	Counting orientations of graphs with no strongly connected tournaments. CoRR Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota
2021	J	`jnl`	Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2021	C	`conf`	Maximum number of r-edge-colorings such that all copies of K LAGOS Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt
2021	J	`jnl`	On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2021	J	`jnl`	Rainbow Erdös-Rothschild Problem for the Fano Plane. SIAM J. Discret. Math. Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
2021	J	`jnl`	Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. J. Graph Theory Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
2020	J	`jnl`	A spectral clustering approach for the evolution of the COVID-19 pandemic in the state of Rio Grande do Sul, Brazil. CoRR Luiz Emilio Allem, Carlos Hoppen, Matheus Micadei Marzo, Lucas Siviero Sibemberg
2020	A*	`conf`	Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP Martin Fürer, Carlos Hoppen, Vilmar Trevisan
2020	J	`jnl`	Estimating parameters associated with monotone properties. Comb. Probab. Comput. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2019	C	`conf`	Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. LAGOS Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato
2019	J	`jnl`	On the query complexity of estimating the distance to hereditary graph properties. CoRR Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2019	J	`jnl`	Packing Arborescences in Random Digraphs. SIAM J. Discret. Math. Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2019	C	`conf`	Remarks on an Edge-coloring Problem. LAGOS Carlos Hoppen, Hanno Lefmann
2019	J	`jnl`	Stability Results for Two Classes of Hypergraphs. SIAM J. Discret. Math. Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
2019	C	`conf`	Total Domination in Regular Graphs. LAGOS Carlos Hoppen, Giovane Mansan
2018	J	`jnl`	Edge-colorings avoiding rainbow stars. J. Graph Theory Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
2018	J	`jnl`	Limits of k-dimensional poset sequences. Discret. Appl. Math. Ricardo Cordeiro Corrêa, Carlos Hoppen, Rudini Menezes Sampaio
2018	J	`jnl`	Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. Comb. Carlos Hoppen, Nicholas C. Wormald
2018	B	`conf`	Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan
2017	J	`jnl`	A Rainbow Erdös-Rothschild Problem. SIAM J. Discret. Math. Carlos Hoppen, Hanno Lefmann, Knut Odermann
2017	J	`jnl`	A pre-test for factoring bivariate polynomials with coefficients in F Inf. Process. Lett. Luiz Emilio Allem, Carlos Hoppen
2017	J	`jnl`	Densities in large permutations and parameter testing. Eur. J. Comb. Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
2017	J	`jnl`	Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Discret. Math. Fabrício Benevides, Carlos Hoppen, Rudini M. Sampaio
2017	J	`jnl`	Estimating parameters associated with monotone properties. CoRR Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2017	J	`jnl`	Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2017	J	`jnl`	On graphs with a large number of edge-colorings avoiding a rainbow triangle. Eur. J. Comb. Carlos Hoppen, Hanno Lefmann, Knut Odermann
2017	J	`jnl`	Packing arborescences in random digraphs. Electron. Notes Discret. Math. Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2017	J	`jnl`	Stability of extremal hypergraphs with applications to an edge-coloring problem. Electron. Notes Discret. Math. Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann
2016	J	`jnl`	A coloring problem for intersecting vector spaces. Discret. Math. Carlos Hoppen, Hanno Lefmann, Knut Odermann
2016	—	`conf`	Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2016	J	`jnl`	Packing arborescences in random digraphs. CoRR Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
2016	J	`jnl`	Properties of regular graphs with large girth via local algorithms. J. Comb. Theory B Carlos Hoppen, Nicholas C. Wormald
2015	J	`jnl`	A rainbow Erdős-Rothschild problem. Electron. Notes Discret. Math. Carlos Hoppen, Hanno Lefmann, Knut Odermann
2015	J	`jnl`	Edge-colorings avoiding a fixed matching with a prescribed color pattern. Eur. J. Comb. Carlos Hoppen, Hanno Lefmann
2015	J	`jnl`	Edge-colorings avoiding fixed rainbow stars. Electron. Notes Discret. Math. Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches
2015	J	`jnl`	Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2014	J	`jnl`	Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2014	J	`jnl`	Large permutations and parameter testing. CoRR Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
2013	—	`conf`	An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2013	J	`jnl`	Limits of permutation sequences. J. Comb. Theory B Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Balázs Ráth, Rudini Menezes Sampaio
2013	J	`jnl`	Unicyclic Graphs with equal Laplacian Energy CoRR Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan
2012	J	`jnl`	A note on permutation regularity. Discret. Appl. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2012	J	`jnl`	Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2012	J	`jnl`	Hypergraphs with many Kneser colorings. Eur. J. Comb. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2011	J	`jnl`	A note on Gao's algorithm for polynomial factorization. Theor. Comput. Sci. Carlos Hoppen, Virginia M. Rodrigues, Vilmar Trevisan
2011	J	`jnl`	A note on random k-dimensional posets. Electron. Notes Discret. Math. Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2011	J	`jnl`	Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2011	J	`jnl`	Every hereditary permutation property is testable. Electron. Notes Discret. Math. Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2011	J	`jnl`	Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
2011	J	`jnl`	Testing permutation properties through subpermutations. Theor. Comput. Sci. Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
2010	A*	`conf`	Property Testing and Parameter Testing for Permutations. SODA Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
2009	J	`jnl`	A note on permutation regularity. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2009	J	`jnl`	Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2008	J	`jnl`	Induced Forests in Regular Graphs with Large Girth. Comb. Probab. Comput. Carlos Hoppen, Nicholas C. Wormald