![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sonoko Moriyama
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
- [j19]Akitoshi Kawamura, Sonoko Moriyama
, Yota Otachi, János Pach:
A lower bound on opaque sets. Comput. Geom. 80: 13-22 (2019) - [j18]Hidefumi Hiraishi, Sonoko Moriyama:
Excluded Minors for ℚ-Representability in Algebraic Extension. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1017-1021 (2019) - 2018
- [j17]Hidefumi Hiraishi, Sonoko Moriyama
:
Excluded Minors of Rank 3 for Orientability and Representability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1355-1362 (2018) - 2015
- [j16]Hidefumi Hiraishi, Sonoko Moriyama
:
Minimal non-orientable matroids of rank three. Eur. J. Comb. 50: 123-137 (2015) - 2013
- [j15]David Avis, Hiroyuki Miyata, Sonoko Moriyama
:
Families of polytopal digraphs that do not satisfy the shelling property. Comput. Geom. 46(3): 382-393 (2013) - [j14]David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama
:
Editorial. Comput. Geom. 46(5): 493 (2013) - [j13]Komei Fukuda, Hiroyuki Miyata, Sonoko Moriyama
:
Complete Enumeration of Small Realizable Oriented Matroids. Discret. Comput. Geom. 49(2): 359-381 (2013) - [j12]Hidefumi Hiraishi, Sonoko Moriyama
:
A new infinite family of minimal non-orientable matroids of rank 3 with 3n elements. Electron. Notes Discret. Math. 44: 275-280 (2013) - 2012
- [j11]Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama
:
On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. Discret. Appl. Math. 160(15): 2104-2115 (2012) - [j10]Yoshitake Matsumoto, Sonoko Moriyama
, Hiroshi Imai, David Bremner:
Matroid Enumeration for Incidence Geometry. Discret. Comput. Geom. 47(1): 17-43 (2012) - 2011
- [j9]Sonoko Moriyama
:
Deciding Shellability of Simplicial Complexes with h-Assignments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1238-1241 (2011) - [j8]Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama
:
Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints. Trans. Comput. Sci. 14: 1-30 (2011) - 2009
- [j7]Komei Fukuda, Sonoko Moriyama
, Hiroki Nakayama, Jürgen Richter-Gebert:
Every non-Euclidean oriented matroid admits a biquadratic final polynomial. Comb. 29(6): 691-698 (2009) - [j6]Komei Fukuda, Sonoko Moriyama
, Yoshio Okamoto
:
The Holt-Klee condition for oriented matroids. Eur. J. Comb. 30(8): 1854-1867 (2009) - [j5]David Avis, Sonoko Moriyama
, Masaki Owari
:
From Bell Inequalities to Tsirelson's Theorem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(5): 1254-1267 (2009) - 2008
- [j4]Masahiro Hachimori
, Sonoko Moriyama
:
A note on shellability and acyclic orientations. Discret. Math. 308(12): 2379-2381 (2008) - 2006
- [j3]Sonoko Moriyama
, Masahiro Hachimori
:
h-Assignments of simplicial complexes and reverse search. Discret. Appl. Math. 154(3): 594-597 (2006) - [j2]Sonoko Moriyama
, Yoshio Okamoto
:
The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. IEICE Trans. Inf. Syst. 89-D(8): 2402-2404 (2006) - 2003
- [j1]Sonoko Moriyama
, Fumihiko Takeuchi:
Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability. Discret. Math. 263(1-3): 295-296 (2003)
Conference and Workshop Papers
- 2016
- [c5]Akitoshi Kawamura, Sonoko Moriyama
, Yota Otachi
, János Pach:
A Lower Bound on Opaque Sets. SoCG 2016: 46:1-46:10 - 2010
- [c4]Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda:
Complete enumeration of small realizable oriented matroids. CCCG 2010: 143-146 - [c3]Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama
:
Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints. ISVD 2010: 23-32 - [c2]Norie Fu, Hiroshi Imai, Sonoko Moriyama
:
Voronoi Diagrams on Periodic Graphs. ISVD 2010: 189-198 - 2000
- [c1]Sonoko Moriyama, Fumihiko Takeuchi:
Incremental construction properties in dimension two-- shellability, extendable shellability and vertex decomposability. CCCG 2000
Informal and Other Publications
- 2014
- [i3]Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A lower bound on opaque sets. CoRR abs/1403.3894 (2014) - 2011
- [i2]Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama:
Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes. CoRR abs/1110.3014 (2011) - [i1]David Avis, Hiroyuki Miyata, Sonoko Moriyama:
Families of polytopal digraphs that do not satisfy the shelling property. CoRR abs/1110.3078 (2011)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint