Stefan Porschen

According to our database, Stefan Porschen authored at least 28 papers between 2001 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2014

XSAT and NAE-SAT of linear CNF classes.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw

Discret. Appl. Math., 2014

Probabilistic Analysis of Random Mixed Horn Formulas.

Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2012

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation.

Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen

Discret. Appl. Math., 2012

2011

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.

Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Complexity Results for Linear XSAT-Problems.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009

On Rectangular Covering Problems.

Stefan Porschen

Int. J. Comput. Geom. Appl., 2009

Linear CNF formulas and satisfiability.

Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao

Discret. Appl. Math., 2009

On Some SAT-Variants over Linear Formulas.

Stefan Porschen, Tatjana Schmidt

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

On Some Aspects of Mixed Horn Formulas.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

A CNF Class Generalizing Exact Linear Formulas.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007

On generalizations of the shadow independent set problem.

Stefan Porschen

Discret. Math., 2007

Satisfiability of mixed Horn formulas.

Stefan Porschen, Ewald Speckenmeyer

Discret. Appl. Math., 2007

On variable-weighted exact satisfiability problems.

Stefan Porschen

Ann. Math. Artif. Intell., 2007

Algorithms for Variable-Weighted 2-SAT and Dual Problems.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Optimal Parameterized Rectangular Coverings.

Stefan Porschen

Proceedings of the Computational Science and Its Applications, 2007

A CNF Formula Hierarchy over the Hypercube.

Stefan Porschen

Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

2006

On Linear CNF Formulas.

Stefan Porschen, Ewald Speckenmeyer, Bert Randerath

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Algorithms for Rectangular Covering Problems.

Stefan Porschen

Proceedings of the Computational Science and Its Applications, 2006

Counting All Solutions of Minimum Weight Exact Satisfiability.

Stefan Porschen

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Exact 3-satisfiability is decidable in time O(2^{0.16254<i>n</i>}).

Stefan Porschen, Bert Randerath, Ewald Speckenmeyer

Ann. Math. Artif. Intell., 2005

On Some Weighted Satisfiability and Graph Problems.

Stefan Porschen

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Solving Minimum Weight Exact Satisfiability in Time <i>O</i>(2^{0.2441<i>n</i>}).

Stefan Porschen

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On the Rectangular Subset Closure of Point Sets.

Stefan Porschen

Proceedings of the Computational Science and Its Applications, 2005

2004

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.

Stefan Porschen

Proceedings of the Computational Science and Its Applications, 2004

2003

Improving a fixed parameter tractability time bound for the shadow problem.

Peter Heusch, Stefan Porschen, Ewald Speckenmeyer

J. Comput. Syst. Sci., 2003

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.

Stefan Porschen, Bert Randerath, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2001

On Covering Z-Grid Points by Rectangles.

Stefan Porschen

Electron. Notes Discret. Math., 2001