default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam129.bht:"
download as .bib file
@article{DBLP:journals/dam/Bar-NoyGH03,
author = {Amotz Bar{-}Noy and
Juan A. Garay and
Amir Herzberg},
title = {Sharing Video on Demand},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {3--30},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00231-7},
doi = {10.1016/S0166-218X(02)00231-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-NoyGH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Barriere03,
author = {Lali Barri{\`{e}}re},
title = {Symmetry properties of chordal rings of degree 3},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {211--232},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00569-3},
doi = {10.1016/S0166-218X(02)00569-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Barriere03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Benczur03,
author = {Andr{\'{a}}s A. Bencz{\'{u}}r},
title = {Pushdown-reduce: an algorithm for connectivity augmentation and poset
covering problems},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {233--262},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00570-X},
doi = {10.1016/S0166-218X(02)00570-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Benczur03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BermondIFP03,
author = {Jean{-}Claude Bermond and
Miriam Di Ianni and
Michele Flammini and
Stephane Perennes},
title = {Deadlock Prevention by Acyclic Orientations},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {31--47},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00232-9},
doi = {10.1016/S0166-218X(02)00232-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BermondIFP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonuccelliM03,
author = {Maurizio A. Bonuccelli and
Alberto Marchetti{-}Spaccamela},
title = {Foreword},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {1},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00230-5},
doi = {10.1016/S0166-218X(02)00230-5},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BonuccelliM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bosikova03,
author = {Martina Bos{\'{\i}}kov{\'{a}}},
title = {Minimum 3-geodetically connected graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {263--283},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00591-7},
doi = {10.1016/S0166-218X(02)00591-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bosikova03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BourasKPS03,
author = {Christos Bouras and
Vaggelis Kapoulas and
Grammati E. Pantziou and
Paul G. Spirakis},
title = {Competitive Video on Demand Schedulers for Popular Movies},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {49--61},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00233-0},
doi = {10.1016/S0166-218X(02)00233-0},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BourasKPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtD03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan},
title = {On linear and circular structure of (claw, net)-free graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {285--303},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00571-1},
doi = {10.1016/S0166-218X(02)00571-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtM03,
author = {Andreas Brandst{\"{a}}dt and
Raffaele Mosca},
title = {On variations of P\({}_{\mbox{4}}\)-sparse graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {521--532},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00180-X},
doi = {10.1016/S0166-218X(03)00180-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DankelmannO03,
author = {Peter Dankelmann and
Ortrud Oellermann},
title = {Bounds on the average connectivity of a graph},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {305--318},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00572-3},
doi = {10.1016/S0166-218X(02)00572-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DankelmannO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DejterS03,
author = {Italo J. Dejter and
Oriol Serra},
title = {Efficient dominating sets in Cayley graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {319--328},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00573-5},
doi = {10.1016/S0166-218X(02)00573-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DejterS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DingC03,
author = {Guoli Ding and
Peter P. Chen},
title = {Generating r-regular graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {329--343},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00593-0},
doi = {10.1016/S0166-218X(02)00593-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DingC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyeST03,
author = {Shane Dye and
Leen Stougie and
Asgeir Tomasgard},
title = {Approximation Algorithms and Relaxations for a Service Provision Problem
on a Telecommunication Network},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {63--81},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00234-2},
doi = {10.1016/S0166-218X(02)00234-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyeST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FaragoSS03,
author = {Andr{\'{a}}s Farag{\'{o}} and
{\'{A}}ron Szentesi and
Bal{\'{a}}zs Szviatovszki},
title = {Inverse Optimization in High-speed Networks},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {83--98},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00235-4},
doi = {10.1016/S0166-218X(02)00235-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FaragoSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FominG03,
author = {Fedor V. Fomin and
Petr A. Golovach},
title = {Interval degree and bandwidth of a graph},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {345--359},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00574-7},
doi = {10.1016/S0166-218X(02)00574-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FominG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GiaroJM03,
author = {Krzysztof Giaro and
Robert Janczewski and
Michal Malafiejski},
title = {The complexity of the T-coloring problem for graphs with small degree},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {361--369},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00576-0},
doi = {10.1016/S0166-218X(02)00576-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GiaroJM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GiaroJM03a,
author = {Krzysztof Giaro and
Robert Janczewski and
Michal Malafiejski},
title = {A polynomial algorithm for finding T-span of generalized cacti},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {371--382},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00575-9},
doi = {10.1016/S0166-218X(02)00575-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GiaroJM03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoldschmidtLO03,
author = {Olivier Goldschmidt and
Alexandre Laugier and
Eli V. Olinick},
title = {{SONET/SDH} Ring Assignment with Capacity Constraints},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {99--128},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00236-6},
doi = {10.1016/S0166-218X(02)00236-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GoldschmidtLO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuoZ03,
author = {Xiaofeng Guo and
Fuji Zhang},
title = {Planar k-cycle resonant graphs with k=1, 2},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {383--397},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00577-2},
doi = {10.1016/S0166-218X(02)00577-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuoZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GutinVY03,
author = {Gregory Z. Gutin and
Alek Vainshtein and
Anders Yeo},
title = {Domination analysis of combinatorial optimization problems},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {513--520},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00359-7},
doi = {10.1016/S0166-218X(03)00359-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GutinVY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GutinY03,
author = {Gregory Z. Gutin and
Anders Yeo},
title = {Upper bounds on {ATSP} neighborhood size},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {533--538},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00181-1},
doi = {10.1016/S0166-218X(03)00181-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GutinY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HaanpaaO03,
author = {Harri Haanp{\"{a}}{\"{a}} and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {Classification of whist tournaments with up to 12 players},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {399--407},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00578-4},
doi = {10.1016/S0166-218X(02)00578-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HaanpaaO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HarmsH03,
author = {Janelle J. Harms and
Chenjiang Hu},
title = {Physical Network Design to Facilitate Capacity Reallocation},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {129--153},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00237-8},
doi = {10.1016/S0166-218X(02)00237-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HarmsH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HonkalaKL03,
author = {Iiro S. Honkala and
Mark G. Karpovsky and
Simon Litsyn},
title = {Cycles identifying vertices and edges in binary hypercubes and 2-dimensional
tori},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {409--419},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00579-6},
doi = {10.1016/S0166-218X(02)00579-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HonkalaKL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuangHM03,
author = {Hua{-}Min Huang and
Frank K. Hwang and
Jian{-}Feng Ma},
title = {Using transforming matrices to generate {DNA} clone grids},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {421--431},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00595-4},
doi = {10.1016/S0166-218X(02)00595-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HuangHM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KarunoN03,
author = {Yoshiyuki Karuno and
Hiroshi Nagamochi},
title = {2-Approximation algorithms for the multi-vehicle scheduling problem
on a path with release and handling times},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {433--447},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00596-6},
doi = {10.1016/S0166-218X(02)00596-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KarunoN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KlazvarV03,
author = {Sandi Klavzar and
Aleksander Vesel},
title = {Computing graph invariants on rotagraphs using dynamic algorithm approach:
the case of (2, 1)-colorings and independence numbers},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {449--460},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00597-8},
doi = {10.1016/S0166-218X(02)00597-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KlazvarV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kolliopoulos03,
author = {Stavros G. Kolliopoulos},
title = {Approximating covering integer programs with multiplicity constraints},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {461--473},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00598-X},
doi = {10.1016/S0166-218X(02)00598-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kolliopoulos03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ManninoS03,
author = {Carlo Mannino and
Antonio Sassano},
title = {An Enumerative Algorithm for the Frequency Assignment Problem},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {155--169},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00239-1},
doi = {10.1016/S0166-218X(02)00239-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ManninoS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaoN03,
author = {Weizhen Mao and
David M. Nicol},
title = {On k-ary n-cubes: Theory and Applications},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {171--193},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00238-X},
doi = {10.1016/S0166-218X(02)00238-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MaoN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NagamochiI03,
author = {Hiroshi Nagamochi and
Toshimasa Ishii},
title = {On the minimum local-vertex-connectivity augmentation in graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {475--486},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00580-2},
doi = {10.1016/S0166-218X(02)00580-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NagamochiI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Nakamura03,
author = {Masataka Nakamura},
title = {Excluded-minor characterizations of antimatroids arisen from posets
and graph searches},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {487--498},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00581-4},
doi = {10.1016/S0166-218X(02)00581-4},
timestamp = {Mon, 26 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Nakamura03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OReillyS03,
author = {Una{-}May O'Reilly and
Nicola Santoro},
title = {Tight Bounds for Synchronous Communication of Information Using Bits,
Silence},
journal = {Discret. Appl. Math.},
volume = {129},
number = {1},
pages = {195--209},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00240-8},
doi = {10.1016/S0166-218X(02)00240-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/OReillyS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OhC03,
author = {Eunseuk Oh and
Jianer Chen},
title = {On strong Menger-connectivity of star graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {499--511},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00600-5},
doi = {10.1016/S0166-218X(02)00600-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OhC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Rizzi03,
author = {Romeo Rizzi},
title = {A simple minimum T-cut algorithm},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {539--544},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00182-3},
doi = {10.1016/S0166-218X(03)00182-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Rizzi03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Wierman03,
author = {John C. Wierman},
title = {Pairs of graphs with site and bond percolation critical probabilities
in opposite orders},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {545--548},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00183-5},
doi = {10.1016/S0166-218X(03)00183-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Wierman03.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.
retrieved on 2025-03-13 13:11 CET 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:
