Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantin Makarychev
Person information
- affiliation: Northwestern University, IL, USA
- affiliation (former): Princeton University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j15]Konstantin Makarychev, Miklós Z. Rácz
, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. IEEE Trans. Inf. Theory 68(11): 7454-7470 (2022)- 2019
- [j14]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48(6): 1763-1795 (2019) - 2018
- [j13]Konstantin Makarychev, Maxim Sviridenko:
Solving Optimization Problems with Diseconomies of Scale via Decoupling. J. ACM 65(6): 42:1-42:27 (2018) - 2017
- [j12]Konstantin Makarychev, Maxim Sviridenko:
Maximizing Polynomials Subject to Assignment Constraints. ACM Trans. Algorithms 13(4): 54:1-54:15 (2017) - 2015
- [j11]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. Random Struct. Algorithms 46(3): 541-571 (2015) - 2014
- [j10]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [j9]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. ACM Trans. Algorithms 10(4): 18:1-18:18 (2014) - [j8]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-Boolean Max-k-CSP. Theory Comput. 10: 341-358 (2014) - 2013
- [j7]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222: 93-107 (2013) - [j6]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61(4): 1014-1029 (2013) - 2012
- [j5]Konstantin Makarychev, Yury Makarychev:
Chain Independence and Common Information. IEEE Trans. Inf. Theory 58(8): 5279-5286 (2012) - 2010
- [j4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. SIAM J. Comput. 39(6): 2487-2512 (2010) - [j3]Amol Ghoting, Konstantin Makarychev:
I/O efficient algorithms for serial and parallel suffix tree construction. ACM Trans. Database Syst. 35(4): 25:1-25:37 (2010) - 2009
- [j2]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms 5(3): 32:1-32:14 (2009) - 2002
- [j1]Konstantin Makarychev, Yury Makarychev, Andrei E. Romashchenko, Nikolai K. Vereshchagin:
A new class of non-Shannon-type inequalities for entropies. Commun. Inf. Syst. 2(2): 147-166 (2002)
Conference and Workshop Papers
- 2024
- [c67]Dmitrii Avdiukhin, Vaggos Chatziafratis, Konstantin Makarychev, Grigory Yaroslavtsev:
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams. AAAI 2024: 7926-7934 - [c66]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. SODA 2024: 2236-2274 - 2023
- [c65]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. ESA 2023: 32:1-32:14 - [c64]Vaggos Chatziafratis, Konstantin Makarychev:
Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant. FOCS 2023: 253-284 - [c63]Konstantin Makarychev, Sayak Chakrabarty:
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple! NeurIPS 2023 - [c62]Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. NeurIPS 2023 - 2022
- [c61]Konstantin Makarychev, Liren Shan:
Explainable k-means: don't be greedy, plant bigger trees! STOC 2022: 1629-1642 - 2021
- [c60]Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. SoCG 2021: 13:1-13:14 - [c59]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Local Correlation Clustering with Asymmetric Classification Errors. ICML 2021: 4677-4686 - [c58]Konstantin Makarychev, Liren Shan:
Near-Optimal Algorithms for Explainable k-Medians and k-Means. ICML 2021: 7358-7367 - [c57]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. ISIT 2021: 1949-1954 - 2020
- [c56]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c55]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Correlation Clustering with Asymmetric Classification Errors. ICML 2020: 4641-4650 - [c54]Konstantin Makarychev, Yury Makarychev:
Certified Algorithms: Worst-Case Analysis and Beyond. ITCS 2020: 49:1-49:14 - [c53]Konstantin Makarychev, Aravind Reddy, Liren Shan:
Improved Guarantees for k-means++ and k-means++ Parallel. NeurIPS 2020 - 2019
- [c52]Sanchit Kalhan, Konstantin Makarychev, Timothy Zhou:
Correlation clustering with local objectives. NeurIPS 2019: 9341-9350 - [c51]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. STOC 2019: 1027-1038 - 2018
- [c50]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC 2018: 1088-1101 - 2017
- [c49]Cyrus Rashtchian, Konstantin Makarychev, Miklós Z. Rácz, Siena Ang, Djordje Jevdjic, Sergey Yekhanin, Luis Ceze, Karin Strauss:
Clustering Billions of Reads for DNA Data Storage. NIPS 2017: 3360-3371 - [c48]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA 2017: 340-357 - [c47]Haris Angelidakis, Konstantin Makarychev, Yury Makarychev:
Algorithms for stable and perturbation-resilient problems. STOC 2017: 438-451 - 2016
- [c46]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A Bi-Criteria Approximation Algorithm for k-Means. APPROX-RANDOM 2016: 14:1-14:20 - [c45]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Learning Communities in the Presence of Errors. COLT 2016: 1258-1291 - 2015
- [c44]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Correlation Clustering with Noisy Partial Information. COLT 2015: 1321-1342 - [c43]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. FOCS 2015: 975-993 - [c42]Virajith Jalaparti, Peter Bodík, Ishai Menache, Sriram Rao, Konstantin Makarychev, Matthew Caesar:
Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can. SIGCOMM 2015: 407-420 - [c41]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. STOC 2015: 219-228 - 2014
- [c40]Konstantin Makarychev, Maxim Sviridenko:
Solving Optimization Problems with Diseconomies of Scale via Decoupling. FOCS 2014: 571-580 - [c39]Konstantin Makarychev, Yury Makarychev:
Nonuniform Graph Partitioning with Unrelated Weights. ICALP (1) 2014: 812-822 - [c38]Konstantin Makarychev, Debmalya Panigrahi:
Precedence-Constrained Scheduling of Malleable Jobs with Preemption. ICALP (1) 2014: 823-834 - [c37]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut. SODA 2014: 890-906 - [c36]Anand Louis, Konstantin Makarychev:
Approximation Algorithm for Sparsest k-Partitioning. SODA 2014: 1244-1255 - [c35]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Constant factor approximation for balanced cut in the PIE model. STOC 2014: 41-49 - 2013
- [c34]Geoffrey Zweig, Konstantin Makarychev:
Speed regularization and optimality in word classing. ICASSP 2013: 8237-8241 - [c33]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Sorting noisy data with partial information. ITCS 2013: 515-528 - [c32]Konstantin Makarychev:
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. STACS 2013: 139-147 - 2012
- [c31]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-boolean MAX k-CSP. APPROX-RANDOM 2012: 254-265 - [c30]Guojing Cong, Konstantin Makarychev:
Optimizing Large-scale Graph Analysis on Multithreaded, Multicore Platforms. IPDPS 2012: 414-425 - [c29]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. SODA 2012: 420-436 - [c28]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Approximation algorithms for semi-random partitioning problems. STOC 2012: 367-384 - 2011
- [c27]Philip C. Church, Andrzej Goscinski, Kathryn E. Holt, Michael Inouye, Amol Ghoting, Konstantin Makarychev, Matthias Reumann:
Design of multiple sequence alignment algorithms on parallel, distributed memory supercomputers. EMBC 2011: 924-927 - [c26]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c25]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games. FOCS 2011: 443-452 - [c24]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462 - [c23]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12 - [c22]Konstantin Makarychev, Maxim Sviridenko:
Maximizing Polynomials Subject to Assignment Constraints. ICALP (1) 2011: 510-520 - [c21]Konstantin Makarychev, Alantha Newman:
Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459 - [c20]Guojing Cong, Konstantin Makarychev:
Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform. IPDPS 2011: 688-697 - [c19]Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani:
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. STACS 2011: 332-343 - 2010
- [c18]Konstantin Makarychev, Yury Makarychev:
Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. FOCS 2010: 255-264 - [c17]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) 2010: 594-604 - [c16]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. WAOA 2010: 190-200 - 2009
- [c15]Guojing Cong, Konstantin Makarychev:
Improving Memory Access Locality for Large-Scale Graph Analysis Applications. PDCCS 2009: 121-127 - [c14]Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko:
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216 - [c13]Amol Ghoting, Konstantin Makarychev:
Indexing genomic sequences on the IBM Blue Gene. SC 2009 - [c12]Amol Ghoting, Konstantin Makarychev:
Serial and parallel methods for i/o efficient suffix tree construction. SIGMOD Conference 2009: 827-840 - [c11]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292 - 2008
- [c10]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961 - 2007
- [c9]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. FOCS 2007: 625-633 - [c8]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. FOCS 2007: 713-723 - [c7]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. SODA 2007: 62-68 - [c6]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
A divide and conquer algorithm for d-dimensional arrangement. SODA 2007: 541-546 - 2006
- [c5]Eden Chlamtac, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Using Embeddings. FOCS 2006: 687-696 - [c4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Directed metrics and directed graph partitioning problems. SODA 2006: 51-60 - [c3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for unique games. STOC 2006: 205-214 - 2005
- [c2]Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
Quadratic forms on graphs. STOC 2005: 486-493 - [c1]Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev:
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. STOC 2005: 573-581
Parts in Books or Collections
- 2020
- [p2]Konstantin Makarychev, Yury Makarychev:
Perturbation Resilience. Beyond the Worst-Case Analysis of Algorithms 2020: 95-119 - 2017
- [p1]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithms for CSPs. The Constraint Satisfaction Problem 2017: 287-325
Editorship
- 2020
- [e1]Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, Julia Chuzhoy:
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. ACM 2020, ISBN 978-1-4503-6979-4 [contents]
Reference Works
- 2011
- [r1]Amol Ghoting, Konstantin Makarychev:
Suffix Trees. Encyclopedia of Parallel Computing 2011: 1949-1955
Informal and Other Publications
- 2024
- [i48]Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. CoRR abs/2402.15668 (2024) - [i47]Suprovat Ghoshal, Konstantin Makarychev, Yury Makarychev:
Constraint Satisfaction Problems with Advice. CoRR abs/2403.02212 (2024) - 2023
- [i46]Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. CoRR abs/2304.09113 (2023) - [i45]Sayak Chakrabarty, Konstantin Makarychev:
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple! CoRR abs/2305.13560 (2023) - [i44]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithms for Norm Multiway Cut. CoRR abs/2308.08373 (2023) - [i43]Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan:
Higher-Order Cheeger Inequality for Partitioning with Buffers. CoRR abs/2308.10160 (2023) - 2022
- [i42]Vaggos Chatziafratis, Konstantin Makarychev:
Phylogenetic CSPs are Approximation Resistant. CoRR abs/2212.12765 (2022) - 2021
- [i41]Konstantin Makarychev, Liren Shan:
Near-optimal Algorithms for Explainable k-Medians and k-Means. CoRR abs/2107.00798 (2021) - [i40]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Correlation Clustering with Asymmetric Classification Errors. CoRR abs/2108.05696 (2021) - [i39]Jafar Jafarov, Sanchit Kalhan, Konstantin Makarychev, Yury Makarychev:
Local Correlation Clustering with Asymmetric Classification Errors. CoRR abs/2108.05697 (2021) - [i38]Konstantin Makarychev, Liren Shan:
Explainable k-means. Don't be greedy, plant bigger trees! CoRR abs/2111.03193 (2021) - 2020
- [i37]Konstantin Makarychev, Aravind Reddy, Liren Shan:
Improved Guarantees for k-means++ and k-means++ Parallel. CoRR abs/2010.14487 (2020) - [i36]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. CoRR abs/2011.14532 (2020) - 2019
- [i35]Sanchit Kalhan, Konstantin Makarychev, Timothy Zhou:
Improved algorithms for Correlation Clustering with local objectives. CoRR abs/1902.10829 (2019) - [i34]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - 2018
- [i33]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering. CoRR abs/1811.03195 (2018) - [i32]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR abs/1811.03591 (2018) - 2016
- [i31]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR abs/1607.04787 (2016) - [i30]Konstantin Makarychev, Yury Makarychev:
Metric Perturbation Resilience. CoRR abs/1607.06442 (2016) - 2015
- [i29]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs Above Average. CoRR abs/1503.03851 (2015) - [i28]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A bi-criteria approximation algorithm for k Means. CoRR abs/1507.04227 (2015) - [i27]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Learning Communities in the Presence of Errors. CoRR abs/1511.03229 (2015) - 2014
- [i26]Konstantin Makarychev, Yury Makarychev:
Nonuniform Graph Partitioning with Unrelated Weights. CoRR abs/1401.0699 (2014) - [i25]Nikhil R. Devanur, Konstantin Makarychev, Debmalya Panigrahi, Grigory Yaroslavtsev:
Online Algorithms for Machine Minimization. CoRR abs/1403.0486 (2014) - [i24]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. CoRR abs/1403.7721 (2014) - [i23]Konstantin Makarychev, Maxim Sviridenko:
Optimization Problems with Diseconomies of Scale via Decoupling. CoRR abs/1404.3248 (2014) - [i22]Konstantin Makarychev, Debmalya Panigrahi:
Precedence-constrained Scheduling of Malleable Jobs with Preemption. CoRR abs/1404.6850 (2014) - [i21]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Constant Factor Approximation for Balanced Cut in the PIE model. CoRR abs/1406.5665 (2014) - [i20]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Algorithms for Semi-random Correlation Clustering. CoRR abs/1406.5667 (2014) - [i19]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. CoRR abs/1412.0681 (2014) - 2013
- [i18]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Bilu-Linial Stable Instances of Max Cut. CoRR abs/1305.1681 (2013) - [i17]Anand Louis, Konstantin Makarychev:
Approximation Algorithm for Sparsest k-Partitioning. CoRR abs/1306.4384 (2013) - 2012
- [i16]Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan:
Approximation Algorithms for Semi-random Graph Partitioning Problems. CoRR abs/1205.2234 (2012) - [i15]Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for Non-Boolean MAX k-CSP. CoRR abs/1206.3603 (2012) - [i14]Konstantin Makarychev:
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. CoRR abs/1210.1890 (2012) - 2011
- [i13]Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani:
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data. CoRR abs/1101.1941 (2011) - [i12]Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck constant is strictly smaller than Krivine's bound. CoRR abs/1103.6161 (2011) - [i11]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games against a Semi-Random Adversary. CoRR abs/1104.3806 (2011) - [i10]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [i9]Konstantin Makarychev, Yury Makarychev:
Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. CoRR abs/1006.4607 (2010) - [i8]Arnab Bhattacharyya, Konstantin Makarychev:
Improved Approximation for the Directed Spanner Problem. CoRR abs/1012.4062 (2010) - 2009
- [i7]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. CoRR abs/0903.0367 (2009) - [i6]Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [i5]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for the Max k-CSP Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Note on MAX 2SAT. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i1]Konstantin Makarychev, Yury Makarychev:
Conditionally independent random variables. CoRR abs/cs/0510029 (2005)
Coauthor Index
[j14] [j8] [j5] [j4] [j2] [j1] [c66] [c65] [c60] [c59] [c55] [c54] [c51] [c50] [c48] [c47] [c46] [c45] [c44] [c43] [c39] [c37] [c35] [c33] [c31] [c28] [c25] [c24] [c18] [c16] [c11] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1] [p2] [p1] [e1] [i47] [i44] [i43] [i40] [i39] [i33] [i32] [i31] [i30] [i29] [i28] [i27] [i26] [i21] [i20] [i18] [i16] [i15] [i12] [i11] [i9] [i7] [i6] [i5] [i4] [i3] [i2] [i1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
