default search action
Yuni Iwamasa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Yuni Iwamasa
:
Characterizations of the set of integer points in an integral bisubmodular polyhedron. Discret. Math. 347(4): 113855 (2024) - [j11]Yuni Iwamasa
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. 204(1): 27-79 (2024) - [c18]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. ESA 2024: 75:1-75:15 - [c17]Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito:
Basis Sequence Reconfiguration in the Union of Matroids. ISAAC 2024: 38:1-38:16 - [i20]Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato:
On the sizes of BDDs and ZDDs representing matroids. CoRR abs/2404.14670 (2024) - [i19]Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algorithmic aspects of semistability of quiver representations. CoRR abs/2407.06493 (2024) - [i18]Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito:
Basis sequence reconfiguration in the union of matroids. CoRR abs/2409.07848 (2024) - 2023
- [j10]Takehiro Ito
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19(1): 6:1-6:22 (2023) - [j9]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - [c16]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG 2023: 43:1-43:16 - [c15]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. ICALP 2023: 81:1-81:19 - [c14]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [i17]Yuni Iwamasa:
Characterizations of the set of integer points in an integral bisubmodular polyhedron. CoRR abs/2303.06320 (2023) - [i16]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - [i15]Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR abs/2310.15502 (2023) - [i14]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR abs/2310.20245 (2023) - 2022
- [j8]Hiroshi Hirai, Yuni Iwamasa
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. Algorithmica 84(7): 1875-1896 (2022) - [j7]Yuni Iwamasa
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194(1): 229-256 (2022) - [j6]Hiroshi Hirai, Yuni Iwamasa
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. Math. Program. 195(1): 1-37 (2022) - [c13]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c12]Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki:
Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. ISAAC 2022: 4:1-4:19 - [c11]Takehiro Ito
Independent Set Reconfiguration on Directed Graphs. MFCS 2022: 58:1-58:15 - [c10]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA 2022: 1342-1355 - [i13]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent set reconfiguration on directed graphs. CoRR abs/2203.13435 (2022) - [i12]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i11]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - [i10]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of colorings in triangulations of the sphere. CoRR abs/2210.17105 (2022) - 2021
- [c9]Takehiro Ito
Reconfiguring Directed Trees in a Digraph. COCOON 2021: 343-354 - [c8]Yuni Iwamasa
A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. IPCO 2021: 119-133 - [c7]Soichiro Fujii, Yuni Iwamasa, Kei Kimura:
Quantaloidal approach to constraint satisfaction. ACT 2021: 289-305 - [i9]Yuni Iwamasa:
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices. CoRR abs/2104.14841 (2021) - [i8]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. CoRR abs/2107.03092 (2021) - [i7]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR abs/2110.11585 (2021) - 2020
- [c6]Hiroshi Hirai
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. IPCO 2020: 196-208 - [c5]Yuni Iwamasa
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. TAMC 2020: 156-167 - [i6]Yuni Iwamasa, Kenjiro Takazawa:
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. CoRR abs/2003.02424 (2020) - [i5]Hiroshi Hirai, Yuni Iwamasa:
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices. CoRR abs/2004.10443 (2020)
2010 – 2019
- 2019
- [j5]Hiroshi Hirai
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15(3): 44:1-44:41 (2019) - 2018
- [j4]Yuni Iwamasa
The quadratic M-convexity testing problem. Discret. Appl. Math. 238: 106-114 (2018) - [j3]Yuni Iwamasa
Discrete convexity in joint winner property. Discret. Optim. 28: 78-88 (2018) - [j2]Yuni Iwamasa
On a general framework for network representability in discrete optimization. J. Comb. Optim. 36(3): 678-708 (2018) - [c4]Hiroshi Hirai, Yuni Iwamasa
Reconstructing Phylogenetic Tree From Multipartite Quartet System. ISAAC 2018: 57:1-57:13 - [c3]Hiroshi Hirai, Yuni Iwamasa
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS 2018: 39:1-39:14 - [i4]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A tractable class of binary VCSPs via M-convex intersection. CoRR abs/1801.02199 (2018) - 2017
- [i3]Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Discrete Convexity in Joint Winner Property. CoRR abs/1701.07645 (2017) - 2016
- [j1]Hiroshi Hirai, Yuni Iwamasa
On k-Submodular Relaxation. SIAM J. Discret. Math. 30(3): 1726-1736 (2016) - [c2]Yuni Iwamasa
On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract). ISCO 2016: 369-380 - 2015
- [c1]Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura:
Threshold Influence Model for Allocating Advertising Budgets. ICML 2015: 1395-1404 - [i2]Hiroshi Hirai, Yuni Iwamasa:
On k-Submodular Relaxation. CoRR abs/1504.07830 (2015) - 2014
- [i1]Yuni Iwamasa, Naoki Masuda:
Networks maximising the consensus time of voter models. CoRR abs/1404.6360 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: