Networks

2005

Solving the undirected minimum cost flow problem with arbitrary costs
by: Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso v. 45 i. 1 p. 1 - 3
Strict nonblockingness of reduced shuffle-exchange networks
by: F. K. Hwang, Binwu Zhang v. 45 i. 1 p. 4 - 8
Parallel scheduling problems in next generation wireless networks
by: Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal v. 45 i. 1 p. 9 - 22
Adversarial models for priority-based networks
by: Carme Àlvarez, Maria J. Blesa, Josep Díaz, Maria J. Serna, Antonio Fernández v. 45 i. 1 p. 23 - 35
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
by: Ravindra K. Ahuja, Horst W. Hamacher v. 45 i. 1 p. 36 - 41
On the minimum number of wavelengths in multicast trees in WDM networks
by: Yingyu Wan, Weifa Liang v. 45 i. 1 p. 42 - 48
Diameter vulnerability of iterated line digraphs in terms of the girth
by: Camino Balbuena, Xavier Marcote, Daniela Ferrero v. 45 i. 2 p. 49 - 54
Graphs, branchwidth, and tangles! Oh my!
by: Illya V. Hicks v. 45 i. 2 p. 55 - 60
Strong formulations for network design problems with connectivity requirements
by: Thomas L. Magnanti, S. Raghavan v. 45 i. 2 p. 61 - 79
Connectedness of digraphs and graphs under constraints on the conditional diameter
by: Xavier Marcote, Camino Balbuena, Josep Fàbrega v. 45 i. 2 p. 80 - 87
On the fault-tolerant diameter and wide diameter of omega-connected graphs
by: Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen, Cheng Zhong v. 45 i. 2 p. 88 - 94
All-port line broadcasting in highly connected graphs
by: Iris Gaber, Michal Parnas v. 45 i. 2 p. 95 - 103
Balanced paths in acyclic networks: Tractable cases and related approaches
by: Paola Cappanera, Maria Grazia Scutellà v. 45 i. 2 p. 104 - 111
On restricted connectivities of permutation graphs
by: Camino Balbuena, Xavier Marcote, Pedro P. García-Vázquez v. 45 i. 3 p. 113 - 118
Constructions of sparse asymmetric connectors with number theoretic methods
by: Andreas Baltz, Gerold Jäger, Anand Srivastav v. 45 i. 3 p. 119 - 124
A branch-and-price algorithm for the capacitated p-median problem
by: Alberto Ceselli, Giovanni Righini v. 45 i. 3 p. 125 - 142
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
by: Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough v. 45 i. 3 p. 143 - 164
The strongly connected reliability of complete digraphs
by: Jason I. Brown, Xiaohu Li v. 45 i. 3 p. 165 - 168
Leader election in oriented star graphs
by: Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani v. 45 i. 3 p. 169 - 179
Exact solution of the centralized network design problem on directed graphs
by: Fatma Gzara, Jean-Louis Goffin v. 45 i. 4 p. 181 - 192
A simple protocol for deniable authentication based on ElGamal cryptography
by: Yingjie Wang, Jianhua Li, Ling Tie v. 45 i. 4 p. 193 - 194
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
by: Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno v. 45 i. 4 p. 195 - 198
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
by: Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez v. 45 i. 4 p. 199 - 209
Matchings in 3-vertex-critical graphs: The even case
by: Nawarat Ananchuen, Michael D. Plummer v. 45 i. 4 p. 210 - 213
Greedy approximation algorithms for directed multicuts
by: Yana Kortsarts, Guy Kortsarz, Zeev Nutov v. 45 i. 4 p. 214 - 217
Minimal feedback vertex sets in directed split-stars
by: Fu-Hsing Wang, Cheng-Ju Hsu, Jen-Chih Tsai v. 45 i. 4 p. 218 - 223
Optimal broadcasting with universal lists based on competitive analysis
by: Jae-Hoon Kim, Kyung-Yong Chwa v. 45 i. 4 p. 224 - 231
Lowering eccentricity of a tree by node upgrading
by: Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang v. 45 i. 4 p. 232 - 239

2004

Branch decompositions and minor containment
by: Illya V. Hicks v. 43 i. 1 p. 1 - 9
Connectivity-splitting models for survivable network design
by: Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani v. 43 i. 1 p. 10 - 27
Fault-tolerant cycle embedding in hierarchical cubic networks
by: Jung-Sheng Fu, Gen-Huey Chen v. 43 i. 1 p. 28 - 38
Optimization of Internet Protocol network design and routing
by: Kaj Holmberg, Di Yuan v. 43 i. 1 p. 39 - 53
Edge-superconnectivity of cages
by: Xavier Marcote, Camino Balbuena v. 43 i. 1 p. 54 - 59
Minimal path broadcast networks
by: Arthur M. Farley v. 43 i. 2 p. 61 - 70
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
by: Corinne Feremans, Martine Labbé, Gilbert Laporte v. 43 i. 2 p. 71 - 86
An exact algorithm for the min-cost network containment problem
by: Raffaele Pesenti, Franca Rinaldi, Walter Ukovich v. 43 i. 2 p. 87 - 102
On some properties of suboptimal colorings of graphs
by: Ivo Blöchliger, Dominique de Werra v. 43 i. 2 p. 103 - 108
The absolute center of a network
by: Dov Dvir, Gabriel Y. Handler v. 43 i. 2 p. 109 - 118
A randomized algorithm for gossiping in radio networks
by: Marek Chrobak, Leszek Gasieniec, Wojciech Rytter v. 43 i. 2 p. 119 - 124
A hybrid multicommodity routing algorithm for traffic engineering
by: Wided Ouaja, Barry Richards v. 43 i. 3 p. 125 - 140
Bisectored unit disk graphs
by: John Nolan v. 43 i. 3 p. 141 - 152
Minimum-cost dynamic flows: The series-parallel case
by: Bettina Klinz, Gerhard J. Woeginger v. 43 i. 3 p. 153 - 162
Low-connectivity network design on series-parallel graphs
by: S. Raghavan v. 43 i. 3 p. 163 - 176
The Ring Star Problem: Polyhedral analysis and exact algorithm
by: Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González v. 43 i. 3 p. 177 - 189
The 2-path network problem
by: Geir Dahl, Bjarne Johannessen v. 43 i. 3 p. 190 - 199
From the editors
v. 43 i. 4
A directed cycle-based column-and-cut generation method for capacitated survivable network design
by: Deepak Rajan, Alper Atamtürk v. 43 i. 4 p. 201 - 211
The maximum-leaf spanning tree problem: Formulations and facets
by: Tetsuya Fujie v. 43 i. 4 p. 212 - 223
A note on a secure voting system on a public network
by: M. G. Karagiannopoulos, Michael N. Vrahatis, Gerasimos C. Meletiou v. 43 i. 4 p. 224 - 225
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
by: Natashia Boland, Horst W. Hamacher, Frank Lenzen v. 43 i. 4 p. 226 - 240
Large-scale local search heuristics for the capacitated vertex p-center problem
by: Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà v. 43 i. 4 p. 241 - 255
Algorithms for a network design problem with crossing supermodular demands
by: Vardges Melkonian, Éva Tardos v. 43 i. 4 p. 256 - 265
Complete binary trees in folded and enhanced cubes
by: Sheshayya A. Choudum, R. Usha Nandini v. 43 i. 4 p. 266 - 272
2003 Glover-Klingman prize winners
by: Bruce L. Golden, Douglas R. Shier v. 44 i. 1
Packing cuts in undirected graphs
by: Alberto Caprara, Alessandro Panconesi, Romeo Rizzi v. 44 i. 1 p. 1 - 11
A stochastic integer programming approach to solving a synchronous optical network ring design problem
by: J. Cole Smith, Andrew J. Schaefer, Joyce W. Yen v. 44 i. 1 p. 12 - 26
Some recent contributions to network optimization
by: Walid Ben-Ameur, Luis Gouveia v. 44 i. 1 p. 27 - 30
Solving the asymmetric traveling salesman problem with periodic constraints
by: Giuseppe Paletta, Chefi Triki v. 44 i. 1 p. 31 - 37
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
by: Arie Tamir v. 44 i. 1 p. 38 - 40
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
by: Brian C. Dean v. 44 i. 1 p. 41 - 46
Probabilistic location problems with discrete demand weights
by: Oded Berman, Jiamin Wang v. 44 i. 1 p. 47 - 57
Foreword
by: Stefano Pallottino, Roberto Tadei v. 44 i. 2 p. 59 - 60
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
by: Matteo Fischetti, Carlo Polo, Massimo Scantamburlo v. 44 i. 2 p. 61 - 72
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
by: Luigi De Giovanni, Federico Della Croce, Roberto Tadei v. 44 i. 2 p. 73 - 83
Projecting the flow variables for hub location problems
by: Martine Labbé, Hande Yaman v. 44 i. 2 p. 84 - 93
Solving the Hub location problem in telecommunication network design: A local search approach
by: Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei v. 44 i. 2 p. 94 - 105
Grid scheduling by on-line rectangle packing
by: Massimiliano Caramia, Stefano Giordani, Antonio Iovanella v. 44 i. 2 p. 106 - 119
Cardinality constrained path covering problems in grid graphs
by: Nicola Apollonio, Lou Caccetta, Bruno Simeone v. 44 i. 2 p. 120 - 131
A competitive scheduling problem and its relevance to UMTS channel assignment
by: Claudio Arbib, Stefano Smriglio, Mara Servilio v. 44 i. 2 p. 132 - 141
Decomposition techniques for the minimum toll revenue problem
by: Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich v. 44 i. 2 p. 142 - 150
An implicit enumeration scheme for the batch selection problem
by: Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio v. 44 i. 2 p. 151 - 159
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
by: Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee v. 44 i. 2 p. 160 - 171
Embedding of cycles and wheels into arbitrary trees
by: Indra Rajasingh, Albert William, Jasintha Quadras, Paul Manuel v. 44 i. 3 p. 173 - 178
Trade-offs on the location of the core node in a network
by: Jean-François Macq, Michel X. Goemans v. 44 i. 3 p. 179 - 186
Optimal grid representations
by: Marcia Helene Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo v. 44 i. 3 p. 187 - 193
The ring grooming problem
by: Timothy Y. Chow, Philip J. Lin v. 44 i. 3 p. 194 - 202
Approximation algorithms for finding low-degree subgraphs
by: Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi v. 44 i. 3 p. 203 - 215
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
by: Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen v. 44 i. 3 p. 216 - 229
Bounding vertex coloring by truncated multistage branch and bound
by: Massimiliano Caramia, Paolo Dell'Olmo v. 44 i. 4 p. 231 - 242
Minimum k-geodetically connected digraphs
by: Ján Plesník v. 44 i. 4 p. 243 - 253
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
by: Luis Gouveia, Thomas L. Magnanti, Cristina Requejo v. 44 i. 4 p. 254 - 265
On d-threshold graphs and d-dimensional bin packing
by: Alberto Caprara, Andrea Lodi, Romeo Rizzi v. 44 i. 4 p. 266 - 280
The Push Tree problem
by: Frédéric Havet, Marc Wennink v. 44 i. 4 p. 281 - 291
The proof of a conjecture of Bouabdallah and Sotteau
by: Min Xu, Xin-Min Hou, Jun-Ming Xu v. 44 i. 4 p. 292 - 296
A network flow approach to cost allocation for rooted trees
by: Satoru Iwata, Nozomu Zuiki v. 44 i. 4 p. 297 - 301
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
by: Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng v. 44 i. 4 p. 302 - 310

2003

Multifacility ordered median problems on networks: A further analysis
by: Jörg Kalcsics, Stefan Nickel, Justo Puerto v. 41 i. 1 p. 1 - 12
The SONET edge-partition problem
by: Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick v. 41 i. 1 p. 13 - 23
Upgrading trees under diameter and budget constraints
by: Victor Chepoi, Hartmut Noltemeier, Yann Vaxès v. 41 i. 1 p. 24 - 35
Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest-path trees
by: Robert B. Dial v. 41 i. 1 p. 36 - 43
Social network coordination and graph routing
by: Shmuel Onn, Elisheva Sperber v. 41 i. 1 p. 44 - 50
Optimal rectangular partitions
by: Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza v. 41 i. 1 p. 51 - 67
Report: Some recent developments in network economics
by: Anna Nagurney v. 41 i. 1 p. 68 - 72
Towards minimum k-geodetically connected graphs
by: Ján Plesník v. 41 i. 2 p. 73 - 82
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
by: Jean-Claude Bermond, Stéphan Ceroi v. 41 i. 2 p. 83 - 86
Reserving resilient capacity for a single commodity with upper-bound constraints
by: G. Brightwell, G. Oriolo, F. Bruce Shepherd v. 41 i. 2 p. 87 - 96
An improved algorithm for the minmax regret median problem on a tree
by: Igor Averbakh, Oded Berman v. 41 i. 2 p. 97 - 103
A GRASP with path-relinking for private virtual circuit routing
by: Mauricio G. C. Resende, Celso C. Ribeiro v. 41 i. 2 p. 104 - 114
A polynomial-time algorithm to find shortest paths with recourse
by: J. Scott Provan v. 41 i. 2 p. 115 - 125
The single-vehicle routing problem with unrestricted backhauls
by: Haldun Süral, James H. Bookbinder v. 41 i. 3 p. 127 - 136
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 41 i. 3 p. 137 - 142
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
by: Francisco Ortega, Laurence A. Wolsey v. 41 i. 3 p. 143 - 158
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
by: Luis Gouveia, Thomas L. Magnanti v. 41 i. 3 p. 159 - 173
Small-worlds: A review of recent books
by: Ian Frommer, Guruprasad Pundoor v. 41 i. 3 p. 174 - 180
Ernesto de Queirós Vieira Martins (1945-2000): An appreciation
by: Mário S. Rosa v. 41 i. 4 p. 181 - 183
The determination of the path with minimum-cost norm value
by: José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Santos v. 41 i. 4 p. 184 - 196
Dynamic shortest paths minimizing travel times and costs
by: Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà v. 41 i. 4 p. 197 - 205
A bicriterion approach for routing problems in multimedia networks
by: João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal v. 41 i. 4 p. 206 - 220
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
by: Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides v. 41 i. 4 p. 221 - 228
A numerical tool for multiattribute ranking problems
by: Domingos Moreira Cardoso, Jorge Freire de Sousa v. 41 i. 4 p. 229 - 234
Trees, slices, and wheels: On the floorplan area minimization problem
by: Ana Maria De Almeida, Rosália Rodrigues v. 41 i. 4 p. 235 - 244
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
by: Alexandra Makri, Diego Klabjan v. 42 i. 1 p. 1 - 14
The spectra of wrapped butterfly digraphs
by: Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana v. 42 i. 1 p. 15 - 19
A general construction for nonblocking crosstalk-free photonic switching networks
by: Frank K. Hwang, Wen-Dar Lin v. 42 i. 1 p. 20 - 25
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
by: Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi v. 42 i. 1 p. 26 - 41
The facility location problem with general cost functions
by: Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni v. 42 i. 1 p. 42 - 47
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search
by: Nenad Mladenovic, Martine Labbé, Pierre Hansen v. 42 i. 1 p. 48 - 64
Editorial: Glover-Klingman prize
by: Douglas R. Shier, Bruce L. Golden v. 42 i. 2 p. 65 - 65
Network optimization in supply chain management and financial engineering: An annotated bibliography
by: Joseph Geunes, Panos M. Pardalos v. 42 i. 2 p. 66 - 84
Cycle embedding in faulty wrapped butterfly graphs
by: Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin v. 42 i. 2 p. 85 - 96
The performance of QoS-aware IP multicast routing protocols
by: Chih-Jen Tseng, Chyouhwa Chen v. 42 i. 2 p. 97 - 108
Some recent contributions to routing and location problems
by: A. Corberán, E. Mota, J. J. Salazar v. 42 i. 2 p. 109 - 113
An annotated bibliography of network interior point methods
by: Mauricio G. C. Resende, Geraldo Veiga v. 42 i. 2 p. 114 - 121
Broadcasting in generalized chordal rings
by: Francesc Comellas, Pavol Hell v. 42 i. 3 p. 123 - 134
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
by: I. Dumitrescu, N. Boland v. 42 i. 3 p. 135 - 153
Reoptimizing the traveling salesman problem
by: Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza v. 42 i. 3 p. 154 - 159
A linear algorithm for compact box-drawings of trees
by: Masud Hasan, Md. Saidur Rahman, Takao Nishizeki v. 42 i. 3 p. 160 - 164
The linear arrangement problem on recursively constructed graphs
by: Steven B. Horton, T. Easton, R. Gary Parker v. 42 i. 3 p. 165 - 168
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
by: Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou v. 42 i. 3 p. 169 - 180
Unilaterally connected large digraphs and generalized cycles
by: José Gómez, Eduardo A. Canale, Xavier Muñoz v. 42 i. 4 p. 181 - 188
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
by: Hong-Chun Hsu, Yi-Lin Hsieh, Jimmy J. M. Tan, Lih-Hsing Hsu v. 42 i. 4 p. 189 - 201
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
by: Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du v. 42 i. 4 p. 202 - 208
On the power of BFS to determine a graph's diameter
by: Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler v. 42 i. 4 p. 209 - 222

2002

On the geodetic number of a graph
by: Gary Chartrand, Frank Harary, Ping Zhang v. 39 i. 1 p. 1 - 6
Minimax inverse problems of minimum cuts
by: Maiko Shigeno v. 39 i. 1 p. 7 - 14
The simplex algorithm for multicommodity networks
by: Nina K. Detlefsen, Stein W. Wallace v. 39 i. 1 p. 15 - 28
A comparative analysis of several formulations for the generalized minimum spanning tree problem
by: Corinne Feremans, Martine Labbé, Gilbert Laporte v. 39 i. 1 p. 29 - 34
Balanced network flows. VII. Primal-dual algorithms
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 39 i. 1 p. 35 - 42
On multiroute maximum flows in networks
by: Charu C. Aggarwal, James B. Orlin v. 39 i. 1 p. 43 - 52
A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs
by: Justin C. Williams v. 39 i. 1 p. 53 - 60
Partial line directed hypergraphs
by: Daniela Ferrero, Carles Padró v. 39 i. 2 p. 61 - 67
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
by: Glenn K. Manacher, Terrance A. Mankus v. 39 i. 2 p. 68 - 72
Edge-cutsets in the directed hypercube
by: Paul L. Mariz, Shahriar Shahriari v. 39 i. 2 p. 73 - 76
Minimum-weight rooted not-necessarily-spanning arborescence problem
by: V. Venkata Rao, R. Sridharan v. 39 i. 2 p. 77 - 87
Deterministic radio broadcasting at low cost
by: Anders Dessmark, Andrzej Pelc v. 39 i. 2 p. 88 - 97
Oriented hypercubes
by: Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard v. 39 i. 2 p. 98 - 106
Models for the design and analysis of a large package sort facility
by: Paul McAree, Lawrence Bodin, Michael Ball v. 39 i. 2 p. 107 - 120
Degree- and time-constrained broadcast networks
by: Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson v. 39 i. 3 p. 121 - 129
Light graphs with small routing cost
by: Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang v. 39 i. 3 p. 130 - 138
Worst-case incremental analysis for a class of p-facility location problems
by: R. L. Francis, Timothy J. Lowe, Arie Tamir v. 39 i. 3 p. 139 - 143
Efficient algorithms for centers and medians in interval and circular-arc graphs
by: Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal v. 39 i. 3 p. 144 - 152
Superconnected digraphs and graphs with small conditional diameters
by: Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo v. 39 i. 3 p. 153 - 160
Exact algorithms for minimum routing cost trees
by: Matteo Fischetti, Giuseppe Lancia, Paolo Serafini v. 39 i. 3 p. 161 - 173
Lazy evaluation in penniless propagation over join trees
by: Andrés Cano, Serafín Moral, Antonio Salmerón v. 39 i. 4 p. 175 - 185
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
by: M. Brazil, D. A. Thomas, J. F. Weng v. 39 i. 4 p. 186 - 202
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
by: Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki v. 39 i. 4 p. 203 - 209
Length-constrained path-matchings in graphs
by: Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni v. 39 i. 4 p. 210 - 215
Dimensioning multicast-enabled communications networks
by: Mikael Prytz, Anders Forsgre v. 39 i. 4 p. 216 - 231
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
by: Igor Averbakh, Oded Berman v. 40 i. 1 p. 1 - 12
A branch-and-price algorithm for switch-box routing
by: David Grove Jørgensen, Morten Meyling v. 40 i. 1 p. 13 - 26
A note on the traveling repairman problem
by: Alfredo García Olaverri, Pedro Jodrá, Javier Tejel v. 40 i. 1 p. 27 - 31
Approximation algorithms for constructing wavelength routing networks
by: Refael Hassin, Asaf Levin v. 40 i. 1 p. 32 - 37
Preprocessing Steiner problems from VLSI layout
by: Eduardo Uchoa, Marcus Poggi de Aragão, Celso C. Ribeiro v. 40 i. 1 p. 38 - 50
Embedding iterated line digraphs in books
by: Toru Hasunuma v. 40 i. 2 p. 51 - 62
Source location problems considering vertex-connectivity and edge-connectivity simultaneously
by: Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama v. 40 i. 2 p. 63 - 70
Augmented cubes
by: Sheshayya A. Choudum, V. Sunitha v. 40 i. 2 p. 71 - 84
Fast permutation routing in a class of interconnection networks
by: Ehab S. Elmallah, Chin-Hung Lam v. 40 i. 2 p. 85 - 90
Super edge- and point-connectivities of the Cartesian product of regular graphs
by: Bih-Sheue Shieh v. 40 i. 2 p. 91 - 96
Shortest-path network interdiction
by: Eitan Israeli, R. Kevin Wood v. 40 i. 2 p. 97 - 111
Minimax problems with bitonic matrices
by: Dorit S. Hochbaum, Paul A. Tucker v. 40 i. 3 p. 113 - 124
Network fair bandwidth share using hash rate estimation
by: Jung-Shian Li, Ming-Shiann Leu v. 40 i. 3 p. 125 - 141
Node-disjoint paths and related problems on hierarchical cubic networks
by: Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh v. 40 i. 3 p. 142 - 154
Isomorphisms of the De Bruijn digraph and free-space optical networks
by: David Coudert, Afonso Ferreira, Stephane Perennes v. 40 i. 3 p. 155 - 164
Increasing the connectivity of the star graphs
by: Eddie Cheng, Marc J. Lipman v. 40 i. 3 p. 165 - 169
Solving partial constraint satisfaction problems with tree decomposition
by: Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen v. 40 i. 3 p. 170 - 180
Combinatorial algorithms for inverse network flow problems
by: Ravindra K. Ahuja, James B. Orlin v. 40 i. 4 p. 181 - 187
Multistars and directed flow formulations
by: Luis Gouveia, Leslie A. Hall v. 40 i. 4 p. 188 - 201
Design of fault-tolerant networks for satellites (TWTA redundancy)
by: Jean-Claude Bermond, Éric Darrot, Olivier Delmas v. 40 i. 4 p. 202 - 207
Efficient algorithms for finding the (k, l)-core of tree networks
by: Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari v. 40 i. 4 p. 208 - 215
On the online shortest path problem with limited arc cost dependencies
by: S. Travis Waller, Athanasios K. Ziliaskopoulos v. 40 i. 4 p. 216 - 227
The fractional matching numbers of graphs
by: Yan Liu, Guizhen Liu v. 40 i. 4 p. 228 - 231

2001

The early days of Networks
by: Ivan T. Frisch v. 37 i. 1 p. 1 - 7
An improved approximation scheme for the Group Steiner Problem
by: Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky v. 37 i. 1 p. 8 - 20
Allocation of partially renewable resources: Concept, capabilities, and applications
by: Andreas Schirmer, Andreas Drexl v. 37 i. 1 p. 21 - 34
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
by: Elise Miller-Hooks v. 37 i. 1 p. 35 - 52
Cooperative triangulation in MSBNs without revealing subnet structures
by: Yang Xiang v. 37 i. 1 p. 53 - 65
How hard is it to determine if a graph has a 2-role assignment?
by: Fred S. Roberts, Li Sheng v. 37 i. 2 p. 67 - 73
A branch and cut method for the degree-constrained minimum spanning tree problem
by: Lou Caccetta, S. P. Hill v. 37 i. 2 p. 74 - 83
Embedding longest fault-free paths in arrangement graphs with faulty vertices
by: Ray-Shang Lo, Gen-Huey Chen v. 37 i. 2 p. 84 - 93
Improved upper and lower bounds for k-broadcasting
by: Hovhannes A. Harutyunyan, Arthur L. Liestman v. 37 i. 2 p. 94 - 101
Scattering number in graphs
by: Shenggui Zhang, Ziguo Wang v. 37 i. 2 p. 102 - 106
Minimizing drop cost for SONET/WDM networks with wavelength requirements
by: Charles J. Colbourn, Peng-Jun Wan v. 37 i. 2 p. 107 - 116
Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs
by: Falk Nicolai, Thomas Szymczak v. 37 i. 3 p. 117 - 128
On the number of spanning trees in directed circulant graphs
by: Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski v. 37 i. 3 p. 129 - 133
The capacitated arc routing problem with intermediate facilities
by: Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte v. 37 i. 3 p. 134 - 143
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
by: Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki v. 37 i. 3 p. 144 - 155
Minimum spanners of butterfly graphs
by: Shien-Ching Hwang, Gen-Huey Chen v. 37 i. 3 p. 156 - 164
On the construction of combined k-fault-tolerant Hamiltonian graphs
by: Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung v. 37 i. 3 p. 165 - 170
A new - old algorithm for minimum-cut and maximum-flow in closure graphs
by: Dorit S. Hochbaum v. 37 i. 4 p. 171 - 193
Balanced network flows. IV. Duality and structure theory
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 37 i. 4 p. 194 - 201
Balanced network flows. V. Cycle-canceling algorithms
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 37 i. 4 p. 202 - 209
Balanced network flows. VI. Polyhedral descriptions
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 37 i. 4 p. 210 - 218
Stability of networks and protocols in the adversarial queueing model for packet routing
by: Ashish Goel v. 37 i. 4 p. 219 - 224
Characterization results of all shortest paths interval routing schemes
by: Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan v. 37 i. 4 p. 225 - 232
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
by: Frank K. Hwang, Chih-Hung Yen v. 38 i. 1 p. 1 - 5
An algorithm for constructing minimal c-broadcast networks
by: Shiwoo Lee, Jose A. Ventura v. 38 i. 1 p. 6 - 21
Electronic voting in a large-scale distributed system
by: Gianluca Dini v. 38 i. 1 p. 22 - 32
The ultracenter and central fringe of a graph
by: Gary Chartrand, Karen S. Novotny, Steven J. Winters v. 38 i. 1 p. 33 - 38
Efficient communication in unknown networks
by: Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro v. 38 i. 1 p. 39 - 49
Local search with perturbations for the prize-collecting Steiner tree problem in graphs
by: S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro v. 38 i. 1 p. 50 - 58
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
by: Thomas Andreae v. 38 i. 2 p. 59 - 67
A polynomial algorithm for a constrained traveling salesman problem
by: J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald v. 38 i. 2 p. 68 - 75
A catalog of Hanan grid problems
by: Martin Zachariasen v. 38 i. 2 p. 76 - 83
The center function on trees
by: Fred R. McMorris, Fred S. Roberts, Chi Wang v. 38 i. 2 p. 84 - 87
Solving the minimum-weighted coloring problem
by: Massimiliano Caramia, Paolo Dell'Olmo v. 38 i. 2 p. 88 - 101
Robust location problems with pos/neg weights on a tree
by: Rainer E. Burkard, Helidon Dollani v. 38 i. 2 p. 102 - 113
Universally maximum flow with piecewise-constant capacities
by: Lisa Fleischer v. 38 i. 3 p. 115 - 125
Worst-case ratios of networks in the rectilinear plane
by: Ulrich Brenner, Jens Vygen v. 38 i. 3 p. 126 - 139
File distribution in networks with multimedia storage servers
by: Jeong-dong Ryoo, Shivendra S. Panwar v. 38 i. 3 p. 140 - 149
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs
by: Pierre Fraigniaud, Joseph G. Peters v. 38 i. 3 p. 150 - 162
k-Broadcasting in trees
by: Hovhannes A. Harutyunyan, Arthur L. Liestman v. 38 i. 3 p. 163 - 168
A network based model of a promotion-sensitive grocery logistics system
by: Ananth V. Iyer, Jianming Ye v. 38 i. 4 p. 169 - 18
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm
by: Richard D. McBride, John W. Mamer v. 38 i. 4 p. 181 - 188
Low-cost minimum-time line-broadcasting schemes in complete binary trees
by: Amir Averbuch, Iris Gaber, Yehuda Roditty v. 38 i. 4 p. 189 - 193
Maximizing residual flow under an arc destruction
by: Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair v. 38 i. 4 p. 194 - 198
Area efficient layouts of the Batcher sorting networks
by: Shimon Even v. 38 i. 4 p. 199 - 208
The clique partitioning problem: Facets and patching facets
by: Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma v. 38 i. 4 p. 209 - 226

2000

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
by: Luis Gouveia, Pedro Martins v. 35 i. 1 p. 1 - 16
The single allocation problem in the interacting three-hub network
by: Jinhyeon Sohn, Sungsoo Park v. 35 i. 1 p. 17 - 25
Degree-preserving trees
by: Hajo Broersma, Otto Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller v. 35 i. 1 p. 26 - 39
Source-limited inclusive routing: A new paradigm for multicast communication
by: Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng v. 35 i. 1 p. 40 - 55
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
by: Gen-Huey Chen, Jung-Sheng Fu, Jywe-Fei Fang v. 35 i. 1 p. 56 - 69
A general framework for functional networks
by: Enrique Castillo, Angel Cobo, Ruslán Gómez-Nesterkin, Ali S. Hadi v. 35 i. 1 p. 70 - 82
Cluster fault-tolerant routing in star graphs
by: Qian-Ping Gu, Shietung Peng v. 35 i. 1 p. 83 - 90
A truncated primal-infeasible dual-feasible network interior point method
by: L. F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, J. J. Júdice v. 35 i. 2 p. 91 - 108
Network reliability with node failures
by: Shaobin Liu, Kam-Hoi Cheng, Xiaoping Liu v. 35 i. 2 p. 109 - 117
State space partition algorithms for stochastic systems with applications to minimum spanning trees
by: Christos Alexopoulos, Jay A. Jacobson v. 35 i. 2 p. 118 - 138
Orienting split-stars and alternating group graphs
by: Eddie Cheng, Marc J. Lipman v. 35 i. 2 p. 139 - 144
On the performance and feasibility of multicast core selection heuristics
by: Eric Fleury, Yih Huang, Philip K. McKinley v. 35 i. 2 p. 145 - 156
Optimal fault-tolerant networks with a server
by: Sheshayya A. Choudum, S. Sivagurunathan v. 35 i. 2 p. 157 - 160
Cycles in butterfly graphs
by: Shien-Ching Hwang, Gen-Huey Chen v. 35 i. 2 p. 161 - 171
Clustering for faster network simplex pivots
by: David Eppstein v. 35 i. 3 p. 173 - 180
Robust path choice in networks with failures
by: Michael C. Ferris, Andrzej Ruszczynski v. 35 i. 3 p. 181 - 194
The searchlight guarding problem on weighted split graphs and weighted cographs
by: William C. K. Yen, C. Y. Tang v. 35 i. 3 p. 195 - 206
Shortest path routing and fault-tolerant routing on de Bruijn networks
by: Jyh-Wen Mao, Chang-Biau Yang v. 35 i. 3 p. 207 - 215
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
by: Dukwon Kim, Panos M. Pardalos v. 35 i. 3 p. 216 - 222
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
by: Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-in Kim v. 35 i. 3 p. 223 - 232
Construction schemes for fault-tolerant Hamiltonian graphs
by: Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung v. 35 i. 3 p. 233 - 245
Wavelength allocation on trees of rings
by: Xiaotie Deng, Guojun Li, Wenan Zang v. 35 i. 4 p. 248 - 252
Improvement on vertex cover for low-degree graphs
by: Jianer Chen, Lihua Liu, Weijia Jia v. 35 i. 4 p. 253 - 259
Minimizing number of wavelengths in multicast routing trees in WDM networks
by: Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiaohua Jia v. 35 i. 4 p. 260 - 265
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
by: Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita v. 35 i. 4 p. 266 - 273
Orthogonal (g, f)-factorizations in networks
by: Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu v. 35 i. 4 p. 274 - 278
Load-balanced routing in counter rotated SONET rings
by: Peng-Jun Wan, Yuanyuan Yang v. 35 i. 4 p. 279 - 286
Reducing the Steiner problem in four uniform orientations
by: Guo-Hui Lin, Guoliang Xue v. 35 i. 4 p. 287 - 301
The cardinality-constrained shortest path problem in 2-graphs
by: Geir Dahl, Bjørnar Realfsen v. 36 i. 1 p. 1 - 8
A characterization of the two-commodity network design problem
by: S. Trilochan Sastry v. 36 i. 1 p. 9 - 16
Constrained length connectivity and survivable networks
by: Walid Ben-Ameur v. 36 i. 1 p. 17 - 33
On the cycle polytope of a directed graph
by: Egon Balas, Maarten Oosten v. 36 i. 1 p. 34 - 46
Minimizing the complexity of an activity network
by: Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann v. 36 i. 1 p. 47 - 52
New polynomial-time cycle-canceling algorithms for minimum-cost flows
by: P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin v. 36 i. 1 p. 53 - 63
Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree
by: D. DiMarco v. 36 i. 1 p. 64 - 67
A polyhedral study of the asymmetric traveling salesman problem with time windows
by: Norbert Ascheuer, Matteo Fischetti, Martin Grötschel v. 36 i. 2 p. 69 - 79
Efficient modeling of travel in networks with time-varying link speeds
by: Mark E. T. Horn v. 36 i. 2 p. 80 - 90
Embedding interconnection networks in grids via the layered cross product
by: Guy Even, Shimon Even v. 36 i. 2 p. 91 - 95
Impact of topographic information on graph exploration efficiency
by: Petrisor Panaite, Andrzej Pelc v. 36 i. 2 p. 96 - 103
The local Steiner problem in normed planes
by: Konrad J. Swanepoel v. 36 i. 2 p. 104 - 113
Channel assignment and weighted coloring
by: Colin McDiarmid, Bruce A. Reed v. 36 i. 2 p. 114 - 117
Compounding of gossip graphs
by: Guillaume Fertin, Roger Labahn v. 36 i. 2 p. 126 - 137
Tabu search for the Steiner problem in graphs
by: Celso C. Ribeiro, Maurício C. Souza v. 36 i. 2 p. 138 - 146
Minimum-diameter covering problems
by: Esther M. Arkin, Refael Hassin v. 36 i. 3 p. 147 - 155
The graph Voronoi diagram with applications
by: Martin Erwig v. 36 i. 3 p. 156 - 163
On the unilateral (Delta, D*)-problem
by: José Gómez, Eduardo A. Canale, Xavier Muñoz v. 36 i. 3 p. 164 - 171
Approximating multiroot 3-outconnected subgraphs
by: Zeev Nutov v. 36 i. 3 p. 172 - 179
Fault-tolerant routings in chordal ring networks
by: Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá v. 36 i. 3 p. 180 - 190
Low-congested interval routing schemes for hypercubelike networks
by: Serafino Cicerone, Gabriele Di Stefano, Michele Flammini v. 36 i. 3 p. 191 - 201
The full-degree spanning tree problem
by: Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann v. 36 i. 4 p. 203 - 209
Topological expansion of multiple-ring metropolitan area networks
by: Steven Chamberland, Brunilde Sansò v. 36 i. 4 p. 210 - 224
Hamiltonian-laceability of star graphs
by: Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho v. 36 i. 4 p. 225 - 232
An aggregation approach to solving the network p-median problem with link demands
by: Peiwu Zhao, Rajan Batta v. 36 i. 4 p. 233 - 241

1999

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 33 i. 1 p. 1 - 28
Balanced network flows. II. Simple augmentation algorithms
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 33 i. 1 p. 29 - 41
Balanced network flows. III. Strongly polynomial augmentation algorithms
by: Christian Fremuth-Paeger, Dieter Jungnickel v. 33 i. 1 p. 43 - 56
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
by: Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger v. 33 i. 1 p. 57 - 70
Small congestion embedding of graphs into hypercubes
by: Akira Matsubayashi, Shuichi Ueno v. 33 i. 1 p. 71 - 77
Multicriteria network location problems with sum objectives
by: Horst W. Hamacher, Martine Labbé, Stefan Nickel v. 33 i. 2 p. 79 - 92
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation
by: Anna Nagurney, Stavros Siokos v. 33 i. 2 p. 93 - 108
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
by: Ishwar Murthy, Phil K. Seo v. 33 i. 2 p. 109 - 124
Rectilinear full Steiner tree generation
by: Martin Zachariasen v. 33 i. 2 p. 125 - 143
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
by: M. Brazil, D. A. Thomas, J. F. Weng v. 33 i. 2 p. 145 - 155
Super edge connectivity properties of connected edge symmetric graphs
by: Qiaoliang Li, Qiao Li v. 33 i. 2 p. 157 - 159
On diameter of permutation graphs
by: Weizhen Gu v. 33 i. 3 p. 161 - 166
Transmissions in a network with capacities and delays
by: Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis v. 33 i. 3 p. 167 - 174
Pseudo-Gilbert-Steiner trees
by: D. Trietsch, J. F. Weng v. 33 i. 3 p. 175 - 178
All-to-all communication for some wavelength-routed all-optical networks
by: Bruno Beauquier v. 33 i. 3 p. 179 - 187
A note on the bottleneck graph partition problem
by: Bettina Klinz, Gerhard J. Woeginger v. 33 i. 3 p. 189 - 191
An expert system for coherent assessment of probabilities in multigraph models
by: Enrique Castillo, Ali S. Hadi, F. Jubete, Cristina Solares v. 33 i. 3 p. 193 - 206
The probabilistic longest path problem
by: Cécile Murat, Vangelis Th. Paschos v. 33 i. 3 p. 207 - 219
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
by: Yu-Chee Tseng, Yuh-Shyan Chen, Tong-Ying Juang, Chiou-Jyu Chang v. 33 i. 3 p. 221 - 231
Various results on the toughness of graphs
by: Hajo Broersma, Erik Engbers, Huib Trommel v. 33 i. 3 p. 233 - 238
Multidimensional assortment problem with an application
by: Ashish Tripathy, Haldun Süral, Yigal Gerchak v. 33 i. 3 p. 239 - 245
Upper and lower bounds for the average-case complexity of path-search
by: Nicholas Pippenger v. 33 i. 4 p. 249 - 259
Characterizing bit permutation networks
by: Gerard J. Chang, Frank K. Hwang, Li-Da Tong v. 33 i. 4 p. 261 - 267
Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation
by: G. W. Richards, Frank K. Hwang v. 33 i. 4 p. 269 - 291
Strictly nonblocking conference networks using high-dimensional meshes
by: Yi Du, Gerald M. Masson v. 33 i. 4 p. 293 - 308
Deferred-query: An efficient approach for some problems on interval graphs
by: Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw v. 34 i. 1 p. 1 - 10
On the memory overhead of distributed snapshots
by: Lior Shabtay, Adrian Segall v. 34 i. 1 p. 11 - 17
Path problems in networks with vector-valued edge weights
by: Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi v. 34 i. 1 p. 19 - 35
Lower bounds for linear interval routing
by: Tamar Eilam, Shlomo Moran, Shmuel Zaks v. 34 i. 1 p. 37 - 46
Deadlock-free interval routing schemes
by: Michele Flammini v. 34 i. 1 p. 47 - 60
Optimal edge coloring of large graphs
by: J. Gómez, M. Escudero v. 34 i. 1 p. 61 - 65
An optimal algorithm for layered wheel floorplan designs
by: Priyalal Kulasinghe, Saïd Bettayeb v. 34 i. 1 p. 67 - 72
A competitive analysis for retransmission timeout
by: Shlomi Dolev, Michael Kate, Jennifer L. Welch v. 34 i. 1 p. 73 - 80
Optimal tree 3-spanners in directed path graphs
by: Hoàng-Oanh Le, Van Bang Le v. 34 i. 2 p. 81 - 87
An efficient implementation of an algorithm for finding K shortest simple paths
by: Eleni Hadjiconstantinou, Nicos Christofides v. 34 i. 2 p. 88 - 101
Analysis of LP relaxations for multiway and multicut problems
by: Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra v. 34 i. 2 p. 102 - 114
Eccentric graphs
by: Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters v. 34 i. 2 p. 115 - 121
Optimum requirement spanning trees and reliability of tree networks
by: Tsutomu Anazawa, Takayuki Kodera, Masakazu Jimbo v. 34 i. 2 p. 122 - 131
On a condition for obtaining an explicit solution of optimum requirement spanning tree
by: Tsutomu Anazawa v. 34 i. 2 p. 132 - 135
Greedy online algorithms for routing permanent virtual circuits
by: Jessen T. Havill, Weizhen Mao v. 34 i. 2 p. 136 - 153
New large graphs with given degree and diameter six
by: J. Gómez, Ignacio M. Pelayo, Camino Balbuena v. 34 i. 2 p. 154 - 161
A tabu search heuristic for the Steiner Tree Problem
by: Michel Gendreau, Jean-Francois Larochelle, Brunilde Sansò v. 34 i. 2 p. 162 - 172
On crossings, the Crossing Postman Problem, and the Rural Postman Problem
by: Robert S. Garfinkel, Ian R. Webb v. 34 i. 3 p. 173 - 180
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
by: Cees Duin, Stefan Voß v. 34 i. 3 p. 181 - 191
Tenacity of complete graph products and grids
by: Sheshayya A. Choudum, N. Priya v. 34 i. 3 p. 192 - 196
On the superconnectivity and the conditional diameter of graphs and digraphs
by: Angeles Carmona, Josep Fàbrega v. 34 i. 3 p. 197 - 205
Optimal adaptive fault diagnosis for simple multiprocessor systems
by: Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis v. 34 i. 3 p. 206 - 214
Crossing properties of multiterminal cuts
by: Robert F. Easley, David Hartvigsen v. 34 i. 3 p. 215 - 220
Modeling K-coteries by well-covered graphs
by: Masafumi Yamashita, Tsunehiko Kameda v. 34 i. 3 p. 221 - 228
Heuristic and exact algorithms for scheduling aircraft landings
by: Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer v. 34 i. 3 p. 229 - 241
A survey of sequences of central subgraphs
by: Peter J. Slater v. 34 i. 4 p. 244 - 249
Locations on time-varying networks
by: S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel v. 34 i. 4 p. 250 - 257
On Steiner centers and Steiner medians of graphs
by: Ortrud Oellermann v. 34 i. 4 p. 258 - 263
Balance vertices in trees
by: K. Brooks Reid v. 34 i. 4 p. 264 - 271
The subtree center of a tree
by: Juhani Nieminen, Matti Peltola v. 34 i. 4 p. 272 - 278
Properties of edge-deleted distance stable graphs
by: Karen Klemm, Steven J. Winters v. 34 i. 4 p. 279 - 282
A unified approach to network location problems
by: Stefan Nickel, Justo Puerto v. 34 i. 4 p. 283 - 290
Eulerian location problems
by: Gianpaolo Ghiani, Gilbert Laporte v. 34 i. 4 p. 291 - 302
Center, median, and centroid subgraphs
by: Christian Smart, Peter J. Slater v. 34 i. 4 p. 303 - 311
Generalized eccentricity, radius, and diameter in graphs
by: Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart v. 34 i. 4 p. 312 - 319

1998

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete
by: Michael S. Jacobson, André E. Kézdy, Jeno Lehel v. 31 i. 1 p. 1 - 10
A strong lower bound for the Node Weighted Steiner Tree Problem
by: Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand v. 31 i. 1 p. 11 - 17
On capacitated stochastic chain problems in a network
by: L. Ganapathy, Kunhiraman Nair v. 31 i. 1 p. 19 - 27
Tough enough chordal graphs are Hamiltonian
by: Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jeno Lehel v. 31 i. 1 p. 29 - 38
A branch and cut algorithm for the Steiner problem in graphs
by: Abilio Lucena, J. E. Beasley v. 31 i. 1 p. 39 - 59
Reliability analysis of circulant graphs
by: Qiaoliang Li, Qiao Li v. 31 i. 2 p. 61 - 65
Fast collective communication by packets in the postal model
by: Luisa Gargano, Adele A. Rescigno v. 31 i. 2 p. 67 - 79
Location problems with grouped structure of demand: Complexity and algorithms
by: Igor Averbakh, Oded Berman v. 31 i. 2 p. 81 - 92
Minmax-regret robust 1-median location on a tree
by: Bintong Chen, Chin-Shien Lin v. 31 i. 2 p. 93 - 103
Topological properties and algorithms for two-level hypernet networks
by: Hui-Ling Huang, Gen-Huey Chen v. 31 i. 2 p. 105 - 118
Process network synthesis: Problem definition
by: Ferenc Friedler, L. T. Fan, Balázs Imreh v. 31 i. 2 p. 119 - 124
Tools for studying paths and cycles in digraphs
by: Charles Delorme, Oscar Ordaz, D. Quiroz v. 31 i. 2 p. 125 - 148
Flow-dependent networks: Existence and behavior at Steiner points
by: Christopher L. Cox v. 31 i. 3 p. 149 - 156
Edge connectivity between nodes and node-subsets
by: Hiro Ito, Mitsuo Yokoyama v. 31 i. 3 p. 157 - 163
Feasibility in transportation networks with supply eating arcs
by: Shane Dye, Asgeir Tomasgard, Stein W. Wallace v. 31 i. 3 p. 165 - 176
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
by: Andreas Brandstädt, Feodor F. Dragan v. 31 i. 3 p. 177 - 182
Verification of DAG structures in cooperative belief network-based multiagent systems
by: Yang Xiang v. 31 i. 3 p. 183 - 191
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
by: Irina Ioachim, Sylvie Gélinas, François Soumis, Jacques Desrosiers v. 31 i. 3 p. 193 - 204
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
by: Dong X. Shaw, Geon Cho v. 31 i. 4 p. 205 - 216
Uniformly optimally reliable graphs
by: D. Gross, J. T. Saccoman v. 31 i. 4 p. 217 - 225
A new proximal decomposition algorithm for routing in telecommunication networks
by: Philippe Mahey, Adam Ouorou, Larry LeBlanc, Jerome Chifflet v. 31 i. 4 p. 227 - 238
Undirected graphs rearrangeable by 2-length walks
by: Dominique Barth, Petrisor Panaite v. 31 i. 4 p. 239 - 247
Solving the all-pair shortest path query problem on interval and circular-arc graphs
by: Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan v. 31 i. 4 p. 249 - 258
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
by: Hanif D. Sherali, Kaan Ozbay, Shivaram Subramanian v. 31 i. 4 p. 259 - 272
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
by: Uwe H. Suhl, Heinrich Hilbert v. 31 i. 4 p. 273 - 282
Approximating Steiner trees in graphs with restricted weights
by: Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani v. 31 i. 4 p. 283 - 292
Hub network games
by: Darko Skorin-Kapov v. 31 i. 4 p. 293 - 302
Diameter-preserving orientations of the torus
by: Jean-Claude König, David W. Krumme, Emmanuel Lazard v. 32 i. 1 p. 1 - 11
On the chromatic number of disk graphs
by: Ewa Malesinska, Steffen Piskorz, Gerhard Weißenfels v. 32 i. 1 p. 13 - 22
Topological properties of incomplete WK-recursive networks
by: Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh v. 32 i. 1 p. 23 - 45
Compressing cube-connected cycles and butterfly networks
by: Ralf Klasing, Reinhard Lüling, Burkhard Monien v. 32 i. 1 p. 47 - 65
An extended planar algorithm for maximum integral two-flow
by: Raanan Manor, Michal Penn v. 32 i. 1 p. 67 - 76
Routing in asymmetrical multiconnection three-stage Clos networks
by: Yiu Kwok Tham v. 32 i. 2 p. 77 - 83
Proportional lot sizing and scheduling: Some extensions
by: Alf Kimms, Andreas Drexl v. 32 i. 2 p. 85 - 101
Partial characterizations of networks supporting shortest path interval labeling schemes
by: Lata Narayanan, Sunil M. Shende v. 32 i. 2 p. 103 - 113
Max-min partitioning of grid graphs into connected components
by: Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone v. 32 i. 2 p. 115 - 125
Embedding into the rectilinear grid
by: Hans-Jürgen Bandelt, Victor Chepoi v. 32 i. 2 p. 127 - 132
On shortest two-connected Steiner networks with Euclidean distance
by: D. Frank Hsu, Xiao-Dong Hu v. 32 i. 2 p. 133 - 140
On the relationship between dynamic Nash and instantaneous user equilibria
by: Byung-Wook Wie, Roger L. Tobin v. 32 i. 2 p. 141 - 163
Sense of direction: Definitions, properties, and classes
by: Paola Flocchini, Bernard Mans, Nicola Santoro v. 32 i. 3 p. 165 - 180
Fault-tolerant graphs for tori
by: Toshinori Yamada, Shuichi Ueno v. 32 i. 3 p. 181 - 188
How to test a tree
by: Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup v. 32 i. 3 p. 189 - 197
Paired-domination in graphs
by: Teresa W. Haynes, Peter J. Slater v. 32 i. 3 p. 199 - 206
Solving Steiner tree problems in graphs to optimality
by: Thorsten Koch, Alexander Martin v. 32 i. 3 p. 207 - 232
Scheduling in broadcast networks
by: Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney v. 32 i. 4 p. 233 - 253
A polynomial algorithm for the p-centdian problem on a tree
by: Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez v. 32 i. 4 p. 255 - 262
A branch-and-cut algorithm for the undirected selective traveling salesman problem
by: Michel Gendreau, Gilbert Laporte, Frédéric Semet v. 32 i. 4 p. 263 - 273
Constructions of large planar networks with given degree and diameter
by: Michael R. Fellows, Pavol Hell, Karen Seyffarth v. 32 i. 4 p. 275 - 281
Project scheduling with multiple modes: A comparison of exact algorithms
by: Sönke Hartmann, Andreas Drexl v. 32 i. 4 p. 283 - 297
On optimal orientations of Cartesian products of even cycles
by: Khee Meng Koh, Eng Guan Tay v. 32 i. 4 p. 299 - 306
On container length and connectivity in unidirectional hypercubes
by: Jung-Sing Jwo, Tai-Ching Tuan v. 32 i. 4 p. 307 - 317

1997

Multiple message broadcasting in the postal model
by: Amotz Bar-Noy, Shlomo Kipnis v. 29 i. 1 p. 1 - 10
Optimal packet fragmentation and routing in computer networks
by: Ariel Orda, Raphael Rom v. 29 i. 1 p. 11 - 28
Tracking the P-NP boundary for well-covered graphs
by: Ramesh S. Sankaranarayana v. 29 i. 1 p. 29 - 37
Counting small cycles in generalized de Bruijn digraphs
by: Toru Hasunuma, Yukio Shibata v. 29 i. 1 p. 39 - 47
A lower bound for interval routing in general networks
by: Savio S. H. Tse, Francis C. M. Lau v. 29 i. 1 p. 49 - 53
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
by: Matteo Fischetti, Daniele Vigo v. 29 i. 1 p. 55 - 67
On the bisection width of the transposition network
by: Konstantinos Kalpakis, Yaacov Yesha v. 29 i. 1 p. 69 - 76
Balanced graphs and network flows
by: Stephen G. Penrice v. 29 i. 2 p. 77 - 80
A secure voting system on a public network
by: Chin-Chen Chang, Wen-Bin Wu v. 29 i. 2 p. 81 - 87
Efficient path and vertex exchange in steiner tree algorithms
by: Cees Duin, Stefan Voß v. 29 i. 2 p. 89 - 105
The tree center problems and the relationship with the bottleneck knapsack problems
by: Akiyoshi Shioura, Maiko Shigeno v. 29 i. 2 p. 107 - 110
A note on Bertsekas' small-label-first strategy
by: Zhi-Long Chen, Warren B. Powell v. 29 i. 2 p. 111 - 116
Algorithms for computing message delay for wireless networks
by: Hosam M. F. AboElFotoh v. 29 i. 2 p. 117 - 124
Dual algorithms for the shortest path tree problem
by: Stefano Pallottino, Maria Grazia Scutellà v. 29 i. 2 p. 125 - 133
Minimum bandwidth problem for embedding graphs in cycles
by: Yixun Lin v. 29 i. 3 p. 135 - 140
Time-varying shortest path problems with constraints
by: X. Cai, Ton Kloks, C. K. Wong v. 29 i. 3 p. 141 - 150
Minimum-weight cycles in 3-separable graphs
by: Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner v. 29 i. 3 p. 151 - 160
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
by: Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman v. 29 i. 3 p. 161 - 171
A GRASP for graph planarization
by: Mauricio G. C. Resende, Celso C. Ribeiro v. 29 i. 3 p. 173 - 189
Edge coloring a k-tree into two smaller trees
by: Dilip Chhajed v. 29 i. 4 p. 191 - 194
Reliability analysis of replicated and-or graphs
by: De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi v. 29 i. 4 p. 195 - 203
Restricted delivery problems on a network
by: Esther M. Arkin, Refael Hassin, Limor Klein v. 29 i. 4 p. 205 - 216
An infinite class of reach-preservable graphs
by: Daniel Gagliardi, Marty Lewinter v. 29 i. 4 p. 217 - 218
Layered cross product - A technique to construct interconnection networks
by: Shimon Even, Ami Litman v. 29 i. 4 p. 219 - 223
A computationally efficient method for nonlinear multicommodity network flow problems
by: Shin-Yeu Lin, Ch'i-Hsin Lin v. 29 i. 4 p. 225 - 244
Constructing a bipartite graph of maximum connectivity with prescribed degrees
by: Takao Asano v. 29 i. 4 p. 245 - 263
On optimal orientations of Cartesian products of even cycles and paths
by: Khee Meng Koh, Eng Guan Tay v. 30 i. 1 p. 1 - 7
State space partitioning methods for stochastic shortest path problems
by: Christos Alexopoulos v. 30 i. 1 p. 9 - 21
Maximizing spanning trees in almost complete graphs
by: Bryan Gilbert, Wendy J. Myrvold v. 30 i. 1 p. 23 - 30
Locating replicas of a database on a network
by: S. Louis Hakimi, Edward F. Schmeichel v. 30 i. 1 p. 31 - 36
Linear time algorithms for computing the most reliable source on an unreliable tree network
by: Guoliang Xue v. 30 i. 1 p. 37 - 45
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
by: Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski v. 30 i. 1 p. 47 - 56
Commodity family extended formulations of uncapacitated fixed charge network flow problems
by: Peh H. Ng, Ronald L. Rardin v. 30 i. 1 p. 57 - 71
Introduction to graph theory
by: Kathryn Fraughnaugh v. 30 i. 1 p. 73 - 73
Optimality of consecutive and nested tree partitions
by: Gerard J. Chang, Frank K. Hwang v. 30 i. 2 p. 75 - 80
Exact reliabilities of most reliable double-loop networks
by: Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu v. 30 i. 2 p. 81 - 90
A note on genetic algorithms for degree-constrained spanning tree problems
by: Gengui Zhou, Mitsuo Gen v. 30 i. 2 p. 91 - 95
Maximizing spanning trees in almost complete graphs
by: Bryan Gilbert, Wendy J. Myrvold v. 30 i. 2 p. 97 - 104
A tabu search heuristic for periodic and multi-depot vehicle routing problems
by: Jean-François Cordeau, Michel Gendreau, Gilbert Laporte v. 30 i. 2 p. 105 - 119
r-domination problems on homogeneously orderable graphs
by: Feodor F. Dragan, Falk Nicolai v. 30 i. 2 p. 121 - 131
The node multiterminal cut polyhedron
by: Bo Yu, Joseph Cheriyan v. 30 i. 2 p. 133 - 148
Euclidean Steiner minimum trees: An improved exact algorithm
by: Pawel Winter, Martin Zachariasen v. 30 i. 3 p. 149 - 166
The vertex-face total chromatic number of Halin graphs
by: Peter Che Bor Lam, Zhongfu Zhang v. 30 i. 3 p. 167 - 170
The assignment problem with external interactions
by: Russ J. Vander Wiel, Nikolaos V. Sahinidis v. 30 i. 3 p. 171 - 185
Mean eccentricities of de Bruijn networks
by: Jean-Claude Bermond, Zhen Liu, Michel Syska v. 30 i. 3 p. 187 - 203
De Bruijn and Kautz bus networks
by: Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan v. 30 i. 3 p. 205 - 218
On the Rabin number problem
by: Dyi-Rong Duh, Gen-Huey Chen v. 30 i. 3 p. 219 - 230
The structure of max lambda-min m+1 graphs used in the design of reliable networks
by: Guifang Wang, Lianzhu Zhang v. 30 i. 4 p. 231 - 242
A characterization of 3-Steiner distance hereditary graphs
by: D. P. Day, Ortrud Oellermann, Henda C. Swart v. 30 i. 4 p. 243 - 253
Graphs with given connectivity properties
by: Serge Lawrencenko, Qiang Luo v. 30 i. 4 p. 255 - 261
The polytope of block diagonal matrices and complete bipartite partitionings
by: Yves Crama, Maarten Oosten v. 30 i. 4 p. 263 - 282
Link-disjoint embedding of complete binary trees in meshes
by: Sang-Kyu Lee, Hyeong-Ah Choi v. 30 i. 4 p. 283 - 292
(K, j)-domination and (K, j)-reliability
by: Jose Rodriguez, Lorenzo Traldi v. 30 i. 4 p. 293 - 306

1996

Embedding grids into grids: Techniques for large compression ratios
by: John A. Ellis v. 27 i. 1 p. 1 - 17
Node fault tolerance in graphs
by: Frank Harary, John P. Hayes v. 27 i. 1 p. 19 - 23
A feedback strategy for periodic network flows
by: Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich v. 27 i. 1 p. 25 - 34
A comparative study of doubly connected directed topologies for LANs and MANs
by: Tein Y. Chung, Dharma P. Agrawal, Suresh Rai, Tzau J. Chung v. 27 i. 1 p. 35 - 51
Components and graph automorphisms of standard 2 x 2-switch banyan networks
by: Eckehart Hotzel v. 27 i. 1 p. 53 - 71
A modified Melzak procedure for computing node-weighted Steiner trees
by: Alice Underwood v. 27 i. 1 p. 73 - 79
Package routing in transportation networks with fixed vehicle schedules
by: Lloyd Greenwald, Thomas Dean v. 27 i. 1 p. 81 - 93
An optimal algorithm for the mixed Chinese postman problem
by: Yves Nobert, Jean-Claude Picard v. 27 i. 2 p. 97 - 108
Network synthesis with few edges
by: Kalyan T. Talluri v. 27 i. 2 p. 109 - 115
Disconnecting sets in single and two-terminal-pair networks
by: Frieda Granot, Michal Penn, Maurice Queyranne v. 27 i. 2 p. 117 - 123
Uniformly least reliable graphs
by: L. Petingi, J. T. Saccoman, L. Schoppmann v. 27 i. 2 p. 125 - 131
Stochastic shortest path problems with recourse
by: George H. Polychronopoulos, John N. Tsitsiklis v. 27 i. 2 p. 133 - 143
Transmitting on various network topologies
by: Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung v. 27 i. 2 p. 145 - 157
Circuit-switched row-column broadcasting in torus and mesh networks
by: Ju-Young Lee Park, Hyeong-Ah Choi v. 27 i. 2 p. 159 - 167
A linear time algorithm to recognize circular permutation graphs
by: R. Sritharan v. 27 i. 3 p. 171 - 174
Complexity of spanning tree problems with leaf-dependent objectives
by: Mauro Dell'Amico, Martine Labbé, Francesco Maffioli v. 27 i. 3 p. 175 - 181
Broadcasting with universal lists
by: Krzysztof Diks, Andrzej Pelc v. 27 i. 3 p. 183 - 196
Star-factors and k-bounded total domination
by: Georg Gunther, Bert Hartnell, Douglas F. Rall v. 27 i. 3 p. 197 - 201
Optimally edge fault-tolerant trees
by: Hung-Kuei Ku, John P. Hayes v. 27 i. 3 p. 203 - 214
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph
by: Prakash Mirchandani v. 27 i. 4 p. 215 - 217
A single facility location problem on a tree with unreliable edges
by: Emanuel Melachrinoudis, Mary E. Helander v. 27 i. 4 p. 219 - 237
Minimum gossip bus networks
by: Pierre Fraigniaud, Christian Laforest v. 27 i. 4 p. 239 - 251
An addendum to the most vital edges of matching in a bipartite graph
by: A. Volgenant v. 27 i. 4 p. 253 - 253
A response to Volgenant's Addendum on the most vital edges
by: Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung v. 27 i. 4 p. 255 - 255
Minimum covering criterion for obnoxious facility location on a network
by: Oded Berman, Zvi Drezner, George O. Wesolowsky v. 28 i. 1 p. 1 - 5
2-diameter of de Bruijn graphs
by: Qiao Li, Dominique Sotteau, Junming Xu v. 28 i. 1 p. 7 - 14
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
by: Si-Qing Zheng v. 28 i. 1 p. 15 - 19
Routing algorithms for switching networks with probabilistic traffic
by: Geng Lin, Nicholas Pippenger v. 28 i. 1 p. 21 - 29
A new method for efficient symbolic propagation in discrete Bayesian networks
by: Enrique Castillo, José Manuel Gutiérrez, Ali S. Hadi v. 28 i. 1 p. 31 - 43
Minimal rankings
by: J. Ghoshal, Renu Laskar, D. Pillone v. 28 i. 1 p. 45 - 53
Topological network design of state-dependent queueing networks
by: J. MacGregor Smith v. 28 i. 1 p. 55 - 68
Divide-and-conquer algorithms for graph-layout problems
by: Ram Swaminathan v. 28 i. 2 p. 69 - 85
Minimizing message complexity of partially replicated data on hypercubes
by: Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha v. 28 i. 2 p. 87 - 95
On the connectivity and the conditional diameter of graphs and digraphs
by: Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol v. 28 i. 2 p. 97 - 105
Network decomposition of general financial equilibria with transaction costs
by: Anna Nagurney, June Dong v. 28 i. 2 p. 107 - 116
Solving the dynamic facility location problem
by: Pierre Chardaire, Alain Sutter, Marie-Christine Costa v. 28 i. 2 p. 117 - 124
Vulnerability of scheduled networks and a generalization of Menger's Theorem
by: Kenneth A. Berman v. 28 i. 3 p. 125 - 134
Cyclic gossiping times for some classes of graphs
by: James A. Knisely, Renu Laskar v. 28 i. 3 p. 135 - 141
Fault-tolerant broadcasting and gossiping in communication networks
by: Andrzej Pelc v. 28 i. 3 p. 143 - 156
MLH: A hierarchical hypercube network
by: Mokhtar Aboelaze v. 28 i. 3 p. 157 - 165
On the location of a tree-shaped facility
by: Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward v. 28 i. 3 p. 167 - 175
Optimal routings in communication networks with linearly bounded forwarding index
by: Yannis Manoussakis, Zsolt Tuza v. 28 i. 4 p. 177 - 180
On eccentric vertices in graphs
by: Gary Chartrand, Michelle Schultz, Steven J. Winters v. 28 i. 4 p. 181 - 186
An approximation scheme for some Steiner tree problems in the plane
by: Lusheng Wang, Tao Jiang v. 28 i. 4 p. 187 - 193
Routing in quasi torus networks
by: Yao-Min Chen, Galen H. Sasaki v. 28 i. 4 p. 195 - 209
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
by: B. Kalantari, Gholamreza B. Khosrovshahi v. 28 i. 4 p. 211 - 219
The bottleneck graph partition problem
by: Dorit S. Hochbaum, Anu Pathria v. 28 i. 4 p. 221 - 225