The following pages link to David Rappaport (Q170487):
Displaying 50 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- (Q714900) (redirect page) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- A decision algorithm for reversible pairs of polygons (Q741530) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder (Q1099952) (← links)
- Optimality criteria for controlled discontinuous processes (Q1147988) (← links)
- A convex hull algorithm for discs, and applications (Q1188286) (← links)
- Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019) (← links)
- Identification and characterization of multiphase transport systems by a finite set of moments (Q1228312) (← links)
- Tracer identifiability of multiphase transport systems (Q1230469) (← links)
- Stochastic control of system with unobserved jump parameter process (Q1249553) (← links)
- Analysis and tracer identification of multiphase transport systems with recycling (Q1257444) (← links)
- Moldable and castable polygons (Q1334613) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- Establishing strong connectivity using optimal radius half-disk antennas (Q1931278) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- Maximal area sets and harmony (Q2373433) (← links)
- State complexity of suffix distance (Q2401012) (← links)
- Relative prefix distance between languages (Q2408810) (← links)
- Encompassing colored planar straight line graphs (Q2456662) (← links)
- Moving coins (Q2489547) (← links)
- Constant directions of the Riccati equation (Q2550709) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- Computing Simple Circuits from a Set of Line Segments is NP-Complete (Q3034824) (← links)
- (Q3138983) (← links)
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
- A simple linear hidden-line algorithm for star-shaped polygons (Q3219151) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- (Q3796752) (← links)
- (Q3974694) (← links)
- (Q4028875) (← links)
- On Convergence for Spatially Inhomogeneous Multiphase Transport Systems (Q4069586) (← links)
- The complexity of computing minimum separating polygons (Q4274652) (← links)
- Algorithms for Cluster Busting in Anchored Graph Drawing (Q4386509) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- (Q4547800) (← links)
- (Q4609332) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Quasi-Distances and Weighted Finite Automata (Q4683187) (← links)
