Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam100.bht:"
download as .bib file
@article{DBLP:journals/dam/Bar-NoyS00,
author = {Amotz Bar{-}Noy and
Shlomo Kipnis and
Baruch Schieber},
title = {Optimal multiple message broadcasting in telephone-like communication
systems},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {1--15},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00155-9},
doi = {10.1016/S0166-218X(99)00155-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-NoyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangZ00,
author = {Gerard J. Chang and
Xuding Zhu},
title = {Pseudo-Hamiltonian-connected graphs},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {145--153},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00181-X},
doi = {10.1016/S0166-218X(99)00181-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChangZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Damanik00,
author = {David Damanik},
title = {Local symmetries in the period-doubling sequence},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {115--121},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00199-7},
doi = {10.1016/S0166-218X(99)00199-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Damanik00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DellAmicoT00,
author = {Mauro Dell'Amico and
Paolo Toth},
title = {Algorithms and codes for dense assignment problems: the state of the
art},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {17--48},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00172-9},
doi = {10.1016/S0166-218X(99)00172-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DellAmicoT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DowneyFR00,
author = {Rodney G. Downey and
Michael R. Fellows and
Venkatesh Raman},
title = {The complexity of irredundant sets parameterized by size},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {155--167},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00185-7},
doi = {10.1016/S0166-218X(99)00185-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DowneyFR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fujishige00,
author = {Satoru Fujishige},
title = {A laminarity property of the polyhedron described by a weakly posi-modular
set function},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {123--126},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00198-5},
doi = {10.1016/S0166-218X(99)00198-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Fujishige00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Gavalec00,
author = {Martin Gavalec},
title = {Computing orbit period in max-min algebra},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {49--65},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00174-2},
doi = {10.1016/S0166-218X(99)00174-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Gavalec00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GranotGZ00,
author = {Daniel Granot and
Frieda Granot and
Weiping R. Zhu},
title = {Naturally submodular digraphs and forbidden digraph configurations},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {67--84},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00167-5},
doi = {10.1016/S0166-218X(99)00167-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GranotGZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuT00,
author = {Qian{-}Ping Gu and
Hisao Tamaki},
title = {Multicolor routing in the undirected hypercube},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {169--181},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00189-4},
doi = {10.1016/S0166-218X(99)00189-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuruswamiR00,
author = {Venkatesan Guruswami and
C. Pandu Rangan},
title = {Algorithmic aspects of clique-transversal and clique-independent sets},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {183--202},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00159-6},
doi = {10.1016/S0166-218X(99)00159-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuruswamiR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KovacsL00,
author = {Tomas Kovacs and
Andrzej Lingas},
title = {Maximum packing for biconnected outerplanar graphs},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {85--94},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00176-6},
doi = {10.1016/S0166-218X(99)00176-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KovacsL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kravchenko00,
author = {Svetlana A. Kravchenko},
title = {On the complexity of minimizing the number of late jobs in unit time
open shop},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {127--132},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00202-4},
doi = {10.1016/S0166-218X(99)00202-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kravchenko00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeHT00,
author = {Chung{-}Yee Lee and
Yong He and
Guochun Tang},
title = {A note on "parallel machine scheduling with non-simultaneous machine
available time"},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {133--135},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00201-2},
doi = {10.1016/S0166-218X(99)00201-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeHT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NaorOP00,
author = {Joseph Naor and
Ariel Orda and
Yael Petruschka},
title = {Dynamic storage allocation with known durations},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {203--213},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00175-4},
doi = {10.1016/S0166-218X(99)00175-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NaorOP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RaschleS00,
author = {Thomas Raschle and
Klaus Simon},
title = {On the P4-components of graphs},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {215--235},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00114-6},
doi = {10.1016/S0166-218X(99)00114-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RaschleS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ResendePP00,
author = {Mauricio G. C. Resende and
Leonidas S. Pitsoulis and
Panos M. Pardalos},
title = {Fortran subroutines for computing approximate solutions of weighted
{MAX-SAT} problems using {GRASP}},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {95--113},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00171-7},
doi = {10.1016/S0166-218X(99)00171-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ResendePP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Salazar00,
author = {Juan Jos{\'{e}} Salazar},
title = {A note on the generalized steiner tree polytope},
journal = {Discret. Appl. Math.},
volume = {100},
number = {1-2},
pages = {137--144},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00200-0},
doi = {10.1016/S0166-218X(99)00200-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Salazar00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-05 12:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
