The following pages link to Sundar Vishwanathan (Q879398):
Displaying 38 items.
- Some results in square-free and strong square-free edge-colorings of graphs (Q879399) (← links)
- Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- Multilinear polynomials and a conjecture of Frankl and Füredi (Q1284481) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)
- A counting proof of the Graham-Pollak theorem (Q1942667) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- The common prefix problem on trees (Q2380083) (← links)
- Bipartite coverings and the chromatic number (Q2380224) (← links)
- Maximum matching on trees in the online preemptive and the incremental dynamic graph models (Q2412432) (← links)
- A polynomial space proof of the Graham-Pollak theorem (Q2427560) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
- Approximation Algorithms for the Achromatic Number (Q2775897) (← links)
- Randomized Memoryless Algorithms for the Weighted and the Generalized <i>k</i> -server Problems (Q3384661) (← links)
- A bound on the chromatic number using the longest odd cycle length (Q3437002) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems (Q3459854) (← links)
- Matched-Factor <i>d</i>-Domatic Coloring of Graphs (Q3544253) (← links)
- Randomized online graph coloring (Q4015271) (← links)
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137) (← links)
- Constructing Reliable Communication Networks of Small Weight Online (Q4327817) (← links)
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem (Q4472443) (← links)
- An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883) (← links)
- (Q4875162) (← links)
- Metrical Service Systems with Multiple Servers (Q4925264) (← links)
- (Q4952685) (← links)
- On hard instances of approximate vertex cover (Q4962765) (← links)
- Locality based graph coloring (Q5248487) (← links)
- (Q5275362) (← links)
- (Q5501834) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- WITHDRAWN: On the Mod-6 Town Rules (Q6519556) (← links)
