The following pages link to Jean Cardinal (Q364845):
Displaying 50 items.
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- Draining a polygon-or-rolling a ball out of a polygon (Q390145) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- On the shelling antimatroids of split graphs (Q510993) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Colorful strips (Q659707) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Juggling with pattern matching (Q864953) (← links)
- Covering partial cubes with zones (Q888589) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Empty region graphs (Q1000919) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Highway hull revisited (Q1037778) (← links)
- Tree-structured multiple description coding (Q1405491) (← links)
- Complexity-constrained tree-structured vector quantizers (Q1603617) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- Designing small keyboards is hard (Q1770399) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- General position subsets and independent hyperplanes in \(d\)-space (Q2397235) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Sorting under partial information (without the ellipsoid algorithm) (Q2439837) (← links)
- Local properties of geometric graphs (Q2456666) (← links)
- Minimum entropy orientations (Q2517793) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles (Q2842144) (← links)
- On Generalized Comparison-Based Sorting Problems (Q2848974) (← links)
- Coloring Planar Homothets and Three-Dimensional Hypergraphs (Q2894459) (← links)
- The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
- Reconstructing Point Set Order Typesfrom Radial Orderings (Q2942609) (← links)
- Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
- Ramsey-type theorems for lines in 3-space (Q2965986) (← links)
- Making triangles colorful (Q2968105) (← links)
