default search action
Viresh Patel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Allan Lo, Viresh Patel, Mehmet Akif Yildiz
:
Hamilton cycles in dense regular digraphs and oriented graphs. J. Comb. Theory B 164: 119-160 (2024) - [j29]Matthew Jenssen, Viresh Patel, Guus Regts:
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. J. Comb. Theory B 169: 233-252 (2024) - 2023
- [j28]Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51(5): 528-532 (2023) - [j27]Jeroen Huijben, Viresh Patel, Guus Regts:
Sampling from the low temperature Potts model through a Markov chain on flows. Random Struct. Algorithms 62(1): 219-239 (2023) - [i17]Matthew Jenssen, Viresh Patel, Guus Regts:
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR abs/2309.10928 (2023) - [i16]Viresh Patel, Guus Regts, Ayla Stam:
A near-optimal zero-free disk for the Ising model. CoRR abs/2311.05574 (2023) - 2022
- [j26]Viresh Patel, Guus Regts:
Approximate counting using Taylor's theorem: a survey. Bull. EATCS 138 (2022) - [j25]Viresh Patel, Fabian Stroh:
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. SIAM J. Discret. Math. 36(2): 1363-1393 (2022) - [i15]Viresh Patel, Guus Regts:
Approximate counting using Taylor's theorem: a survey. CoRR abs/2212.08143 (2022) - 2021
- [j24]N. R. Aravind, Stijn Cambie
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 (2021) - [c8]Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts:
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. SODA 2021: 1508-1519 - [i14]Jeroen Huijben, Viresh Patel, Guus Regts:
Sampling from the low temperature Potts model through a Markov chain on flows. CoRR abs/2103.07360 (2021) - 2020
- [j23]Pieter Kleer
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. Electron. J. Comb. 27(4): 4 (2020) - [c7]Matthew Coulson, Ewan Davies
Statistical Physics Approaches to Unique Games. CCC 2020: 13:1-13:27 - [i13]Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts:
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. CoRR abs/2006.14828 (2020) - [i12]Viresh Patel, Fabian Stroh:
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs. CoRR abs/2007.14502 (2020) - [i11]Pieter Kleer, Viresh Patel, Fabian Stroh:
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. CoRR abs/2011.09726 (2020)
2010 – 2019
- 2019
- [j22]Viresh Patel, Guus Regts:
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica 81(5): 1844-1858 (2019) - [i10]Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts:
Statistical physics approaches to Unique Games. CoRR abs/1911.01504 (2019) - [i9]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 (2019) - 2018
- [j21]Krzysztof Choromanski, Dvir Falik, Anita Liebenau
Excluding Hooks and their Complements. Electron. J. Comb. 25(3): 3 (2018) - [j20]Allan Lo, Viresh Patel:
Hamilton Cycles in Sparse Robustly Expanding Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [i8]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
- [j19]Allan Lo
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61: 813-818 (2017) - [j18]Viresh Patel, Guus Regts:
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electron. Notes Discret. Math. 61: 971-977 (2017) - [j17]Viresh Patel, Guus Regts:
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM J. Comput. 46(6): 1893-1919 (2017) - [i7]Viresh Patel, Guus Regts:
Computing the number of induced copies of a fixed graph in a bounded degree graph. CoRR abs/1707.05186 (2017) - 2016
- [j16]Matthew Johnson
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 (2016) - [j15]Magnus Bordewich
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1): 21-52 (2016) - [j14]Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48(3): 427-453 (2016) - [j13]Gregory Z. Gutin, Viresh Patel:
Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. 30(1): 220-238 (2016) - [i6]Viresh Patel, Guus Regts:
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. CoRR abs/1607.01167 (2016) - 2015
- [j12]Ross J. Kang, Viresh Patel, Guus Regts:
On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. 49: 821-827 (2015) - [j11]Ross J. Kang
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29(3): 1670-1682 (2015) - 2014
- [j10]Marthe Bonamy, Matthew Johnson
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 (2014) - [j9]Hajo Broersma
On Toughness and Hamiltonicity of 2K2-Free Graphs. J. Graph Theory 75(3): 244-255 (2014) - [j8]Matthew Johnson
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. 54(2): 244-260 (2014) - [c6]Matthew Johnson
Finding Shortest Paths Between Graph Colourings. IPEC 2014: 221-233 - [i5]Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR abs/1401.4931 (2014) - [i4]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR abs/1403.6347 (2014) - [i3]Gregory Z. Gutin, Viresh Patel:
Parameterized TSP: Beating the Average. CoRR abs/1408.0531 (2014) - 2013
- [j7]Viresh Patel:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. SIAM J. Comput. 42(3): 1113-1131 (2013) - [j6]Hajo Broersma
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 (2013) - [c5]Rachit Mehra
Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data. ICACCI 2013: 817-821 - [i2]Magnus Bordewich, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. CoRR abs/1305.0776 (2013) - 2012
- [j5]Paul S. Bonsma, Hajo Broersma
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 (2012) - 2011
- [j4]Marthe Bonamy, Matthew Johnson
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38: 161-166 (2011) - [c4]Hajo Broersma
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218 - 2010
- [j3]Graham R. Brightwell, Viresh Patel:
Average relational distance in linear extensions of posets. Discret. Math. 310(5): 1016-1021 (2010) - [c3]Matthew Johnson
Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251 - [c2]Viresh Patel:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. ESA (1) 2010: 561-572 - [c1]Paul S. Bonsma, Hajo Broersma
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135 - [i1]Viresh Patel:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. CoRR abs/1004.4484 (2010)
2000 – 2009
- 2008
- [j2]Viresh Patel:
Cutting two graphs simultaneously. J. Graph Theory 57(1): 19-32 (2008) - [j1]Viresh Patel:
Partitioning Posets. Order 25(2): 131-152 (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-08-05 21:11 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: