Search results for: Maxim Sviridenko
Journal of Scheduling > 2018 > 21 > 1 > 35-51
Lecture Notes in Computer Science > Automata, Languages and Programming > Session A11: Hardness of Approximation > 510-520
Lecture Notes in Computer Science > Integer Programming and Combinatorial Optimization > Session 4 > 154-168
Lecture Notes in Computer Science > Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques > Session Approx 3 > 177-188
Lecture Notes in Computer Science > Computer Science - Theory and Applications > Accepted Papers > 38-46
Lecture Notes in Computer Science > Algorithms – ESA 2007 > Contributed Papers: Design and Analysis Track > 475-486
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of APPROX > 188-199
Lecture Notes in Computer Science > Automata, Languages and Programming > Session 10-Track A1. Approximations > 594-604
Lecture Notes in Computer Science > Integer Programming and Combinatorial Optimization > Session 8 > 359-373
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of APPROX > 244-257
Lecture Notes in Computer Science > Experimental and Efficient Algorithms > Contributed Regular Papers > 391-402
Lecture Notes in Computer Science > Computer Science - Theory and Applications > Accepted Papers > 227-236
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of APPROX > 202-216
Lecture Notes in Computer Science > Approximation Algorithms for Combinatorial Optimization > Contributed Talks > 34-41
Lecture Notes in Computer Science > Algorithm Theory — SWAT 2002 > Approximation Algorithms > 280-287
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of APPROX > 140-151