Algorithms for Total Weighted Completion Time Scheduling. - Ivan D. Baev; Waleed Meleis; Alexandre E. Eichenberger (SODA, 1999)

Efficient Backtracking Instruction Schedulers. - Santosh G. Abraham; Waleed Meleis; Ivan D. Baev (IEEE PACT, 2000)

Approximation algorithms for data placement in arbitrary networks. - Ivan D. Baev; Rajmohan Rajaraman (SODA, 2001)

Scheduling Superblocks with Bound-Based Branch Trade-Offs. - Waleed Meleis; Alexandre E. Eichenberger; Ivan D. Baev (IEEE Trans. Computers, 2001)

An Experimental Study of Algorithms for Weighted Completion Time Scheduling. - Ivan D. Baev; Waleed Meleis; Alexandre E. Eichenberger (Algorithmica, 2002)

Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots. - Ivan D. Baev; Waleed Meleis; Santosh G. Abraham (Int. J. Parallel Program., 2002)

Lower bounds on precedence-constrained scheduling for parallel processors. - Ivan D. Baev; Waleed Meleis; Alexandre E. Eichenberger (Inf. Process. Lett., 2002)

Prematerialization: reducing register pressure for free. - Ivan D. Baev; Richard E. Hank; David H. Gross (PACT, 2006)

Approximation Algorithms for Data Placement Problems. - Ivan D. Baev; Rajmohan Rajaraman; Chaitanya Swamy (SIAM J. Comput., 2008)

Techniques for Region-Based Register Allocation. - Ivan D. Baev (CGO, 2009)