doc. Mgr. Jan Obdržálek, PhD.


Office: C436
Botanická 554/68a
602 00 Brno

Show on the map

Phone: +420 549 49 4225
E‑mail:
CV

Curriculum vitae

Personal Data
  • Jan Obdržálek, born Dec. 9, 1977 in Brno, Czechoslovakia, married, 3 children.
Workplace
  • Department of Computer Science
    Faculty of Informatics
    Masaryk University
    Botanicka 68a
    602 00 Brno
    Czech Republic

Employment Position
  • Associate Professor
Education and Academic Qualifications
  • 2018: habilitation (Associate Professor), Faculty of Informatics, Masaryk University, Brno. Thesis: Graphs, Their Width, and Logic
  • 2006: PhD in Computer Science, University of Edinburgh. Thesis: Algorithmic Analysis of Parity Games. Supervisor: Prof. Colin Stirling, Examiners: Dr. Kousha Etessami (University of Edinburgh), Prof. Dr. Thomas Wilke (CAU Kiel, Germany)
  • 2001: Mgr. (master's degree) in computer science, Faculty of Informatics Masaryk University, Brno. Thesis: Formal verification of sequential systems with infinitely many states. Supervisor: Dr. Antonín Kučera
Employment Summary
  • 01/2018 - now: Associate Professor, Department of Computer Science, Faculty of Informatics, Masaryk University, Brno.
  • 07/2015 - 01/2018: Assistant Professor, Department of Computer Science, Faculty of Informatics, Masaryk University, Brno.
  • 09/2014 - 06/2015: Researcher, Department of Computer Science, Faculty of Informatics, Masaryk University, Brno.
  • 01/2006 - 08/2014: Researcher, Institute for Theoretical Computer Science, Faculty of Informatics, Masaryk University, Brno.
Teaching Activities
  • Lectures at FI MU
    IA014 Advanced Functional Programming, 2014 - now
    MA015 Graph Algorithms, 2015 - now
    IA010 Principles of Programming Languages, 2015
    PB006 Principy programovacích jazyků (Principles of Programming Languages), 2013-2014
    DUVOD Introduction to PhD Study, 2010-2013
    IA156 Formal Verification Methods, 2013
    IA011 Semantics of Programming Languages, 2006
  • Tutorials at FI MU
    MA015 Graph Algorithms, 2015 - now
    IB002 Algorithms and Data Structures I, 2014 - now
    IB000 Mathematical Foundations of Computer Science, 2014 - now
    MA010 Graph Theory, 2006, 2012-2013
    J003 Fundamental Concepts in Computer Science, 2015
    IB000 Induction and Recursion, 2006
    Computability & Intractability, 2001,2005
    Formal Languages and Automata, 1999-2001
    Formal Languages and Automata II, 1999-2000
  • Tutorials at the University of Edinburgh
    CS3 Computability & Intractability, 2002 - 2003
    CS3 Language Semantics and Implementation, 2002 - 2003
Research Interets
  • Algorithmic metatheorems: FO/MSO model checking, logics and their descriptive complexity; lower bounds for efficient decidability.
  • Structural graph theory: width parameters of (di)graphs, algorithmic use of these parameters.
  • Parameterized complexity - techniques and algorithms.
  • Automatic software verification and error checking.
  • Infinite two player games (esp. parity games) related to verification and logics; modal mu-calculus.
  • Modern programming languages; functional programming; theorem proving.
Academic Stays
  • 2004-2005: A five-month stay at the RWTH Aachen, Germany. Funded by RTN GAMES.
  • 2000: Summer Scholarship Programme, July 3 – September 8, EPCC, University of Edinburgh, UK. Awarded a full stipend.
Project participation
  • Research Projects
    Structural properties, parameterized tractability and hardness in combinatorial problems. GAČR GA17-00837S. Team member. 2017–2019.
    Center of Excellence - Institute for Theoretical Computer Science. GAČR GAP202/12/G061. Team member. 2012–2018.
    Parametrizované algoritmy a kernelizace v kontextu diskrétní matematiky a logiky. GAČR GA14-03501S. Team member. 2014–2016.
    Well-structured combinatorial classes, width parameters, and design of efficient algorithms. GAČR GAP202/11/0196. Team member. 2011–2013.
    Structural graph theory and parameterized complexity. GAČR GC201/09/J021. Team member. 2009–2010
    Utilization of Structural and Width Parametres in Combinatorics and Algorithmic Complexity. GAČR GA201/08/0308. Team member. 2008–2010.
    Institute for Theoretical Computer Science, ITI. MŠMT 1M0545. Task Supervisor. 2005-2011.
    Research Training Network GAMES. EU 5th Framework Programme, Edinburgh. Participating student researcher. 2002–2006
  • Educational and Development Projects
    Platform for cooperation in research and education with FI MU in data processing. OPVK project, reg. no. CZ.1.07/2.4.00/12.0049. Task coordinator. 2010–2011.
    Inovation of Doctoral Study at FI MU. OPVK project, reg. no. CZ.1.07/2.2.00/15.0196. Task coordinator. 2010–2013.
Appreciation of Science Community
  • 2001: Awarded the Overseas Research Students Award (ORS) paying the difference between home and overseas fees (very competitive).
  • 2001: Awarded Engineering and Physical Science Research Council (EPSRC) studentship covering fees, research costs and maintenance during PhD in Edinburgh.
  • 2001: Awarded the annual rector’s prize for the best student, Masaryk university.
Selected Publications
  • GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK a Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics, Elsevier B.V., 2014, roč. 168, č. 1, s. 88-107. ISSN 0166-218X. doi:10.1016/j.dam.2013.10.038. info
  • GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European Journal of Combinatorics, Elsevier, 2013, roč. 34, č. 3, s. 680-701. ISSN 0195-6698. doi:10.1016/j.ejc.2012.07.024. info
  • GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando Sanchez VILLAAMIL a Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013. s. 529-540, 12 s. ISBN 978-3-642-40449-8. doi:10.1007/978-3-642-40450-4_45. info
  • GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg. ICALP (2) 2013. Berlin Heidelberg: Springer, 2013. s. 250-262, 13 s. ISBN 978-3-642-39211-5. doi:10.1007/978-3-642-39212-2_24. info
  • BERWANGER, Dietmar, Anuj DAWAR, Paul HUNTER, Stephan KREUTZER a Jan OBDRŽÁLEK. The DAG-width of directed graphs. Journal of Combinatorial Theory, Ser B, Amsterdam: Elsevier B.V., 2012, roč. 102, č. 4, s. 900-923. ISSN 0095-8956. doi:10.1016/j.jctb.2012.04.004. info
  • OBDRŽÁLEK, Jan a Marek TRTÍK. Efficient Loop Navigation for Symbolic Execution. In Tevfik Bultan and Pao-Ann Hsiung. Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011. Heidelberg: Springer-Verlag, 2011. s. 453-462, 10 s. ISBN 978-3-642-24371-4. doi:10.1007/978-3-642-24372-1_34. info
  • BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, Germany: IBFI Schloss Dagstuhl, 2009. s. 207-218, 12 s. ISBN 978-3-939897-09-5. DOI info
  • GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Joachim KNEIS a Peter ROSSMANITH. On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. 5917. vyd. Berlin: Springer Verlag, 2009. s. 185-197, 13 s. ISBN 978-3-642-11268-3. doi:10.1007/978-3-642-11269-0_15. DOI Conference info
  • OBDRŽÁLEK, Jan, Marek TRTÍK a Jiří SLABÝ. Stanse - Static Analysis Framework for C Code. 2008. Domovská stránka nástroje Stanse info
  • OBDRŽÁLEK, Jan. Clique-Width and Parity Games. In Computer Science Logic 2007, proceedings. Berlin: Springer-Verlag, 2007. s. 54-68, 15 s. ISBN 978-3-540-74914-1. info
  • OBDRŽÁLEK, Jan. DAG-width - Connectivity Measure for Directed Graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York/Philadelphia: Association for Computing Machinery/Society for Industrial and Applied Mathematics, 2006. s. 814--821, 8 s. ISBN 0-89871-605-5. info
  • OBDRŽÁLEK, Jan. Fast Mu-calculus Model Checking when Tree-width is Bounded. In CAV 2003. Berlin Heidelberg: Springer-Verlag, 2003. s. 80-92, 13 s. ISBN 3-540-40524-0. info
  • OBDRŽÁLEK, Jan, J. M. BULL a L. A. SMITH. A Parallel Java Grande Benchmark Suite. In Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM). : ACM Press, 2001. s. 8-8, 1 s. info
  • KAMBITES, M. E., J. M. BULL a Jan OBDRŽÁLEK. An OpenMP-like interface for parallel programming in Java. Concurrency and Computation: Practice and Experience, John Wiley & Sons, Inc, 2001, roč. 13, 8-9, s. 793-814. ISSN 1532-0626. info

2018/09/26