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