The following pages link to Telikepalli Kavitha (Q270029):
Displaying 50 items.
- Fair matchings and related problems (Q270032) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Popular mixed matchings (Q541674) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- (Q699766) (redirect page) (← links)
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Optimal popular matchings (Q967372) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Popular matchings of desired size (Q1627184) (← links)
- New pairwise spanners (Q1693988) (← links)
- Popular edges and dominant matchings (Q1800997) (← links)
- Popular matchings in the stable marriage problem (Q1951580) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- Dynamic matrix rank with partial lookahead (Q2254496) (← links)
- Two problems in max-size popular matchings (Q2415362) (← links)
- Upper neighbours of Čech closure operators (Q2424305) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- The carvingwidth of hypercubes (Q2509307) (← links)
- Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
- Algorithms to compute minimum cycle basis in directed graphs (Q2643144) (← links)
- Popular matchings in complete graphs (Q2663715) (← links)
- (Q2921697) (← links)
- (Q2921727) (← links)
- (Q2934590) (← links)
- Rank-maximal matchings (Q2944532) (← links)
- Strongly stable matchings in time <i>O</i> ( <i>nm</i> ) and extension to the hospitals-residents problem (Q2944552) (← links)
- New Pairwise Spanners (Q2955020) (← links)
- Group of closure isomorphisms of Cech closure spaces (Q2956784) (← links)
- On Pairwise Spanners (Q2957885) (← links)
- Fair Matchings and Related Problems (Q2963925) (← links)
- Popular Matchings in the Stable Marriage Problem (Q3012841) (← links)
- Isoperimetric Inequalities and the Width Parameters of Graphs (Q3082945) (← links)
- Near-Popular Matchings in the Roommates Problem (Q3092226) (← links)
- Dynamic matrix rank with partial lookahead (Q3165965) (← links)
- Additive spanners and (α, β)-spanners (Q3188987) (← links)
- Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance (Q3189043) (← links)
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs (Q3395038) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q3448799) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Bounded Unpopularity Matchings (Q3512453) (← links)
- On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
