Jianwei Lin

ORCID: 0000-0003-0538-9150
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Cardiac Arrhythmias and Treatments
  • Atrial Fibrillation Management and Outcomes
  • Graph Labeling and Dimension Problems
  • Advanced Differential Equations and Dynamical Systems
  • Graph theory and applications
  • Complexity and Algorithms in Graphs
  • Cardiac electrophysiology and arrhythmias
  • Respiratory and Cough-Related Research
  • Optimization and Search Problems

RELX Group (United States)
2024

Prompt (Canada)
2024

RELX Group (United Kingdom)
2024

Sir Run Run Shaw Hospital
2023

Zhejiang University
2023

Western Michigan University
2012-2013

Importance Success rates of pulmonary vein isolation (PVI) are modest for persistent atrial fibrillation (AF). Additional linear ablation beyond PVI has not been proved superior to alone in randomized trials. Ethanol infusion the Marshall (EIVOM) facilitates at mitral isthmus and may lead improved effectiveness a strategy. Objective To determine whether with radiofrequency energy combined EIVOM added improves sinus rhythm maintenance compared patients AF. Design, Setting, Participants The...

10.1001/jama.2024.24438 article EN JAMA 2024-11-18

10.1016/s1547-5271(24)00032-8 article EN Heart Rhythm 2024-02-26

Let K 3 n denote the Cartesian product , where is complete graph on vertices.We show that domination number of 2 .

10.7151/dmgt.1731 article EN cc-by-nc-nd Discussiones Mathematicae Graph Theory 2013-10-14

Abstract Aims Pulsed-field ablation (PFA) is a promising new modality to treat atrial fibrillation. However, PFA can cause varying degrees of diaphragmatic contraction and dry cough, especially under conscious sedation. This prospective study presents method minimize the impact on cough during procedure. Methods results Twenty-eight patients underwent for pulmonary vein (PV) superior vena cava isolation Each patient received two groups ablations in each vein: control group allowed...

10.1093/europace/euad374 article EN cc-by-nc EP Europace 2023-12-28

In a properly vertex-colored graph G, path P is rainbow if no two vertices of have the same color, except possibly end-vertices P. If every G are connected by path, then vertex rainbow-connected. A proper coloring that results in rainbow-connected G. The minimum number colors needed connection vrc(G) Thus order n ≥ 2, 2 ≤ n. We present characterizations all graphs for which ∈ {2,n−1,n} and study relationship between chromatic χ(G) For size m, m − + 1 cycle rank Vertex numbers determined 0 or...

10.7151/dmgt.1586 article EN Discussiones Mathematicae Graph Theory 2012-01-01
Coming Soon ...