vix.ing · top · new · best · stats · spec

Uno, Yushi

  1. Reconfiguring Undirected Paths
    2019/05/01 by Demaine, Erik D., Eppstein, David, Hesterberg, Adam +4 · 4 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  2. The complexity of UNO
    2010/03/15 by Erik D. Demaine, Martin L. Demaine, Demaine, Erik D. +9 · 1 voice
    Computer Science · Social Sciences · Decision Sciences · #Artificial Intelligence in Games #Digital Games and Media #Game Theory and Applications
  3. Swapping Colored Tokens on Graphs
    2018/03/19 by Katsuhisa Yamanaka, Yamanaka, Katsuhisa, Takashi Horiyama +13 · 1 citation
    Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Genome Rearrangement Algorithms
  4. Linear-Time Recognition of Double-Threshold Graphs
    2019/09/20 by Yusuke Kobayashi, Kobayashi, Yusuke, Yoshio Okamoto +5 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems
  5. Gourds: a sliding-block puzzle with turning
    2020/11/02 by Hamersma, Joep, van Kreveld, Marc, Uno, Yushi +1 · 1 citation
    #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.1.3 #F.2.2 #FOS: Computer and information sciences #G.2.2
  6. Reconfiguration of Non-crossing Spanning Trees
    2022/06/08 by Oswin Aichholzer, Brad Ballinger, Aichholzer, Oswin +17 · 2 citations
    Computer Science · Engineering · #Advanced Graph Theory Research #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Optimization and Packing Problems
  7. Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
    2016/03/07 by Jean-Francois Baffier, Baffier, Jean-Francois, Man-Kwun Chiu +13 · 1 voice
    Computer Science · #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CC #cs.DM