default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFerenc Bencs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Ferenc Bencs, Jeroen Huijben, Guus Regts:
Approximating the chromatic polynomial is as hard as computing it exactly. Comput. Complex. 33(1): 1 (2024)- [j11]Ferenc Bencs, Aranka Hrusková
, László Márton Tóth:
Factor-of-iid Schreier decorations of lattices in Euclidean spaces. Discret. Math. 347(9): 114056 (2024) - [j10]Ferenc Bencs, Aranka Hrusková, László Márton Tóth:
Factor-of-iid balanced orientation of non-amenable graphs. Eur. J. Comb. 115: 103784 (2024) - [i8]Ferenc Bencs, Guus Regts:
Approximating the volume of a truncated relaxation of the independence polytope. CoRR abs/2404.08577 (2024) - [i7]Ferenc Bencs, Khallil Berrekkal, Guus Regts:
Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros. CoRR abs/2408.04727 (2024) - 2023
- [j9]Ferenc Bencs, Jeroen Huijben, Guus Regts:
On the Location of Chromatic Zeros of Series-Parallel Graphs. Electron. J. Comb. 30(3) (2023) - [j8]Ferenc Bencs, Péter Csikvári:
Upper bound for the number of spanning forests of regular graphs. Eur. J. Comb. 110: 103677 (2023) - [c1]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. SODA 2023: 675-699 - [i6]Ferenc Bencs, Khallil Berrekkal, Guus Regts:
Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees. CoRR abs/2310.04338 (2023) - 2022
- [j7]Ferenc Bencs, Péter Csikvári:
Evaluations of Tutte polynomials of regular graphs. J. Comb. Theory B 157: 500-523 (2022) - [i5]Ferenc Bencs, David de Boer, Pjotr Buys, Guus Regts:
Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ. CoRR abs/2203.15457 (2022) - [i4]Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák:
On complex roots of the independence polynomial. CoRR abs/2204.04868 (2022) - [i3]Ferenc Bencs, Jeroen Huijben, Guus Regts:
On the location of chromatic zeros of series-parallel graphs. CoRR abs/2204.10038 (2022) - [i2]Ferenc Bencs, Jeroen Huijben, Guus Regts:
Approximating the chromatic polynomial is as hard as computing it exactly. CoRR abs/2211.13790 (2022) - 2021
- [j6]Ferenc Bencs, Péter Csikvári, Guus Regts:
Some Applications of Wagner's Weighted Subgraph Counting Polynomial. Electron. J. Comb. 28(4) (2021) - [j5]Ferenc Bencs:
Some coefficient sequences related to the descent polynomial. Eur. J. Comb. 98: 103396 (2021)
2010 – 2019
- 2018
- [j4]Ferenc Bencs:
Christoffel-Darboux Type Identities for the Independence Polynomial. Comb. Probab. Comput. 27(5): 716-724 (2018) - [j3]Ferenc Bencs:
On trees with real-rooted independence polynomial. Discret. Math. 341(12): 3321-3330 (2018) - [i1]Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts:
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. CoRR abs/1812.07532 (2018) - 2017
- [j2]Ferenc Bencs:
One more remark on the adjoint polynomial. Eur. J. Comb. 65: 253-258 (2017) - 2016
- [j1]Péter Árendás, Ferenc Bencs, Zoltán Blázsik, Csaba Szabó:
Compositions of Complements of Graphs. Integers 16: A29 (2016)
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-10-07 22:13 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:
