1.4k citations
- The University of TokyoJP116 papers
- RIKENJP81 papers
- Kyoto UniversityJP52 papers
- Keio UniversityJP38 papers
- The University of OsakaJP32 papers
- Tokyo Institute of TechnologyJP27 papers
- Japan Science and Technology AgencyJP25 papers
- National Institute for Materials ScienceJP25 papers
- University of TsukubaJP25 papers
- Japan Atomic Energy AgencyJP21 papers
- Kyushu UniversityJP18 papers
- Nagoya UniversityJP17 papers
5 papers · 2 filters
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Evmorfia Argyriou, Sabine Cornelsen, Henry Förster +5
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of c…
Finding Cheeger Cuts in Hypergraphs via Heat Equation
Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai +1
Cheeger's inequality states that a tightly connected subset can be extracted from a graph using an eigenvector of the normalized Laplacian associated with . More specificall…
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
Soh Kumabe, Takanori Maehara, Ryoma Sin'ya
The automaton constrained tree knapsack problem is a variant of the knapsack problem in which the items are associated with the vertices of the tree, and we can select a subset of…
Subspace Selection via DR-Submodular Maximization on Lattices
So Nakashima, Takanori Maehara
The subspace selection problem seeks a subspace that maximizes an objective function under some constraint. This problem includes several important machine learning problems such a…
Submodular maximization with uncertain knapsack capacity
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
We consider the maximization problem of monotone submodular functions under an uncertain knapsack constraint. Specifically, the problem is discussed in the situation that the knaps…