Universität zu Köln

2014

Porschen, Stefan, Schmidt, Tatjana, Speckenmeyer, Ewald and Wotzlaw, Andreas (2014). XSAT and NAE-SAT of linear CNF classes. Discret Appl. Math., 167. S. 1 - 15. AMSTERDAM: ELSEVIER SCIENCE BV. ISSN 1872-6771

2012

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. Discret Appl. Math., 160 (16-17). S. 2349 - 2364. AMSTERDAM: ELSEVIER. ISSN 1872-6771

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Applied Mathematics, 160 (16-17). pp. 2349-2363. Elsevier.

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Probabilistic Analysis of Random Mixed Horn Formulas. Working Paper.

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs. In: Dagstuhl Seminar ”SAT Interactions”, 18. - 23.11.2012, Dagstuhl. Speech. (["eprint_fieldopt_ispublished_unpub" not defined])

Wotzlaw, Andreas, van der Grinten, Alexander, Speckenmeyer, Ewald and Porschen, Stefan (2012). pfolioUZK: Solver Description. In: Proceedings of SAT Challenge 2012 : Solver and Benchmark Descriptions, p. 45. University of Helsinki.

van der Grinten, Alexander, Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). satUZK: Solver Description. In: Proceedings of SAT Challenge 2012 : Solver and Benchmark Descriptions, pp. 54-55. University of Helsinki.

2011

Porschen, Stefan, Schmidt, Tatjana, Speckenmeyer, Ewald and Wotzlaw, Andreas (2011). XSAT and NAE-SAT of linear CNF classes. Discrete Applied Mathematics, 167. pp. 1-14. Elsevier.

Speckenmeyer, Ewald, Wotzlaw, Andreas and Porschen, Stefan (2011). A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs. In: Theory and Applications of Satisfiability Testing - SAT 2011 : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 134-144. Springer.

2007

Porschen, Stefan (2007). On rectangular covering problems. Working Paper.

Porschen, Stefan (2007). On variable-weighted exact satisfiability problems. Annals of mathematics and artificial intelligence, 51 (1). pp. 27-54.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Algorithms for Variable-Weighted 2-SAT and Dual Problems. Working Paper.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Clause Set Structures and Polynomial-Time SAT-Decidable Classes. Working Paper.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Clause set structures and satisfiability. Working Paper.

2006

Porschen, Stefan, Speckenmeyer, Ewald and Zhao, Xishun (2006). Linear CNF formulas and satisfiability. Working Paper.