  |
Items where Author is "Szajkó, Anikó"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 3. ArticleMann, Zoltán Ádám and Szajkó, Anikó (2013) Average-case complexity of backtrack search for coloring sparse random graphs. Journal of Computer and System Sciences, 79 (8). pp. 1287-1301. ISSN 0022-0000 Book SectionMann, Zoltán Ádám and Szajkó, Anikó (2012) Complexity of different ILP models of the frequency assignment problem. In: Linear Programming - New Frontiers in Theory and Applications. Nova Science Publishers, pp. 305-326. ISBN 978-1-61209-579-0 Mann, Zoltán Ádám and Szajkó, Anikó (2011) Determining the expected runtime of an exact graph coloring algorithm. In: Proceedings of the 2010 Mini-Conference on Applied Theoretical Computer Science. University of Primorska Press, pp. 75-83. ISBN 978-961-6832-10-6 |
