Viresh Patel - RankMe

58 papers A* 1A 1B 2C 1Misc 1Journal 50Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Path decompositions of oriented graphs. Eur. J. Comb. Viresh Patel, Mehmet Akif Yildiz
2024	J	`jnl`	A near-optimal zero-free disk for the Ising model. Comb. Theory Viresh Patel, Guus Regts, Ayla Stam
2024	J	`jnl`	Hamilton cycles in dense regular digraphs and oriented graphs. J. Comb. Theory B Allan Lo, Viresh Patel, Mehmet Akif Yildiz
2024	J	`jnl`	Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. J. Comb. Theory B Matthew Jenssen, Viresh Patel, Guus Regts
2024	J	`jnl`	Performance Analysis of Smart Grid Communication Networks Using Co-Simulation. IEEE Access Viresh Patel, Anupam Soni, Ankush Sharma, Saikat Chakrabarti, Anju Meghwani, Suresh Chandra Srivastava, Anurag K. Srivastava, Sreenath Jayakumar Geetha
2023	J	`jnl`	A near-optimal zero-free disk for the Ising model. CoRR Viresh Patel, Guus Regts, Ayla Stam
2023	J	`jnl`	Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR Matthew Jenssen, Viresh Patel, Guus Regts
2023	J	`jnl`	Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz
2023	J	`jnl`	Sampling from the low temperature Potts model through a Markov chain on flows. Random Struct. Algorithms Jeroen Huijben, Viresh Patel, Guus Regts
2022	J	`jnl`	A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. SIAM J. Discret. Math. Viresh Patel, Fabian Stroh
2022	J	`jnl`	Approximate counting using Taylor's theorem: a survey. CoRR Viresh Patel, Guus Regts
2022	J	`jnl`	Approximate counting using Taylor's theorem: a survey. Bull. EATCS Viresh Patel, Guus Regts
2021	A*	`conf`	Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. SODA Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts
2021	J	`jnl`	Sampling from the low temperature Potts model through a Markov chain on flows. CoRR Jeroen Huijben, Viresh Patel, Guus Regts
2021	J	`jnl`	Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
2020	J	`jnl`	A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs. CoRR Viresh Patel, Fabian Stroh
2020	J	`jnl`	Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. CoRR Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts
2020	A	`conf`	Statistical Physics Approaches to Unique Games. CCC Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts
2020	J	`jnl`	Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. Electron. J. Comb. Pieter Kleer, Viresh Patel, Fabian Stroh
2020	J	`jnl`	Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. CoRR Pieter Kleer, Viresh Patel, Fabian Stroh
2019	J	`jnl`	Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica Viresh Patel, Guus Regts
2019	J	`jnl`	Statistical physics approaches to Unique Games. CoRR Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts
2019	J	`jnl`	Structure and colour in triangle-free graphs. CoRR N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
2018	J	`jnl`	Excluding Hooks and their Complements. Electron. J. Comb. Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk
2018	J	`jnl`	Hamilton Cycles in Sparse Robustly Expanding Digraphs. Electron. J. Comb. Allan Lo, Viresh Patel
2018	J	`jnl`	On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. CoRR Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts
2017	J	`jnl`	Computing the number of induced copies of a fixed graph in a bounded degree graph. CoRR Viresh Patel, Guus Regts
2017	J	`jnl`	Decomposing tournaments into paths. Electron. Notes Discret. Math. Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot
2017	J	`jnl`	Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM J. Comput. Viresh Patel, Guus Regts
2017	J	`jnl`	Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electron. Notes Discret. Math. Viresh Patel, Guus Regts
2016	J	`jnl`	A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms Daniela Kühn, Deryk Osthus, Viresh Patel
2016	J	`jnl`	Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. CoRR Viresh Patel, Guus Regts
2016	J	`jnl`	Finding Shortest Paths Between Graph Colourings. Algorithmica Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2016	J	`jnl`	Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
2016	J	`jnl`	Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. Gregory Z. Gutin, Viresh Patel
2015	J	`jnl`	A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. Ross J. Kang, János Pach, Viresh Patel, Guus Regts
2015	J	`jnl`	On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. Ross J. Kang, Viresh Patel, Guus Regts
2014	J	`jnl`	A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR Daniela Kühn, Deryk Osthus, Viresh Patel
2014	J	`jnl`	Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	B	`conf`	Finding Shortest Paths Between Graph Colourings. IPEC Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2014	J	`jnl`	On Toughness and Hamiltonicity of 2 J. Graph Theory Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2014	J	`jnl`	Parameterized TSP: Beating the Average. CoRR Gregory Z. Gutin, Viresh Patel
2014	J	`jnl`	Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2013	J	`jnl`	Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. SIAM J. Comput. Viresh Patel
2013	J	`jnl`	Mixing of the Glauber dynamics for the ferromagnetic Potts model CoRR Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
2013	—	`conf`	Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data. ICACCI Rachit Mehra, Viresh Patel, Faruk Kazi, Navdeep M. Singh, S. R. Wagh
2013	J	`jnl`	Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Viresh Patel
2012	J	`jnl`	The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2011	J	`jnl`	On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2011	B	`conf`	Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC Hajo Broersma, Petr A. Golovach, Viresh Patel
2010	J	`jnl`	Average relational distance in linear extensions of posets. Discret. Math. Graham R. Brightwell, Viresh Patel
2010	J	`jnl`	Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus CoRR Viresh Patel
2010	—	`conf`	Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. ESA (1) Viresh Patel
2010	Misc	`conf`	Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2010	C	`conf`	The Complexity Status of Problems Related to Sparsest Cuts. IWOCA Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2008	J	`jnl`	Cutting two graphs simultaneously. J. Graph Theory Viresh Patel
2008	J	`jnl`	Partitioning Posets. Order Viresh Patel