default search action
Yasuko Matsui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Yasuaki Kobayashi
, Kazuhiro Kurita
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA 2024: 232-246 - [i2]Yasuko Matsui, Takeshi Naitoh, Ping Zhan:
A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron. CoRR abs/2405.01039 (2024) - 2023
- [j12]Yasuko Matsui, Noriyoshi Sukegawa, Ping Zhan:
Monotone Diameter of Bisubmodular Polyhedra. Oper. Res. Forum 4(4): 76 (2023) - [i1]Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR abs/2308.16426 (2023) - 2021
- [j11]Yasuko Matsui, Kenta Ozeki:
A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs. IEICE Trans. Inf. Syst. 104-D(3): 389-391 (2021) - 2020
- [j10]Yasuko Matsui, Daiki Hosomi, Masahiro Takaiwa:
Development of Finger-Wrist Rehabilitation Device Using Pneumatically Driven Parallel Sticks. J. Robotics Mechatronics 32(5): 1044-1051 (2020)
2010 – 2019
- 2019
- [j9]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
Enumerating Highly-Edge-Connected Spanning Subgraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1002-1006 (2019) - 2018
- [j8]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j7]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma
Safe sets, network majority on weighted trees. Networks 71(1): 81-92 (2018) - [c8]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
More Routes for Evacuation. COCOON 2018: 76-83 - 2016
- [j6]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma
Network Majority on Tree Topological Network. Electron. Notes Discret. Math. 54: 79-84 (2016) - [c7]Tetsuya Akagi, Shujiro Dohta, Yasuko Matsui, Hiroaki Tamaki, Naoki Kato:
Low-cost wearable rehabilitation devices using flexible pneumatic cylinder with built-in pneumatic driving system. AIM 2016: 89-93 - [c6]Yasuko Matsui, Tetsuya Akagi, Shujiro Dohta:
Development of low-cost wire type linear potentiometer for flexible spherical actuator. AIM 2016: 1017-1021 - [c5]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c4]Feifei Cho, Tetsuya Akagi, Shujiro Dohta, Yasuko Matsui:
Development of the Manipulator for Special Environment. ICMSSP 2016: 100-104 - 2011
- [j5]Masaki Yamamoto, Shuji Kijima
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. J. Comb. Optim. 22(3): 392-408 (2011) - 2010
- [j4]Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara
Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16-18): 1714-1722 (2010) - [j3]Yasuko Matsui, Ryuhei Uehara
Enumeration of the perfect sequences of a chordal graph. Theor. Comput. Sci. 411(40-42): 3635-3641 (2010)
2000 – 2009
- 2009
- [c3]Masaki Yamamoto, Shuji Kijima
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON 2009: 328-337 - 2008
- [c2]Yasuko Matsui, Ryuhei Uehara
Enumeration of Perfect Sequences of Chordal Graph. ISAAC 2008: 859-870 - 2004
- [j2]Tomomi Matsui
Random generation of 2 times 2 times ... times 2 times J contingency tables. Theor. Comput. Sci. 326(1-3): 117-135 (2004) - 2001
- [j1]Yasuko Matsui, Tomomi Matsui
NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263(1-2): 305-310 (2001)
1990 – 1999
- 1995
- [c1]Yasuko Matsui, Tomomi Matsui:
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. Combinatorics and Computer Science 1995: 18-26
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-08-03 20:12 CEST 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: