The following pages link to Hiroshi Nagamochi (Q187130):
Displaying 50 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- A note on minimizing submodular functions (Q293366) (← links)
- An exact strip packing algorithm based on canonical forms (Q339635) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Unranking of small combinations from large sets (Q473209) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming (Q535320) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Minimum degree orderings (Q848936) (← links)
- Two equivalent measures on weighted hypergraphs (Q860393) (← links)
- Sparse connectivity certificates via MA orderings in graphs (Q860401) (← links)
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574) (← links)
- Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- A detachment algorithm for inferring a graph from path frequency (Q1014796) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Eulerian detachments with local edge-connectivity (Q1028462) (← links)
- A simple recognition of maximal planar graphs (Q1029086) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph (Q1186788) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons (Q1280281) (← links)
- Canonical cactus representation for miminum cuts (Q1343494) (← links)
- Vehicle scheduling on a tree with release and handling times (Q1357781) (← links)
- Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs (Q1383804) (← links)
