- 200 years
- Study
- International
- Business and employers
- Research
- About us
https://webcdn.mmu.ac.uk/profiles/img/profile-images/1Jan-Foniok-0072-crop-145x145-5821f6685dc71.png
A mathematician.
“The attempt to assess the impact of research before it is done is going to destroy research completely.”
— Sir Tony Hoare FRS FREng, inventor of Quicksort
“We need more shepherds and not more sheep.”
PhD in Theoretical Computer Science (2007): Charles University, Prague.
PGCert in Learning and Teaching in HE (2016): Manchester Metropolitan University.
University of Warwick, UK (2013–2014)
Queen's University, Canada (2011–2013)
Ecole Polytechnique, France (2011)
ETH Zurich, Switzerland (2007–2010)
In 2001–2004 I was an elected member of Charles University’s Academic Senate. The Academic Senate is the University’s highest self-governing body. In 2002–2004 I was the chairman of the Senate’s Social Affairs Committee.
I can read maths in Russian!
Operational research is the discipline of applying advanced analytical methods to help make better decisions. Learn more about OR.
Discrete mathematics has in the past often been frowned upon as trivial by many mathematicians, interested in all things infinite and continuous. This changed with the advent of computing; discrete mathematicians made enormous contributions to the development of the algorithms behind all the software (a.k.a. “apps”) that make today’s world what it is.
Combinatorics, Graph Theory, Mathematical Programming (“the maths of OR”)
J. Foniok, B. Gaertner, L. Klaus, M. Sprecher (2014). Counting unique-sink orientations. DISCRETE APPLIED MATHEMATICS. 163, pp.155-164.
J. Foniok, C. Tardif (2015). Digraph functors which admit both left and right adjoints. DISCRETE MATHEMATICS. 338(4), pp.527-535.
J. Foniok (2014). On ramsey properties of classes with forbidden trees. Logical Methods in Computer Science. 10(3),
A. Collins, J. Foniok, N. Korpelainen, V. Lozin, V. Zamaraev Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Applied Mathematics.
J. Foniok, B. Gaertner, L. Klaus, M. Sprecher (2014). Counting unique-sink orientations. DISCRETE APPLIED MATHEMATICS. 163, pp.155-164.
J. Foniok, K. Fukuda, L. Klaus (2011). Combinatorial characterizations of K-matrices. LINEAR ALGEBRA AND ITS APPLICATIONS. 434(1), pp.68-80.
J. Foniok P-matrix recognition is co-NP-complete. Computing Research Repository (CoRR). arXiv:0710.3519,
J. Foniok, J. Nesetril, C. Tardif (2007). On Finite Maximal Antichains in the Homomorphism Order. Electron. Notes Discret. Math.. 29(SPEC. ISS.), pp.389-396.
A. Atminas, A. Collins, J. Foniok, VV. Lozin (2014). Deciding the Bell number for hereditary graph properties. In: Lecture Notes in Computer Science. Nouan-le-Fuzelier, France, 25/6/2014. pp.69-80.
J. Foniok, J. Nesetril, C. Tardif (2006). Generalised Dualities and Finite Maximal Antichains. In: WG. Bergen, NORWAY, 22/6/2006. pp.27-36.
Linear programming over cubes and hidden-K LCPs. Recent Advances in Linear Optimization, Ecole des Ponts ParisTech, Paris, July 2014.
Constraint satisfaction problems with tree duality. North British Semigroups and Applications Network Meeting, Norwich, England, April 2014.
Homomorphism Dualities. Ontario Combinatorics Workshop, Fields Institute, Toronto, May 2012.
Linear complementarity, unique-sink orientations and oriented matroids. Conference on Discrete Geometry and Optimization, Fields Institute, Toronto, September 2011.
Adjoint functors on digraphs. Workshop on Graph Homomorphisms, Fields Institute, Toronto, July 2011.
Reviewer for Mathematical Reviews.
Peer reviews for: Algorithmica, Canadian Math Bulletin, Combinatorica, Commentationes Mathematicæ Universitatis Carolinæ, Discrete Mathematics, European Journal of Combinatorics, Fundamenta Mathematicae, Graphs and Combinatorics, Journal of Graph Theory, Order, SIAM Journal on Discrete Mathematics.
Swiss National Science Foundation (SNF): project A Fresh Look at the Complexity of Pivoting in Linear Complementarity, 2009–2012, jointly with K. Fukuda.
Swiss National Science Foundation (SNF): Advanced Researcher Fellowship, 2011–2013.
London Mathematical Society (LMS): Research in Pairs small grant, 2017, for a research trip to Kingston, Ontario.
In 1993–1996 and again in 1997–2006 I was an organiser of Pikomat MFF UK, a mathematics competition for children aged 12–15. In 2000–2005 I was the managing organiser; this included leading a team of about 15 collaborators. The programme consisted partly in Spring Schools and Summer Camps, in whose preparation and running I was involved, too.
In 2006 and 2007 I was in charge of organising the competition MASO on behalf of the Institute for Theoretical Computer Science. MASO is a competition for teams of schoolchildren; almost 300 participants took part.
ESGI138: Workflow Modelling of Construction Projects. 2018.
ESGI130: Strategies for the use of Data and Algorithmic Approaches in Railway Traffic Management. 2017.
Fellow of the Higher Education Academy
London Mathematical Society (member)
Swiss Operations Research Society (member)