|
Search the dblp DataBase
Nicolás E. Stier Moses:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses
Network Games with Atomic Players. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:525-536 [Conf]
- José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. [Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:59-73 [Conf]
- José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
On the Inefficiency of Equilibria in Congestion Games. [Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:167-181 [Conf]
- José Incera, Gerardo Rubino, Nicolás E. Stier Moses
On the application of accelerating simulation methods in network analysis. [Citation Graph (0, 0)][DBLP] PDPTA, 2000, pp:- [Conf]
- Andreas S. Schulz, Nicolás E. Stier Moses
On the performance of user equilibria in traffic networks. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:86-87 [Conf]
- José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses
A note on the precedence-constrained class sequencing problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:3, pp:257-259 [Journal]
- José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
Selfish Routing in Capacitated Networks. [Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2004, v:29, n:4, pp:961-976 [Journal]
- Andreas S. Schulz, Nicolás E. Stier Moses
Efficiency and fairness of system-optimal routing with user constraints. [Citation Graph (0, 0)][DBLP] Networks, 2006, v:48, n:4, pp:223-234 [Journal]
- Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. [Citation Graph (0, 0)][DBLP] Telecommunication Systems, 2003, v:24, n:2-4, pp:123-138 [Journal]
- Fernando Ordóñez, Nicolás E. Stier Moses
Robust Wardrop Equilibrium. [Citation Graph (0, 0)][DBLP] NET-COOP, 2007, pp:247-256 [Conf]
Search in 0.018secs, Finished in 0.019secs
|