The School of Computing

Profile

Roles within department

• Erasmus Departmental Coordinator

Teaching Interests

• Mathematics for  1^st year computing students
• Discrete Mathematics and Graph Theory
• Theoretical Computer  Science (formal languages, automata)
• Computability and Theory of Complexity
• Programming

Research Interests

• Graph theory 
• Combinatorial optimization
• Operational research
• Applied problems related to optimization
• Structural mark up languages
• Digitalisation of mathematical documents
• Educational software for mathematics

Selected Publications

• Chlebík, M. and Chlebíková, J. (2009) Hardness of approximation for orthogonal rectagle packing and covering problems. Journal of Discrete Algorithms, 7 (3). pp. 291-305. ISSN 1570-8667
• Chlebík, M and Chlebíková, J. (2008) Approximation hardness of dominating set problems in bounded degree graphs. Information and Computation, 206 (11). pp. 1264-1275. ISSN 0890-5401
• Chlebík, M. and Chlebíková, J. (2008) The Steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406 (3). pp. 207-214. ISSN 0304-3975
• Chlebík, M. and Chlebíková, J. (2008) Crown reductions for the minimum weighted vertex cover problem. Discrete Applied Mathematics, 156 (3). pp. 292-312. ISSN 0166-218X
• Chlebík, M. and Chlebíková, J. (2007) The complexity of combinatorial optimization problems on d-dimensional boxes. SIAM Journal on Discrete Mathematics, 21 (1). pp. 158-169. ISSN 0895-4801
• Chlebíková, J. (2007)  Some New Excluded Minor Theorems, Periodica Mathematics Hungarica, 55, no. 1, pp. 47—55
• Chlebíková, J. and Jansen, K. (2007)  The d-precoloring problem on k-degenerate graphs, Discrete Mathematics, 307, pp. 2042-2052.
• Chlebík, M. and Chlebíková, J. (2006) Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science, 354 (3). pp. 320-338. ISSN 0304-3975