David Hartman

  Everything is both simpler
than we can imagine,
and more complicated
that we can conceive.

Johann Wolfgang von Goethe


Currently

research fellow at COBRA working group at institute of computer science (ICS) working on problems concerning complex networks with regard to reliable construction as well as emergence of stuctural phenomena. The corresponding application domains includes those in neurological research or climatology. Another reseach domain is analysis algebraic properties of graphs including theory of symmetric relational structures and optimization with effort to interval artithmetic both realized partially at Computer Science Institute of Charles University (IUUK) and within Interval Methods Group at Department of Applied mathematics (KAM) at Charles University in Prague. I also teach several courses at mentioned university, see particular section.

Research interests

Roughly described research topics, for more details see research.
  • Graph theory and combinatorics
  • Algebraic graph theory especially connected with model theory
  • Combinatorial theory of complex networks
  • Optimization and interval optimization and corresponding problems from linear algebra
  • Computational neuroscience
  • Computational climatology
  • Computational cybersecurity

Teaching

Major courses at Charles University in Prague, see teaching and theses.
  • Graphs and networks
  • Algorithms of nonlinear optimization
  • Selected Chapters on Combinatorics I
  • Complex network analysis
  • Optimization seminar

Contact

(room No. 238)    
Pod Vodarenskou vezi 271/2,
11800, Prague,
Czech Republic
e-mail: hartman < at > cs.cas.cz
phone: +420 266 052 081
institution web: hartman at ICS