The following pages link to H. Ramesh (Q293203):
Displaying 22 items.
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time (Q876699) (← links)
- The restriction mapping problem revisited. (Q1872722) (← links)
- An algorithm for enumerating all spanning trees of a directed graph (Q1977130) (← links)
- (Q2721994) (← links)
- (Q2754182) (← links)
- Covering rectilinear polygons with axis-parallel rectangles (Q2819577) (← links)
- (Q2969101) (← links)
- On Restricted Bio-Turing Machines (Q3100944) (← links)
- (Q3129926) (← links)
- (Q3140445) (← links)
- (Q4037441) (← links)
- (Q4231921) (← links)
- Derandomizing Approximation Algorithms Based on Semidefinite Programming (Q4268812) (← links)
- Approximate hypergraph coloring (Q4375639) (← links)
- (Q4415265) (← links)
- Covering Rectilinear Polygons with Axis-Parallel Rectangles (Q4441891) (← links)
- (Q4681301) (← links)
- (Q4761354) (← links)
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs (Q4834379) (← links)
- On Traversing Layered Graphs On-Line (Q4837544) (← links)
- On the Power of Bio-Turing Machines (Q5429226) (← links)
