Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 129
Volume 129, Number 1, 15 June 2003
- Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela:
Foreword. 1 - Amotz Bar-Noy, Juan A. Garay, Amir Herzberg
:
Sharing Video on Demand. 3-30 - Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations. 31-47 - Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis:
Competitive Video on Demand Schedulers for Popular Movies. 49-61 - Shane Dye, Leen Stougie, Asgeir Tomasgard:
Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network. 63-81 - András Faragó, Áron Szentesi, Balázs Szviatovszki:
Inverse Optimization in High-speed Networks. 83-98 - Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick:
SONET/SDH Ring Assignment with Capacity Constraints. 99-128 - Janelle J. Harms, Chenjiang Hu:
Physical Network Design to Facilitate Capacity Reallocation. 129-153 - Carlo Mannino, Antonio Sassano:
An Enumerative Algorithm for the Frequency Assignment Problem. 155-169 - Weizhen Mao, David M. Nicol:
On k-ary n-cubes: Theory and Applications. 171-193 - Una-May O'Reilly, Nicola Santoro:
Tight Bounds for Synchronous Communication of Information Using Bits, Silence. 195-209
Volume 129, Number 2-3, 1 August 2003
- Lali Barrière:
Symmetry properties of chordal rings of degree 3. 211-232 - András A. Benczúr:
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. 233-262 - Martina Bosíková:
Minimum 3-geodetically connected graphs. 263-283 - Andreas Brandstädt, Feodor F. Dragan:
On linear and circular structure of (claw, net)-free graphs. 285-303 - Peter Dankelmann, Ortrud Oellermann:
Bounds on the average connectivity of a graph. 305-318 - Italo J. Dejter, Oriol Serra:
Efficient dominating sets in Cayley graphs. 319-328 - Guoli Ding, Peter P. Chen:
Generating r-regular graphs. 329-343 - Fedor V. Fomin, Petr A. Golovach:
Interval degree and bandwidth of a graph. 345-359 - Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree. 361-369 - Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti. 371-382 - Xiaofeng Guo, Fuji Zhang:
Planar k-cycle resonant graphs with k=1, 2. 383-397 - Harri Haanpää, Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players. 399-407 - Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. 409-419 - Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma:
Using transforming matrices to generate DNA clone grids. 421-431 - Yoshiyuki Karuno, Hiroshi Nagamochi:
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. 433-447 - Sandi Klavzar, Aleksander Vesel:
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. 449-460 - Stavros G. Kolliopoulos:
Approximating covering integer programs with multiplicity constraints. 461-473 - Hiroshi Nagamochi, Toshimasa Ishii:
On the minimum local-vertex-connectivity augmentation in graphs. 475-486 - M. Nakamura:
Excluded-minor characterizations of antimatroids arisen from posets and graph searches. 487-498 - Eunseuk Oh, Jianer Chen:
On strong Menger-connectivity of star graphs. 499-511 - Gregory Z. Gutin, Alek Vainshtein, Anders Yeo:
Domination analysis of combinatorial optimization problems. 513-520 - Andreas Brandstädt, Raffaele Mosca:
On variations of P4-sparse graphs. 521-532 - Gregory Z. Gutin, Anders Yeo:
Upper bounds on ATSP neighborhood size. 533-538 - Romeo Rizzi:
A simple minimum T-cut algorithm. 539-544 - John C. Wierman:
Pairs of graphs with site and bond percolation critical probabilities in opposite orders. 545-548
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.
last updated on 2024-05-10 19:50 CEST 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:
