Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ionut D. Aron
2010 – today
- 2013
[i1]Ionut D. Aron, Pascal Van Hentenryck: A constraint satisfaction approach to the robust spanning tree problem with interval data. CoRR abs/1301.0552 (2013)- 2010
- [j3]Tallys H. Yunes, Ionut D. Aron, John N. Hooker: An Integrated Solver for Optimization Problems. Operations Research 58(2): 342-356 (2010)
2000 – 2009
- 2006
- [c5]Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann: A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. CPAIOR 2006: 16-28
- 2004
- [j2]Ionut D. Aron, Pascal Van Hentenryck: On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32(1): 36-40 (2004)
- [c4]Ionut D. Aron, John N. Hooker, Tallys H. Yunes: SIMPL: A System for Integrating Optimization Techniques. CPAIOR 2004: 21-36
- 2002
- [c3]Ionut D. Aron, Pascal Van Hentenryck: A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data. UAI 2002: 18-25
- 2001
- [j1]Ionut D. Aron, Sandeep K. S. Gupta: On the Scalability of On-Demand Routing Protocols for Mobile ad hoc Networks: An Analytical Study. Journal of Interconnection Networks 2(1): 5-29 (2001)
- 2000
- [c2]Ionut D. Aron, Sandeep K. S. Gupta: Analytical comparison of local and end-to-end error recovery in reactive routing protocols for mobile ad hoc networks. MSWiM 2000: 69-76
1990 – 1999
- 1999
- [c1]Ionut D. Aron, Sandeep K. S. Gupta: A Witness-Aided Routing Protocol for Mobile Ad-Hoc Networks with Unidirectional Links. MDA 1999: 24-33
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-02 19:55 CET by the dblp team