Search dblp for Publications

export results for "toc:db/journals/dam/dam108.bht:"

 download as .bib file

@article{DBLP:journals/dam/AnstreicherFLW01,
  author       = {Kurt M. Anstreicher and
                  Marcia Fampa and
                  Jon Lee and
                  Joy Williams},
  title        = {Maximum-entropy remote sampling},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {211--226},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00217-1},
  doi          = {10.1016/S0166-218X(00)00217-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AnstreicherFLW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BrandstadtL01,
  author       = {Andreas Brandst{\"{a}}dt and
                  Vadim V. Lozin},
  title        = {A note on alpha-redundant vertices in graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {301--308},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00239-0},
  doi          = {10.1016/S0166-218X(00)00239-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BrandstadtL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ButlerDYS01,
  author       = {Jon T. Butler and
                  Gerhard W. Dueck and
                  Svetlana N. Yanushkevich and
                  Vlad P. Shmerko},
  title        = {On the number of generators for transeunt triangles},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {309--316},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00240-7},
  doi          = {10.1016/S0166-218X(00)00240-7},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/ButlerDYS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CiceroneS01,
  author       = {Serafino Cicerone and
                  Gabriele Di Stefano},
  title        = {Graphs with bounded induced distance},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {3--21},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00227-4},
  doi          = {10.1016/S0166-218X(00)00227-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CiceroneS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CourcelleMR01,
  author       = {Bruno Courcelle and
                  Johann A. Makowsky and
                  Udi Rotics},
  title        = {On the fixed parameter complexity of graph enumeration problems definable
                  in monadic second-order logic},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {23--52},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00221-3},
  doi          = {10.1016/S0166-218X(00)00221-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CourcelleMR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Damaschke01,
  author       = {Peter Damaschke},
  title        = {Minus domination in small-degree graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {53--64},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00219-5},
  doi          = {10.1016/S0166-218X(00)00219-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Damaschke01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FariaFN01,
  author       = {Lu{\'{e}}rbio Faria and
                  Celina M. H. de Figueiredo and
                  Candido Ferreira Xavier de Mendon{\c{c}}a Neto},
  title        = {{SPLITTING} {NUMBER} is NP-complete},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {65--83},
  year         = {2001},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FariaFN01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FeketeK01,
  author       = {S{\'{a}}ndor P. Fekete and
                  Jana Kremer},
  title        = {Tree spanners in planar graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {85--103},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00226-2},
  doi          = {10.1016/S0166-218X(00)00226-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FeketeK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HanLS01,
  author       = {Yijie Han and
                  Weifa Liang and
                  Xiaojun Shen},
  title        = {Very fast parallel algorithms for approximate edge coloring},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {227--238},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(99)00190-0},
  doi          = {10.1016/S0166-218X(99)00190-0},
  timestamp    = {Fri, 28 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/HanLS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Handke01,
  author       = {Dagmar Handke},
  title        = {Independent tree spanners: fault-tolerant spanning trees with constant
                  distance guarantees},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {105--127},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00223-7},
  doi          = {10.1016/S0166-218X(00)00223-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Handke01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HanenM01,
  author       = {Claire Hanen and
                  Alix Munier},
  title        = {An approximation algorithm for scheduling dependent tasks on m processors
                  with small communication delays},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {239--257},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00179-7},
  doi          = {10.1016/S0166-218X(00)00179-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HanenM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HromkovicS01,
  author       = {Juraj Hromkovic and
                  Ondrej S{\'{y}}kora},
  title        = {Preface},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {1--2},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00218-3},
  doi          = {10.1016/S0166-218X(00)00218-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HromkovicS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KernP01,
  author       = {Walter Kern and
                  Dani{\"{e}}l Paulusma},
  title        = {The new {FIFA} rules are hard: complexity aspects of sports competitions},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {317--323},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00241-9},
  doi          = {10.1016/S0166-218X(00)00241-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KernP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KranakisKMSU01,
  author       = {Evangelos Kranakis and
                  Danny Krizanc and
                  Anil Maheshwari and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Jorge Urrutia},
  title        = {Ray shooting from convex ranges},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {259--267},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00180-3},
  doi          = {10.1016/S0166-218X(00)00180-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KranakisKMSU01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KrumkeMNRW01,
  author       = {Sven Oliver Krumke and
                  Madhav V. Marathe and
                  Hartmut Noltemeier and
                  S. S. Ravi and
                  Hans{-}Christoph Wirth},
  title        = {Upgrading bottleneck constrained forests},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {129--142},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00222-5},
  doi          = {10.1016/S0166-218X(00)00222-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KrumkeMNRW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/LeeW01,
  author       = {Jon Lee and
                  Dan Wilson},
  title        = {Polyhedral methods for piecewise-linear functions {I:} the lambda
                  method},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {269--285},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00216-X},
  doi          = {10.1016/S0166-218X(00)00216-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LeeW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MitranaS01,
  author       = {Victor Mitrana and
                  Ralf Stiebe},
  title        = {Extended finite automata over groups},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {287--300},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00200-6},
  doi          = {10.1016/S0166-218X(00)00200-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MitranaS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/RottgerS01,
  author       = {Markus R{\"{o}}ttger and
                  Ulf{-}Peter Schroeder},
  title        = {Efficient embeddings of grids into grids},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {143--173},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00224-9},
  doi          = {10.1016/S0166-218X(00)00224-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RottgerS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ShahrokhiS01,
  author       = {Farhad Shahrokhi and
                  L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
  title        = {Constructing integral uniform flows in symmetric networks with application
                  to the edge-forwarding index problem},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {175--191},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00228-6},
  doi          = {10.1016/S0166-218X(00)00228-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ShahrokhiS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/TalamoV01,
  author       = {Maurizio Talamo and
                  Paola Vocca},
  title        = {Representing graphs implicitly using almost optimal space},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {193--210},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00225-0},
  doi          = {10.1016/S0166-218X(00)00225-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/TalamoV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Woeginger01,
  author       = {Gerhard J. Woeginger},
  title        = {A note on the depth function of combinatorial optimization problems},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {325--328},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00242-0},
  doi          = {10.1016/S0166-218X(00)00242-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Woeginger01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Zhang01,
  author       = {Guochuan Zhang},
  title        = {An on-line bin-batching problem},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {3},
  pages        = {329--333},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00243-2},
  doi          = {10.1016/S0166-218X(00)00243-2},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Zhang01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.