The following pages link to N. S. Narayanaswamy (Q393118):
Displayed 50 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Exact algorithms for allocation problems (Q777301) (← links)
- The connected domination number of grids (Q831725) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- A note on first-fit coloring of interval graphs (Q925259) (← links)
- A new characterization of matrices with the consecutive ones property (Q967442) (← links)
- Facility location on planar graphs with unreliable links (Q1625178) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Minimum membership hitting sets of axis parallel segments (Q1791030) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
- Dynamic data structures for interval coloring (Q2197541) (← links)
- Lazy or eager dynamic matching may not be fast (Q2203578) (← links)
- Data structures for incremental interval coloring (Q2300068) (← links)
- On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- A note on the Hadwiger number of circular arc graphs (Q2379986) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) (← links)
- On the Structure of Contractible Vertex Pairs in Chordal Graphs (Q2839231) (← links)
- A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (Q2841986) (← links)
- FPT Algorithms for Consecutive Ones Submatrix Problems (Q2867091) (← links)
- Generalized Above Guarantee Vertex Cover and r-Partization (Q2889897) (← links)
- (Q2904774) (← links)
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
- Block Sorting Is APX-Hard (Q2947036) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- (Q3011746) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- Approximability of Connected Factors (Q3188871) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
- Connected (s,t)-Vertex Separator Parameterized by Chordality (Q3454522) (← links)
- Solving minones-2-sat as Fast as vertex cover (Q3586112) (← links)
- Sequences Characterizing k-Trees (Q3591347) (← links)
- (Q4551371) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- (Q4608602) (← links)
- Computing and Combinatorics (Q4681172) (← links)
- Computing and Combinatorics (Q4681192) (← links)
- (Q4708587) (← links)
- (Q4736846) (← links)
- Parameterized Algorithms for (r,l)-Partization (Q4910556) (← links)