Mutsunori Yagiura

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Tomio Hirata

> Home > Persons > Mutsunori Yagiura

Publications

2009
[c12]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iadis/MatsuuraYH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iadis/MatsuuraYH09
Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata:
A textile design and the boolean rank problem. IADIS AC (1) 2009: 345-352
2008
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgaa/XieYOHZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/XieYOHZ08
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. J. Graph Algorithms Appl. 12(4): 383-399 (2008)
2007
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/XieYOHZ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/XieYOHZ07
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/lion/OnoYH07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lion/OnoYH07
Takao Ono, Mutsunori Yagiura, Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176

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.