The following pages link to J. Mark Keil (Q680147):
Displaying 46 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Algorithmic properties of ciliate sequence alignment (Q847670) (← links)
- The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation (Q975537) (← links)
- (Q1050356) (redirect page) (← links)
- A note on a conjecture by Gavril on clique separable graphs (Q1050357) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
- Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Computing a subgraph of the minimum weight triangulation (Q1327172) (← links)
- A large subgraph of the minimum weight triangulation (Q1380821) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- A new bound for map labeling with uniform circle pairs (Q1847377) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- Polygon simplification by minimizing convex corners (Q2272403) (← links)
- Algorithms for optimal area triangulations of a convex polygon (Q2432732) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- (Q2753927) (← links)
- (Q3000094) (← links)
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM (Q3442762) (← links)
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions (Q3557005) (← links)
- Decomposing a Polygon into Simpler Components (Q3694719) (← links)
- Domination in permutation graphs (Q3731637) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- (Q3802644) (← links)
- (Q3983251) (← links)
- Efficient Algorithms for the Capacitated 1-Median Problem (Q4024313) (← links)
- (Q4028874) (← links)
- (Q4259288) (← links)
- Covering Orthogonal Polygons with Non-Piercing Rectangles (Q4365028) (← links)
- Computing Visibility Information in an Inaccurate Simple Polygon (Q4375868) (← links)
- (Q4945512) (← links)
- Boundary Labeling for Rectangular Diagrams (Q5116476) (← links)
- Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks (Q5505328) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
- Finding a maximum clique in a disk graph (Q6620520) (← links)
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)
