Walid Ben-Ameur

	2012
33		Walid Ben-Ameur, Mohamed Didi Biha: On the minimum cut separator problem. Networks 59(1): 30-36 (2012)
	2011
32		Pierre Bauguion, Walid Ben-Ameur, Éric Gourdin: Cache Location in Tree Networks: Preliminary Results. INOC 2011: 517-522
31		Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache: Virtual network provisioning across multiple substrate networks. Computer Networks 55(4): 1011-1023 (2011)
30		Walid Ben-Ameur, José Neto: A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discrete Applied Mathematics 159(16): 1689-1698 (2011)
	2010
29		Walid Ben-Ameur, Pablo Pavón Mariño, Michal Pióro: On Traffic Domination in Communication Networks. PERFORM 2010: 191-202
28		Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro: Failure disjoint paths. Electronic Notes in Discrete Mathematics 36: 1105-1112 (2010)
27		Walid Ben-Ameur, Mateusz Zotkiewicz: Polynomial traffic demand polytope partitioning. Electronic Notes in Discrete Mathematics 36: 1113-1120 (2010)
26		Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou: Networks with unicyclic connected components and without short cycles. Electronic Notes in Discrete Mathematics 36: 961-968 (2010)
25		Walid Ben-Ameur, Makhlouf Hadji: Steiner Networks with unicyclic connected components. Electronic Notes in Discrete Mathematics 36: 969-976 (2010)
24		Walid Ben-Ameur, Mohamed Didi Biha: Algorithms and formulations for the minimum cut separator problem. Electronic Notes in Discrete Mathematics 36: 977-983 (2010)
23		Walid Ben-Ameur, José Neto: Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. European Journal of Operational Research 207(1): 15-24 (2010)
22		Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro: Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. IEEE Communications Letters 14(8): 776-778 (2010)
21		Walid Ben-Ameur, Makhlouf Hadji: Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. SIAM J. Discrete Math. 24(4): 1541-1557 (2010)
	2009
20		Walid Ben-Ameur, José Neto: A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. CTW 2009: 105-108
19		Mateusz Zotkiewicz, Walid Ben-Ameur: More Adaptive Robust Stable Routing. GLOBECOM 2009: 1-6
	2008
18		Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi: A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. ICN 2008: 692-697
17		Walid Ben-Ameur, José Neto: A geometric characterization of "optimality-equivalent" relaxations. J. Global Optimization 42(4): 533-547 (2008)
16		Walid Ben-Ameur, José Neto: Spectral bounds for the maximum cut problem. Networks 52(1): 8-13 (2008)
	2007
15		Walid Ben-Ameur, José Neto: Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1): 3-17 (2007)
14		Walid Ben-Ameur, Luis Gouveia: Preface. Networks 50(1): 1-2 (2007)
13		Meriema Belaidouni, Walid Ben-Ameur: On the minimum cost multiple-source unsplittable flow problem. RAIRO - Operations Research 41(3): 253-273 (2007)
	2006
12		Walid Ben-Ameur: On the Maximum Cut Problem. ACiD 2006: 154
11		Walid Ben-Ameur, Adam Ouorou: Mathematical Models of the Delay Constrained Routing Problem. Algorithmic Operations Research 1(2): (2006)
10		Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee: Foreword. Annals OR 146(1): 1-2 (2006)
9		Walid Ben-Ameur: New bounds for the maximum cut problem. Electronic Notes in Discrete Mathematics 27: 5 (2006)
8		Walid Ben-Ameur, José Neto: A constraint generation algorithm for large scale linear programs using multiple-points separation. Math. Program. 107(3): 517-537 (2006)
7		Walid Ben-Ameur, Luis Gouveia: Further contributions to network optimization. Networks 48(1): 1-6 (2006)
	2004
6		Walid Ben-Ameur, Luis Gouveia: Some recent contributions to network optimization. Networks 44(1): 27-30 (2004)
	2003
5		Walid Ben-Ameur, Hervé Kerivin: Networks new economical virtual private. Commun. ACM 46(6): 69-73 (2003)
4		Walid Ben-Ameur, Éric Gourdin: Internet Routing and Related Topology Issues. SIAM J. Discrete Math. 17(1): 18-49 (2003)
	2002
3		Walid Ben-Ameur: Multi-hour design of survivable classical IP networks. Int. J. Communication Systems 15(6): 553-572 (2002)
	2001
2		Walid Ben-Ameur, B. Liau: Calcul des métriques de routage pour Internet. Annales des Télécommunications 56(3-4): 150-168 (2001)
	2000
1		Walid Ben-Ameur: Constrained length connectivity and survivable networks. Networks 36(1): 17-33 (2000)

Coauthor Index

1	Hossam Afifi	[18]
2	Pierre Bauguion	[32]
3	Meriema Belaidouni	[13]
4	Daniel Bienstock	[10]
5	Mohamed Didi Biha	[24] [33]
6	Mohamed Chedly Ghedira	[18]
7	Éric Gourdin	[4] [32]
8	Luís Gouveia (Luis Gouveia)	[6] [7] [14]
9	Makhlouf Hadji	[21] [25] [26]
10	Ines Houidi	[31]
11	Hervé Kerivin	[5]
12	B. Liau	[2]
13	Wajdi Louati	[31]
14	Pablo Pavón Mariño	[29]
15	José Neto	[8] [15] [16] [17] [20] [23] [30]
16	Adam Ouorou	[11] [26]
17	Michal Pióro	[22] [28] [29]
18	Iraj Saniee	[10]
19	Djamal Zeghlache	[31]
20	Mateusz Zotkiewicz	[19] [22] [27] [28]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page