Knauer

Results: 84



#Item
21

CONNECTED COVERING NUMBERS JONATHAN CHAPPELON, KOLJA KNAUER, LUIS PEDRO MONTEJANO, AND JORGE LUIS RAM´IREZ ALFONS´IN Dedicated to the memory of Michel Las Vergnas Abstract. A connected covering is a design system in wh

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
    22

    L ATTICES AND P OLYHEDRA FROM G RAPHS vorgelegt von Diplom-Mathematiker Kolja Knauer aus Oldenburg

    Add to Reading List

    Source URL: page.math.tu-berlin.de

    Language: English
      23

      Making Octants Colorful and Related Covering Decomposition Problems Jean Cardinal∗ Kolja Knauer†

      Add to Reading List

      Source URL: page.math.tu-berlin.de

      Language: English
        24

        Simple Treewidth Kolja Knauer 1 Technical University Berlin

        Add to Reading List

        Source URL: page.math.tu-berlin.de

        Language: English
          25

          ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

          Add to Reading List

          Source URL: page.math.tu-berlin.de

          Language: English
            26

            DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER A BSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph – called c-orientations. Given a distributive latt

            Add to Reading List

            Source URL: page.math.tu-berlin.de

            Language: English
              27

              HOW TO EAT 4/9 OF A PIZZA arXiv:0812.2870v4 [cs.DM] 24 Jan 2011 KOLJA KNAUER, PIOTR MICEK, AND TORSTEN UECKERDT Abstract. Two players want to eat a sliced pizza by alternately picking its

              Add to Reading List

              Source URL: arxiv.org

              Language: English - Date: 2011-01-24 20:14:31
                28

                ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

                Add to Reading List

                Source URL: www.math.kit.edu

                Language: English - Date: 2015-11-10 14:19:32
                  29

                  Tutorial Florian Waibel, Johannes Eickhold, Markus Knauer Survey Who has used…

                  Add to Reading List

                  Source URL: www.eclipsecon.org

                  Language: English - Date: 2015-05-11 11:01:52
                    30

                    PRESENTS Fabrics by Thomas Knauer Frippery

                    Add to Reading List

                    Source URL: andoverfabrics.com

                    Language: English - Date: 2012-10-18 18:15:20
                      UPDATE