Publications August 3, 2015 Books, Monographs and Book Chapters 1. I. Necoara, A. Patrascu and A. Nedi´c, “Complexity certifications of first order inexact Lagrangian methods for general convex programming: applicati

Source URL: www.ifp.illinois.edu

On the Complexity of Selecting Disjunctions in Integer Programming Ashutosh Mahajan∗ Ted Ralphs

Source URL: coral.ie.lehigh.edu

Save 37% off Functional Programming in C++ with code fcccukic at manning.com. Functional Design for Concurrent Systems by Ivan Čukić The biggest problem in software development is handling complexity. Software systems

Source URL: cukic.co

The Ellipsoid Method: A Survey

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Mathematical optimization
• Operations research
• Computational complexity theory
• Linear programming
• Convex optimization
• Complexity classes
• Combinatorial optimization
• Ellipsoid method
• Leonid Khachiyan
• Simplex algorithm
• Ellipsoid

Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3

Source URL: cgi.csc.liv.ac.uk

• Computational complexity theory
• Mathematics
• Dynamic programming
• Theory of computation
• IP
• Longest common subsequence problem

CSE 181 Project guidelines

Source URL: www.cs.bilkent.edu.tr

• Computer programming
• Mathematics
• Applied mathematics
• Theoretical computer science
• Sorting algorithms
• Operations research
• Analysis of algorithms
• Merge sort
• Divide and conquer algorithms
• Algorithm
• Recursion
• Time complexity

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

LNCSEfficient Dynamic Aggregation

Source URL: webee.technion.ac.il

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Network theory
• Shortest path problem
• Minimum spanning tree
• Network flow
• Dynamic programming

Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c

Source URL: somchaya.org

• Graph theory
• Mathematics
• Computational complexity theory
• Combinatorial optimization
• Matching
• Assignment problem
• Linear programming
• Multi-agent system
• Shortest path problem

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Source URL: theory.stanford.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Clique problem
• Linear programming
• P
• Algorithm
• Time complexity
• Optimization problem
• Book:Graph Theory
• P versus NP problem