Funder
SECOM Science and Technology Foundation, Japan
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. Minimum cost noncrossing flow problem on layered networks;Altinel;Discrete Appl. Math.,2019
2. Graph Drawing: Algorithms for the Visualization of Graphs;Battista,1999
3. A bottleneck matching problem with edge-crossing constraints;Carlsson;Int. J. Comput. Geom.,2015
4. Computing maximum non-crossing matching in convex bipartite graphs;Chen;Discrete Appl. Math.,2015
5. Introduction to Algorithms;Cormen,2009