<?xml version="1.0"?>
<dblpperson name="Anis Gharbi" pid="94/6486" n="29">
<person key="homepages/94/6486" mdate="2009-06-10">
<author pid="94/6486">Anis Gharbi</author>
</person>
<r><article key="journals/entropy/AlbaqamiMGS25" mdate="2026-01-04">
<author orcid="0009-0003-1380-3179" pid="422/1154">Hissah Albaqami</author>
<author pid="25/3452">Mehdi Mrad</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0002-2677-0236" pid="33/3416">Munevver Mine Subasi</author>
<title>A Monte Carlo-Based Framework for Two-Stage Stochastic Programming: Application to Bond Portfolio Optimization.</title>
<pages>1118</pages>
<year>2025</year>
<volume>27</volume>
<journal>Entropy</journal>
<number>11</number>
<ee type="oa">https://doi.org/10.3390/e27111118</ee>
<url>db/journals/entropy/entropy27.html#AlbaqamiMGS25</url>
<stream>streams/journals/entropy</stream>
</article>
</r>
<r><article key="journals/symmetry/BamatrafG25" mdate="2026-02-06">
<author orcid="0000-0001-8149-3975" pid="237/7922">Khaled Bamatraf</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<title>Arc Flow Formulation for Efficient Uniform Parallel Machine Scheduling.</title>
<pages>1839</pages>
<year>2025</year>
<volume>17</volume>
<journal>Symmetry</journal>
<number>11</number>
<ee type="oa">https://doi.org/10.3390/sym17111839</ee>
<url>db/journals/symmetry/symmetry17.html#BamatrafG25</url>
<stream>streams/journals/symmetry</stream>
</article>
</r>
<r><article key="journals/access/AmmarGB24" mdate="2024-08-02">
<author orcid="0009-0006-2003-2407" pid="381/2619">Roua Ben Ammar</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<author pid="19/8018">Mohamed Zied Babai</author>
<title>Soccer Match Algorithm for Global Optimization: A Contender Metaheuristic.</title>
<pages>93924-93945</pages>
<year>2024</year>
<volume>12</volume>
<journal>IEEE Access</journal>
<ee type="oa">https://doi.org/10.1109/ACCESS.2024.3424791</ee>
<url>db/journals/access/access12.html#AmmarGB24</url>
<stream>streams/journals/access</stream>
</article>
</r>
<r><article key="journals/systems/BamatrafG24" mdate="2024-07-19">
<author orcid="0000-0001-8149-3975" pid="237/7922">Khaled Bamatraf</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<title>Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling.</title>
<pages>221</pages>
<year>2024</year>
<volume>12</volume>
<journal>Syst.</journal>
<number>6</number>
<ee type="oa">https://doi.org/10.3390/systems12060221</ee>
<url>db/journals/systems/systems12.html#BamatrafG24</url>
</article>
</r>
<r><article key="journals/tnsm/SuryahatmajaMAYG23" mdate="2024-01-13">
<author orcid="0000-0001-9655-6553" pid="217/4774">Umar S. Suryahatmaja</author>
<author orcid="0000-0002-9482-5913" pid="25/3452">Mehdi Mrad</author>
<author pid="56/4513">Mohamed Naceur Azaiez</author>
<author pid="193/7057">Asma Ben Yaghlane</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<title>The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources.</title>
<pages>5141-5154</pages>
<year>2023</year>
<month>December</month>
<volume>20</volume>
<journal>IEEE Trans. Netw. Serv. Manag.</journal>
<number>4</number>
<ee>https://doi.org/10.1109/TNSM.2023.3282709</ee>
<url>db/journals/tnsm/tnsm20.html#SuryahatmajaMAYG23</url>
</article>
</r>
<r><article key="journals/candie/AzaiezGKMM22" mdate="2023-09-30">
<author orcid="0000-0002-0311-2054" pid="56/4513">Mohamed Naceur Azaiez</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0001-6649-7257" pid="38/84">Imed Kacem</author>
<author orcid="0000-0002-0521-4329" pid="230/5146">Yosra Makhlouf</author>
<author pid="123/3632">Malek Masmoudi</author>
<title>Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling.</title>
<pages>108040</pages>
<year>2022</year>
<volume>168</volume>
<journal>Comput. Ind. Eng.</journal>
<ee>https://doi.org/10.1016/j.cie.2022.108040</ee>
<url>db/journals/candie/candie168.html#AzaiezGKMM22</url>
</article>
</r>
<r><inproceedings key="conf/icnsc/AzaiezGKMM21" mdate="2023-09-30">
<author orcid="0000-0002-0311-2054" pid="56/4513">Mohamed Naceur Azaiez</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0001-6649-7257" pid="38/84">Imed Kacem</author>
<author orcid="0000-0002-0521-4329" pid="230/5146">Yosra Makhlouf</author>
<author pid="123/3632">Malek Masmoudi</author>
<title>Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model.</title>
<pages>1-5</pages>
<year>2021</year>
<booktitle>ICNSC</booktitle>
<ee>https://doi.org/10.1109/ICNSC52481.2021.9702162</ee>
<crossref>conf/icnsc/2021</crossref>
<url>db/conf/icnsc/icnsc2021.html#AzaiezGKMM21</url>
</inproceedings>
</r>
<r><article key="journals/access/MradHSG20" mdate="2020-05-04">
<author orcid="0000-0002-9482-5913" pid="25/3452">Mehdi Mrad</author>
<author orcid="0000-0002-8176-0698" pid="202/9421">Olfa Harrabi</author>
<author orcid="0000-0002-5240-7270" pid="68/6678">Jouhaina Chaouachi Siala</author>
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<title>A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem.</title>
<pages>57891-57904</pages>
<year>2020</year>
<volume>8</volume>
<journal>IEEE Access</journal>
<ee type="oa">https://doi.org/10.1109/ACCESS.2020.2973122</ee>
<url>db/journals/access/access8.html#MradHSG20</url>
</article>
</r>
<r><article key="journals/itor/MradCLG19" mdate="2020-07-09">
<author orcid="0000-0002-9482-5913" pid="25/3452">Mehdi Mrad</author>
<author pid="244/6196">Sabrine Chalghoumi</author>
<author pid="42/2035">Talel Ladhari</author>
<author pid="94/6486">Anis Gharbi</author>
<title>Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates.</title>
<pages>2432-2449</pages>
<year>2019</year>
<volume>26</volume>
<journal>Int. Trans. Oper. Res.</journal>
<number>6</number>
<ee>https://doi.org/10.1111/itor.12421</ee>
<url>db/journals/itor/itor26.html#MradCLG19</url>
</article>
</r>
<r><article key="journals/access/LabidiKLGS18" mdate="2025-01-19">
<author orcid="0000-0002-9585-1339" pid="58/8433">Mohamed Labidi</author>
<author pid="12/8725">Anis Kooli</author>
<author pid="42/2035">Talel Ladhari</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0001-9655-6553" pid="217/4774">Umar S. Suryahatmaja</author>
<title>A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints.</title>
<pages>16294-16304</pages>
<year>2018</year>
<volume>6</volume>
<journal>IEEE Access</journal>
<ee type="oa">https://doi.org/10.1109/ACCESS.2018.2815598</ee>
<ee>https://www.wikidata.org/entity/Q130134977</ee>
<url>db/journals/access/access6.html#LabidiKLGS18</url>
</article>
</r>
<r><article key="journals/access/HidriG17" mdate="2018-07-04">
<author orcid="0000-0001-6868-7353" pid="01/5290">Lotfi Hidri</author>
<author pid="94/6486">Anis Gharbi</author>
<title>New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks.</title>
<pages>6121-6133</pages>
<year>2017</year>
<volume>5</volume>
<journal>IEEE Access</journal>
<ee type="oa">https://doi.org/10.1109/ACCESS.2017.2696118</ee>
<url>db/journals/access/access5.html#HidriG17</url>
</article>
</r>
<r><inproceedings key="conf/codit/GharbiLA17" mdate="2017-11-21">
<author pid="94/6486">Anis Gharbi</author>
<author pid="46/3187">Mohamed-Aly Louly</author>
<author pid="56/4513">Mohamed Naceur Azaiez</author>
<title>Physician scheduling using goal programming-an application to a large hospital in Saudi Arabia.</title>
<pages>922-925</pages>
<year>2017</year>
<booktitle>CoDIT</booktitle>
<ee>https://doi.org/10.1109/CoDIT.2017.8102715</ee>
<crossref>conf/codit/2017</crossref>
<url>db/conf/codit/codit2017.html#GharbiLA17</url>
</inproceedings>
</r>
<r><article key="journals/anor/MradGHK16" mdate="2020-08-13">
<author orcid="0000-0002-9482-5913" pid="25/3452">Mehdi Mrad</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<author orcid="0000-0003-1469-7163" pid="62/8018">Mohamed Kharbeche</author>
<title>An optimization-based heuristic for the machine reassignment problem.</title>
<pages>115-132</pages>
<year>2016</year>
<volume>242</volume>
<journal>Ann. Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s10479-015-2002-6</ee>
<url>db/journals/anor/anor242.html#MradGHK16</url>
</article>
</r>
<r><article key="journals/jam/GharbiLL14" mdate="2020-07-16">
<author orcid="0000-0001-5658-7259" pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0002-9585-1339" pid="58/8433">Mohamed Labidi</author>
<author orcid="0000-0002-9134-7629" pid="46/3187">Mohamed-Aly Louly</author>
<title>The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures.</title>
<year>2014</year>
<volume>2014</volume>
<journal>J. Appl. Math.</journal>
<ee type="oa">https://doi.org/10.1155/2014/273567</ee>
<ee>https://www.wikidata.org/entity/Q59050631</ee>
<url>db/journals/jam/jam2014.html#GharbiLL14</url>
<pages>273567:1-273567:14</pages>
</article>
</r>
<r><article key="journals/eor/GharbiLMS13" mdate="2020-02-21">
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0002-5648-1398" pid="42/2035">Talel Ladhari</author>
<author orcid="0000-0003-3060-6970" pid="03/8725">Mohamed Kais Msakni</author>
<author pid="54/8057">Mehdi Serairi</author>
<title>The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.</title>
<pages>69-78</pages>
<year>2013</year>
<volume>231</volume>
<journal>Eur. J. Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/j.ejor.2013.05.031</ee>
<url>db/journals/eor/eor231.html#GharbiLMS13</url>
</article>
</r>
<r><article key="journals/cor/GharbiL10" mdate="2020-02-18">
<author pid="94/6486">Anis Gharbi</author>
<author pid="58/8433">Mohamed Labidi</author>
<title>Jackson's semi-preemptive scheduling on a single machine.</title>
<pages>2082-2088</pages>
<year>2010</year>
<volume>37</volume>
<journal>Comput. Oper. Res.</journal>
<number>12</number>
<ee>https://doi.org/10.1016/j.cor.2010.02.008</ee>
<url>db/journals/cor/cor37.html#GharbiL10</url>
</article>
</r>
<r><article key="journals/endm/GharbiAK10" mdate="2023-09-30">
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0002-0311-2054" pid="56/4513">Mohamed Naceur Azaiez</author>
<author orcid="0000-0003-1469-7163" pid="62/8018">Mohamed Kharbeche</author>
<title>Minimizing Expected Attacking Cost in Networks.</title>
<pages>947-954</pages>
<year>2010</year>
<volume>36</volume>
<journal>Electron. Notes Discret. Math.</journal>
<ee>https://doi.org/10.1016/j.endm.2010.05.120</ee>
<url>db/journals/endm/endm36.html#GharbiAK10</url>
</article>
</r>
<r><article key="journals/endm/GharbiL10" mdate="2020-02-20">
<author pid="94/6486">Anis Gharbi</author>
<author pid="58/8433">Mohamed Labidi</author>
<title>Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem.</title>
<pages>1057-1064</pages>
<year>2010</year>
<volume>36</volume>
<journal>Electron. Notes Discret. Math.</journal>
<ee>https://doi.org/10.1016/j.endm.2010.05.134</ee>
<url>db/journals/endm/endm36.html#GharbiL10</url>
</article>
</r>
<r><article key="journals/endm/GharbiLMS10" mdate="2020-02-20">
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0002-5648-1398" pid="42/2035">Talel Ladhari</author>
<author orcid="0000-0003-3060-6970" pid="03/8725">Mohamed Kais Msakni</author>
<author pid="54/8057">Mehdi Serairi</author>
<title>Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.</title>
<pages>1089-1096</pages>
<year>2010</year>
<volume>36</volume>
<journal>Electron. Notes Discret. Math.</journal>
<ee>https://doi.org/10.1016/j.endm.2010.05.138</ee>
<url>db/journals/endm/endm36.html#GharbiLMS10</url>
</article>
</r>
<r><article key="journals/eor/NodemKG09" mdate="2020-02-21">
<author pid="75/7059">F. I. Dehayem Nodem</author>
<author orcid="0000-0002-2019-3589" pid="08/6598">Jean-Pierre Kenn&#233;</author>
<author pid="94/6486">Anis Gharbi</author>
<title>Hierarchical decision making in production and repair/replacement planning with imperfect repairs under uncertainties.</title>
<pages>173-189</pages>
<year>2009</year>
<volume>198</volume>
<journal>Eur. J. Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/j.ejor.2008.09.001</ee>
<url>db/journals/eor/eor198.html#NodemKG09</url>
</article>
</r>
<r><article key="journals/scheduling/HidriGH08" mdate="2020-04-01">
<author pid="01/5290">Lotfi Hidri</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<title>Energetic reasoning revisited: application to parallel machine scheduling.</title>
<pages>239-252</pages>
<year>2008</year>
<volume>11</volume>
<journal>J. Sched.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s10951-008-0070-z</ee>
<url>db/journals/scheduling/scheduling11.html#HidriGH08</url>
</article>
</r>
<r><article key="journals/cor/GharbiH07" mdate="2020-02-18">
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<title>An approximate decomposition algorithm for scheduling on parallel machines with heads and tails.</title>
<pages>868-883</pages>
<year>2007</year>
<volume>34</volume>
<journal>Comput. Oper. Res.</journal>
<number>3</number>
<ee>https://doi.org/10.1016/j.cor.2005.05.012</ee>
<url>db/journals/cor/cor34.html#GharbiH07</url>
</article>
</r>
<r><article key="journals/eor/KenneGB07" mdate="2020-02-21">
<author orcid="0000-0002-2019-3589" pid="08/6598">Jean-Pierre Kenn&#233;</author>
<author pid="94/6486">Anis Gharbi</author>
<author pid="00/5079">M. Beit</author>
<title>Age-dependent production planning and maintenance strategies in unreliable manufacturing systems with lost sale.</title>
<pages>408-420</pages>
<year>2007</year>
<volume>178</volume>
<journal>Eur. J. Oper. Res.</journal>
<number>2</number>
<ee>https://doi.org/10.1016/j.ejor.2006.01.029</ee>
<url>db/journals/eor/eor178.html#KenneGB07</url>
</article>
</r>
<r><article key="journals/itor/HaouariGJ06" mdate="2020-07-09">
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0003-3462-8739" pid="61/7017">Mahdi Jemmali</author>
<title>Tight bounds for the identical parallel machine scheduling problem.</title>
<pages>529-548</pages>
<year>2006</year>
<volume>13</volume>
<journal>Int. Trans. Oper. Res.</journal>
<number>6</number>
<ee>https://doi.org/10.1111/j.1475-3995.2006.00562.x</ee>
<url>db/journals/itor/itor13.html#HaouariGJ06</url>
</article>
</r>
<r><article key="journals/mmor/HaouariHG06" mdate="2020-03-03">
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<author pid="01/5290">Lotfi Hidri</author>
<author pid="94/6486">Anis Gharbi</author>
<title>Optimal Scheduling of a Two-stage Hybrid Flow Shop.</title>
<pages>107-124</pages>
<year>2006</year>
<volume>64</volume>
<journal>Math. Methods Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00186-006-0066-4</ee>
<url>db/journals/mmor/mmor64.html#HaouariHG06</url>
</article>
</r>
<r><article key="journals/dam/GharbiH05" mdate="2021-02-11">
<author pid="94/6486">Anis Gharbi</author>
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<title>Optimal parallel machines scheduling with availability constraints.</title>
<pages>63-87</pages>
<year>2005</year>
<volume>148</volume>
<journal>Discret. Appl. Math.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1016/j.dam.2004.12.003</ee>
<url>db/journals/dam/dam148.html#GharbiH05</url>
</article>
</r>
<r><article key="journals/disopt/HaouariG05" mdate="2021-02-12">
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<author pid="94/6486">Anis Gharbi</author>
<title>Fast lifting procedures for the bin packing problem.</title>
<pages>201-218</pages>
<year>2005</year>
<volume>2</volume>
<journal>Discret. Optim.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.1016/j.disopt.2005.06.002</ee>
<url>db/journals/disopt/disopt2.html#HaouariG05</url>
</article>
</r>
<r><article key="journals/anor/HaouariG04" mdate="2020-08-13">
<author pid="65/3765">Mohamed Haouari</author>
<author pid="94/6486">Anis Gharbi</author>
<title>Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.</title>
<pages>187-204</pages>
<year>2004</year>
<volume>129</volume>
<journal>Ann. Oper. Res.</journal>
<number>1-4</number>
<ee>https://doi.org/10.1023/B:ANOR.0000030688.31785.40</ee>
<url>db/journals/anor/anor129.html#HaouariG04</url>
</article>
</r>
<r><article key="journals/orl/HaouariG03" mdate="2017-06-08">
<author orcid="0000-0003-0767-8220" pid="65/3765">Mohamed Haouari</author>
<author pid="94/6486">Anis Gharbi</author>
<title>An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.</title>
<pages>49-52</pages>
<year>2003</year>
<volume>31</volume>
<journal>Oper. Res. Lett.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/S0167-6377(02)00177-3</ee>
<url>db/journals/orl/orl31.html#HaouariG03</url>
</article>
</r>
<coauthors n="28" nc="2">
<co c="0"><na f="a/Albaqami:Hissah" pid="422/1154">Hissah Albaqami</na></co>
<co c="0"><na f="a/Ammar:Roua_Ben" pid="381/2619">Roua Ben Ammar</na></co>
<co c="0"><na f="a/Azaiez:Mohamed_Naceur" pid="56/4513">Mohamed Naceur Azaiez</na></co>
<co c="0" n="2"><na f="b/Babai:M=_Zied" pid="19/8018">M. Zied Babai</na><na>Mohamed Zied Babai</na></co>
<co c="0"><na f="b/Bamatraf:Khaled" pid="237/7922">Khaled Bamatraf</na></co>
<co c="1"><na f="b/Beit:M=" pid="00/5079">M. Beit</na></co>
<co c="0"><na f="c/Chalghoumi:Sabrine" pid="244/6196">Sabrine Chalghoumi</na></co>
<co c="0"><na f="h/Haouari:Mohamed" pid="65/3765">Mohamed Haouari</na></co>
<co c="0"><na f="h/Harrabi:Olfa" pid="202/9421">Olfa Harrabi</na></co>
<co c="0"><na f="h/Hidri:Lotfi" pid="01/5290">Lotfi Hidri</na></co>
<co c="0"><na f="j/Jemmali:Mahdi" pid="61/7017">Mahdi Jemmali</na></co>
<co c="0"><na f="k/Kacem:Imed" pid="38/84">Imed Kacem</na></co>
<co c="1"><na f="k/Kenn=eacute=:Jean=Pierre" pid="08/6598">Jean-Pierre Kenn&#233;</na></co>
<co c="0"><na f="k/Kharbeche:Mohamed" pid="62/8018">Mohamed Kharbeche</na></co>
<co c="0"><na f="k/Kooli:Anis" pid="12/8725">Anis Kooli</na></co>
<co c="0"><na f="l/Labidi:Mohamed" pid="58/8433">Mohamed Labidi</na></co>
<co c="0"><na f="l/Ladhari:Talel" pid="42/2035">Talel Ladhari</na></co>
<co c="0" n="2"><na f="l/Louly:Mohamed_Aly_Ould" pid="46/3187">Mohamed Aly Ould Louly</na><na>Mohamed-Aly Louly</na></co>
<co c="0"><na f="m/Makhlouf:Yosra" pid="230/5146">Yosra Makhlouf</na></co>
<co c="0"><na f="m/Masmoudi:Malek" pid="123/3632">Malek Masmoudi</na></co>
<co c="0"><na f="m/Mrad:Mehdi" pid="25/3452">Mehdi Mrad</na></co>
<co c="0"><na f="m/Msakni:Mohamed_Kais" pid="03/8725">Mohamed Kais Msakni</na></co>
<co c="1"><na f="n/Nodem:F=_I=_Dehayem" pid="75/7059">F. I. Dehayem Nodem</na></co>
<co c="0"><na f="s/Serairi:Mehdi" pid="54/8057">Mehdi Serairi</na></co>
<co c="0"><na f="s/Siala:Jouhaina_Chaouachi" pid="68/6678">Jouhaina Chaouachi Siala</na></co>
<co c="0"><na f="s/Subasi:Munevver_Mine" pid="33/3416">Munevver Mine Subasi</na></co>
<co c="0"><na f="s/Suryahatmaja:Umar_S=" pid="217/4774">Umar S. Suryahatmaja</na></co>
<co c="0"><na f="y/Yaghlane:Asma_Ben" pid="193/7057">Asma Ben Yaghlane</na></co>
</coauthors>
</dblpperson>

