Yuni Iwamasa
Orcid: 0000-0002-6794-3543Affiliations:
- Kyoto University, Japan
  According to our database1,
  Yuni Iwamasa
  authored at least 35 papers
  between 2014 and 2025.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
- 
    on orcid.org
On csauthors.net:
Bibliography
  2025
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.
    
  
    Math. Program., September, 2025
    
  
    J. Appl. Comput. Topol., September, 2025
    
  
A general framework for finding diverse solutions via network flow and its applications.
    
  
    CoRR, April, 2025
    
  
    Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025
    
  
  2024
Characterizations of the set of integer points in an integral bisubmodular polyhedron.
    
  
    Discret. Math., April, 2024
    
  
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices.
    
  
    Math. Program., March, 2024
    
  
    Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
    
  
    Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
    
  
  2023
    Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
    
  
    Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
    
  
    Proceedings of the 39th International Symposium on Computational Geometry, 2023
    
  
  2022
    Algorithmica, 2022
    
  
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
    
  
    Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
    
  
    Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
    
  
    Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
    
  
    Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
    
  
  2021
    Proceedings of the Fourth International Conference on Applied Category Theory, 2021
    
  
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices.
    
  
    CoRR, 2021
    
  
A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices.
    
  
    Proceedings of the Integer Programming and Combinatorial Optimization, 2021
    
  
    Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
    
  
  2020
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications.
    
  
    Proceedings of the Theory and Applications of Models of Computation, 2020
    
  
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices.
    
  
    Proceedings of the Integer Programming and Combinatorial Optimization, 2020
    
  
  2019
    ACM Trans. Algorithms, 2019
    
  
  2018
    J. Comb. Optim., 2018
    
  
    Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
    
  
    Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
    
  
  2016
On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract).
    
  
    Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
    
  
  2015
    Proceedings of the 32nd International Conference on Machine Learning, 2015
    
  
  2014