default search action
Search dblp for Publications
export results for "toc:db/journals/networks/networks39.bht:"
@article{DBLP:journals/networks/AggarwalO02, author = {Charu C. Aggarwal and James B. Orlin}, title = {On multiroute maximum flows in networks}, journal = {Networks}, volume = {39}, number = {1}, pages = {43--52}, year = {2002}, url = {https://doi.org/10.1002/net.10008}, doi = {10.1002/NET.10008}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/AggarwalO02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BalbuenaFMP02, author = {Camino Balbuena and Josep F{\`{a}}brega and Xavier Marcote and Ignacio M. Pelayo}, title = {Superconnected digraphs and graphs with small conditional diameters}, journal = {Networks}, volume = {39}, number = {3}, pages = {153--160}, year = {2002}, url = {https://doi.org/10.1002/net.10020}, doi = {10.1002/NET.10020}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BalbuenaFMP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BespamyatnikhBKKS02, author = {Sergei Bespamyatnikh and Binay K. Bhattacharya and J. Mark Keil and David G. Kirkpatrick and Michael Segal}, title = {Efficient algorithms for centers and medians in interval and circular-arc graphs}, journal = {Networks}, volume = {39}, number = {3}, pages = {144--152}, year = {2002}, url = {https://doi.org/10.1002/net.10023}, doi = {10.1002/NET.10023}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BespamyatnikhBKKS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BrazilTW02, author = {Marcus Brazil and Doreen A. Thomas and Jia F. Weng}, title = {Forbidden subpaths for Steiner minimum networks in uniform orientation metrics}, journal = {Networks}, volume = {39}, number = {4}, pages = {186--202}, year = {2002}, url = {https://doi.org/10.1002/net.10025}, doi = {10.1002/NET.10025}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BrazilTW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/CanoMS02, author = {Andr{\'{e}}s Cano and Seraf{\'{\i}}n Moral and Antonio Salmer{\'{o}}n}, title = {Lazy evaluation in penniless propagation over join trees}, journal = {Networks}, volume = {39}, number = {4}, pages = {175--185}, year = {2002}, url = {https://doi.org/10.1002/net.10024}, doi = {10.1002/NET.10024}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/CanoMS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ChartrandHZ02, author = {Gary Chartrand and Frank Harary and Ping Zhang}, title = {On the geodetic number of a graph}, journal = {Networks}, volume = {39}, number = {1}, pages = {1--6}, year = {2002}, url = {https://doi.org/10.1002/net.10007}, doi = {10.1002/NET.10007}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ChartrandHZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DessmarkP02, author = {Anders Dessmark and Andrzej Pelc}, title = {Deterministic radio broadcasting at low cost}, journal = {Networks}, volume = {39}, number = {2}, pages = {88--97}, year = {2002}, url = {https://doi.org/10.1002/net.10016}, doi = {10.1002/NET.10016}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DessmarkP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DetlefsenW02, author = {Nina K. Detlefsen and Stein W. Wallace}, title = {The simplex algorithm for multicommodity networks}, journal = {Networks}, volume = {39}, number = {1}, pages = {15--28}, year = {2002}, url = {https://doi.org/10.1002/net.10006}, doi = {10.1002/NET.10006}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DetlefsenW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DinneenPW02, author = {Michael J. Dinneen and Geoffrey Pritchard and Mark C. Wilson}, title = {Degree- and time-constrained broadcast networks}, journal = {Networks}, volume = {39}, number = {3}, pages = {121--129}, year = {2002}, url = {https://doi.org/10.1002/net.10018}, doi = {10.1002/NET.10018}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DinneenPW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FeremansLL02, author = {Corinne Feremans and Martine Labb{\'{e}} and Gilbert Laporte}, title = {A comparative analysis of several formulations for the generalized minimum spanning tree problem}, journal = {Networks}, volume = {39}, number = {1}, pages = {29--34}, year = {2002}, url = {https://doi.org/10.1002/net.10009}, doi = {10.1002/NET.10009}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FeremansLL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FerreroP02, author = {Daniela Ferrero and Carles Padr{\'{o}}}, title = {Partial line directed hypergraphs}, journal = {Networks}, volume = {39}, number = {2}, pages = {61--67}, year = {2002}, url = {https://doi.org/10.1002/net.10013}, doi = {10.1002/NET.10013}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FerreroP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FischettiLS02, author = {Matteo Fischetti and Giuseppe Lancia and Paolo Serafini}, title = {Exact algorithms for minimum routing cost trees}, journal = {Networks}, volume = {39}, number = {3}, pages = {161--173}, year = {2002}, url = {https://doi.org/10.1002/net.10022}, doi = {10.1002/NET.10022}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/FischettiLS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FraigniaudKL02, author = {Pierre Fraigniaud and Jean{-}Claude K{\"{o}}nig and Emmanuel Lazard}, title = {Oriented hypercubes}, journal = {Networks}, volume = {39}, number = {2}, pages = {98--106}, year = {2002}, url = {https://doi.org/10.1002/net.10012}, doi = {10.1002/NET.10012}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FraigniaudKL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/FrancisLT02, author = {Richard L. Francis and Timothy J. Lowe and Arie Tamir}, title = {Worst-case incremental analysis for a class of p-facility location problems}, journal = {Networks}, volume = {39}, number = {3}, pages = {139--143}, year = {2002}, url = {https://doi.org/10.1002/net.10021}, doi = {10.1002/NET.10021}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/FrancisLT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Fremuth-PaegerJ02, author = {Christian Fremuth{-}Paeger and Dieter Jungnickel}, title = {Balanced network flows. {VII.} Primal-dual algorithms}, journal = {Networks}, volume = {39}, number = {1}, pages = {35--42}, year = {2002}, url = {https://doi.org/10.1002/net.10002}, doi = {10.1002/NET.10002}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Fremuth-PaegerJ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/GhodsiHMM02, author = {Mohammad Ghodsi and Mohammad Taghi Hajiaghayi and Mohammad Mahdian and Vahab S. Mirrokni}, title = {Length-constrained path-matchings in graphs}, journal = {Networks}, volume = {39}, number = {4}, pages = {210--215}, year = {2002}, url = {https://doi.org/10.1002/net.10030}, doi = {10.1002/NET.10030}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GhodsiHMM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/KarunoNI02, author = {Yoshiyuki Karuno and Hiroshi Nagamochi and Toshihide Ibaraki}, title = {Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks}, journal = {Networks}, volume = {39}, number = {4}, pages = {203--209}, year = {2002}, url = {https://doi.org/10.1002/net.10028}, doi = {10.1002/NET.10028}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/KarunoNI02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ManacherM02, author = {Glenn K. Manacher and Terrance A. Mankus}, title = {A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone}, journal = {Networks}, volume = {39}, number = {2}, pages = {68--72}, year = {2002}, url = {https://doi.org/10.1002/net.10014}, doi = {10.1002/NET.10014}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ManacherM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/MarizS02, author = {Paul L. Mariz and Shahriar Shahriari}, title = {Edge-cutsets in the directed hypercube}, journal = {Networks}, volume = {39}, number = {2}, pages = {73--76}, year = {2002}, url = {https://doi.org/10.1002/net.10011}, doi = {10.1002/NET.10011}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MarizS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/McAreeBB02, author = {Paul McAree and Lawrence Bodin and Michael O. Ball}, title = {Models for the design and analysis of a large package sort facility}, journal = {Networks}, volume = {39}, number = {2}, pages = {107--120}, year = {2002}, url = {https://doi.org/10.1002/net.10017}, doi = {10.1002/NET.10017}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/McAreeBB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/PrytzF02, author = {Mikael Prytz and Anders Forsgren}, title = {Dimensioning multicast-enabled communications networks}, journal = {Networks}, volume = {39}, number = {4}, pages = {216--231}, year = {2002}, url = {https://doi.org/10.1002/net.10026}, doi = {10.1002/NET.10026}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/PrytzF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/RaoS02, author = {V. Venkata Rao and R. Sridharan}, title = {Minimum-weight rooted not-necessarily-spanning arborescence problem}, journal = {Networks}, volume = {39}, number = {2}, pages = {77--87}, year = {2002}, url = {https://doi.org/10.1002/net.10015}, doi = {10.1002/NET.10015}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/RaoS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Shigeno02, author = {Maiko Shigeno}, title = {Minimax inverse problems of minimum cuts}, journal = {Networks}, volume = {39}, number = {1}, pages = {7--14}, year = {2002}, url = {https://doi.org/10.1002/net.10000}, doi = {10.1002/NET.10000}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Shigeno02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Williams02, author = {Justin C. Williams}, title = {A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs}, journal = {Networks}, volume = {39}, number = {1}, pages = {53--60}, year = {2002}, url = {https://doi.org/10.1002/net.10010}, doi = {10.1002/NET.10010}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Williams02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/WuCT02, author = {Bang Ye Wu and Kun{-}Mao Chao and Chuan Yi Tang}, title = {Light graphs with small routing cost}, journal = {Networks}, volume = {39}, number = {3}, pages = {130--138}, year = {2002}, url = {https://doi.org/10.1002/net.10019}, doi = {10.1002/NET.10019}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/WuCT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.