| |
| 2007 | ||
|---|---|---|
| 4 | EE | Alexander Hertel, Alasdair Urquhart: Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL 2007: 527-541 |
| 3 | EE | Alexander Hertel, Philipp Hertel, Alasdair Urquhart: Formalizing Dangerous SAT Encodings. SAT 2007: 159-172 |
| 2006 | ||
| 2 | EE | Alexander Hertel, Alasdair Urquhart: The Resolution Width Problem is EXPTIME-Complete. Electronic Colloquium on Computational Complexity (ECCC) 13(133): (2006) |
| 2002 | ||
| 1 | EE | Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel: An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. ISAAC 2002: 249-261 |
| 1 | Philipp Hertel | [1] [3] |
| 2 | Iris van Rooij | [1] |
| 3 | Ulrike Stege | [1] |
| 4 | Alasdair Urquhart | [2] [3] [4] |