Hyperedge Routing

Hyperedge Routing is a computational method in hypergraph visualization that determines the geometric pathways connecting multiple nodes through a hyperedge, distinguishing itself by explicitly modeling the spatial embedding and routing logic of set-based relationships in non-pairwise networks.

4

Publications

188

Citations

11

Authors

3

Institutions

Publications per year

2017–2026

1

Authors

11

  1. WM
    Wai-Kei Mak

    National Tsing Hua University, Taiwan

    2 publications · 27 citations

    2

    h-index

  2. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    2 publications · 27 citations

    2

    h-index

  3. SH
    Sheng H. Wang

    University of Helsinki, Finland

    1 publications · 66 citations

    1

    h-index

  4. FS
    Felix Siebenhühner

    University of Helsinki, Finland

    1 publications · 66 citations

    1

    h-index

  5. JM
    J. Matias Palva

    University of Helsinki, Finland

    1 publications · 66 citations

    1

    h-index

1–5 of 11

Institutions

3

  1. The University of Texas at Austin

    Austin, United States

    2 h-index

    4 publications

    54 citations

  2. University of Helsinki

    Helsinki, Finland

    1 h-index

    6 publications

    396 citations

  3. Tilburg University

    Tilburg, The Netherlands

    1 h-index

    3 publications

    285 citations

1–3 of 3

Venues

  1. International Journal of Game Theory

    1 publications · 95 citations

    1

    h-index

  2. ACM Transactions on Design Automation of Electronic Systems

    TODAES · 1 publications · 17 citations

    1

    h-index

  3. International Conference on Computer Aided Design

    Conference · 1 publications · 10 citations

    1

    h-index

  4. NeuroImage

    1 publications · 66 citations

    1

    h-index

1–4