Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Sandeep Satheesh
Layered Graphs: A Class That Admits Polynomial Time Solutions for Some Hard Problems
Related publications
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Some Explicit Solutions for a Class of One-Phase Stefan Problems
Connected Domination Polynomial of Some Graphs
IOSR Journal of Mathematics
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Mathematics
Computer Science
Polynomial Time Uniform Word Problems
Mathematical Logic Quarterly
Logic
A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-Criteria Optimization
Polynomial Algorithms for Perfect Graphs
North-Holland Mathematics Studies
