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

Yamaguchi, Yutaro

  1. Stochastic Packing Integer Programs with Few Queries
    2017/07/13 by Maehara, Takanori, Yamaguchi, Yutaro · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  2. Stochastic Monotone Submodular Maximization with Queries
    2019/07/09 by Takanori Maehara, Maehara, Takanori, Yutaro Yamaguchi +1 · 1 citation
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Stochastic Gradient Optimization Techniques
  3. List colouring of two matroids through reduction to partition matroids
    2019/11/24 by Kristóf Bérczi, Tamás Schwarcz, Bérczi, Kristóf +3 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
  4. Matroid Intersection under Restricted Oracles
    2022/09/29 by Bérczi, Kristóf, Király, Tamás, Yamaguchi, Yutaro +1 · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  5. Finding a Shortest Non-zero Path in Group-Labeled Graphs
    2019/06/10 by Yoichi Iwata, Yutaro Yamaguchi, Iwata, Yoichi +1 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Privacy-Preserving Technologies in Data
  6. A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
    2023/11/07 by Izumi, Taisuke, Kitamura, Naoki, Yamaguchi, Yutaro · 2 citations
    Computer Science · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)
  7. Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions
    2023/08/24 by Alpár Jüttner, Csaba Király, Jüttner, Alpár +9 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems