[{"citation":{"chicago":"Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” <i>Discrete Mathematics</i> 218 (2000): 289–91.","short":"E. Steffen, Discrete Mathematics 218 (2000) 289–291.","ieee":"E. Steffen, “A refinement of Vizing’s theorem,” <i>Discrete Mathematics</i>, vol. 218, pp. 289–291, 2000.","apa":"Steffen, E. (2000). A refinement of Vizing’s theorem. <i>Discrete Mathematics</i>, <i>218</i>, 289–291.","bibtex":"@article{Steffen_2000, title={A refinement of Vizing’s theorem}, volume={218}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2000}, pages={289–291} }","ama":"Steffen E. A refinement of Vizing’s theorem. <i>Discrete Mathematics</i>. 2000;218:289-291.","mla":"Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” <i>Discrete Mathematics</i>, vol. 218, 2000, pp. 289–91."},"publication":"Discrete Mathematics","type":"journal_article","date_created":"2019-06-07T12:31:13Z","intvolume":"       218","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"status":"public","title":"A refinement of Vizing's theorem","year":"2000","volume":218,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10183","page":"289 - 291"},{"title":"Reductions of Symmetry configurations n3","status":"public","year":"2000","author":[{"last_name":"Carstens","first_name":"Hans Georg","full_name":"Carstens, Hans Georg"},{"first_name":"Thomas","last_name":"Dinski","full_name":"Dinski, Thomas"},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        99","page":"401-411","language":[{"iso":"eng"}],"_id":"10186","user_id":"15540","volume":99,"publication":"Discrete Applied Mathematics","citation":{"apa":"Carstens, H. G., Dinski, T., &#38; Steffen, E. (2000). Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>, <i>99</i>, 401–411.","mla":"Carstens, Hans Georg, et al. “Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i>, vol. 99, 2000, pp. 401–11.","ieee":"H. G. Carstens, T. Dinski, and E. Steffen, “Reductions of Symmetry configurations n3,” <i>Discrete Applied Mathematics</i>, vol. 99, pp. 401–411, 2000.","chicago":"Carstens, Hans Georg, Thomas Dinski, and Eckhard Steffen. “Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i> 99 (2000): 401–11.","short":"H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.","ama":"Carstens HG, Dinski T, Steffen E. Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>. 2000;99:401-411.","bibtex":"@article{Carstens_Dinski_Steffen_2000, title={Reductions of Symmetry configurations n3}, volume={99}, journal={Discrete Applied Mathematics}, author={Carstens, Hans Georg and Dinski, Thomas and Steffen, Eckhard}, year={2000}, pages={401–411} }"},"date_created":"2019-06-07T12:36:50Z","type":"journal_article"},{"type":"journal_article","date_created":"2019-06-07T12:38:49Z","publication":"Discrete Mathematics","citation":{"chicago":"Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” <i>Discrete Mathematics</i> 207 (1999): 291–92.","short":"E. Steffen, Discrete Mathematics 207 (1999) 291–292.","apa":"Steffen, E. (1999). Counterexamples to a conjecture about Petersen-minors in supersnarks. <i>Discrete Mathematics</i>, <i>207</i>, 291–292.","ieee":"E. Steffen, “Counterexamples to a conjecture about Petersen-minors in supersnarks,” <i>Discrete Mathematics</i>, vol. 207, pp. 291–292, 1999.","ama":"Steffen E. Counterexamples to a conjecture about Petersen-minors in supersnarks. <i>Discrete Mathematics</i>. 1999;207:291-292.","bibtex":"@article{Steffen_1999, title={Counterexamples to a conjecture about Petersen-minors in supersnarks}, volume={207}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={1999}, pages={291–292} }","mla":"Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” <i>Discrete Mathematics</i>, vol. 207, 1999, pp. 291–92."},"user_id":"15540","volume":207,"page":"291-292","language":[{"iso":"eng"}],"_id":"10187","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"       207","title":"Counterexamples to a conjecture about Petersen-minors in supersnarks","status":"public","year":"1999","author":[{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}]},{"citation":{"ama":"Steffen E. Non-bicritical critical snarks. <i>Graphs Comb</i>. 1999;15:473-480.","bibtex":"@article{Steffen_1999, title={Non-bicritical critical snarks}, volume={15}, journal={Graphs Comb.}, author={Steffen, Eckhard}, year={1999}, pages={473–480} }","mla":"Steffen, Eckhard. “Non-Bicritical Critical Snarks.” <i>Graphs Comb.</i>, vol. 15, 1999, pp. 473–80.","short":"E. Steffen, Graphs Comb. 15 (1999) 473–480.","chicago":"Steffen, Eckhard. “Non-Bicritical Critical Snarks.” <i>Graphs Comb.</i> 15 (1999): 473–80.","apa":"Steffen, E. (1999). Non-bicritical critical snarks. <i>Graphs Comb.</i>, <i>15</i>, 473–480.","ieee":"E. Steffen, “Non-bicritical critical snarks,” <i>Graphs Comb.</i>, vol. 15, pp. 473–480, 1999."},"publication":"Graphs Comb.","date_created":"2019-06-07T12:39:54Z","type":"journal_article","author":[{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"year":"1999","status":"public","title":"Non-bicritical critical snarks","intvolume":"        15","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","_id":"10189","language":[{"iso":"eng"}],"page":" 473-480","volume":15,"user_id":"15540"},{"publication":"Discuss. Math. Graph Theory","citation":{"short":"S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.","chicago":"Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” <i>Discuss. Math. Graph Theory</i> 19 (1999): 5–11.","apa":"Grünewald, S., &#38; Steffen, E. (1999). Cyclically 5-edge connected non-bicritical critical snarks. <i>Discuss. Math. Graph Theory</i>, <i>19</i>, 5–11.","ieee":"S. Grünewald and E. Steffen, “Cyclically 5-edge connected non-bicritical critical snarks,” <i>Discuss. Math. Graph Theory</i>, vol. 19, pp. 5–11, 1999.","ama":"Grünewald S, Steffen E. Cyclically 5-edge connected non-bicritical critical snarks. <i>Discuss Math Graph Theory</i>. 1999;19:5-11.","bibtex":"@article{Grünewald_Steffen_1999, title={Cyclically 5-edge connected non-bicritical critical snarks}, volume={19}, journal={Discuss. Math. Graph Theory}, author={Grünewald, Stefan and Steffen, Eckhard}, year={1999}, pages={5–11} }","mla":"Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” <i>Discuss. Math. Graph Theory</i>, vol. 19, 1999, pp. 5–11."},"date_created":"2019-06-07T12:41:01Z","type":"journal_article","title":"Cyclically 5-edge connected non-bicritical critical snarks","year":"1999","status":"public","author":[{"first_name":"Stefan","last_name":"Grünewald","full_name":"Grünewald, Stefan"},{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        19","page":"5-11","_id":"10190","language":[{"iso":"eng"}],"user_id":"15540","volume":19},{"author":[{"last_name":"Grünewald","first_name":"Stefan","full_name":"Grünewald, Stefan"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"title":"Chromatic-index-critical graphs of even order","status":"public","year":"1999","intvolume":"        30","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","_id":"10191","language":[{"iso":"eng"}],"page":"27 -36","volume":30,"user_id":"15540","citation":{"apa":"Grünewald, S., &#38; Steffen, E. (1999). Chromatic-index-critical graphs of even order. <i>J. Graph Theory</i>, <i>30</i>, 27–36.","ieee":"S. Grünewald and E. Steffen, “Chromatic-index-critical graphs of even order,” <i>J. Graph Theory</i>, vol. 30, pp. 27–36, 1999.","short":"S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.","chicago":"Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” <i>J. Graph Theory</i> 30 (1999): 27–36.","mla":"Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” <i>J. Graph Theory</i>, vol. 30, 1999, pp. 27–36.","ama":"Grünewald S, Steffen E. Chromatic-index-critical graphs of even order. <i>J Graph Theory</i>. 1999;30:27-36.","bibtex":"@article{Grünewald_Steffen_1999, title={Chromatic-index-critical graphs of even order}, volume={30}, journal={J. Graph Theory}, author={Grünewald, Stefan and Steffen, Eckhard}, year={1999}, pages={27–36} }"},"publication":"J. Graph Theory","date_created":"2019-06-07T12:42:13Z","type":"journal_article"},{"user_id":"15540","volume":50,"page":"292 - 296","language":[{"iso":"eng"}],"_id":"10193","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        50","title":"Snarks and reducibility","status":"public","year":"1998","author":[{"full_name":"Brinkmann, Gunnar","first_name":"Gunnar","last_name":"Brinkmann"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"type":"journal_article","date_created":"2019-06-07T12:53:52Z","publication":"Ars Combinatoria","citation":{"apa":"Brinkmann, G., &#38; Steffen, E. (1998). Snarks and reducibility. <i>Ars Combinatoria</i>, <i>50</i>, 292–296.","ieee":"G. Brinkmann and E. Steffen, “Snarks and reducibility,” <i>Ars Combinatoria</i>, vol. 50, pp. 292–296, 1998.","short":"G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.","chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” <i>Ars Combinatoria</i> 50 (1998): 292–96.","mla":"Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” <i>Ars Combinatoria</i>, vol. 50, 1998, pp. 292–96.","ama":"Brinkmann G, Steffen E. Snarks and reducibility. <i>Ars Combinatoria</i>. 1998;50:292-296.","bibtex":"@article{Brinkmann_Steffen_1998, title={Snarks and reducibility}, volume={50}, journal={Ars Combinatoria}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1998}, pages={292–296} }"}},{"volume":19,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10194","page":"889 - 900","intvolume":"        19","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"full_name":"Brinkmann, Gunnar","last_name":"Brinkmann","first_name":"Gunnar"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"status":"public","title":"Chromatic-index-critical graphs of Orders 11 and 12","year":"1998","type":"journal_article","date_created":"2019-06-07T12:55:07Z","citation":{"chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” <i>European J. Combinatorics</i> 19 (1998): 889–900.","short":"G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.","apa":"Brinkmann, G., &#38; Steffen, E. (1998). Chromatic-index-critical graphs of Orders 11 and 12. <i>European J. Combinatorics</i>, <i>19</i>, 889–900.","ieee":"G. Brinkmann and E. Steffen, “Chromatic-index-critical graphs of Orders 11 and 12,” <i>European J. Combinatorics</i>, vol. 19, pp. 889–900, 1998.","ama":"Brinkmann G, Steffen E. Chromatic-index-critical graphs of Orders 11 and 12. <i>European J Combinatorics</i>. 1998;19:889-900.","bibtex":"@article{Brinkmann_Steffen_1998, title={Chromatic-index-critical graphs of Orders 11 and 12}, volume={19}, journal={European J. Combinatorics}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1998}, pages={889–900} }","mla":"Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” <i>European J. Combinatorics</i>, vol. 19, 1998, pp. 889–900."},"publication":"European J. Combinatorics"},{"language":[{"iso":"eng"}],"_id":"10195","page":"183 - 203 (","volume":188,"user_id":"15540","author":[{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"title":"Classification and characterizations of snarkse","year":"1998","status":"public","intvolume":"       188","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","date_created":"2019-06-07T12:56:23Z","type":"journal_article","citation":{"ama":"Steffen E. Classification and characterizations of snarkse. <i>Discrete Mathematics</i>. 1998;188:183-203 (.","bibtex":"@article{Steffen_1998, title={Classification and characterizations of snarkse}, volume={188}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={1998}, pages={183-203 (} }","mla":"Steffen, Eckhard. “Classification and Characterizations of Snarkse.” <i>Discrete Mathematics</i>, vol. 188, 1998, pp. 183-203 (.","chicago":"Steffen, Eckhard. “Classification and Characterizations of Snarkse.” <i>Discrete Mathematics</i> 188 (1998): 183-203 (.","short":"E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.","apa":"Steffen, E. (1998). Classification and characterizations of snarkse. <i>Discrete Mathematics</i>, <i>188</i>, 183-203 (.","ieee":"E. Steffen, “Classification and characterizations of snarkse,” <i>Discrete Mathematics</i>, vol. 188, pp. 183-203 (, 1998."},"publication":"Discrete Mathematics"},{"intvolume":"       188","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"last_name":"Brinkmann","first_name":"Gunnar","full_name":"Brinkmann, Gunnar"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"year":"1997","title":"3- and 4-critical graphs of small even order","status":"public","volume":188,"user_id":"15540","_id":"10196","language":[{"iso":"eng"}],"page":" 193 -197","citation":{"mla":"Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” <i>Discrete Mathematics</i>, vol. 188, 1997, pp. 193–97.","bibtex":"@article{Brinkmann_Steffen_1997, title={3- and 4-critical graphs of small even order}, volume={188}, journal={Discrete Mathematics}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1997}, pages={193–197} }","ama":"Brinkmann G, Steffen E. 3- and 4-critical graphs of small even order. <i>Discrete Mathematics</i>. 1997;188:193-197.","ieee":"G. Brinkmann and E. Steffen, “3- and 4-critical graphs of small even order,” <i>Discrete Mathematics</i>, vol. 188, pp. 193–197, 1997.","apa":"Brinkmann, G., &#38; Steffen, E. (1997). 3- and 4-critical graphs of small even order. <i>Discrete Mathematics</i>, <i>188</i>, 193–197.","short":"G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.","chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” <i>Discrete Mathematics</i> 188 (1997): 193–97."},"publication":"Discrete Mathematics","type":"journal_article","date_created":"2019-06-07T12:57:46Z"},{"citation":{"mla":"Steffen, Eckhard. “Counterexamples to a Conjecture about Bottlenecks in Non-Tait-Colourable Cubic Graphs.” <i>Discrete Mathematics</i>, vol. 161, 1996, p. 315.","ama":"Steffen E. Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. <i>Discrete Mathematics</i>. 1996;161:315.","bibtex":"@article{Steffen_1996, title={Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs}, volume={161}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={1996}, pages={315} }","apa":"Steffen, E. (1996). Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. <i>Discrete Mathematics</i>, <i>161</i>, 315.","ieee":"E. Steffen, “Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs,” <i>Discrete Mathematics</i>, vol. 161, p. 315, 1996.","short":"E. Steffen, Discrete Mathematics 161 (1996) 315.","chicago":"Steffen, Eckhard. “Counterexamples to a Conjecture about Bottlenecks in Non-Tait-Colourable Cubic Graphs.” <i>Discrete Mathematics</i> 161 (1996): 315."},"publication":"Discrete Mathematics","type":"journal_article","date_created":"2019-06-07T12:59:04Z","intvolume":"       161","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"title":"Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs","year":"1996","status":"public","volume":161,"user_id":"15540","_id":"10197","language":[{"iso":"eng"}],"page":"315"},{"intvolume":"        16","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","author":[{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"},{"full_name":"Zhu, Xuding","first_name":"Xuding","last_name":"Zhu"}],"status":"public","year":"1996","title":"Star chromatic numbers of graphs","volume":16,"user_id":"15540","_id":"10198","language":[{"iso":"eng"}],"page":"439-448","citation":{"bibtex":"@article{Steffen_Zhu_1996, title={Star chromatic numbers of graphs}, volume={16}, journal={Combinatorica}, author={Steffen, Eckhard and Zhu, Xuding}, year={1996}, pages={439–448} }","ama":"Steffen E, Zhu X. Star chromatic numbers of graphs. <i>Combinatorica</i>. 1996;16:439-448.","mla":"Steffen, Eckhard, and Xuding Zhu. “Star Chromatic Numbers of Graphs.” <i>Combinatorica</i>, vol. 16, 1996, pp. 439–48.","short":"E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.","chicago":"Steffen, Eckhard, and Xuding Zhu. “Star Chromatic Numbers of Graphs.” <i>Combinatorica</i> 16 (1996): 439–48.","ieee":"E. Steffen and X. Zhu, “Star chromatic numbers of graphs,” <i>Combinatorica</i>, vol. 16, pp. 439–448, 1996.","apa":"Steffen, E., &#38; Zhu, X. (1996). Star chromatic numbers of graphs. <i>Combinatorica</i>, <i>16</i>, 439–448."},"publication":"Combinatorica","type":"journal_article","date_created":"2019-06-07T13:00:18Z"},{"language":[{"iso":"eng"}],"_id":"10199","page":"309 -319","volume":22,"user_id":"15540","author":[{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"year":"1996","status":"public","title":"Tutte's 5-flow conjecture for graphs of non-orientable genus 5","intvolume":"        22","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T13:01:15Z","type":"journal_article","citation":{"bibtex":"@article{Steffen_1996, title={Tutte’s 5-flow conjecture for graphs of non-orientable genus 5}, volume={22}, journal={J. Graph Theory}, author={Steffen, Eckhard}, year={1996}, pages={309–319} }","ama":"Steffen E. Tutte’s 5-flow conjecture for graphs of non-orientable genus 5. <i>J Graph Theory</i>. 1996;22:309-319.","mla":"Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Graphs of Non-Orientable Genus 5.” <i>J. Graph Theory</i>, vol. 22, 1996, pp. 309–19.","chicago":"Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Graphs of Non-Orientable Genus 5.” <i>J. Graph Theory</i> 22 (1996): 309–19.","short":"E. Steffen, J. Graph Theory 22 (1996) 309–319.","ieee":"E. Steffen, “Tutte’s 5-flow conjecture for graphs of non-orientable genus 5,” <i>J. Graph Theory</i>, vol. 22, pp. 309–319, 1996.","apa":"Steffen, E. (1996). Tutte’s 5-flow conjecture for graphs of non-orientable genus 5. <i>J. Graph Theory</i>, <i>22</i>, 309–319."},"publication":"J. Graph Theory"},{"citation":{"ieee":"E. Steffen, “Complexity results for the default- and autoepistemic logic,” in <i>Computer Science Logic </i>, 1992, vol. 626, pp. 339–352.","apa":"Steffen, E. (1992). Complexity results for the default- and autoepistemic logic. In E. Börger (Ed.), <i>Computer Science Logic </i> (Vol. 626, pp. 339–352). Springer Berlin Heidelberg.","chicago":"Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” In <i>Computer Science Logic </i>, edited by E. Börger, 626:339–52. Springer Berlin Heidelberg, 1992.","short":"E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.","mla":"Steffen, Eckhard. “Complexity Results for the Default- and Autoepistemic Logic.” <i>Computer Science Logic </i>, edited by E. Börger, vol. 626, Springer Berlin Heidelberg, 1992, pp. 339–52.","bibtex":"@inproceedings{Steffen_1992, title={Complexity results for the default- and autoepistemic logic}, volume={626}, booktitle={Computer Science Logic }, publisher={Springer Berlin Heidelberg}, author={Steffen, Eckhard}, editor={Börger, E.Editor}, year={1992}, pages={339–352} }","ama":"Steffen E. Complexity results for the default- and autoepistemic logic. In: Börger E, ed. <i>Computer Science Logic </i>. Vol 626. Springer Berlin Heidelberg; 1992:339-352."},"publication":"Computer Science Logic ","date_created":"2019-06-07T13:07:39Z","type":"conference","author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"year":"1992","title":"Complexity results for the default- and autoepistemic logic","status":"public","intvolume":"       626","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","language":[{"iso":"eng"}],"_id":"10201","publisher":"Springer Berlin Heidelberg","page":"339 - 352","volume":626,"editor":[{"first_name":"E.","last_name":"Börger","full_name":"Börger, E."}],"user_id":"15540"}]