Search results for: Hiroshi Nagamochi
Lecture Notes in Computer Science > Integer Programming and Combinatorial Optimization > Edge Connectivity > 96-111
Lecture Notes in Computer Science > Graph Drawing > k-Level Drawings > 406-418
Lecture Notes in Computer Science > Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics > The Importance of Being Careful > 121-135
Lecture Notes in Computer Science > Algorithms and Computation > 6B Graph and Combinatorial Algorithms IV > 434-443
Lecture Notes in Computer Science > Graph Drawing > Clusters, Cuts, and Orthogonal Drawings > 369-380
Lecture Notes in Computer Science > Algorithms and Computation > Combinatorial Generation and Optimization (I) > 36-48
Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Contributed Papers > 342-353