Sonoko Moriyama and Combinatorial - Free people check

(1 - 11 from 12

)

Alumni (Theory of Combinatorial Algorithms, ETH Zürich)

ti.inf.ethz.ch

Theory of Combinatorial Algorithms Prof. Emo Welzl and Prof. Bernd Gärtner People. Personnel; Guests; Alumni; ... Sonoko Moriyama: Oct 1, – Feb 20, 2004:

deciding non-realizability of oriented matroids by semidefinite ...www.ybook.co.jp › online-p › PJO › vol5

www.ybook.co.jp

Hiroyuki Miyata, Sonoko Moriyama and Hiroshi Imai. Abstract: The concept of oriented matroid is a combinatorial abstraction of many geometric objects such.

CiteSeerX — On Combinatorial Properties of Linear Program Digraphs

citeseerx.ist.psu.edu

On Combinatorial Properties of Linear Program Digraphs ... Sonoko Moriyama ... On Combinatorial Properties of Linear Program ...

Complete Enumeration of Small Realizable Oriented Matroids |...

link.springer.com

Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have...

Matroid Enumeration for Incidence Geometry | SpringerLink

link.springer.com

Matroids are combinatorial abstractions for point configurations and hyperplane arrangements, which are fundamental objects in discrete geometry. Matroids

All web results to the name "Sonoko Moriyama"

CG13 - Combinatorial Geometries: matroids, oriented LIRMMwww.lirmm.fr › ~gioan › CG13-CIRM › public › CG13-participants

www.lirmm.fr

Sonoko MORIYAMA, (Graduate School of Information Sciences, Tohoku University). Viet Hang NGUYEN, (G-SCOP, Grenoble UJF, France).

CG13 - Combinatorial Geometries: matroids, oriented ...

www.lirmm.fr

(Joint work with Sonoko Moriyama.) 17h15: Carsten LANGE (Freie Universität Berlin, Germany) Counting invariants for realizations of associahedra: An n-dimensional associahedron is a simple convex polytope with vertex-edge graph isomorphic to the flip graph of …