iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/33/2410.rss
dblp: Viresh Patel https://dblp.org/pid/33/2410.html dblp person page RSS feed Tue, 10 Dec 2024 20:44:42 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Viresh Patelhttps://dblp.org/pid/33/2410.html14451 Performance Analysis of Smart Grid Communication Networks Using Co-Simulation.https://doi.org/10.1109/ACCESS.2024.3486667, , , , , , , :
Performance Analysis of Smart Grid Communication Networks Using Co-Simulation. IEEE Access 12: 164767-164776 ()]]>https://dblp.org/rec/journals/access/PatelSSCMSSG24Mon, 01 Jan 2024 00:00:00 +0100 A near-optimal zero-free disk for the Ising model.https://doi.org/10.5070/c64264237, , :
A near-optimal zero-free disk for the Ising model. Comb. Theory 4(2) ()]]>https://dblp.org/rec/journals/combtheory/PatelRS24Mon, 01 Jan 2024 00:00:00 +0100 Hamilton cycles in dense regular digraphs and oriented graphs.https://doi.org/10.1016/j.jctb.2023.09.004, , :
Hamilton cycles in dense regular digraphs and oriented graphs. J. Comb. Theory B 164: 119-160 ()]]>https://dblp.org/rec/journals/jctb/LoPY24Mon, 01 Jan 2024 00:00:00 +0100 Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.https://doi.org/10.1016/j.jctb.2024.06.005, , :
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. J. Comb. Theory B 169: 233-252 ()]]>https://dblp.org/rec/journals/jctb/JenssenPR24Mon, 01 Jan 2024 00:00:00 +0100 Orthogonal schedules in single round robin tournaments.https://doi.org/10.1016/j.orl.2023.08.002, , , , :
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51(5): 528-532 ()]]>https://dblp.org/rec/journals/orl/LambersBPSY23Fri, 01 Sep 2023 01:00:00 +0200 Sampling from the low temperature Potts model through a Markov chain on flows.https://doi.org/10.1002/rsa.21089, , :
Sampling from the low temperature Potts model through a Markov chain on flows. Random Struct. Algorithms 62(1): 219-239 ()]]>https://dblp.org/rec/journals/rsa/HuijbenPR23Sun, 01 Jan 2023 00:00:00 +0100 Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.https://doi.org/10.48550/arXiv.2309.10928, , :
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR abs/2309.10928 ()]]>https://dblp.org/rec/journals/corr/abs-2309-10928Sun, 01 Jan 2023 00:00:00 +0100 A near-optimal zero-free disk for the Ising model.https://doi.org/10.48550/arXiv.2311.05574, , :
A near-optimal zero-free disk for the Ising model. CoRR abs/2311.05574 ()]]>https://dblp.org/rec/journals/corr/abs-2311-05574Sun, 01 Jan 2023 00:00:00 +0100 Approximate counting using Taylor's theorem: a survey.http://eatcs.org/beatcs/index.php/beatcs/article/view/725, :
Approximate counting using Taylor's theorem: a survey. Bull. EATCS 138 ()]]>https://dblp.org/rec/journals/eatcs/PatelR22Sat, 01 Jan 2022 00:00:00 +0100 A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs.https://doi.org/10.1137/20m1356191, :
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. SIAM J. Discret. Math. 36(2): 1363-1393 ()]]>https://dblp.org/rec/journals/siamdm/PatelS22Sat, 01 Jan 2022 00:00:00 +0100 Approximate counting using Taylor's theorem: a survey.https://doi.org/10.48550/arXiv.2212.08143, :
Approximate counting using Taylor's theorem: a survey. CoRR abs/2212.08143 ()]]>https://dblp.org/rec/journals/corr/abs-2212-08143Sat, 01 Jan 2022 00:00:00 +0100 Structure and Colour in Triangle-Free Graphs.https://doi.org/10.37236/9267, , , , , :
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 ()]]>https://dblp.org/rec/journals/combinatorics/AravindCBVKP21Fri, 01 Jan 2021 00:00:00 +0100 Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.https://doi.org/10.1137/1.9781611976465.91, , , :
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. SODA : 1508-1519]]>https://dblp.org/rec/conf/soda/BuysGPR21Fri, 01 Jan 2021 00:00:00 +0100 Sampling from the low temperature Potts model through a Markov chain on flows.https://arxiv.org/abs/2103.07360, , :
Sampling from the low temperature Potts model through a Markov chain on flows. CoRR abs/2103.07360 ()]]>https://dblp.org/rec/journals/corr/abs-2103-07360Fri, 01 Jan 2021 00:00:00 +0100 Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.https://doi.org/10.37236/9503, , :
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. Electron. J. Comb. 27(4): 4 ()]]>https://dblp.org/rec/journals/combinatorics/KleerPS20Wed, 01 Jan 2020 00:00:00 +0100 Statistical Physics Approaches to Unique Games.https://doi.org/10.4230/LIPIcs.CCC.2020.13, , , , :
Statistical Physics Approaches to Unique Games. CCC : 13:1-13:27]]>https://dblp.org/rec/conf/coco/CoulsonDKPR20Wed, 01 Jan 2020 00:00:00 +0100 Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.https://arxiv.org/abs/2006.14828, , , :
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. CoRR abs/2006.14828 ()]]>https://dblp.org/rec/journals/corr/abs-2006-14828Wed, 01 Jan 2020 00:00:00 +0100 A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs.https://arxiv.org/abs/2007.14502, :
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs. CoRR abs/2007.14502 ()]]>https://dblp.org/rec/journals/corr/abs-2007-14502Wed, 01 Jan 2020 00:00:00 +0100 Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.https://arxiv.org/abs/2011.09726, , :
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. CoRR abs/2011.09726 ()]]>https://dblp.org/rec/journals/corr/abs-2011-09726Wed, 01 Jan 2020 00:00:00 +0100 Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph.https://doi.org/10.1007/s00453-018-0511-9, :
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica 81(5): 1844-1858 ()]]>https://dblp.org/rec/journals/algorithmica/PatelR19Tue, 01 Jan 2019 00:00:00 +0100 Statistical physics approaches to Unique Games.http://arxiv.org/abs/1911.01504, , , , :
Statistical physics approaches to Unique Games. CoRR abs/1911.01504 ()]]>https://dblp.org/rec/journals/corr/abs-1911-01504Tue, 01 Jan 2019 00:00:00 +0100 Structure and colour in triangle-free graphs.http://arxiv.org/abs/1912.13328, , , , , :
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 ()]]>https://dblp.org/rec/journals/corr/abs-1912-13328Tue, 01 Jan 2019 00:00:00 +0100 Excluding Hooks and their Complements.https://doi.org/10.37236/6397, , , , :
Excluding Hooks and their Complements. Electron. J. Comb. 25(3): 3 ()]]>https://dblp.org/rec/journals/combinatorics/ChoromanskiFLPP18Mon, 01 Jan 2018 00:00:00 +0100 Hamilton Cycles in Sparse Robustly Expanding Digraphs.https://doi.org/10.37236/7418, :
Hamilton Cycles in Sparse Robustly Expanding Digraphs. Electron. J. Comb. 25(3): 3 ()]]>https://dblp.org/rec/journals/combinatorics/LoP18Mon, 01 Jan 2018 00:00:00 +0100 On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.http://arxiv.org/abs/1812.07532, , , :
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. CoRR abs/1812.07532 ()]]>https://dblp.org/rec/journals/corr/abs-1812-07532Mon, 01 Jan 2018 00:00:00 +0100 Decomposing tournaments into paths.https://doi.org/10.1016/j.endm.2017.07.040, , , :
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61: 813-818 ()]]>https://dblp.org/rec/journals/endm/LoPST17Sun, 01 Jan 2017 00:00:00 +0100 Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.https://doi.org/10.1016/j.endm.2017.07.061, :
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electron. Notes Discret. Math. 61: 971-977 ()]]>https://dblp.org/rec/journals/endm/PatelR17Sun, 01 Jan 2017 00:00:00 +0100 Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials.https://doi.org/10.1137/16M1101003, :
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM J. Comput. 46(6): 1893-1919 ()]]>https://dblp.org/rec/journals/siamcomp/PatelR17Sun, 01 Jan 2017 00:00:00 +0100 Computing the number of induced copies of a fixed graph in a bounded degree graph.http://arxiv.org/abs/1707.05186, :
Computing the number of induced copies of a fixed graph in a bounded degree graph. CoRR abs/1707.05186 ()]]>https://dblp.org/rec/journals/corr/PatelR17Sun, 01 Jan 2017 00:00:00 +0100 Finding Shortest Paths Between Graph Colourings.https://doi.org/10.1007/s00453-015-0009-7, , , , :
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 ()]]>https://dblp.org/rec/journals/algorithmica/0001KKPP16Fri, 01 Jan 2016 00:00:00 +0100 Mixing of the Glauber dynamics for the ferromagnetic Potts model.https://doi.org/10.1002/rsa.20569, , :
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1): 21-52 ()]]>https://dblp.org/rec/journals/rsa/BordewichGP16Fri, 01 Jan 2016 00:00:00 +0100 A domination algorithm for {0, 1}-instances of the travelling salesman problem.https://doi.org/10.1002/rsa.20600, , :
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48(3): 427-453 ()]]>https://dblp.org/rec/journals/rsa/KuhnOP16Fri, 01 Jan 2016 00:00:00 +0100 Parameterized Traveling Salesman Problem: Beating the Average.https://doi.org/10.1137/140980946, :
Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. 30(1): 220-238 ()]]>https://dblp.org/rec/journals/siamdm/GutinP16Fri, 01 Jan 2016 00:00:00 +0100 Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.http://arxiv.org/abs/1607.01167, :
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. CoRR abs/1607.01167 ()]]>https://dblp.org/rec/journals/corr/PatelR16Fri, 01 Jan 2016 00:00:00 +0100 On a Ramsey-type problem of Erdős and Pach.https://doi.org/10.1016/j.endm.2015.06.049, , :
On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. 49: 821-827 ()]]>https://dblp.org/rec/journals/endm/KangPR15Thu, 01 Jan 2015 00:00:00 +0100 A Precise Threshold for Quasi-Ramsey Numbers.https://doi.org/10.1137/14097313X, , , :
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29(3): 1670-1682 ()]]>https://dblp.org/rec/journals/siamdm/KangPPR15Thu, 01 Jan 2015 00:00:00 +0100 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.https://doi.org/10.1007/s10878-012-9490-y, , , , :
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 ()]]>https://dblp.org/rec/journals/jco/Bonamy0LPP14Wed, 01 Jan 2014 00:00:00 +0100 On Toughness and Hamiltonicity of 2K2-Free Graphs.https://doi.org/10.1002/jgt.21734, , :
On Toughness and Hamiltonicity of 2K2-Free Graphs. J. Graph Theory 75(3): 244-255 ()]]>https://dblp.org/rec/journals/jgt/BroersmaPP14Wed, 01 Jan 2014 00:00:00 +0100 Obtaining Online Ecological Colourings by Generalizing First-Fit.https://doi.org/10.1007/s00224-013-9513-9, , , :
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. 54(2): 244-260 ()]]>https://dblp.org/rec/journals/mst/0002PPT14Wed, 01 Jan 2014 00:00:00 +0100 Finding Shortest Paths Between Graph Colourings.https://doi.org/10.1007/978-3-319-13524-3_19, , , , :
Finding Shortest Paths Between Graph Colourings. IPEC : 221-233]]>https://dblp.org/rec/conf/iwpec/0002KKPP14Wed, 01 Jan 2014 00:00:00 +0100 A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem.http://arxiv.org/abs/1401.4931, , :
A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR abs/1401.4931 ()]]>https://dblp.org/rec/journals/corr/KuhnOP14Wed, 01 Jan 2014 00:00:00 +0100 Colouring Reconfiguration Is Fixed-Parameter Tractable.http://arxiv.org/abs/1403.6347, , , , :
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR abs/1403.6347 ()]]>https://dblp.org/rec/journals/corr/0002KKPP14Wed, 01 Jan 2014 00:00:00 +0100 Parameterized TSP: Beating the Average.http://arxiv.org/abs/1408.0531, :
Parameterized TSP: Beating the Average. CoRR abs/1408.0531 ()]]>https://dblp.org/rec/journals/corr/GutinP14Wed, 01 Jan 2014 00:00:00 +0100 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.https://doi.org/10.1137/100811416:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. SIAM J. Comput. 42(3): 1113-1131 ()]]>https://dblp.org/rec/journals/siamcomp/Patel13Tue, 01 Jan 2013 00:00:00 +0100 Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.https://doi.org/10.1016/j.tcs.2013.03.008, , :
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 ()]]>https://dblp.org/rec/journals/tcs/BroersmaGP13Tue, 01 Jan 2013 00:00:00 +0100 Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data.https://doi.org/10.1109/ICACCI.2013.6637281, , , , :
Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data. ICACCI : 817-821]]>https://dblp.org/rec/conf/icacci/MehraPKSW13Tue, 01 Jan 2013 00:00:00 +0100 Mixing of the Glauber dynamics for the ferromagnetic Potts model.http://arxiv.org/abs/1305.0776, , :
Mixing of the Glauber dynamics for the ferromagnetic Potts model. CoRR abs/1305.0776 ()]]>https://dblp.org/rec/journals/corr/abs-1305-0776Tue, 01 Jan 2013 00:00:00 +0100 The complexity of finding uniform sparsest cuts in various graph classes.https://doi.org/10.1016/j.jda.2011.12.008, , , :
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 ()]]>https://dblp.org/rec/journals/jda/BonsmaBPP12Sun, 01 Jan 2012 00:00:00 +0100 On the diameter of reconfiguration graphs for vertex colourings.https://doi.org/10.1016/j.endm.2011.09.028, , , , :
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38: 161-166 ()]]>https://dblp.org/rec/journals/endm/BonamyJLPP11Sat, 01 Jan 2011 00:00:00 +0100 Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.https://doi.org/10.1007/978-3-642-28050-4_17, , :
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC : 207-218]]>https://dblp.org/rec/conf/iwpec/BroersmaGP11Sat, 01 Jan 2011 00:00:00 +0100 Average relational distance in linear extensions of posets.https://doi.org/10.1016/j.disc.2009.10.016, :
Average relational distance in linear extensions of posets. Discret. Math. 310(5): 1016-1021 ()]]>https://dblp.org/rec/journals/dm/BrightwellP10Fri, 01 Jan 2010 00:00:00 +0100 Obtaining Online Ecological Colourings by Generalizing First-Fit.https://doi.org/10.1007/978-3-642-13182-0_22, , , :
Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR : 240-251]]>https://dblp.org/rec/conf/csr/JohnsonPPT10Fri, 01 Jan 2010 00:00:00 +0100 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.https://doi.org/10.1007/978-3-642-15775-2_48:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. ESA (1) : 561-572]]>https://dblp.org/rec/conf/esa/Patel10Fri, 01 Jan 2010 00:00:00 +0100 The Complexity Status of Problems Related to Sparsest Cuts.https://doi.org/10.1007/978-3-642-19222-7_14, , , :
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA : 125-135]]>https://dblp.org/rec/conf/iwoca/BonsmaBPP10Fri, 01 Jan 2010 00:00:00 +0100 Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.http://arxiv.org/abs/1004.4484:
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. CoRR abs/1004.4484 ()]]>https://dblp.org/rec/journals/corr/abs-1004-4484Fri, 01 Jan 2010 00:00:00 +0100 Cutting two graphs simultaneously.https://doi.org/10.1002/jgt.20274:
Cutting two graphs simultaneously. J. Graph Theory 57(1): 19-32 ()]]>https://dblp.org/rec/journals/jgt/Patel08Tue, 01 Jan 2008 00:00:00 +0100 Partitioning Posets.https://doi.org/10.1007/s11083-008-9085-5:
Partitioning Posets. Order 25(2): 131-152 ()]]>https://dblp.org/rec/journals/order/Patel08Tue, 01 Jan 2008 00:00:00 +0100