default search action
Carlos Hoppen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Carlos Hoppen
, Hanno Lefmann, Dionatan Ricardo Schmidt:
Edge-colorings avoiding patterns in a triangle. Discret. Math. 347(4): 113896 (2024) - 2023
- [j43]Josefran de Oliveira Bastos
Graphs with many edge-colorings such that complete graphs are rainbow. Discret. Appl. Math. 333: 151-164 (2023) - [j42]Fabrício Siqueira Benevides, Carlos Hoppen
Heilbronn triangle-type problems in the unit square [0,1]2. Random Struct. Algorithms 62(3): 585-599 (2023) - 2022
- [j41]Carlos Hoppen
Minimum 2-dominating sets in regular graphs. Discret. Appl. Math. 323: 268-285 (2022) - [j40]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. Discret. Math. 345(12): 113024 (2022) - 2021
- [j39]Carlos Hoppen
Asymptotic bounds on total domination in regular graphs. Discret. Math. 344(4): 112287 (2021) - [j38]Carlos Hoppen
An extension of the rainbow Erdős-Rothschild problem. Discret. Math. 344(8): 112443 (2021) - [j37]Lucas de Oliveira Contiero, Carlos Hoppen
Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. J. Graph Theory 98(1): 141-173 (2021) - [j36]Carlos Hoppen
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. 35(2): 1238-1251 (2021) - [j35]Lucas de Oliveira Contiero, Carlos Hoppen
Rainbow Erdös-Rothschild Problem for the Fano Plane. SIAM J. Discret. Math. 35(3): 1927-1951 (2021) - [c10]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. LAGOS 2021: 385-393 - [c9]Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel
Maximum number of r-edge-colorings such that all copies of Kk are rainbow. LAGOS 2021: 419-426 - [i8]Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota:
Counting orientations of graphs with no strongly connected tournaments. CoRR abs/2101.12327 (2021) - [i7]Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR abs/2109.02515 (2021) - 2020
- [j34]Carlos Hoppen
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29(4): 616-632 (2020) - [c8]Martin Fürer
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP 2020: 52:1-52:18 - [i6]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 abs/2008.00333 (2020)
2010 – 2019
- 2019
- [j33]Carlos Hoppen
Packing Arborescences in Random Digraphs. SIAM J. Discret. Math. 33(1): 438-453 (2019) - [j32]Lucas de Oliveira Contiero, Carlos Hoppen
Stability Results for Two Classes of Hypergraphs. SIAM J. Discret. Math. 33(4): 2023-2040 (2019) - [c7]Carlos Hoppen
Remarks on an Edge-coloring Problem. LAGOS 2019: 511-521 - [c6]Carlos Hoppen
Total Domination in Regular Graphs. LAGOS 2019: 523-533 - [c5]Carlos Hoppen
Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. LAGOS 2019: 535-544 - [i5]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
On the query complexity of estimating the distance to hereditary graph properties. CoRR abs/1912.01081 (2019) - 2018
- [j31]Carlos Hoppen
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. Comb. 38(3): 619-664 (2018) - [j30]Ricardo Cordeiro Corrêa
Limits of k-dimensional poset sequences. Discret. Appl. Math. 245: 208-219 (2018) - [j29]Carlos Hoppen
Edge-colorings avoiding rainbow stars. J. Graph Theory 87(4): 399-429 (2018) - [c4]Martin Fürer
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489 - 2017
- [j28]Fabrício Benevides, Carlos Hoppen
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Discret. Math. 340(9): 2143-2160 (2017) - [j27]Roman Glebov, Carlos Hoppen
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - [j26]Carlos Hoppen
On graphs with a large number of edge-colorings avoiding a rainbow triangle. Eur. J. Comb. 66: 168-190 (2017) - [j25]Lucas de Oliveira Contiero, Carlos Hoppen
Stability of extremal hypergraphs with applications to an edge-coloring problem. Electron. Notes Discret. Math. 61: 263-269 (2017) - [j24]Carlos Hoppen
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61: 607-613 (2017) - [j23]Carlos Hoppen
Packing arborescences in random digraphs. Electron. Notes Discret. Math. 61: 615-621 (2017) - [j22]Luiz Emilio Allem
A pre-test for factoring bivariate polynomials with coefficients in F2. Inf. Process. Lett. 121: 22-28 (2017) - [j21]Carlos Hoppen
A Rainbow Erdös-Rothschild Problem. SIAM J. Discret. Math. 31(4): 2647-2674 (2017) - [i4]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. CoRR abs/1707.08225 (2017) - 2016
- [j20]Carlos Hoppen
A coloring problem for intersecting vector spaces. Discret. Math. 339(12): 2941-2954 (2016) - [j19]Carlos Hoppen
Properties of regular graphs with large girth via local algorithms. J. Comb. Theory B 121: 367-397 (2016) - [c3]Carlos Hoppen
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM 2016: 35:1-35:13 - [i3]Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato:
Packing arborescences in random digraphs. CoRR abs/1605.05764 (2016) - 2015
- [j18]Carlos Hoppen
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338(2): 262-271 (2015) - [j17]Carlos Hoppen
Edge-colorings avoiding a fixed matching with a prescribed color pattern. Eur. J. Comb. 47: 75-94 (2015) - [j16]Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A rainbow Erdős-Rothschild problem. Electron. Notes Discret. Math. 49: 473-480 (2015) - [j15]Carlos Hoppen
Edge-colorings avoiding fixed rainbow stars. Electron. Notes Discret. Math. 50: 275-280 (2015) - 2014
- [j14]Carlos Hoppen
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35: 354-373 (2014) - [i2]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014) - 2013
- [j13]Carlos Hoppen
Limits of permutation sequences. J. Comb. Theory B 103(1): 93-113 (2013) - [c2]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory 2013: 432-450 - [i1]Eliseu Fritscher, Carlos Hoppen, Vilmar Trevisan:
Unicyclic Graphs with equal Laplacian Energy. CoRR abs/1304.1221 (2013) - 2012
- [j12]Carlos Hoppen
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21(1-2): 203-218 (2012) - [j11]Carlos Hoppen
A note on permutation regularity. Discret. Appl. Math. 160(18): 2716-2727 (2012) - [j10]Carlos Hoppen
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33(5): 816-843 (2012) - 2011
- [j9]Ricardo C. Corrêa
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37: 51-56 (2011) - [j8]Antônio J. O. Bastos, Carlos Hoppen
Every hereditary permutation property is testable. Electron. Notes Discret. Math. 38: 123-128 (2011) - [j7]Carlos Hoppen
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. 38: 469-474 (2011) - [j6]Itai Benjamini, Carlos Hoppen
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66(2): 115-136 (2011) - [j5]Carlos Hoppen
A note on Gao's algorithm for polynomial factorization. Theor. Comput. Sci. 412(16): 1508-1522 (2011) - [j4]Carlos Hoppen
Testing permutation properties through subpermutations. Theor. Comput. Sci. 412(29): 3555-3567 (2011) - 2010
- [c1]Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio:
Property Testing and Parameter Testing for Permutations. SODA 2010: 66-75
2000 – 2009
- 2009
- [j3]Carlos Hoppen
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34: 219-223 (2009) - [j2]Carlos Hoppen
A note on permutation regularity. Electron. Notes Discret. Math. 35: 183-188 (2009) - 2008
- [j1]Carlos Hoppen
Induced Forests in Regular Graphs with Large Girth. Comb. Probab. Comput. 17(3): 389-410 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: