Research Statement Darren Strash Institute of Theoretical Informatics Karlsruhe Institute of Technology January 12, 2015

Source URL: www.ics.uci.edu

• NP-complete problems
• Algorithm
• Mathematical logic
• Graph theory
• Computational geometry
• Graph coloring
• Combinatorics
• Distributed computing
• Kurt Mehlhorn
• Theoretical computer science
• Mathematics
• Applied mathematics

Effects of Grounded and Formal Representations on Combinatorics Learning David W. Braithwaite () Robert L. Goldstone () Department of Psychology, 1101 E. 10th Street Bloomington, I

Source URL: cognitrn.psych.indiana.edu

CCCG 2011, Toronto ON, August 10–12, 2011 Combinatorics of Minkowski decomposition of associahedra Carsten E. M. C. Lange∗ Abstract

Source URL: www.cccg.ca

• Simplex
• Convex polytope
• Permutohedron
• Minkowski addition
• Abstract polytope
• Geometry
• Polytopes
• Mathematics

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

Source URL: research.microsoft.com

• Models of computation
• Mathematics
• Computer science
• Combinatorics on words
• Finite state transducer
• Tree automaton
• Finite-state machine
• Alphabet
• Regular language
• Automata theory
• Formal languages
• Theoretical computer science

CCCG 2010, Winnipeg MB, August 9–11, 2010 Six-way Equipartitioning by Three Lines in the Plane William Steiger∗ Mario Szegedy

Source URL: cccg.ca

• Euclidean plane geometry
• Triangles
• Equipartition theorem
• Thermodynamics
• Quadrilateral
• Combinatorics
• Trigonometric functions
• Norm
• Polygon
• Geometry
• Mathematics
• Euclidean geometry

Probabilistic analysis of the (1 C 1)-evolutionary algorithm Alois Panholzer| Institut f¨ur Diskrete Mathematik und Geometrie Technische Universit¨at Wien

Source URL: 140.109.74.92

• Number theory
• Bessel function
• Combinatorics
• Asymptotic analysis
• Mathematical analysis
• Mathematics
• Harmonic number

CCCG 2011, Toronto ON, August 10–12, 2011 On the generation of topological (nk )-configurations J¨ urgen Bokowski

Source URL: www.cccg.ca

• Arrangement of lines
• Incidence geometry
• Configuration
• Combinatorics
• Sweep line algorithm
• Projective plane
• Geometry
• Euclidean plane geometry
• Discrete geometry

Effects of prevention and quarantine for SIS model on a square lattice

Source URL: www.mssanz.org.au

• Phase transitions
• Combinatorics
• Epidemiology
• Lattice models
• Percolation theory
• Epidemic model
• Percolation threshold
• Lattice
• Mean field theory
• Physics
• Critical phenomena
• Mathematics

114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

Source URL: dcg.ethz.ch

• Breadth-first search
• Graph
• Combinatorics
• Theoretical computer science
• Network theory
• Tango tree
• Search algorithms
• Graph theory
• Mathematics

CENTRE FOR DISCRETE MATHEMATICS AND COMPUTING in the DISCIPLINE of MATHEMATICS, SCHOOL of MATHEMATICS and PHYSICS and the

Source URL: www.maths.uq.edu.au

• Algebraic combinatorics
• Journal of Graph Theory
• Combinatorial design
• W. T. Tutte
• William Lawrence Kocay
• Outline of combinatorics
• Combinatorics
• Mathematics
• Discrete mathematics