Varmuza, K., Dehmer, M., Emmert-Streib, F., & Filzmoser, P. (2021). Automorphism groups of alkane graphs. Croatica Chemica Acta, 94(1). https://doi.org/10.5562/cca3807 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., Mowshowitz, A., Varmuza, K., & Jodlbauer, H. (2020). The orbit-polynomial: A novel measure of symmetry in networks. IEEE Access, 8, 36100–36112. https://doi.org/10.1109/access.2020.2970059 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., Mowshowitz, A., Ilić, A., Chen, Z., Yu, G., Feng, L., Ghorbani, M., Varmuza, K., & Tao, J. (2020). Relations and bounds for the zeros of graph polynomials using vertex orbits. Applied Mathematics and Computation, 380(125239), 125239. https://doi.org/10.1016/j.amc.2020.125239 ( reposiTUm)

Dehmer, M., & Varmuza, K. (2015). A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees. Applied Mathematics and Computation, 259, 242–250. https://doi.org/10.1016/j.amc.2015.02.042 ( reposiTUm)

Varmuza, K., Filzmoser, P., & Dehmer, M. (2013). Multivariate linear QSPR/QSAR models: Rigorous evaluation of variable selection for PLS. Computational and Structural Biotechnology Journal, 5(e201302007), e201302007. https://doi.org/10.5936/csbj.201302007 ( reposiTUm)

Dehmer, M., Sivakumar, L., & Varmuza, K. (2012). Uniquely discriminating molecular structures using novel eigenvalue-based descriptors. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 67, 147–172. http://hdl.handle.net/20.500.12708/163749 ( reposiTUm)

Dehmer, M., Grabner, M., & Varmuza, K. (2012). Information indices with high discriminative power for graphs. PLoS ONE, 7(2), e31214. https://doi.org/10.1371/journal.pone.0031214 ( reposiTUm)

Varmuza, K., Filzmoser, P., Liebmann, B., & Dehmer, M. (2012). Redundancy analysis for characterizing the correlation between groups of variables - Applied to molecular descriptors. Chemometrics and Intelligent Laboratory Systems, 117, 31–41. https://doi.org/10.1016/j.chemolab.2011.05.013 ( reposiTUm)

Mueller, L. A. J., Kugler, K. G., Dander, A., Graber, A., & Dehmer, M. (2011). QuACN: an R package for analyzing complex biological networks quantitatively. Bioinformatics, 27(1), 140–141. https://doi.org/10.1093/bioinformatics/btq606 ( reposiTUm)

Dehmer, M., & Mowshowitz, A. (2011). A history of graph entropy measures. Information Sciences, 181(1), 57–78. https://doi.org/10.1016/j.ins.2010.08.041 ( reposiTUm)

Diudea, M. V., Ilic, A., Varmuza, K., & Dehmer, M. (2011). Network Analysis Using a Novel Highly Discriminating Topological Index. Complexity, 16(6), 32–39. http://hdl.handle.net/20.500.12708/162646 ( reposiTUm)

Molina, F., Dehmer, M., Perco, P., Graber, A., Girolami, M., Spasovski, G., Schanstra, J. P., & Vlahou, A. (2010). Systems biology: opening new avenues in clinical research. Nephrology Dialysis Transplantation, 25(4), 1015–1018. https://doi.org/10.1093/ndt/gfq033 ( reposiTUm)

Dehmer, M., & Mowshowitz, A. (2010). Inequalities for entropy-based measures of network information content. Applied Mathematics and Computation, 215(12), 4263–4271. https://doi.org/10.1016/j.amc.2009.12.051 ( reposiTUm)

Dehmer, M., Barbarini, N., Varmuza, K., & Graber, A. (2010). Novel topological descriptors for analyzing biological networks. BMC Structural Biology, 10(18). http://hdl.handle.net/20.500.12708/167564 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., Tsoy, Y. R., & Varmuza, K. (2010). New information functional for analyzing chemical graph structures (in Russian). Bulletin of the Tomsk Polytechnic University, 316(5), 5–11. http://hdl.handle.net/20.500.12708/167569 ( reposiTUm)

Dehmer, M., Varmuza, K., Borgert, S., & Emmert-Streib, F. (2009). On Entropy-Based Molecular Descriptors : Statistical Analysis of Real and Synthetic Chemical Structures. Journal of Chemical Information and Modeling, 49(7), 1655–1663. https://doi.org/10.1021/ci900060x ( reposiTUm)

Dehmer, M., Barbarini, N., Varmuza, K., & Graber, A. (2009). A Large Scale Analysis of Information-Theoretic Network Complexity Measures Using Chemical Structures. PLoS ONE, 4(12), e8057. https://doi.org/10.1371/journal.pone.0008057 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2008). Structural information content of networks: graph entropy based on local vertex functionals. Computational Biology and Chemistry, 32(2), 131–138. https://doi.org/10.1016/j.compbiolchem.2007.09.007 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2008). The structural information content of chemical networks. Zeitschrift Fur Naturforschung A, 63A, 155–159. http://hdl.handle.net/20.500.12708/170654 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., & Gesell, T. (2008). A comparative analysis of multidimensional features of objects resembling sets of graphs. Applied Mathematics and Computation, 196(1), 221–235. https://doi.org/10.1016/j.amc.2007.05.058 ( reposiTUm)

Dehmer, M. (2008). Information processing in complex networks: Graph entropy and information functionals. Applied Mathematics and Computation, 201(1–2), 82–94. https://doi.org/10.1016/j.amc.2007.12.010 ( reposiTUm)

Dehmer, M., Borgert, S., & Bonchev, D. (2008). Information inequalities for graphs. SYMMETRY: Culture and Science, 19(4), 269–284. http://hdl.handle.net/20.500.12708/171336 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2008). Robustness in scale-free networks: comparing directed and undirected networks. International Journal of Modern Physics C, 19(5), 717–726. http://hdl.handle.net/20.500.12708/170114 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2007). Structural similarity of directed universal hierarchical graphs: a low computational complexity approach. Applied Mathematics and Computation, 194(1), 7–20. https://doi.org/10.1016/j.amc.2007.04.006 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2007). Comparing large graphs efficiently by margins of feature vectors. Applied Mathematics and Computation, 188(2), 1699–1710. https://doi.org/10.1016/j.amc.2006.11.185 ( reposiTUm)

Dehmer, M., & Kilian, J. (2007). On bounds for the zeros of univariate polynomials. International Journal of Applied Mathematics and Computer Sciences, 4(2), 495–500. http://hdl.handle.net/20.500.12708/168779 ( reposiTUm)

Dehmer, M., & Mehler, A. (2007). A new method of measuring similarity for a special class of directed graphs. Tatra Mountains Mathematical Publications, 36, 39–59. http://hdl.handle.net/20.500.12708/168777 ( reposiTUm)

Emmert-Streib, F., & Dehmer, M. (2007). Optimization procedure for predicting nonlinear time series based on a non-Gaussian noise model. MICAI 2007: Advances in Artificial Intelligence, 540–549. https://doi.org/10.1007/978-3-540-76631-5_51 ( reposiTUm)

Emmert-Streib, F., & Dehmer, M. (2007). Information theoretic measures of UHG graphs with low computational complexity. Applied Mathematics and Computation, 190(2), 1783–1794. https://doi.org/10.1016/j.amc.2007.02.095 ( reposiTUm)

Emmert-Streib, F., & Dehmer, M. (2007). Global information processing in gene networks: fault tolerance. BIONETCS, PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON BIO-INSPIRED MODELS OF NETWORK, INFORMATION, AND COMPUTING SYSTEMS, 4. http://hdl.handle.net/20.500.12708/168808 ( reposiTUm)

Emmert-Streib, F., & Dehmer, M. (2007). Topological mappings between graphs, trees and generalized trees. Applied Mathematics and Computation, 186(2), 1326–1333. https://doi.org/10.1016/j.amc.2006.07.162 ( reposiTUm)

Varmuza, K., & Dehmer, M. (2011). Uniqueness of numerical molecular descriptors for organic compounds. In Conferentia Chemometrica 2011. Conferentia Chemometrica 2011, Sümeg, Ungarn, EU. http://hdl.handle.net/20.500.12708/47430 ( reposiTUm)

Varmuza, K., Filzmoser, P., & Dehmer, M. (2010). Statistical evaluation of molecular descriptors used in quantitative-structure-activity relationships. In Programme and Abstracts (p. 55). http://hdl.handle.net/20.500.12708/47028 ( reposiTUm)

Varmuza, K., Dehmer, M., & Borgert, S. (2008). Molecular Descriptors Based on Entropy and the Full Topological Neighborhood of All Atoms. In 22. CIC- Workshop (p. 97). http://hdl.handle.net/20.500.12708/46316 ( reposiTUm)

Kreuzer, M. (2008). On the statistics of lattice polytopes. In M. Dehmer, M. Drmota, & F. Emmert-Streib (Eds.), Proceedings of the 2008 International Conference on Information Theory and Statistical Learning (pp. 119–124). CSREA Press. http://hdl.handle.net/20.500.12708/44488 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., & Zulauf, A. (2007). A Graph mining technique for automatic classification of web genre data. In Prodeedings of the 2007 International Conference on Machine Learning; Models Technologies & Applications (pp. 10–14). CSREA Press. http://hdl.handle.net/20.500.12708/40715 ( reposiTUm)

Dehmer, M., Mehler, A., & Emmert-Streib, F. (2007). Graph-theoretical characterizations of generalized trees. In Proceedings of the 2007 International Conference on Machine Learning; Models Technologies & Applications (pp. 113–117). CSREA Press. http://hdl.handle.net/20.500.12708/40716 ( reposiTUm)

Dehmer, M., Sivakumar, L., & Varmuza, K. (2012). On distance-based entropy measures. In I. Gutman & B. Furtula (Eds.), Distance in Molecular Graphs - Theory, Mathematical Chemistry Monographs (pp. 123–138). University of Kragujevac, Serbia. http://hdl.handle.net/20.500.12708/27635 ( reposiTUm)

Dehmer, M., & Varmuza, K. (2012). On Aspects of the Degeneracy of Topological Indices. In Advanced Computational Technologies (pp. 99–107). Romanian Academy Publishing House. http://hdl.handle.net/20.500.12708/27954 ( reposiTUm)

Dehmer, M., Emmert-Streib, F., Tsoy, Y. R., & Varmuza, K. (2011). Quantifying structural complexity of graphs : Information measures in mathematical chemistry. In Quantum Frontiers of Atoms and Molecule (pp. 479–497). Nova Science Publishers, Inc. http://hdl.handle.net/20.500.12708/27334 ( reposiTUm)

Drmota, M., & Gittenberger, B. (2009). Analytic combinatorics on random graphs. In M. Dehmer & F. Emmert-Streib (Eds.), Analysis of Complex Networks (pp. 425–448). Wiley-VCH. http://hdl.handle.net/20.500.12708/26367 ( reposiTUm)

Dehmer, M., Varmuza, K., & Bonchev, D. (Eds.). (2012). Statistical Modelling of Molecular Descriptors in QSAR/QSPR. Wiley - Blackwell. http://hdl.handle.net/20.500.12708/23528 ( reposiTUm)

Dehmer, M., & Emmert-Streib, F. (2008). Analysis of microarray data: A network-based approach. Wiley-VCH. http://hdl.handle.net/20.500.12708/22182 ( reposiTUm)

Dehmer, M., Drmota, M., & Emmert-Streib, F. (Eds.). (2008). Proceedings of the 2008 International Conference on Information Theory and Statistical Learning. CSREA Press. http://hdl.handle.net/20.500.12708/23052 ( reposiTUm)

Arabnia, H. R., Dehmer, M., Emmert-Streib, F., & Qu Yang, M. (Eds.). (2007). Proceedings of the 2007 International Conference on Machine Learning; Models, Technologies & Applications. CSREA Press. http://hdl.handle.net/20.500.12708/22184 ( reposiTUm)

Varmuza, K., Dehmer, M., & Filzmoser, P. (2013). Empirical modeling of mass spectral features by molecular descriptors. CC 2013 Conferentia Chemometrica 2013, Sopron / Hungary, EU. http://hdl.handle.net/20.500.12708/120582 ( reposiTUm)

Dehmer, M., Varmuza, K., & Emmert-Streib, F. (2009). Information Measures for Characterizing Weighted Chemical Graphs. 24#^{th} MATH/CHEM/COMP Conference, Dubrovnik, Kroatien, Non-EU. http://hdl.handle.net/20.500.12708/98103 ( reposiTUm)

Dehmer, M. (2007). Techniques for measuring the structural similarity and information content of networks. Madeira Math Encounters XXXIII, Madeira, Spain, EU. http://hdl.handle.net/20.500.12708/118445 ( reposiTUm)

Dehmer, M. (2007). A graph mining technique for automatic classification of web genre data. The 2007 International Confernce on Machine Learning: Models Technologies & Applications (MLMTA07), Las Vegas, USA, Non-EU. http://hdl.handle.net/20.500.12708/118446 ( reposiTUm)

Dehmer, M. (2007). On novel bounds for zeros of complex polynomials. Kharkov National University, Department of Function Theory and Functional Analysis, Karkov, Ukaine, Non-EU. http://hdl.handle.net/20.500.12708/118444 ( reposiTUm)

Dehmer, M. (2007). Location of zeros of complex valued-polynomials. International Conference on Computer, Electrical, and Systems Science, and Engineering, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118442 ( reposiTUm)

Dehmer, M. (2007). Techniques to compare networks structurally. NEMO Pojekt Meeting, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118447 ( reposiTUm)

Dehmer, M. (2007). Structural analysis of graphs usind information theoretic functionals. 12th Workshop on Graph Theory(CID 2007 Colourings, Independence and Domination), Karpacz, Poland, EU. http://hdl.handle.net/20.500.12708/118371 ( reposiTUm)

Dehmer, M. (2007). Analysis of complex networks : graph and information-theoretic methods [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181442 ( reposiTUm)