An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. - Ulrike Stege; Iris van Rooij; Alexander Hertel; Philipp Hertel (ISAAC, 2002)

Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. - Philipp Hertel; Toniann Pitassi (FOCS, 2007)

Formalizing Dangerous SAT Encodings. - Alexander Hertel; Philipp Hertel; Alasdair Urquhart (SAT, 2007)

Black-White Pebbling is PSPACE-Complete. - Philipp Hertel; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2007)

An Exponential Time/Space Speedup For Resolution. - Philipp Hertel; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2007)

A Sound and Complete Proof Theory for Propositional Logical Contingencies. - Alexander Hertel; Philipp Hertel; Charles Morgan (Notre Dame J. Formal Log., 2007)

Clause Learning Can Effectively P-Simulate General Propositional Resolution. - Philipp Hertel; Fahiem Bacchus; Toniann Pitassi; Allen Van Gelder (AAAI, 2008)

Clause Learning, Resolution Space, and Pebbling. - Philipp Hertel (2009)

The PSPACE-Completeness of Black-White Pebbling. - Philipp Hertel; Toniann Pitassi (SIAM J. Comput., 2010)