Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/endm/endm41.bht:"
download as .bib file
@article{DBLP:journals/endm/AdasmeALL13,
author = {Pablo Adasme and
Rafael Andrade and
Marc Letournel and
Abdel Lisser},
title = {A polynomial formulation for the stochastic maximum weight forest
problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {29--36},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.072},
doi = {10.1016/J.ENDM.2013.05.072},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AdasmeALL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AfsarL13,
author = {Hasan Murat Afsar and
Nacima Labadie},
title = {Team Orienteering Problem with Decreasing Profits},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {285--293},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.104},
doi = {10.1016/J.ENDM.2013.05.104},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AfsarL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AgraDS13,
author = {Agostinho Agra and
Mahdi Doostmohammadi and
Cid Carvalho de Souza},
title = {Intersecting a simple mixed integer set with a vertex packing set},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {327--334},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.109},
doi = {10.1016/J.ENDM.2013.05.109},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AgraDS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AllaouaBLC13,
author = {Hanane Allaoua and
Sylvie Borne and
Lucas L{\'{e}}tocart and
Roberto Wolfler Calvo},
title = {A matheuristic approach for solving a home health care problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {471--478},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.127},
doi = {10.1016/J.ENDM.2013.05.127},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AllaouaBLC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AmaldiCGI13,
author = {Edoardo Amaldi and
Stefano Coniglio and
Luca Giovanni Gianoli and
Can Umut Ileri},
title = {On single-path network routing subject to max-min fair flow allocation},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {543--550},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.136},
doi = {10.1016/J.ENDM.2013.05.136},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AmaldiCGI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AndradeF13,
author = {Rafael Castro de Andrade and
Adriano Tavares de Freitas},
title = {Disjunctive combinatorial branch in a subgradient tree algorithm for
the {DCMST} problem with VNS-Lagrangian bounds},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {5--12},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.069},
doi = {10.1016/J.ENDM.2013.05.069},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AndradeF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Angel-BelloMA13,
author = {Francisco {\'{A}}ngel{-}Bello and
Iris Mart{\'{\i}}nez{-}Salazar and
Ada M. Alvarez},
title = {Minimizing waiting times in a route design problem with multiple use
of a single vehicle},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {269--276},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.102},
doi = {10.1016/J.ENDM.2013.05.102},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Angel-BelloMA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ArsikS13,
author = {Idil Arsik and
F. Sibel Salman},
title = {Modeling Earthquake Vulnerability of Highway Networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {319--326},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.108},
doi = {10.1016/J.ENDM.2013.05.108},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ArsikS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AssaadBH13,
author = {Mohamad Assaad and
Walid Ben{-}Ameur and
Faiz Hamid},
title = {An Interval Assignment Problem for Resource Optimization in {LTE}
Networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {237--244},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.098},
doi = {10.1016/J.ENDM.2013.05.098},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AssaadBH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BauguionBG13,
author = {Pierre{-}Olivier Bauguion and
Walid Ben{-}Ameur and
{\'{E}}ric Gourdin},
title = {A new model for multicommodity flow problems, and a strongly polynomial
algorithm for single-source Maximum Concurrent Flow},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {311--318},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.107},
doi = {10.1016/J.ENDM.2013.05.107},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BauguionBG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Ben-AmeurZ13,
author = {Walid Ben{-}Ameur and
Mateusz Zotkiewicz},
title = {Multipolar routing: where dynamic and static routing meet},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {61--68},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.076},
doi = {10.1016/J.ENDM.2013.05.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Ben-AmeurZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BenhamicheMPU13,
author = {Amal Benhamiche and
Ali Ridha Mahjoub and
Nancy Perrot and
Eduardo Uchoa},
title = {Capacitated Network Design using Bin-Packing},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {479--486},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.128},
doi = {10.1016/J.ENDM.2013.05.128},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BenhamicheMPU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BleyHR13,
author = {Andreas Bley and
S. Mehdi Hashemi and
Mohsen Rezapour},
title = {{IP} modeling of the survivable hop constrained connected facility
location problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {463--470},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.126},
doi = {10.1016/J.ENDM.2013.05.126},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BleyHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BleyKD13,
author = {Andreas Bley and
Daniel Karch and
Fabio D'Andreagiovanni},
title = {{WDM} Fiber Replacement Scheduling},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {189--196},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.092},
doi = {10.1016/J.ENDM.2013.05.092},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BleyKD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BockS13,
author = {Adrian Bock and
Laura Sanit{\`{a}}},
title = {On the approximability of two capacitated vehicle routing problems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {519--526},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.133},
doi = {10.1016/J.ENDM.2013.05.133},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BockS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BorndorferBSS13,
author = {Ralf Bornd{\"{o}}rfer and
Julia Buwaya and
Guillaume Sagnol and
Elmar Swarat},
title = {Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic
Approach},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {253--260},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.100},
doi = {10.1016/J.ENDM.2013.05.100},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BorndorferBSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BorneMT13,
author = {Sylvie Borne and
Ali Ridha Mahjoub and
Raouia Taktak},
title = {A branch-and-cut algorithm for the Multiple Steiner {TSP} with Order
constraints},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {487--494},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.129},
doi = {10.1016/J.ENDM.2013.05.129},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BorneMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CacchianiG13,
author = {Valentina Cacchiani and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {A heuristic approach for an integrated fleet-assignment, aircraft-routing
and crew-pairing problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {391--398},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.117},
doi = {10.1016/J.ENDM.2013.05.117},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CacchianiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CappaneraS13,
author = {Paola Cappanera and
Maria Grazia Scutell{\`{a}}},
title = {Home Care optimization: impact of pattern generation policies on scheduling
and routing decisions},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {53--60},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.075},
doi = {10.1016/J.ENDM.2013.05.075},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CappaneraS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CastanoRSV13,
author = {Fabi{\'{a}}n Casta{\~{n}}o and
Andr{\'{e}} Rossi and
Marc Sevaux and
Nubia Velasco},
title = {On the use of multiple sinks to extend the lifetime in connected wireless
sensor networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {77--84},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.078},
doi = {10.1016/J.ENDM.2013.05.078},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/CastanoRSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChenP13,
author = {Richard Li{-}Yang Chen and
Cynthia A. Phillips},
title = {k-Edge Failure Resilient Network Design},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {375--382},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.115},
doi = {10.1016/J.ENDM.2013.05.115},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChengLL13,
author = {Jianqiang Cheng and
Abdel Lisser and
Marc Letournel},
title = {Distributionally robust stochastic shortest path problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {511--518},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.132},
doi = {10.1016/J.ENDM.2013.05.132},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChengLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChimaniKM13,
author = {Markus Chimani and
Maria Kandyba and
Maren Martens},
title = {2-InterConnected Facility Location: Specification, Complexity, and
Exact Solutions},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {21--28},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.071},
doi = {10.1016/J.ENDM.2013.05.071},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChimaniKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ConsoliMM13,
author = {Sergio Consoli and
Jos{\'{e}} Andr{\'{e}}s Moreno{-}P{\'{e}}rez and
Nenad Mladenovic},
title = {Intelligent variable neighbourhood search for the minimum labelling
spanning tree problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {399--406},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.118},
doi = {10.1016/J.ENDM.2013.05.118},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ConsoliMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CoppiDR13,
author = {Alberto Coppi and
Paolo Detti and
Jessica Raffaelli},
title = {A planning and routing model for patient transportation in health
care},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {125--132},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.084},
doi = {10.1016/J.ENDM.2013.05.084},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CoppiDR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CornaroC13,
author = {Alessandra Cornaro and
Gian Paolo Clemente},
title = {A New Lower Bound for the Kirchhoff Index using a numerical procedure
based on Majorization Techniques},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {383--390},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.116},
doi = {10.1016/J.ENDM.2013.05.116},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CornaroC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DiarrassoubaKM13,
author = {Ibrahima Diarrassouba and
Hakan Kutucu and
Ali Ridha Mahjoub},
title = {Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and
Polyhedra},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {551--558},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.137},
doi = {10.1016/J.ENDM.2013.05.137},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/DiarrassoubaKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandezLHRW13,
author = {Elena Fern{\'{a}}ndez and
Carlos Luna{-}Mota and
Achim Hildenbrandt and
Gerhard Reinelt and
Stefan Wiesberg},
title = {A Flow Formulation for the Optimum Communication Spanning Tree},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {85--92},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.079},
doi = {10.1016/J.ENDM.2013.05.079},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandezLHRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ForteLM13,
author = {Vinicius Leal do Forte and
Abilio Lucena and
Nelson Maculan},
title = {Formulations for the Minimum 2-Connected Dominating Set Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {415--422},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.120},
doi = {10.1016/J.ENDM.2013.05.120},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ForteLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FortzLV13,
author = {Bernard Fortz and
Martine Labb{\'{e}} and
Alessia Violin},
title = {Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected
Toll Arcs},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {117--124},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.083},
doi = {10.1016/J.ENDM.2013.05.083},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FortzLV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FuriniK13,
author = {Fabio Furini and
Martin Philip Kidd},
title = {A fast heuristic approach for train timetabling in a railway node},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {205--212},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.094},
doi = {10.1016/J.ENDM.2013.05.094},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FuriniK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GendronGNST13,
author = {Bernard Gendron and
Rosario Giuseppe Garroppo and
Gianfranco Nencioni and
Maria Grazia Scutell{\`{a}} and
Luca Tavanti},
title = {Benders Decomposition for a Location-Design Problem in Green Wireless
Local Area Networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {367--374},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.114},
doi = {10.1016/J.ENDM.2013.05.114},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GendronGNST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GendronLCS13,
author = {Bernard Gendron and
Abilio Lucena and
Alexandre Salles da Cunha and
Luidi Simonetti},
title = {The Degree Preserving Spanning Tree Problem: Valid Inequalities and
Branch-and-cut method},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {173--180},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.090},
doi = {10.1016/J.ENDM.2013.05.090},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GendronLCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GeranisS13,
author = {George Geranis and
Angelo Sifaleras},
title = {Dynamic trees in exterior-point Simplex-type algorithms for network
flow problems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {93--100},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.080},
doi = {10.1016/J.ENDM.2013.05.080},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GeranisS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GiandomenicoLRS13,
author = {Monia Giandomenico and
Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
title = {Approximating the Lov{\'{a}}sz {\texttheta} Function with the
Subgradient Method},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {157--164},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.088},
doi = {10.1016/J.ENDM.2013.05.088},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GiandomenicoLRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GiovanniP13,
author = {Luigi De Giovanni and
Claudio E. Palazzi},
title = {Optimal Client-Server Configuration of Mobile Ad-Hoc Networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {495--502},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.130},
doi = {10.1016/J.ENDM.2013.05.130},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GiovanniP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GiroirePT13,
author = {Fr{\'{e}}d{\'{e}}ric Giroire and
St{\'{e}}phane P{\'{e}}rennes and
Issam Tahiri},
title = {On the Hardness of Equal Shortest Path Routing},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {439--446},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.123},
doi = {10.1016/J.ENDM.2013.05.123},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GiroirePT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GuerreroVPA13,
author = {William J. Guerrero and
Nubia Velasco and
Caroline Prodhon and
Ciro{-}Alberto Amaya},
title = {On the Generalized Elementary Shortest Path Problem: {A} heuristic
approach},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {503--510},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.131},
doi = {10.1016/J.ENDM.2013.05.131},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GuerreroVPA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Hernandez-PerezRMG13,
author = {Hip{\'{o}}lito Hern{\'{a}}ndez{-}P{\'{e}}rez and
Jorge Riera{-}Ledesma and
Inmaculada Rodr{\'{\i}}guez Mart{\'{\i}}n and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {International Network Optimization Conference, Tenerife 2013},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {1--3},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.068},
doi = {10.1016/J.ENDM.2013.05.068},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Hernandez-PerezRMG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HervetFCCF13,
author = {C{\'{e}}dric Hervet and
Alain Faye and
Marie{-}Christine Costa and
Matthieu Chardy and
Stanislas Francfort},
title = {Solving the Two-Stage Robust {FTTH} network design Problem under Demand
Uncertainty},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {335--342},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.110},
doi = {10.1016/J.ENDM.2013.05.110},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HervetFCCF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HuguetKPC13,
author = {Marie{-}Jos{\'{e}} Huguet and
Dominik Kirchler and
Pierre Parent and
Roberto Wolfler Calvo},
title = {Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {431--437},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.122},
doi = {10.1016/J.ENDM.2013.05.122},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HuguetKPC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HuppL13,
author = {Lena Hupp and
Frauke Liers},
title = {A polyhedral study of the Hamiltonian p-median problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {213--220},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.095},
doi = {10.1016/J.ENDM.2013.05.095},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HuppL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Kishimoto13,
author = {Wataru Kishimoto},
title = {An Extension of a Balanced Flow in a Network},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {109--116},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.082},
doi = {10.1016/J.ENDM.2013.05.082},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Kishimoto13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KosterPT13,
author = {Arie Koster and
Truong Khoa Phan and
Martin Tieves},
title = {Extended Cutset Inequalities for the Network Power Consumption Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {69--76},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.077},
doi = {10.1016/J.ENDM.2013.05.077},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KosterPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LamorgeseM13,
author = {Leonardo Lamorgese and
Carlo Mannino},
title = {The track formulation for the Train Dispatching problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {559--566},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.138},
doi = {10.1016/J.ENDM.2013.05.138},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LamorgeseM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeitnerLS13,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl},
title = {Solving the bi-objective prize-collecting Steiner tree problem with
the {\unicode{1013}}-constraint method},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {181--188},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.091},
doi = {10.1016/J.ENDM.2013.05.091},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeitnerLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeitnerLSW13,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl and
Axel Werner},
title = {On the Two-Architecture Connected Facility Location Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {359--366},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.113},
doi = {10.1016/J.ENDM.2013.05.113},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeitnerLSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LiP13,
author = {Yuan Li and
Michal Pi{\'{o}}ro},
title = {Integer programming models for maximizing parallel transmissions in
wireless networks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {197--204},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.093},
doi = {10.1016/J.ENDM.2013.05.093},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LiP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LinK13,
author = {Zhiyuan Lin and
Raymond S. K. Kwan},
title = {An integer fixed-charge multicommodity flow {(FCMF)} model for train
unit scheduling},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {165--172},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.089},
doi = {10.1016/J.ENDM.2013.05.089},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LinK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LjubicMZ13,
author = {Ivana Ljubic and
Petra Mutzel and
Bernd Zey},
title = {Stochastic Survivable Network Design Problems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {245--252},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.099},
doi = {10.1016/J.ENDM.2013.05.099},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LjubicMZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LoggerenbergGT13,
author = {S. P. van Loggerenberg and
Magdalena J. Grobler and
S. E. Terblanche},
title = {Solving the Passive Optical Network with Fiber Duct Sharing Planning
Problem Using Discrete Techniques},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {343--350},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.111},
doi = {10.1016/J.ENDM.2013.05.111},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LoggerenbergGT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LucenaCS13,
author = {Abilio Lucena and
Alexandre Salles da Cunha and
Luidi Simonetti},
title = {Formulating and Solving the Minimum Dominating Cycle Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {423--430},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.121},
doi = {10.1016/J.ENDM.2013.05.121},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LucenaCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MaiaGG13,
author = {S{\'{\i}}lvia M. D. M. Maia and
Elizabeth Ferreira Gouvea Goldbarg and
Marco C{\'{e}}sar Goldbarg},
title = {On the Biobjective Adjacent Only Quadratic Spanning Tree Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {535--542},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.135},
doi = {10.1016/J.ENDM.2013.05.135},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MaiaGG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MalagutiMBZ13,
author = {Enrico Malaguti and
Isabel M{\'{e}}ndez{-}D{\'{\i}}az and
Juan Jos{\'{e}} Miranda Bront and
Paula Zabala},
title = {(k, c) - coloring via Column Generation},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {447--454},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.124},
doi = {10.1016/J.ENDM.2013.05.124},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MalagutiMBZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MassinissaDM13,
author = {Massinissa Merabet and
Sylvain Durand and
Mikl{\'{o}}s Moln{\'{a}}r},
title = {Exact solution for branch vertices constrained spanning problems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {527--534},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.134},
doi = {10.1016/J.ENDM.2013.05.134},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MassinissaDM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Mattia13,
author = {Sara Mattia},
title = {The cut condition for robust network design},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {303--310},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.106},
doi = {10.1016/J.ENDM.2013.05.106},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Mattia13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MeierC13,
author = {J. Fabian Meier and
Uwe Clausen},
title = {Strategic planning in {LTL} logistics - increasing the capacity utilization
of trucks},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {37--44},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.073},
doi = {10.1016/J.ENDM.2013.05.073},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MeierC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PaynterS13,
author = {Bradley J. Paynter and
Douglas R. Shier},
title = {A Network Approach to a Geometric Packing Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {295--302},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.105},
doi = {10.1016/J.ENDM.2013.05.105},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/PaynterS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PedroSC13,
author = {Odivaney Pedro and
Rodney Rezende Saldanha and
Ricardo Saraiva de Camargo},
title = {A Tabu Search Approach for the Prize Collecting Traveling Salesman
Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {261--268},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.101},
doi = {10.1016/J.ENDM.2013.05.101},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PedroSC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PereiraGC13,
author = {Dilson Lucas Pereira and
Michel Gendreau and
Alexandre Salles da Cunha},
title = {Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem
with Adjacency Costs},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {229--236},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.097},
doi = {10.1016/J.ENDM.2013.05.097},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PereiraGC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RazL13,
author = {David Raz and
Shira Levy},
title = {A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc
Path Selection Schemes},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {101--108},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.081},
doi = {10.1016/J.ENDM.2013.05.081},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RazL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ReisNS13,
author = {Daniel Morais dos Reis and
Thiago F. Noronha and
S{\'{e}}rgio Ricardo de Souza},
title = {Iterated Local Search for Fiber Installation in Optical Network Optimization},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {277--284},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.103},
doi = {10.1016/J.ENDM.2013.05.103},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ReisNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RomeroRRR13,
author = {Pablo Romero and
Franco Robledo and
Pablo Rodr{\'{\i}}guez{-}Bocca and
Claudia Rostagnol},
title = {Mathematical Analysis of caching policies and cooperation in YouTube-like
services},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {221--228},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.096},
doi = {10.1016/J.ENDM.2013.05.096},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/RomeroRRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SebaK13,
author = {Hamida Seba and
Riadh Khennoufa},
title = {Edge Coloring by Total Labelings of 4-regular Circulant Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {141--148},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.086},
doi = {10.1016/J.ENDM.2013.05.086},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SebaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SenderC13,
author = {Julia Sender and
Uwe Clausen},
title = {Heuristics for solving a capacitated multiple allocation hub location
problem with application in German wagonload traffic},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {13--20},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.070},
doi = {10.1016/J.ENDM.2013.05.070},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SenderC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SousaLS13,
author = {Amaro de Sousa and
Carlos B. Lopes and
Dorabella Santos},
title = {Load balancing optimization of telecommunication networks with two
differentiated services},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {351--358},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.112},
doi = {10.1016/J.ENDM.2013.05.112},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SousaLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Tomaszewski13,
author = {Artur Tomaszewski},
title = {The final answer to the complexity of a basic problem in resilient
network design},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {455--462},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.125},
doi = {10.1016/J.ENDM.2013.05.125},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Tomaszewski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/VollC13,
author = {Robert Voll and
Uwe Clausen},
title = {Branch-and-Price for a European variant of the Railroad Blocking Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {45--52},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.074},
doi = {10.1016/J.ENDM.2013.05.074},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/VollC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/WaserholeJB13,
author = {Ariel Waserhole and
Vincent Jost and
Nadia Brauner},
title = {Pricing techniques for self regulation in Vehicle Sharing Systems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {149--156},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.087},
doi = {10.1016/J.ENDM.2013.05.087},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/WaserholeJB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/XuLMC13,
author = {Qing Xu and
Fr{\'{e}}d{\'{e}}ric Lassabe and
Hakim Mabed and
Alexandre Caminada},
title = {Fitness Landscape Analysis for Scalable Multicast {RRM} Problem in
Cellular Network},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {407--414},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.119},
doi = {10.1016/J.ENDM.2013.05.119},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/XuLMC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Zotkiewicz13,
author = {Mateusz Zotkiewicz},
title = {Efficient {MIP} formulation for optimal 1-for-N diversity coding},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {133--140},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.085},
doi = {10.1016/J.ENDM.2013.05.085},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Zotkiewicz13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-27 07:10 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
