Aleksandar Pekec

According to our database1, Aleksandar Pekec authored at least 10 papers between 1996 and 2004.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Listen to Your Neighbors: How (Not) to Reach a Consensus.
SIAM J. Discret. Math., 2004

2003
Combinatorial Auction Design.
Manag. Sci., 2003

2002
Subset Comparisons for Additive Linear Orders.
Math. Oper. Res., 2002

2001
The role assignment model nearly fits most social networks.
Math. Soc. Sci., 2001

Meaningful and meaningless solutions for cooperative n-person games.
Eur. J. Oper. Res., 2001

Majority Consensus and the Local Majority Rule.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Optimal Orientations of Annular Networks.
J. Interconnect. Networks, 2000

1998
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
Oper. Res., 1998

1997
Optimization under ordinal scales: When is a greedy solution optimal?
Math. Methods Oper. Res., 1997

1996
A Winning Strategy for the Ramsey Graph Game.
Comb. Probab. Comput., 1996


  Loading...