EDBT 2026 Demo / reviewers in the wild / expert
Jianguo Qian
dblp:36/803
· DBLP profile ↗
14ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0001-6399-1452ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 10 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 4 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On group-valued potential differences and flows in a signed graph
Jianguo Qian |
Discret. Appl. Math. | 2 |
| 2025 | Determining some graph joins by the signless Laplacian spectrum
Jiachang Ye, Jianguo Qian, Zoran Stanic |
Discret. Appl. Math. | 2 |
| 2024 | Menger-Type Connectivity of Line Graphs of Generalized Hypercubes With Faulty EdgesabstractAbstract A connected graph $G$ is called strongly Menger edge connected if $G$ has min{deg$_{G}(x)$, deg$_{G}(y)$} edge-disjoint paths between any two distinct vertices $x$ and $y$ in $G$. In this paper, we consider two types of the strongly Menger edge connectivity of the line graphs of generalized $n$-dimensional hypercubes with faulty edges, namely the $m$-edge-fault-tolerant and $m$-conditional edge-fault-tolerant strongly Menger edge connectivity. We show that the line graphs of all generalized $n$-dimensional hypercubes are $(2n-4)$-edge-fault-tolerant strongly Menger edge connected for $n\geq 3$ and $(4n-10)$-conditional edge-fault-tolerant strongly Menger edge connected for $n\geq 4$. The two bounds for the maximum numbers of faulty edges are best possible. Huanshen Jia, Jianguo Qian |
Comput. J. | 2 |
| 2024 | Minimum number of maximal dissociation sets in trees
Junxia Zhang, Jianguo Qian, Sumin Huang |
Discret. Appl. Math. | 2 |
| 2023 | Dependency-Aware Core Column Discovery for Table Understanding
Jingyi Qiu, Aibo Song, Jiahui Jin 0001, Tianbo Zhang, Jingyi Ding, Xiaolin Fang 0001, Jianguo Qian |
ISWC | 7 |
| 2022 | Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-SeparatorsabstractWhitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later, Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every such triangulation on $n$ vertices has at least $2(n - 2)(n - 4)$ hamiltonian cycles. Along this direction, Brinkmann, Souffriau, and Van Cleemput in 2018 established a linear lower bound on the number of hamiltonian cycles in 4-connected planar triangulations. In stark contrast, Alahmadi, Aldred, and Thomassen in 2020 showed that every 5-connected triangulation of the plane or the projective plane has exponentially many hamiltonian cycles. This gives the motivation to study the number of hamiltonian cycles of 4-connected triangulations with few 4-separators. Recently, Liu and Yu in 2021 showed that every 4-connected planar triangulation with $O(n / \log n)$ 4-separators has a quadratic number of hamiltonian cycles. By adapting the framework of Alahmadi, Aldred, and Thomassen, we strengthen the last two aforementioned results. We prove that every 4-connected planar or projective planar triangulation with $O(n)$ 4-separators has exponentially many hamiltonian cycles. On-Hei Solomon Lo, Jianguo Qian |
SIAM J. Discret. Math. | 2 |
| 2020 | An Ore-type condition for the existence of two disjoint cycles
Maoqun Wang, Jianguo Qian |
Inf. Process. Lett. | 2 |
| 2013 | L(p, q)-Labeling and Integer Flow on Planar GraphsabstractGiven a graph G and two non-negative integers p and q, an L(p, q)-labeling c of G is an assignment of non-negative integers to the vertices of G such that, for any two vertices u and v, |c(u) − c(v)| ≥ p if d(u, v)=1 and |c(u) − c(v)| ≥ q if d(u, v)=2. The L(p, q)-labeling problem arises from a variation of the channel assignment problem. We establish a connection between the L(p, q)-labeling of the planar graph G and the integer flow on the dual graph of G. This provides us with an alternative and potentially more effective way to minimize the edge span of L(p, q)-labelings for planar graphs by using a graph flow approach. As examples, we apply this approach to determine the minimum edge spans of the L(p, q)-labelings for some typical finite planar lattices, including the square lattice, triangular lattice, hexagonal lattice as well as some other lattices consisting of various regular polygons, some of which arise from the design of planar regions for cellular phone networks. Our flow-based approach is also expected to have some further applications in optimizing the other measures for the L(p, q)-labeling problem. Jianguo Qian |
Comput. J. | 2 |
| 2013 | First Demonstration of Multiplexed X-Ray Fluorescence Computed Tomography (XFCT) ImagingabstractSimultaneous imaging of multiple probes or biomarkers represents a critical step toward high specificity molecular imaging. In this work, we propose to utilize the element-specific nature of the X-ray fluorescence (XRF) signal for imaging multiple elements simultaneously (multiplexing) using XRF computed tomography (XFCT). A 5-mm-diameter pencil beam produced by a polychromatic X-ray source (150 kV, 20 mA) was used to stimulate emission of XRF photons from 2% (weight/volume) gold (Au), gadolinium (Gd), and barium (Ba) embedded within a water phantom. The phantom was translated and rotated relative to the stationary pencil beam in a first-generation CT geometry. The X-ray energy spectrum was collected for 18 s at each position using a cadmium telluride detector. The spectra were then used to isolate the K shell XRF peak and to generate sinograms for the three elements of interest. The distribution and concentration of the three elements were reconstructed with the iterative maximum likelihood expectation maximization algorithm. The linearity between the XFCT intensity and the concentrations of elements of interest was investigated. We found that measured XRF spectra showed sharp peaks characteristic of Au, Gd, and Ba. The narrow full-width at half-maximum (FWHM) of the peaks strongly supports the potential of XFCT for multiplexed imaging of Au, Gd, and Ba ( FWHM(Au,Kα1) = 0.619 keV, FWHM(Au,Kα2)=1.371 keV , FWHM(Gd,Kα)=1.297 keV, FWHM(Gd,Kβ)=0.974 keV , FWHM(Ba,Kα)=0.852 keV, and FWHM(Ba,Kβ)=0.594 keV ). The distribution of Au, Gd, and Ba in the water phantom was clearly identifiable in the reconstructed XRF images. Our results showed linear relationships between the XRF intensity of each tested element and their concentrations ( R(2)(Au)=0.944 , R(Gd)(2)=0.986, and R(Ba)(2)=0.999), suggesting that XFCT is capable of quantitative imaging. Finally, a transmission CT image was obtained to show the potential of the approach for providing attenuation correction and morphological information. In conclusion, XFCT is a promising modality for multiplexed imaging of high atomic number probes. Yu Kuang, Guillem Pratx, Magdalena Bazalova-Carter, Bowen Meng, Jianguo Qian, Lei Xing 0001 |
IEEE Trans. Medical Imaging | 5 |
| 2009 | Conjugated trees with minimum general Randic index
Jianguo Qian |
Discret. Appl. Math. | 2 |
| 2009 | A generalization of Sperner's theorem and an application to graph orientations
Jianguo Qian, Konrad Engel |
Discret. Appl. Math. | 1 |
| 2009 | On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
Meirun Chen, Jianguo Qian |
Inf. Process. Lett. | 2 |
| 2008 | Multi-hop all-to-all optical routings in Cartesian product networks
Fuji Zhang, Jianguo Qian |
Inf. Process. Lett. | 3 |
| 2004 | Expanding and forwarding parameters of product graphs
Jianguo Qian, Fuji Zhang |
Discret. Appl. Math. | 1 |