Stefan Szeider (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Stefan Szeider" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

2derstandard.at

743^rd place

3,221^st place

2psu.edu

207^th place

136^th place

2semanticscholar.org

11^th place

8^th place

2tuwien.ac.at

low place

1nodak.edu

5,218^th place

9,258^th place

1logic-cs.at

low place

1translate.google.com

1,064^th place

992^nd place

1futurezone.at

low place

1scholar.google.com

1,697^th place

1,040^th place

1uni-trier.de

7,690^th place

low place

1dur.ac.uk

3,728^th place

2,318^th place

derstandard.at

"Computerwissenschafter der TU Wien wollen internationale Marke werden". Der Standard (in German). 25 January 2012. Retrieved 20 April 2020.
"Zentrum für Grundlagen der Informatik". Der Standard (in German). 31 January 2012. Retrieved 9 January 2017.

doi.org

Gaspers, Serge; Szeider, Stefan (2012). "Backdoors to Satisfaction". The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science. Vol. 7370. pp. 287–317. CiteSeerX 10.1.1.747.5422. doi:10.1007/978-3-642-30891-8_15. ISBN 978-3-642-30890-1. S2CID 6905561.
Gaspers, Serge (22 April 2016). "Backdoors to SAT". Encyclopedia of Algorithms. Springer New York. pp. 167–170. doi:10.1007/978-1-4939-2864-4_781. ISBN 978-1-4939-2863-7.{{cite book}}: CS1 maint: location missing publisher (link)
Samer, Marko; Szeider, Stefan (18 December 2008). "Backdoor Sets of Quantified Boolean Formulas". Journal of Automated Reasoning. 42 (1): 77–97. CiteSeerX 10.1.1.452.5953. doi:10.1007/s10817-008-9114-5. S2CID 13030704.
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (January 2009). "Clique-Width is NP-Complete". SIAM Journal on Discrete Mathematics. 23 (2): 909–939. doi:10.1137/070687256.
Szeider, Stefan (December 2004). "Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable" (PDF). Journal of Computer and System Sciences. 69 (4): 656–674. doi:10.1016/j.jcss.2004.04.009.
Fleischner, Herbert; Kullmann, Oliver; Szeider, Stefan (October 2002). "Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference". Theoretical Computer Science. 289 (1): 503–516. doi:10.1016/S0304-3975(01)00337-1.

dur.ac.uk

dro.dur.ac.uk

Szeider, Stefan (December 2004). "Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable" (PDF). Journal of Computer and System Sciences. 69 (4): 656–674. doi:10.1016/j.jcss.2004.04.009.

futurezone.at

"Algorithmen bestimmen unser Leben". Futurezone.at (in German). February 8, 2012. Retrieved 9 January 2017.

logic-cs.at

"Stefan Szeider". LogiCS. Retrieved 9 January 2017.

nodak.edu

genealogy.math.ndsu.nodak.edu

"Stefan Szeider - The Mathematics Genealogy Project". Mathematics Genealogy Project. Retrieved 9 January 2017.

psu.edu

citeseerx.ist.psu.edu

Gaspers, Serge; Szeider, Stefan (2012). "Backdoors to Satisfaction". The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science. Vol. 7370. pp. 287–317. CiteSeerX 10.1.1.747.5422. doi:10.1007/978-3-642-30891-8_15. ISBN 978-3-642-30890-1. S2CID 6905561.
Samer, Marko; Szeider, Stefan (18 December 2008). "Backdoor Sets of Quantified Boolean Formulas". Journal of Automated Reasoning. 42 (1): 77–97. CiteSeerX 10.1.1.452.5953. doi:10.1007/s10817-008-9114-5. S2CID 13030704.

scholar.google.com

"Stefan Szeider - Professor, Head of Algorithms and Complexity Group, TU Wien". Google Scholar. Retrieved 9 January 2017.

semanticscholar.org

api.semanticscholar.org

Gaspers, Serge; Szeider, Stefan (2012). "Backdoors to Satisfaction". The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science. Vol. 7370. pp. 287–317. CiteSeerX 10.1.1.747.5422. doi:10.1007/978-3-642-30891-8_15. ISBN 978-3-642-30890-1. S2CID 6905561.
Samer, Marko; Szeider, Stefan (18 December 2008). "Backdoor Sets of Quantified Boolean Formulas". Journal of Automated Reasoning. 42 (1): 77–97. CiteSeerX 10.1.1.452.5953. doi:10.1007/s10817-008-9114-5. S2CID 13030704.

translate.google.com

"What does "insoluble" mean here? Prof. Stefan Szeider in portrait". Retrieved 13 January 2017.

Stefan Szeider (English Wikipedia)

derstandard.at

doi.org

dur.ac.uk

dro.dur.ac.uk

futurezone.at

logic-cs.at

nodak.edu

genealogy.math.ndsu.nodak.edu

psu.edu

citeseerx.ist.psu.edu

scholar.google.com

semanticscholar.org

api.semanticscholar.org

translate.google.com

tuwien.ac.at

informatik.tuwien.ac.at

ac.tuwien.ac.at

uni-trier.de

dblp.uni-trier.de