UB Paderborn / Katalog / Suche / in CDI

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2 submatrices

Mathematical programming, 2024, Vol.204 (1-2), p.27-79

Iwamasa, Yuni

2024

Link zum Volltext

Verfügbarkeit prüfen

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices

Mathematical programming, 2022, Vol.195 (1-2), p.1-37

2022

Link zum Volltext

Verfügbarkeit prüfen

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems

Algorithmica, 2022-07, Vol.84 (7), p.1875-1896

2022

Link zum Volltext

Verfügbarkeit prüfen

On a general framework for network representability in discrete optimization

Journal of combinatorial optimization, 2018-10, Vol.36 (3), p.678-708

Iwamasa, Yuni

2018

Link zum Volltext

Verfügbarkeit prüfen

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications

Mathematical programming, 2022-07, Vol.194 (1-2), p.229-256

2022

Link zum Volltext

Verfügbarkeit prüfen

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $$2 \times 2$$ submatrices

Mathematical programming, 2023-05

Iwamasa, Yuni

2023

Link zum Volltext

Verfügbarkeit prüfen

Characterizations of the set of integer points in an integral bisubmodular polyhedron

Discrete mathematics, 2024-04, Vol.347 (4), p.113855, Article 113855

Iwamasa, Yuni

2024

Link zum Volltext

Verfügbarkeit prüfen

Quantaloidal Approach to Constraint Satisfaction

Electronic proceedings in theoretical computer science, 2022-11, Vol.372, p.289-305

2022

Link zum Volltext

Verfügbarkeit prüfen

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

ACM transactions on algorithms, 2023-02, Vol.19 (1), p.1-22, Article 6

2023

Link zum Volltext

Verfügbarkeit prüfen

A Tractable Class of Binary VCSPs via M-Convex Intersection

ACM transactions on algorithms, , Vol.15 (3), p.1-41, Article 44

Link zum Volltext

Verfügbarkeit prüfen

Discrete convexity in joint winner property

Discrete optimization, 2018-05, Vol.28, p.78-88

2018

Link zum Volltext

Verfügbarkeit prüfen

A combinatorial algorithm for computing the rank of a generic partitioned matrix with [Formula omitted] submatrices

Mathematical programming, 2022-09, Vol.195 (1-2), p.1

2022

Link zum Volltext

Verfügbarkeit prüfen

A combinatorial algorithm for computing the rank of a generic partitioned matrix with $$2 \times 2$$ submatrices

Mathematical programming, 2022-09, Vol.195 (1-2), p.1-37

2022

Link zum Volltext

Verfügbarkeit prüfen

The quadratic M-convexity testing problem

Discrete Applied Mathematics, 2018-03, Vol.238, p.106-114

Iwamasa, Yuni

2018

Link zum Volltext

Verfügbarkeit prüfen

On $k$-Submodular Relaxation

SIAM journal on discrete mathematics, 2016-01, Vol.30 (3), p.1726-1736

2016

Link zum Volltext

Verfügbarkeit prüfen

Networks maximizing the consensus time of voter models

Physical review. E, Statistical, nonlinear, and soft matter physics, 2014-07, Vol.90 (1), p.012816-012816, Article 012816

2014

Link zum Volltext

Verfügbarkeit prüfen

Reconfiguring (non-spanning) arborescences

Theoretical computer science, 2023-01, Vol.943, p.131-141

2023

Link zum Volltext

Verfügbarkeit prüfen

Reconfiguring Directed Trees in a Digraph

Computing and Combinatorics, p.343-354

Link zum Volltext

Verfügbarkeit prüfen

Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications

Theory and Applications of Models of Computation, 2020, Vol.12337, p.156-167

2020

Link zum Volltext

Verfügbarkeit prüfen

Reconfiguration of Time-Respecting Arborescences

Algorithms and Data Structures, 2023, p.521-532

2023

Link zum Volltext

Verfügbarkeit prüfen

A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2\,\times \,2$$\end{document} Submatrices

Integer Programming and Combinatorial Optimization, 2021, p.119-133

Iwamasa, Yuni

2021

Link zum Volltext

Verfügbarkeit prüfen

A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} 2 Submatrices

Integer Programming and Combinatorial Optimization, 2020, p.196-208

2020

Link zum Volltext

Verfügbarkeit prüfen

On a General Framework for Network Representability in Discrete Optimization: Extended Abstract

Combinatorial Optimization, 2016, p.369-380

Iwamasa, Yuni

2016

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2 submatrices

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems

On a general framework for network representability in discrete optimization

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications

A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $$2 \times 2$$ submatrices

Characterizations of the set of integer points in an integral bisubmodular polyhedron

Quantaloidal Approach to Constraint Satisfaction

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

A Tractable Class of Binary VCSPs via M-Convex Intersection

Discrete convexity in joint winner property

A combinatorial algorithm for computing the rank of a generic partitioned matrix with [Formula omitted] submatrices

A combinatorial algorithm for computing the rank of a generic partitioned matrix with $$2 \times 2$$ submatrices

The quadratic M-convexity testing problem

On $k$-Submodular Relaxation

Networks maximizing the consensus time of voter models

Reconfiguring (non-spanning) arborescences

Reconfiguring Directed Trees in a Digraph

Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications

Reconfiguration of Time-Respecting Arborescences

On a General Framework for Network Representability in Discrete Optimization: Extended Abstract

Suchergebnisse filtern