The following pages link to Javier Tejel (Q1367694):
Displaying 37 items.
- (Q282734) (redirect page) (← links)
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599) (← links)
- On the minimum size of visibility graphs (Q1603508) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- Colored ray configurations (Q1699300) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- The order of points on the second convex hull of a simple polygon (Q1895970) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Total domination in plane triangulations (Q2219969) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Compatible spanning trees (Q2444309) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Moving coins (Q2489547) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- A lower bound for the number of polygonizations of \(N\) points in the plane (Q2713599) (← links)
- Packing trees into planar graphs (Q3150194) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
- (Q4405923) (← links)
- A note on the traveling repairman problem (Q4785216) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- $K_{1,3}$-covering red and blue points in the plane (Q5377228) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901263) (← links)
- Empty Triangles in Generalized Twisted Drawings of $K_n$ (Q6141790) (← links)
- Twisted ways to find plane structures in simple drawings of complete graphs (Q6145668) (← links)
- Twisted ways to find plane structures in simple drawings of complete graphs (Q6539522) (← links)
