Viresh Patel

From MaRDI portal
Revision as of 08:42, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:309790

Available identifiers

zbMath Open patel.vireshMaRDI QIDQ309790

List of research outcomes

PublicationDate of PublicationType
Hamilton cycles in dense regular digraphs and oriented graphs2024-01-29Paper
https://portal.mardi4nfdi.de/entity/Q61473462024-01-15Paper
A near-optimal zero-free disk for the Ising model2023-11-09Paper
Sampling from the low temperature Potts model through a Markov chain on flows2023-10-17Paper
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs2023-09-20Paper
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem2023-09-19Paper
https://portal.mardi4nfdi.de/entity/Q61610562023-06-26Paper
https://portal.mardi4nfdi.de/entity/Q50924612022-07-21Paper
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs2022-06-23Paper
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs2022-02-11Paper
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs2021-12-15Paper
Path decompositions of random directed graphs2021-09-28Paper
Structure and colour in triangle-free graphs2021-06-21Paper
Improved bounds for zeros of the chromatic polynomial on bounded degree graphs2021-05-07Paper
Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs2020-12-03Paper
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs2020-06-26Paper
Decomposing tournaments into paths2020-05-12Paper
Statistical physics approaches to Unique Games2019-11-04Paper
Computing the number of induced copies of a fixed graph in a bounded degree graph2019-05-07Paper
Discrepancy and large dense monochromatic subsets2018-12-10Paper
Excluding hooks and their complements2018-09-07Paper
Hamilton cycles in sparse robustly expanding digraphs2018-09-07Paper
Decomposing tournaments into paths2018-01-18Paper
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials2018-01-18Paper
On a Ramsey-type problem of Erdős and Pach2018-01-16Paper
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials2018-01-10Paper
Obtaining online ecological colourings by generalizing first-fit2017-11-07Paper
On a Ramsey-type problem of Erdős and Pach2016-10-14Paper
Finding shortest paths between graph colourings2016-09-07Paper
A domination algorithm for {0,1}-instances of the travelling salesman problem2016-06-10Paper
Parameterized Traveling Salesman Problem: Beating the Average2016-02-05Paper
Mixing of the Glauber dynamics for the ferromagnetic Potts model2016-02-03Paper
A Precise Threshold for Quasi-Ramsey Numbers2015-09-23Paper
Finding Shortest Paths Between Graph Colourings2015-09-15Paper
Poset limits can be totally ordered2015-04-22Paper
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments2014-10-15Paper
Tight inequalities among set hitting times in Markov chains2014-09-16Paper
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments2014-06-11Paper
On Toughness and Hamiltonicity of 2K2‐Free Graphs2014-05-22Paper
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs2014-02-25Paper
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width2014-01-07Paper
https://portal.mardi4nfdi.de/entity/Q28573382013-11-01Paper
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus2013-09-25Paper
The complexity of finding uniform sparsest cuts in various graph classes2012-09-13Paper
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width2012-06-15Paper
The Complexity Status of Problems Related to Sparsest Cuts2011-05-19Paper
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus2010-09-06Paper
Obtaining Online Ecological Colourings by Generalizing First-Fit2010-06-22Paper
Average relational distance in linear extensions of posets2010-04-27Paper
Cutting two graphs simultaneously2008-11-19Paper
Partitioning posets2008-09-09Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Viresh Patel