default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Porschen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j10]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw:
XSAT and NAE-SAT of linear CNF classes. Discret. Appl. Math. 167: 1-14 (2014)- [c19]Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen:
Probabilistic Analysis of Random Mixed Horn Formulas. ISAIM 2014 - 2012
- [j9]Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen:
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. Discret. Appl. Math. 160(16-17): 2349-2363 (2012) - 2011
- [c18]Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen:
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. SAT 2011: 134-144 - 2010
- [c17]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer:
Complexity Results for Linear XSAT-Problems. SAT 2010: 251-263
2000 – 2009
- 2009
- [j8]Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao:
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157(5): 1046-1068 (2009) - [j7]Stefan Porschen:
On Rectangular Covering Problems. Int. J. Comput. Geom. Appl. 19(4): 325-340 (2009) - [c16]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer:
On Some Aspects of Mixed Horn Formulas. SAT 2009: 86-100 - [c15]Stefan Porschen, Tatjana Schmidt:
On Some SAT-Variants over Linear Formulas. SOFSEM 2009: 449-460 - 2008
- [c14]Stefan Porschen, Ewald Speckenmeyer:
A CNF Class Generalizing Exact Linear Formulas. SAT 2008: 231-245 - 2007
- [j6]Stefan Porschen:
On variable-weighted exact satisfiability problems. Ann. Math. Artif. Intell. 51(1): 27-54 (2007) - [j5]Stefan Porschen, Ewald Speckenmeyer:
Satisfiability of mixed Horn formulas. Discret. Appl. Math. 155(11): 1408-1419 (2007) - [j4]Stefan Porschen:
On generalizations of the shadow independent set problem. Discret. Math. 307(11-12): 1473-1485 (2007) - [c13]Stefan Porschen:
A CNF Formula Hierarchy over the Hypercube. Australian Conference on Artificial Intelligence 2007: 234-243 - [c12]Stefan Porschen:
Optimal Parameterized Rectangular Coverings. ICCSA (1) 2007: 96-109 - [c11]Stefan Porschen, Ewald Speckenmeyer:
Algorithms for Variable-Weighted 2-SAT and Dual Problems. SAT 2007: 173-186 - 2006
- [c10]Stefan Porschen:
Counting All Solutions of Minimum Weight Exact Satisfiability. CIAC 2006: 50-59 - [c9]Stefan Porschen:
Algorithms for Rectangular Covering Problems. ICCSA (1) 2006: 40-49 - [c8]Stefan Porschen, Ewald Speckenmeyer, Bert Randerath:
On Linear CNF Formulas. SAT 2006: 212-225 - 2005
- [j3]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Exact 3-satisfiability is decidable in time O(20.16254n). Ann. Math. Artif. Intell. 43(1): 173-193 (2005) - [c7]Stefan Porschen:
On the Rectangular Subset Closure of Point Sets. ICCSA (1) 2005: 796-805 - [c6]Stefan Porschen:
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). ISAAC 2005: 654-664 - [c5]Stefan Porschen:
On Some Weighted Satisfiability and Graph Problems. SOFSEM 2005: 278-287 - 2004
- [c4]Stefan Porschen:
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. ICCSA (3) 2004: 137-146 - [c3]Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. SAT 2004 - [c2]Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. SAT (Selected Papers 2004: 251-262 - 2003
- [j2]Peter Heusch, Stefan Porschen, Ewald Speckenmeyer:
Improving a fixed parameter tractability time bound for the shadow problem. J. Comput. Syst. Sci. 67(4): 772-788 (2003) - [c1]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT 2003: 172-187 - 2001
- [j1]Stefan Porschen:
On Covering Z-Grid Points by Rectangles. Electron. Notes Discret. Math. 8: 80-83 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
