Dr. Darren Strash
- Office Hours:
Stop in, or by appointment
- Room: 206
- darren strash ∂does-not-exist.kit edu
About Me
(This site lists my current work at KIT. For a comprehensive list, please see my full site.)
I am a hard-working technophile who is committed to open science and equality in education. My goal is to produce innovative high-quality research, and use my extensive research and practical experience to effectively teach and mentor the next generation of computer scientists.
In 2011, I received a PhD in Computer Science from University of California, Irvine under the advisement of David Eppstein and Mike Goodrich. From there, I worked in research and development in Intel's Computational Lithography Group until 2014. Now, I am a postdoctoral researcher with Peter Sanders at Karlsruhe Institute of Technology.
Research Interests
-
Analysis of Complex Networks: subgraph counting, subgraph listing, graph partitioning, and network characterization
-
Computational Geometry: geometric algorithms, data structures, geometric graphs, polygon decompositions
-
Combinatorial Optimization: maximal clique enumeration, maximum independent set problem
-
Graph Drawing and Network Visualization: greedy drawings, crossing minimization
| Title | Type | Place | Time |
|---|---|---|---|
| Computational Geometry | Lecture |
Building 50.34, Room SR301 |
Mondays from 15:45 - 17:15 |
| Algorithms for Large Social Networks in Theory and Practice | Seminar |
Building 50.34, Room 236 |
Fridays from 09:45 - 11:15 |
| Title | Authors | Conference | Date |
|---|---|---|---|
| Accelerating Local Search for the Maximum Independent Set Problem | Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck |
SEA'16 |
June 2016 |
| Finding Near-Optimal Independent Sets at Scale | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck |
ALENEX'16 |
January 2016 |
| On Minimizing Crossings in Storyline Visualizations | Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, and Darren Strash |
GD'15 |
September 2015 |
| Title | Student | Type | Date |
|---|---|---|---|
| How to Partition a Graph When You Think Like A Vertex | Jan Ebbing |
Bachelor's |
December 2015 |
| Boosting Local Search for the Maximum Independent Set Problem | Jakob Dahlum |
Bachelor's |
November 2015 |
| Title | Conference | Location | Date |
|---|---|---|---|
| Finding Near-Optimal Independent Sets at Scale | ALENEX'16 |
Arlington, VA, USA |
January 10, 2016 |
| On Minimizing Crossings in Storyline Visualizations | GD'15 |
Los Angeles, CA, USA |
September 25, 2015 |