dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Michael Kaufmann (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


184Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann: CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation). SAT 2012: 449-455
183Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSebastian Burg, Stephan Kottler, Michael Kaufmann: Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation). SAT 2012: 471-472
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Kaufmann, Stephan Kottler: Beyond Unit Propagation in SAT Solving. SEA 2011: 267-279
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Kaufmann, Stephan Kottler: Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. Graph Drawing 2009: 419-420
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler: Visualization of Complex BPEL Models. Graph Drawing 2009: 421-423
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephan Kottler, Michael Kaufmann, Carsten Sinz: Computation of Renameable Horn Backdoors. SAT 2008: 154-160
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephan 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 TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page