İçeriğe geç
akaturk Akademik ölçüm
Giriş yap Kayıt ol

OpenAlex konusu

Complexity and Algorithms in Graphs

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 437 eser 21 yazar konusu

Çalışmalar

437 eser

  1. Matching with Contracts Comment 2013
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.8%

    The matching with contracts model (Hatfield and Milgrom 2005) is widely considered to be one of the most important advances of the last two decades in matching theory. One of their main messages is that the set of stable allocations is non-empty under a substitutes condition. We show that an additional irrelevance of…

  2. Approximation algorithms for the multiple knapsack problem with assignment restrictions 2000
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 96.4%

    Özet henüz yok.

  3. Minimum-weight spanning tree algorithms A survey and empirical study 2001
    OpenAlex 79.2%

    Özet henüz yok.

  4. Minimum weight spanning tree algorithms A survey and empirical study 2001
    YÖKSİS SJR Q1 JCR Q2 OpenAlex 78.5%

    Özet henüz yok.

  5. Approximating the single-sink link-installation problem in network design 2001
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 98.2%

    We initiate the algorithmic study of an important but NP-hard problem that arises commonly in network design. The input consists of the following: An undirected graph with one sink node and multiple source nodes, a specified length for each edge, and a specified demand, dem v , for each source node v. A small set of c…

  6. Design implementation and analysis of maximum transversal algorithms 2011
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 95.6%

    We report on careful implementations of seven algorithms for solving the problem of finding a maximum transversal of a sparse matrix. We analyze the algorithms and discuss the design choices. To the best of our knowledge, this is the most comprehensive comparison of maximum transversal algorithms based on augmenting p…

  7. SpyDetector: An approach for detecting side-channel attacks at runtime 2018
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 95.0%

    In this paper, we report on our implementation of a lattice-based key-policy attribute-based encryption (KP-ABE) scheme, which uses short secret keys. The particular KP-ABE scheme can be used directly for attribute-based access control applications, as well as a building block in more involved applications and cryptog…

  8. Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design 1999
    OpenAlex 76.7%

    Özet henüz yok.

  9. Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices 2019
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 91.3%

    Lattice trapdoors are an important primitive used in a wide range of cryptographic protocols, such as identity-based encryption (IBE), attribute-based encryption, functional encryption, and program obfuscation. In this paper, we present software implementations of the Gentry-Peikert-Vaikuntanathan (GPV) digital signat…

  10. Approximation algorithms for the traveling purchaser problem and its variants in network design 1999
    YÖKSİS SJR Q2 JCR Q1 OpenAlex 77.0%

    Özet henüz yok.

  11. School choice under partial fairness 2019
    OpenAlex üst %10 OpenAlex 98.1%

    We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the student exchange under partial fairness (SEPF). Each member of this class…

  12. The minimum cost perfect matching problem with conflict pair constraints 2012
    OpenAlex 89.6%

    Özet henüz yok.

Akademisyenler

21 akademisyen