![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 184 | Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann: CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation). SAT 2012: 449-455 | |
| 183 | Sebastian Burg, Stephan Kottler, Michael Kaufmann: Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation). SAT 2012: 471-472 | |
| 170 | Michael Kaufmann, Stephan Kottler: Beyond Unit Propagation in SAT Solving. SEA 2011: 267-279 | |
| 139 | Michael Kaufmann, Stephan Kottler: Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. Graph Drawing 2009: 419-420 | |
| 138 | Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler: Visualization of Complex BPEL Models. Graph Drawing 2009: 421-423 | |
| 129 | Stephan Kottler, Michael Kaufmann, Carsten Sinz: Computation of Renameable Horn Backdoors. SAT 2008: 154-160 | |
| 128 | Stephan Kottler, Michael Kaufmann, Carsten Sinz: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. SAT 2008: 161-167 |
Selection of 7 from 186 records - Michael Kaufmann has 154 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page