364 results on '"Emo Welzl"'
Search Results
2. Deep Cliques in Point Sets.
3. On Connectivity in Random Graph Models with Limited Dependencies.
4. Convex Hulls of Random Order Types.
5. Connectivity of Triangulation Flip Graphs in the Plane.
6. Clustering Under Perturbation Stability in Near-Linear Time.
7. An Optimal Decentralized (Δ + 1)-Coloring Algorithm.
8. Convex Hulls of Random Order Types.
9. Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
10. Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).
11. Lower bounds for searching robots, some faulty.
12. Minimal Representations of Order Types by Geometric Graphs.
13. From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
14. Minimal Representations of Order Types by Geometric Graphs.
15. Solving and Sampling with Many Solutions.
16. Lower Bounds for Searching Robots, some Faulty.
17. Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
18. From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
19. Order on Order Types.
20. Connectivity of Triangulation Flip Graphs in the Plane.
21. An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm.
22. Packing plane spanning trees and paths in complete geometric graphs.
23. Order on Order Types.
24. Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique.
25. On the Number of Upward Planar Orientations of Maximal Planar Graphs.
26. Counting Plane Graphs with Exponential Speed-Up.
27. Counting Plane Graphs: Flippability and Its Applications.
28. From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
29. On degrees in random triangulations of point sets.
30. The Lovász Local Lemma and Satisfiability.
31. Capacity of Arbitrary Wireless Networks.
32. Catching elephants with mice: sparse sampling for monitoring sensor networks.
33. Random triangulations of planar point sets.
34. The Number of Triangulations on Planar Point Sets.
35. On the number of crossing-free matchings, (cycles, and partitions).
36. Interference in Cellular Networks: The Minimum Membership Set Cover Problem.
37. Online conflict-free coloring for intervals.
38. Off-line Admission Control for Advance Reservations in Star Networks.
39. Algorithms for center and Tverberg points.
40. On the number of upward planar orientations of maximal planar graphs.
41. Lower Bounds for Searching Robots, some Faulty.
42. Translating a Planar Object to Maximize Point Containment.
43. Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem.
44. Point-line incidences in space.
45. Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
46. Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
47. Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique.
48. On the number of crossing-free partitions.
49. Unique Sink Orientations of Cubes.
50. One line and n points.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.