Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Sanjeev Khanna
Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems
Network Design for Vertex Connectivity
Approximation Schemes for Preemptive Weighted Flow Time
‹
1
2
Related publications
Flow-Cut Gaps and Face Covers in Planar Graphs
Approximation Algorithms and Hardness of Thek-Route Cut Problem
ACM Transactions on Algorithms
Mathematics
Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
To Cut or Not to Cut …
British Journal of General Practice
Medicine
Family Practice
Commentary: Measure Twice, Cut as Directed. Transit-Time Flow Measurement and High Frequency Ultrasound Guided Surgical Revision
Journal of Thoracic and Cardiovascular Surgery
Respiratory Medicine
Pulmonary
Cardiovascular Medicine
Surgery
Cardiology
Optimization of Hot Melt Extrusion Parameters for Sphericity and Hardness of Polymeric Face-Cut Pellets
Drug Development and Industrial Pharmacy
Organic Chemistry
Drug Discovery
Pharmacology
Pharmaceutical Science
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms
Improving the Smoothed Complexity of FLIP for Max Cut Problems
Cut-And-Paste Knowledge
Nature
Multidisciplinary
