@inproceedings{6301,
  author       = {{Fischer, Holger Gerhard and Bogner, Christian and Geis, Thomas and Polkehn, Knut and Zimmermann, Dirk}},
  booktitle    = {{Jahresband Usability Professionals}},
  pages        = {{72--74}},
  publisher    = {{German UPA}},
  title        = {{{Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}}},
  year         = {{2011}},
}

@article{10174,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{385 -- 389}},
  title        = {{{Tutte's 5-flow conjecture for cyclically highly connected cubic graphs}}},
  volume       = {{310}},
  year         = {{2010}},
}

@unpublished{10202,
  abstract     = {{An $r$-graph is an $r$-regular graph where every odd set of vertices is
connected by at least $r$ edges to the rest of the graph. Seymour conjectured
that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph
contains $2r$ perfect matchings such that each edge belongs to two of them. We
show that the minimum counter-example to either of these conjectures is a
brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.}},
  author       = {{Mkrtchyan, Vahan and Steffen, Eckhard}},
  booktitle    = {{arXiv:1003.5782}},
  title        = {{{Bricks and conjectures of Berge, Fulkerson and Seymour}}},
  year         = {{2010}},
}

@article{10175,
  author       = {{Mohar, Bojan and Steffen, Eckhard and Vodopivec, Andrej}},
  journal      = {{Ars Mathematica Contemporanea}},
  pages        = {{169--184}},
  title        = {{{Relating embedding and coloring properties of snarks}}},
  volume       = {{1}},
  year         = {{2008}},
}

@article{10176,
  author       = {{Boben, Marco and Pisanski, Tomaž  and Ravnik, Natasa and Steffen, Eckhard}},
  journal      = {{Discrete Applied Mathematics}},
  number       = {{11}},
  pages        = {{1645 --1646}},
  title        = {{{Erratum to „Reductions of Symmetry configurations n3}}},
  volume       = {{154}},
  year         = {{2006}},
}

@article{10177,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{191 -- 214}},
  title        = {{{Measurements of edge-uncolorability}}},
  volume       = {{280}},
  year         = {{2004}},
}

@article{10178,
  author       = {{Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{113 --118}},
  title        = {{{Independent Sets and 2-factors in edge-chromatic critical graphs}}},
  volume       = {{45}},
  year         = {{2004}},
}

@article{10179,
  author       = {{Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{24 -- 34}},
  title        = {{{Circular flow numbers of regular multigraphs}}},
  volume       = {{36}},
  year         = {{2001}},
}

@article{10180,
  author       = {{Steffen, Eckhard}},
  journal      = {{Math. Slovaca}},
  pages        = {{141 --150}},
  title        = {{{On bicritical snarks}}},
  volume       = {{51}},
  year         = {{2001}},
}

@article{10182,
  author       = {{Brinkmann, Gunnar and Choudum, Sheshayya A and Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{Bull. London Math. Soc.}},
  pages        = {{137 --140}},
  title        = {{{Bounds for the independence number of critical graphs}}},
  volume       = {{32}},
  year         = {{2000}},
}

@article{10183,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{289 -- 291}},
  title        = {{{A refinement of Vizing's theorem}}},
  volume       = {{218}},
  year         = {{2000}},
}

@article{10186,
  author       = {{Carstens, Hans Georg and Dinski, Thomas and Steffen, Eckhard}},
  journal      = {{Discrete Applied Mathematics}},
  pages        = {{401--411}},
  title        = {{{Reductions of Symmetry configurations n3}}},
  volume       = {{99}},
  year         = {{2000}},
}

@article{10187,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{291--292}},
  title        = {{{Counterexamples to a conjecture about Petersen-minors in supersnarks}}},
  volume       = {{207}},
  year         = {{1999}},
}

@article{10189,
  author       = {{Steffen, Eckhard}},
  journal      = {{Graphs Comb.}},
  pages        = {{ 473--480}},
  title        = {{{Non-bicritical critical snarks}}},
  volume       = {{15}},
  year         = {{1999}},
}

@article{10190,
  author       = {{Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{Discuss. Math. Graph Theory}},
  pages        = {{5--11}},
  title        = {{{Cyclically 5-edge connected non-bicritical critical snarks}}},
  volume       = {{19}},
  year         = {{1999}},
}

@article{10191,
  author       = {{Grünewald, Stefan and Steffen, Eckhard}},
  journal      = {{J. Graph Theory}},
  pages        = {{27 --36}},
  title        = {{{Chromatic-index-critical graphs of even order}}},
  volume       = {{30}},
  year         = {{1999}},
}

@article{10193,
  author       = {{Brinkmann, Gunnar and Steffen, Eckhard}},
  journal      = {{Ars Combinatoria}},
  pages        = {{292 -- 296}},
  title        = {{{Snarks and reducibility}}},
  volume       = {{50}},
  year         = {{1998}},
}

@article{10194,
  author       = {{Brinkmann, Gunnar and Steffen, Eckhard}},
  journal      = {{European J. Combinatorics}},
  pages        = {{889 -- 900}},
  title        = {{{Chromatic-index-critical graphs of Orders 11 and 12}}},
  volume       = {{19}},
  year         = {{1998}},
}

@article{10195,
  author       = {{Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{183 -- 203 (}},
  title        = {{{Classification and characterizations of snarkse}}},
  volume       = {{188}},
  year         = {{1998}},
}

@article{10196,
  author       = {{Brinkmann, Gunnar and Steffen, Eckhard}},
  journal      = {{Discrete Mathematics}},
  pages        = {{ 193 --197}},
  title        = {{{3- and 4-critical graphs of small even order}}},
  volume       = {{188}},
  year         = {{1997}},
}

