松井 泰子

Matsui Yasuko

  • 教授
  • 学位:博士(工学)

基本情報

所属

  • Undergraduate School of Science / Department of Mathematical Sciences
  • Graduate School of Science and Technology / Course of Science and Technology
  • Graduate School of Science / Course of Mathematics and Mathematical Sciences

詳細情報

研究キーワード

  • Mathematical Programming

研究分野

  • Social infrastructure (civil Engineering, architecture, disaster prevention) Social systems engineering
  • Informatics Information theory

委員歴

  • JCDCG^3 2022 Editorial Board
  • JCDCG^3 2022 Organizing Committee
  • JCDCG^3 2019 Organizing Committee
  • JCDCG^3 2017 Organizing Committee

論文

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints.

Find Routes on a Doughnut

A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs.

Enumerating Highly-Edge-Connected Spanning Subgraphs

More Routes for Evacuation.

Safe sets, network majority on weighted trees

Safe sets in graphs: Graph classes and structural parameters

Network Majority on Tree Topological Network

Safe sets in graphs: Graph classes and structural parameters

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise

Enumeration of the perfect sequences of a chordal graph

Efficient enumeration of all ladder lotteries and its application.

Enumeration of Perfect Sequences of Chordal Graph

2-E-17 Enumeration of Perfect Sequences of Chordal Graph

A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Enumeration of Perfect Sequences of Chordal Graph

On the Enumeration of Bipartite Minimum Edge Colorings, Graph Theory in Paris

Random generation of 2x2x center dot center dot center dot x2xJ contingency tables

NP-completeness for calculating power indices of weighted majority games

A survey of algorithms for calculating power indices of weighted majority games

書籍等出版物

  • Encyclopedia of Operations Research and Management Science
  • An enumeration algorithm of the edge colorings in bipartite groaphs(共著)
  • Handbooks in Operations Research and Management Science
  • Finding all the s-t paths in acyclic graphs(共著)

講演・口頭発表等

  • Enumerate All Routes on a Doughnut
  • Find Routes on a Doughnut
  • Find Routes on a Doughnut
  • A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs
  • Enumeration of Three-Edge-Connected Spanning Subgraphs in Plane Graphs
  • On the diameter of bisubmodular polyhedra
  • A simple enumeration algorithm for all substitutions rooted ordered subtrees into a term tree
  • Enumerating All Spanning Subgraphs with Edge-Connectivity at Least k
  • More Routes for Evacuation
  • Safe Sets in Graphs:Graph Classes and Structural Parameters
  • Enumeration algorithm for minimum weighted vertex colorings on some graphs
  • Network Majority on Tree Topological Network
  • A Fast Algorithm for Counting the Number of Primitive Sorting Networks
  • Enumerating all the Optimal Cost Vertex Coloring of 1-Trees

所属学会

  • JAPANESE SOCIETY OF COMPUTATIONAL STATISTICS

共同研究・競争的資金等の研究課題

Algorithmic Foundations Based on Large-Scale Discrete Structures

On relations of bound graphs and order ideals

Development of the enumeration algorithm for the problems on statistics

On bound graphs and poset operations

The Study of theoretical aspects and practical aspect on Grobner Bases

Constructing Algorithms for Contingency Tables and Graphical Models by using Algebraic Approaches

On subgraphs and subposets of bound graphs

On bound graphs and simplicial vertices

Study of universal Grobner bases of zero-dimensional lattice ideals

On bound graphs and non-maximal cliques

On bound graphs and cique covers

On relations between upper bound graphs and graph operations

ResearchMapへ移動します

Contact Us

Inquiries about coverage

Public Affairs Division Public Affairs and Communications Department

Tel. 0463-63-4670(direct dialing)