Qiongxiang Huang

51 papers Journal 50Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Ordering signless Laplacian spectral radii of graphs with given size and girth. Comput. Appl. Math. Yarong Hu, Zhenzhen Lou, Qiongxiang Huang
2025	J	`jnl`	Graphs with the minimum spectral radius for given independence number. Discret. Math. Yarong Hu, Qiongxiang Huang, Zhenzhen Lou
2023	J	`jnl`	A complete characterization of graphs with exactly two positive eigenvalues. Adv. Appl. Math. Fang Duan, Qiongxiang Huang, Xueyi Huang, Zoran Stanic, Jianfeng Wang
2023	J	`jnl`	On the Spectral Radius of Minimally 2-(Edge)-Connected Graphs with Given Size. Electron. J. Comb. Zhenzhen Lou, Mingfei Gao, Qiongxiang Huang
2023	J	`jnl`	Ordering Discret. Math. Yarong Hu, Zhenzhen Lou, Qiongxiang Huang
2022	J	`jnl`	Mixed graphs with smallest eigenvalue greater than -5+12. Discret. Math. Lu Lu, Zhenzhen Lou, Qiongxiang Huang
2022	J	`jnl`	Quadratic Embedding Constants of Graph Joins. Graphs Comb. Zhenzhen Lou, Nobuaki Obata, Qiongxiang Huang
2021	J	`jnl`	The extremal graphs of order trees and their topological indices. Appl. Math. Comput. Rui Song, Qiongxiang Huang, Peng Wang
2019	J	`jnl`	On graphs with exactly two positive eigenvalues. Ars Math. Contemp. Fang Duan, Qiongxiang Huang, Xueyi Huang
2019	J	`jnl`	On the Eigenvalues Distribution in Threshold Graphs. Graphs Comb. Zhenzhen Lou, Jianfeng Wang, Qiongxiang Huang
2019	J	`jnl`	The Second Eigenvalue of some Normal Cayley Graphs of Highly Transitive Groups. Electron. J. Comb. Xueyi Huang, Qiongxiang Huang, Sebastian M. Cioaba
2018	J	`jnl`	A sharp lower bound on Steiner Wiener index for trees with given diameter. Discret. Math. Lu Lu, Qiongxiang Huang, Jiangxia Hou, Xun Chen
2018	J	`jnl`	Graphs with at Most Three Distance Eigenvalues Different from -1 and -2. Graphs Comb. Xueyi Huang, Qiongxiang Huang, Lu Lu
2017	J	`jnl`	Automorphism group of the complete alternating group graph. Appl. Math. Comput. Xueyi Huang, Qiongxiang Huang
2017	J	`jnl`	Construction of graphs with distinct eigenvalues. Discret. Math. Zhenzhen Lou, Qiongxiang Huang, Xueyi Huang
2016	J	`jnl`	A sharp upper bound on the spectral radius of generalized weighted digraphs. Ars Comb. Ping Li, Qiongxiang Huang
2016	J	`jnl`	The Characteristic Polynomial of a kind of Hexagonal System and its Application. Ars Comb. Caixia Song, Qiongxiang Huang
2016	J	`jnl`	The spectral radius of maximum weighted cycle. Discret. Math. Algorithms Appl. Lu Lu, Qiongxiang Huang, Lin Chen
2015	J	`jnl`	On the Laplacian integral (k-1)-cyclic graphs. Ars Comb. Xueyi Huang, Qiongxiang Huang
2014	J	`jnl`	The Spectral Radius of Maximum Weighted Unicyclic Graph. Ars Comb. Xingming Tao, Qiongxiang Huang, Fenjin Liu
2014	J	`jnl`	The packing number and Laplacian spectrum of a graph. Int. J. Comput. Math. Fei Wen, Qiongxiang Huang, Zhenzhen Lou
2013	J	`jnl`	Almost every complement of a tadpole graph is not chromatically unique. Ars Comb. Jianfeng Wang, Qiongxiang Huang, Kok Lay Teo, Francesco Belardo, Ruying Liu, Chengfu Ye
2013	J	`jnl`	On the Laplacian spectral characterization of the generalized T-shape trees. Ars Comb. Fei Wen, Qiongxiang Huang
2013	J	`jnl`	On the spectral radius of quasi-unicycle graphs. Ars Comb. Fenjin Liu, Qiongxiang Huang
2012	J	`jnl`	On the spectral radii of weighted double stars. Appl. Math. Lett. Fenjin Liu, Qiongxiang Huang, Xingming Tao
2010	J	`jnl`	Note on the choosability of bipartite graphs. Ars Comb. Guoping Wang, Qiongxiang Huang
2010	J	`jnl`	On the spectral characterizations of ∞-graphs. Discret. Math. Jianfeng Wang, Qiongxiang Huang, Francesco Belardo, Enzo Maria Li Marzi
2010	J	`jnl`	On the two largest Q-eigenvalues of graphs. Discret. Math. Jianfeng Wang, Francesco Belardo, Qiongxiang Huang, Bojana Borovicanin
2010	J	`jnl`	Some results on the signless Laplacians of graphs. Appl. Math. Lett. Jianfeng Wang, Qiongxiang Huang, Xinhui An, Francesco Belardo
2010	J	`jnl`	Spectral Characterizations of Dumbbell Graphs. Electron. J. Comb. Jianfeng Wang, Francesco Belardo, Qiongxiang Huang, Enzo Maria Li Marzi
2009	J	`jnl`	A new expression for the adjoint polynomial of a path. Australas. J Comb. Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu
2009	J	`jnl`	Color-character of uncolorable cubic graphs. Appl. Math. Lett. Juan Yan, Qiongxiang Huang
2009	J	`jnl`	Enumeration of 2-regular circulant graphs and directed double networks. Discret. Appl. Math. Aygul Mamut, Qiongxiang Huang, Fenjin Liu
2009	J	`jnl`	On the choosability of bipartite graphs. Ars Comb. Guoping Wang, Qiongxiang Huang
2009	J	`jnl`	The cospectral equivalence classes of graphs having an isolated vertex. Comput. Math. Appl. Jianfeng Wang, Qiongxiang Huang, Yongzhi Liu, Ruying Liu, Chengfu Ye
2008	J	`jnl`	A complete solution to the chromatic equivalence class of graph Discret. Math. Jianfeng Wang, Ruying Liu, Chengfu Ye, Qiongxiang Huang
2008	J	`jnl`	On generalized theta-graphs whose second largest eigenvalue does not exceed 1. Discret. Math. Mingfei Gao, Qiongxiang Huang
2008	J	`jnl`	On the spectral radius of graphs with k-vertex cut. Ars Comb. Guoping Wang, Qiongxiang Huang, Jing Cai
2008	J	`jnl`	The chromatic equivalence class of graph Discuss. Math. Graph Theory Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye
2007	J	`jnl`	Consecutive edge-coloring of the generalized theta-graph. Discret. Appl. Math. Yong-De Feng, Qiongxiang Huang
2007	J	`jnl`	The Edge Choosability of Cn x Pm. Ars Comb. Guoping Wang, Qiongxiang Huang
2005	—	`conf`	Relational to XML Schema Conversion with Constraints. ASIAN Teng Lv, Ping Yan, Qiongxiang Huang
2003	J	`jnl`	A classification of circulant DCI(CI)-digraphs of 2-power order. Discret. Math. Qiongxiang Huang
2001	J	`jnl`	Circulant digraphs determined by their spectra. Discret. Math. Qiongxiang Huang, An Chang
2000	J	`jnl`	A Classification of J. Comb. Theory B Qiongxiang Huang, Jixiang Meng
1998	J	`jnl`	Almost all Cayley graphs have diameter 2. Discret. Math. Jixiang Meng, Qiongxiang Huang
1997	J	`jnl`	Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups. Australas. J Comb. Qiongxiang Huang
1997	J	`jnl`	On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs. Discret. Appl. Math. Huaxiao Zhang, Fuji Zhang, Qiongxiang Huang
1997	J	`jnl`	The Automorphism Groups of Minimal Infinite Circulant Digraphs. Eur. J. Comb. Jixiang Meng, Qiongxiang Huang
1996	J	`jnl`	On the isomorphisms and automorphism groups of circulants. Graphs Comb. Qiongxiang Huang, Jixiang Meng
1996	J	`jnl`	The automorphism groups of circulant digraphs of degree 3. Ars Comb. Qiongxiang Huang, Jinjiang Yuan

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.