![]() |
||
|
EPrints@IIT Delhi >
|
Recent SubmissionsPlanar graph coloring is not self-reducible, assuming P ≠ NP Finding nonfaulty subtrees in faulty binary tree architectures Improved bounds for the max-flow min-multicut ratio for planar and Kr, r-free graphs On-line algorithms for weighted bipartite matching and stable marriages |
||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||