## personal communication (1997)

### Cached

### Download Links

Citations: | 39 - 1 self |

### BibTeX

@MISC{Lin97personalcommunication,

author = {Co-chairs James Lin and Bruce Mcleod},

title = {personal communication},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peer-reviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were optically scanned and then edited for entry into this compilation. But since the process is not perfect, errors may have been introduced, for which we apologize.

### Citations

1129 |
S.: An efficient heuristic procedure for partitioning graphs
- Kernighan, Lin
- 1970
(Show Context)
Citation Context ...s can be easily shown to be NP-hard as well [10]. For the case of undirected graphs, an O(log 1.5 n)-approximation algorithm is known [9]. In practice, Kernighan-Lin heuristic (a.k.a., K-L heuristic) =-=[15]-=- is a well-known algorithm for handling the problem for undirected case. As for the case of directed graphs, Feige and Yahalom [10] showed that the Min-Bisection Problem for directed graphs is not app... |

105 | A packing problem with applications to lettering of maps
- Formann, Wagner
- 1991
(Show Context)
Citation Context ...[17], respectively. ACM Computational Geometry Impact Task Force [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete =-=[11, 14]-=- in general. (The interested reader is also referred to [19, 20] for various approximations and heuristics for map labeling.) Map labeling problems are classified by the following three kinds of graph... |

87 |
Edge Crossings in Drawings of Bipartite Graphs
- Eades, Wormald
- 1994
(Show Context)
Citation Context ...determine a boundary labeling for M so that the crossing number is minimized. Before deriving our main results, we first recall three NP-complete problems, namely, the Decision Crossing Problem (DCP) =-=[8]-=-, the Max-Bisection Problem [22], and the Min-Bisection Problem for directed graphs [10] that are closely related to our problems. Consider a two-layered network G = (L0, L1, E) consisting of disjoint... |

73 | A polylogarithmic approximation of the minimum bisection
- Feige, Krauthgamer
(Show Context)
Citation Context ...hs is known to be NP-hard [12], and the problem for directed graphs can be easily shown to be NP-hard as well [10]. For the case of undirected graphs, an O(log 1.5 n)-approximation algorithm is known =-=[9]-=-. In practice, Kernighan-Lin heuristic (a.k.a., K-L heuristic) [15] is a well-known algorithm for handling the problem for undirected case. As for the case of directed graphs, Feige and Yahalom [10] s... |

64 |
Positioning Names on Maps
- Imhof
- 1975
(Show Context)
Citation Context ...s, lines, or areas) in a drawing (map). In order to ensure readability, unambiguity and legibility, it is suggested that the labels be pairwise disjoint and close to the features to which they belong =-=[13]-=-. A detailed bibliography and survey on map labeling can be found in [21], [17], respectively. ACM Computational Geometry Impact Task Force [7] has identified label placement as an important area of r... |

64 |
Geometry helps in matching
- Vaidya
- 1989
(Show Context)
Citation Context ... (N1 + · · · + Nn)log N) = O(nN log N). Finally, like the work in [1], the LLPML solution can be obtained by finding the minimum weighted matching in A × B, which can be solved in time O(n 2 log 3 n) =-=[18]-=-. As a consequence, LLPML can be solved in polynomial time. It is interesting to compare and contrast the results for LLPML under typepo leaders with those listed in Table 2, which deals with one-to-o... |

60 |
Computers and Interactability. A Guide to the Theory of NP-Completeness. A
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...so that w(S) is minimized. Note that if the graph is directed, then the objective of the problem is to minimize w(S) := ∑ (i,j)∈(S,V \S) wi,j. The problem for undirected graphs is known to be NP-hard =-=[12]-=-, and the problem for directed graphs can be easily shown to be NP-hard as well [10]. For the case of undirected graphs, an O(log 1.5 n)-approximation algorithm is known [9]. In practice, Kernighan-Li... |

36 | A .699 approximation algorithm for Max-Bisection
- Ye
- 2001
(Show Context)
Citation Context ...or M so that the crossing number is minimized. Before deriving our main results, we first recall three NP-complete problems, namely, the Decision Crossing Problem (DCP) [8], the Max-Bisection Problem =-=[22]-=-, and the Min-Bisection Problem for directed graphs [10] that are closely related to our problems. Consider a two-layered network G = (L0, L1, E) consisting of disjoint sets L0 and L1 of nodes and a s... |

34 | Boundary labeling: Models and efficient algorithms for rectangular maps
- Bekos, Kaufmann, et al.
(Show Context)
Citation Context ...re usually used in technical drawings or medical atlases where certain site-features are explained with blocks of texts. To address this problem, Bekos et al. proposed the so-called boundary labeling =-=[1, 3, 4]-=-, in which all labels are attached to the boundary (four sides) of a rectangle R enclosing all sites, and each site is connected to a unique label by a leader, which may be a rectilinear or straight l... |

26 | Map Labeling Heuristics: Provably good and practically useful
- Wagner, Wolff
- 1995
(Show Context)
Citation Context ... [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete [11, 14] in general. (The interested reader is also referred to =-=[19, 20]-=- for various approximations and heuristics for map labeling.) Map labeling problems are classified by the following three kinds of graphical features according to their dimensions, namely, point featu... |

26 |
The Map-Labeling Bibliography
- Wolff
- 2005
(Show Context)
Citation Context ...nambiguity and legibility, it is suggested that the labels be pairwise disjoint and close to the features to which they belong [13]. A detailed bibliography and survey on map labeling can be found in =-=[21]-=-, [17], respectively. ACM Computational Geometry Impact Task Force [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complet... |

15 |
NP-hardness of some map labeling problems
- Iturriaga, Lubiw
- 1997
(Show Context)
Citation Context ...[17], respectively. ACM Computational Geometry Impact Task Force [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete =-=[11, 14]-=- in general. (The interested reader is also referred to [19, 20] for various approximations and heuristics for map labeling.) Map labeling problems are classified by the following three kinds of graph... |

13 | One sided crossing minimization is NPhard for sparse graphs - Munoz, Unger, et al. - 2002 |

10 |
Chazelle and 36 co-authors. The computational geometry impact task force report
- unknown authors
- 1999
(Show Context)
Citation Context ...disjoint and close to the features to which they belong [13]. A detailed bibliography and survey on map labeling can be found in [21], [17], respectively. ACM Computational Geometry Impact Task Force =-=[7]-=- has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete [11, 14] in general. (The interested reader is also referred to [19,... |

7 | Boundary labelling of optimal total leader length
- Bekos, Kaufmann, et al.
- 2005
(Show Context)
Citation Context ...re usually used in technical drawings or medical atlases where certain site-features are explained with blocks of texts. To address this problem, Bekos et al. proposed the so-called boundary labeling =-=[1, 3, 4]-=-, in which all labels are attached to the boundary (four sides) of a rectangle R enclosing all sites, and each site is connected to a unique label by a leader, which may be a rectilinear or straight l... |

7 | Polygons labelling of minimum leader length - Bekos, Kaufmann, et al. - 2006 |

7 |
Map labeling with application to graph drawing
- NEYER
- 2001
(Show Context)
Citation Context ...uity and legibility, it is suggested that the labels be pairwise disjoint and close to the features to which they belong [13]. A detailed bibliography and survey on map labeling can be found in [21], =-=[17]-=-, respectively. ACM Computational Geometry Impact Task Force [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete [11,... |

6 | Algorithms for multi-criteria one-sided boundary labeling
- Benkert, Haverkort, et al.
- 2007
(Show Context)
Citation Context ...ype-opo leaders (b) Type-po leaders (c) Type-s leaders Figure 3: Illustration of leaders. Very recently, in order to improve one-side one-to-one boundary labeling with type-po leaders, Benkert et al. =-=[6]-=- introduced a new notation of so-called type-do leaders, in which the do stands for diagonal-orthogonal. As shown in Figure 4, the only difference between type-po and type-do leaders is that the leade... |

3 | BLer: A boundary labeller for technical drawings - Bekos, Symvonis - 2006 |

3 | On the complexity of finding balanced oneway cuts
- Feige, Yahalom
(Show Context)
Citation Context ...riving our main results, we first recall three NP-complete problems, namely, the Decision Crossing Problem (DCP) [8], the Max-Bisection Problem [22], and the Min-Bisection Problem for directed graphs =-=[10]-=- that are closely related to our problems. Consider a two-layered network G = (L0, L1, E) consisting of disjoint sets L0 and L1 of nodes and a set E ⊆ L0 × L1 of edges. Assume that the nodes in L0 and... |

2 |
Approximate map labeling is in ω(n logn
- Wagner
- 1994
(Show Context)
Citation Context ... [7] has identified label placement as an important area of research. The majority of map labeling problems are known to be NP-complete [11, 14] in general. (The interested reader is also referred to =-=[19, 20]-=- for various approximations and heuristics for map labeling.) Map labeling problems are classified by the following three kinds of graphical features according to their dimensions, namely, point featu... |