The SCEAS System
Navigation Menu

Search the dblp DataBase


Stefan Porschen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Porschen
    Counting All Solutions of Minimum Weight Exact Satisfiability. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:50-59 [Conf]
  2. Stefan Porschen
    On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2004, pp:137-146 [Conf]
  3. Stefan Porschen
    On the Rectangular Subset Closure of Point Sets. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2005, pp:796-805 [Conf]
  4. Stefan Porschen
    Algorithms for Rectangular Covering Problems. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2006, pp:40-49 [Conf]
  5. Stefan Porschen
    Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:654-664 [Conf]
  6. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:172-187 [Conf]
  7. Stefan Porschen, Ewald Speckenmeyer
    Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  8. Stefan Porschen, Ewald Speckenmeyer
    Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:251-262 [Conf]
  9. Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
    On Linear CNF Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:212-225 [Conf]
  10. Stefan Porschen
    On Some Weighted Satisfiability and Graph Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:278-287 [Conf]
  11. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Exact 3-satisfiability is decidable in time O(20.16254n). [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:173-193 [Journal]
  12. Stefan Porschen
    On generalizations of the shadow independent set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1473-1485 [Journal]
  13. Peter Heusch, Stefan Porschen, Ewald Speckenmeyer
    Improving a fixed parameter tractability time bound for the shadow problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:772-788 [Journal]
  14. Stefan Porschen
    Optimal Parameterized Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2007, pp:96-109 [Conf]
  15. Stefan Porschen, Ewald Speckenmeyer
    Algorithms for Variable-Weighted 2-SAT and Dual Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:173-186 [Conf]
  16. Stefan Porschen, Ewald Speckenmeyer
    Satisfiability of mixed Horn formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1408-1419 [Journal]

  17. A CNF Formula Hierarchy over the Hypercube. [Citation Graph (, )][DBLP]

  18. On Some Aspects of Mixed Horn Formulas. [Citation Graph (, )][DBLP]

  19. A CNF Class Generalizing Exact Linear Formulas. [Citation Graph (, )][DBLP]

  20. Complexity Results for Linear XSAT-Problems. [Citation Graph (, )][DBLP]

  21. On Some SAT-Variants over Linear Formulas. [Citation Graph (, )][DBLP]

  22. On variable-weighted exact satisfiability problems. [Citation Graph (, )][DBLP]

  23. Linear CNF formulas and satisfiability. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002