default search action
Kazuyuki Miura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Kazuyuki Miura:
Rectangle-of-Influence Drawings of Five-Connected Plane Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1452-1457 (2024) - 2023
- [j14]Kazuyuki Miura:
Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1092-1099 (2023) - 2022
- [j13]Kazuyuki Miura:
Grid Drawings of Five-Connected Plane Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1228-1234 (2022) - 2021
- [j12]Kei Sato, Kazuyuki Miura:
Convex Grid Drawings of Plane Graphs with Pentagonal Contours on O(n2) Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1142-1149 (2021)
2010 – 2019
- 2014
- [j11]Kazuyuki Miura:
Convex Grid Drawings of Plane Graphs with Pentagonal Contours. IEICE Trans. Inf. Syst. 97-D(3): 413-420 (2014)
2000 – 2009
- 2009
- [j10]Md. Saidur Rahman
, Kazuyuki Miura, Takao Nishizeki:
Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. 42(3): 214-230 (2009) - [j9]Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discret. Comput. Geom. 41(4): 643-670 (2009) - 2008
- [j8]Kazuyuki Miura, Akira Kamada, Takao Nishizeki:
Convex Grid Drawings of Plane Graphs with Rectangular Contours. J. Graph Algorithms Appl. 12(2): 197-224 (2008) - 2006
- [j7]Kazuyuki Miura, Hiroki Haga, Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs. Int. J. Comput. Geom. Appl. 16(2-3): 249-270 (2006) - [j6]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Convex Grid Drawings of Four-connected Plane Graphs. Int. J. Found. Comput. Sci. 17(5): 1031-1060 (2006) - [j5]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Convex Drawings of Plane Graphs of Minimum Outer Apices. Int. J. Found. Comput. Sci. 17(5): 1115-1128 (2006) - [c11]Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. GD 2006: 138-149 - [c10]Akira Kamada, Kazuyuki Miura, Takao Nishizeki:
Convex Grid Drawings of Plane Graphs with Rectangular Contours. ISAAC 2006: 131-140 - 2005
- [j4]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs. Int. J. Found. Comput. Sci. 16(1): 117-141 (2005) - [c9]Kazuyuki Miura, Takao Nishizeki:
Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. APVIS 2005: 75-80 - [c8]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Convex Drawings of Plane Graphs of Minimum Outer Apices. GD 2005: 297-308 - 2004
- [j3]Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman:
Algorithms for Drawing Plane Graphs. IEICE Trans. Inf. Syst. 87-D(2): 281-289 (2004) - [c7]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON 2004: 309-318 - [c6]Kazuyuki Miura, Hiroki Haga, Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs. ISAAC 2004: 693-704 - [c5]Md. Saidur Rahman
Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG 2004: 320-331 - 2002
- [c4]Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki:
Extended Rectangular Drawings of Plane Graphs with Designated Corners. GD 2002: 256-267 - 2001
- [j2]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of 4-Connected Plane Graphs. Discret. Comput. Geom. 26(1): 73-87 (2001) - 2000
- [c3]Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano:
Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265
1990 – 1999
- 1999
- [j1]Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci. 10(2): 195-210 (1999) - [c2]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of Four-Connected Plane Graphs. GD 1999: 145-154 - 1998
- [c1]Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG 1998: 310-323
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-09-07 02:04 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: