School of Science, Engineering & Design
please wait

Page loading - please wait...

Dr Anna Huber

About Anna Huber

Anna Huber obtained her PhD from the Department of Mathematics and Informatics at the Saarland University and the Max Plank Institute for Informatics at Saarbruecken, Germany in 2010. Her thesis title is "Randomized Rounding and Rumor Spreading with Stochastic Dependencies". 

From 2010 to 2013, she was a Post-Doctoral Research Associate in the Algorithms and Complexity research group at Durham University, working on the EPSRC project “Submodular Optimization, Lattice Theory and Maximum Constraint Satisfaction Problems”.

She then moved to the University of Derby as a Lecturer in Mathematics and joined Teesside University as a Senior Lecturer in Mathematics in 2015.


Her research interests include Algebra, Graph Theory and Randomized and Combinatorial Methods and Algorithms.



   A. Huber and A. Krokhin. Oracle Tractability of Skew Bisubmodular Functions. SIAM Journal on Discrete Mathematics, 28(4), pages 1828 - 1837, 2014. 

Also available from arXiv:1308.6505. 

   A. Huber, A. Krokhin and R. Powell. Skew Bisubmodularity and Valued CSPs. SIAM Journal on Computing, 43(3), pages 1064 - 1084, 2014. 

   A. Huber, A. Krokhin and R. Powell. Skew Bisubmodularity and Valued CSPs. Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1296–1305, 2013. Short version of the above.

   A. Huber and V. Kolmogorov. Towards Minimizing k-Submodular Functions. Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO), pages 451–462, 2012. Full version available from arXiv:1309.5469, 2013.

   B. Doerr, A. Huber and A. Levavi. Strong Robustness of Randomized Rumor Spreading Protocols. Discrete Applied Mathematics, 161(6), pages 778 - 793, 2013. A short version appeared in Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), pages 812–821, 2009. 

   N. Fountoulakis, A. Huber and K. Panagiotou. Reliable Broadcasting in Random Networks and the Effect of Density. Proceedings of the 29th Conference on Computer Communications (IEEE INFOCOM) pages 1-9, 2010. This is a full version. 

   N. Fountoulakis, A. Huber and K. Panagiotou. The Speed of Broadcasting in Random Networks: Density Does Not Matter. Brief announcement in Proceedings of the 23rd International Symposium on Distributed Computing (DISC), pages 529–530, 2009. Full version available from arXiv:0904.4851. 

   N. Fountoulakis and A. Huber. Quasirandom Rumor Spreading on the Complete Graph is as Fast as Randomized Rumor Spreading. SIAM Journal on Discrete Mathematics, 23(4): 1964–1991, 2009. An extended abstract appeared in the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), ENDM 34, pages 553-559, 2009. 

   S. Angelopoulos, B. Doerr, A. Huber and K. Panagiotou. Tight Bounds for Quasirandom Rumor Spreading. The Electronic Journal of Combinatorics, 16(1):#R102, 2009.