The following pages link to Hiroshi Nagamochi (Q187130):
Displaying 50 items.
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- (Q2721988) (← links)
- An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate (Q2729643) (← links)
- (Q2762526) (← links)
- An improved algorithm for parameterized edge dominating set problem (Q2790152) (← links)
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game (Q2803833) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q2843925) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Exact Algorithms for Maximum Independent Set (Q2872097) (← links)
- A Refined Exact Algorithm for Edge Dominating Set (Q2898046) (← links)
- Submodular Minimization via Pathwidth (Q2898070) (← links)
- An Improved Exact Algorithm for TSP in Degree-4 Graphs (Q2914313) (← links)
- Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs (Q2920483) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (Q2958106) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game (Q2971393) (← links)
- (Q2999651) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Generating Trees on Multisets (Q3060732) (← links)
- Listing Triconnected Rooted Plane Graphs (Q3066470) (← links)
- An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem (Q3098082) (← links)
- Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Characterizing Mechanisms in Obnoxious Facility Game (Q3167372) (← links)
- New Approximation to the One-sided Radial Crossing Minimization (Q3184609) (← links)
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities (Q3202104) (← links)
- (Q3368663) (← links)
- Some Theorems on Detachments Preserving Local-Edge-Connectivity (Q3439432) (← links)
- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints (Q3511352) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- Convex Drawings of Graphs with Non-convex Boundary (Q3522948) (← links)
- Algorithmic Aspects of Graph Connectivity (Q3543582) (← links)
- Enumerating Rooted Graphs with Reflectional Block Structures (Q3562991) (← links)
- Minimum Transversals in Posimodular Systems (Q3563946) (← links)
- Generating Internally Triconnected Rooted Plane Graphs (Q3569099) (← links)
- (Q3579461) (← links)
- Constant Time Generation of Biconnected Rooted Plane Graphs (Q3587341) (← links)
- FPTAS’s for Some Cut Problems in Weighted Trees (Q3587352) (← links)
- A Detachment Algorithm for Inferring a Graph from Path Frequency (Q3591314) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Removing Node Overlaps Using Multi-sphere Scheme (Q3611863) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming (Q3652187) (← links)
- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems (Q3652191) (← links)
- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries (Q3652242) (← links)
- Upward Star-Shaped Polyhedral Graphs (Q3652278) (← links)
- (Q3840350) (← links)
- Maximum flows in probabilistic networks (Q3984285) (← links)
