Tibor

Results: 497



#Item
61

Short Signatures From Weaker Assumptions Dennis Hofheinz1 , Tibor Jager2 , and Eike Kiltz2 1 Institut f¨ ur Kryptographie und Sicherheit, Karlsruhe Institute of Technology, Germany.

Add to Reading List

Source URL: www.kjdf.de

Language: English - Date: 2014-06-10 05:37:35
    62

    ON COVERING EXPANDER GRAPHS BY HAMILTON CYCLES ´ ROMAN GLEBOV, MICHAEL KRIVELEVICH, AND TIBOR SZABO Abstract. The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In thi

    Add to Reading List

    Source URL: page.mi.fu-berlin.de

    Language: English - Date: 2012-05-03 00:13:41
      63

      Positional games on random graphs Miloˇs Stojakovi´c ∗† Tibor Szab´o∗

      Add to Reading List

      Source URL: page.mi.fu-berlin.de

      Language: English - Date: 2008-09-03 14:36:11
        64

        Conflict-free coloring of graphs Roman Glebov ∗ Tibor Szabó

        Add to Reading List

        Source URL: page.mi.fu-berlin.de

        Language: English - Date: 2013-10-08 03:51:52
          65

          Constructive Combinatorics Tibor Szab´o Shagnik Das So 2015

          Add to Reading List

          Source URL: discretemath.imp.fu-berlin.de

          Language: English - Date: 2015-06-05 06:10:09
            66

            Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 Relaxed Two-Coloring of Cubic Graphs Robert Berke and Tibor Szab´o

            Add to Reading List

            Source URL: page.mi.fu-berlin.de

            Language: English - Date: 2008-09-03 14:36:14
              67

              ON THE CONCENTRATION OF THE DOMINATION NUMBER OF THE RANDOM GRAPH ROMAN GLEBOV, ANITA LIEBENAU, AND TIBOR SZABÓ Abstract. In this paper we study the behaviour of the domination number of the ErdősRényi random graph G(

              Add to Reading List

              Source URL: page.mi.fu-berlin.de

              Language: English - Date: 2015-03-15 09:05:48
                68

                Constructive Combinatorics Tibor Szab´o Shagnik Das So 2015

                Add to Reading List

                Source URL: discretemath.imp.fu-berlin.de

                Language: English - Date: 2015-07-03 20:30:12
                  69

                  Deciding Relaxed Two-Colorability — a Hardness Jump Robert Berke and Tibor Szab´ o Institute of Theoretical Computer Science, ETH Z¨ urich, 8092 Switzerland.

                  Add to Reading List

                  Source URL: page.mi.fu-berlin.de

                  Language: English - Date: 2008-09-03 14:36:15
                    70

                    Deciding Relaxed Two-Colorability — a Hardness Jump Robert Berke Tibor Szab´o ∗

                    Add to Reading List

                    Source URL: page.mi.fu-berlin.de

                    Language: English - Date: 2008-09-03 14:35:56
                      UPDATE