Metric extension operators, vertex sparsifiers and Lipschitz extendability
- Konstantin Makarychev
- Yury Makarychev
- 2010
- FOCS 2010
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
22 results for Konstantin Makarychev
Serial and parallel methods for I/O efficient suffix tree construction
- Amol Ghoting
- Konstantin Makarychev
- 2009
- SIGMOD/PODS 2009
Integrality gaps for sherali-adams relaxations
- Moses Charikar
- Konstantin Makarychev
- et al.
- 2009
- STOC 2009
Improving Memory Access Locality for Large-Scale Graph Analysis Applications
- Guojing Cong
- Konstantin Makarychev
- 2009
- PDCCS 2009
Online make-to-order joint replenishment model: Primal dual competitive algorithms
- N. Buchbinder
- T. Kimbrel
- et al.
- 2008
- SODA 2008
On the advantage over random for maximum acyclic subgraph
- Moses Charikar
- Konstantin Makarychev
- et al.
- 2007
- FOCS 2007
Local global tradeoffs in metric embeddings
- Moses Charikar
- Konstantin Makarychev
- et al.
- 2007
- FOCS 2007
Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
Concentration inequalities for nonlinear matroid intersection
- Konstantin Makarychev
- Warren Schudy
- et al.
- 2013
- Random Structures and Algorithms
I/O efficient algorithms for serial and parallel suffix tree construction
- Amol Ghoting
- Konstantina Makarychev
- 2010
- ACM TODS