Andrew Lomonosov

According to our database, Andrew Lomonosov authored at least 7 papers between 1997 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2007

Stability, Optimality and Complexity of Network Games with Pricing and Player Dropouts.

Andrew Lomonosov, Meera Sitharam

Scalable Comput. Pract. Exp., 2007

2004

Network QoS games: stability vs optimality tradeoff.

Andrew Lomonosov, Meera Sitharam, Kihong Park

J. Comput. Syst. Sci., 2004

2003

Stability vs. Optimality Tradeoff in Game Theoretic Mechanisms for QoS Provision.

Andrew Lomonosov, Meera Sitharam, Kihong Park

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

2001

Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms.

Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam

J. Symb. Comput., 2001

Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD.

Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam

J. Symb. Comput., 2001

1999

Planning Geometric Constraint Decomposition via Optimal Graph Transformations.

Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

1997

Finding Solvable Subsets of Constraint Graphs.

Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997