Publication:726107

DOI10.1007/s00224-018-9855-4zbMath1391.68109arXiv1608.04812OpenAlexW2789741548WikidataQ130192250 ScholiaQ130192250MaRDI QIDQ726107

Adrian Dumitrescu, Csaba D. Tóth, Ritankar Mandal

Publication date: 3 August 2018

Published in: Lecture Notes in Computer Science, Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.04812

zbMATH Keywords

triangulationmonotone pathcounting algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Convex Polygons in Geometric Triangulations

Cites Work

• Counting carambolas
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• A counterexample to the Hirsch conjecture
• Counting triangulations of planar point sets
• Upper bounds for the diameter and height of graphs of convex polyhedra
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• Random edge can be exponential on abstract cubes
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• Monotone Paths in Planar Convex Subdivisions and Polytopes
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Convex Polygons in Geometric Triangulations
• Towards an implementation of the 3D visibility skeleton
• On the Number of Cycles in Planar Graphs
• The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
• Crossing-Free Subgraphs
• The Simplex Algorithm in Dimension Three
• How Many Potatoes Are in a Mesh?
• An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
• Number of Crossing-Free Geometric Graphs vs. Triangulations
• Convex Polygons in Geometric Triangulations
• Counting Plane Graphs: Cross-Graph Charging Schemes
• On Simplex Pivoting Rules and Complexity Theory
• Two New Bounds for the Random‐Edge Simplex‐Algorithm
• Paths on Polyhedra. I
• Unnamed Item