Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/AbbasS00,
  author       = {Nesrine Abbas and
                  Lorna K. Stewart},
  title        = {Biconvex graphs: ordering and algorithms},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {1--19},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00217-6},
  doi          = {10.1016/S0166-218X(99)00217-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AbbasS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AvrielPS00,
  author       = {Mordecai Avriel and
                  Michal Penn and
                  Naomi Shpirer},
  title        = {Container ship stowage problem: complexity and connection to the coloring
                  of circle graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {271--279},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00245-0},
  doi          = {10.1016/S0166-218X(99)00245-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AvrielPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Baptiste00,
  author       = {Philippe Baptiste},
  title        = {Scheduling equal-length jobs on identical parallel machines},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {21--32},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00238-3},
  doi          = {10.1016/S0166-218X(99)00238-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Baptiste00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BilbaoE00,
  author       = {Jes{\'{u}}s Mario Bilbao and
                  Paul H. Edelman},
  title        = {The Shapley value on convex geometries},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {33--40},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00218-8},
  doi          = {10.1016/S0166-218X(99)00218-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BilbaoE00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ChangCFH00,
  author       = {Gerard J. Chang and
                  Bor{-}Liang Chen and
                  Hung{-}Lin Fu and
                  Kuo{-}Ching Huang},
  title        = {Linear k-arboricities on trees},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {281--287},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00247-4},
  doi          = {10.1016/S0166-218X(99)00247-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChangCFH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DahlhausHMR00,
  author       = {Elias Dahlhaus and
                  Peter Hor{\'{a}}k and
                  Mirka Miller and
                  Joseph F. Ryan},
  title        = {The train marshalling problem},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {41--54},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00219-X},
  doi          = {10.1016/S0166-218X(99)00219-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DahlhausHMR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DuckworthZ00,
  author       = {William Duckworth and
                  Michele Zito},
  title        = {Sparse Hypercube 3-spanners},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {289--295},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00246-2},
  doi          = {10.1016/S0166-218X(99)00246-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DuckworthZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/EadesSW00,
  author       = {Peter Eades and
                  Antonios Symvonis and
                  Sue Whitesides},
  title        = {Three-dimensional orthogonal graph drawing algorithms},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {55--87},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00172-4},
  doi          = {10.1016/S0166-218X(00)00172-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/EadesSW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HaeselerPS00,
  author       = {Fritz von Haeseler and
                  Heinz{-}Otto Peitgen and
                  Guentcho Skordev},
  title        = {On the fractal structure of the rescaled evolution set of Carlitz
                  sequences of polynomials},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {89--109},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00244-9},
  doi          = {10.1016/S0166-218X(99)00244-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HaeselerPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HalpertLP00,
  author       = {Ariel Halpert and
                  Fl{\'{o}}ri{\'{a}}n Lengyel and
                  J{\'{a}}nos Pach},
  title        = {Cellular telephone networks and random maps in hypergraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {111--126},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00240-1},
  doi          = {10.1016/S0166-218X(99)00240-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HalpertLP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HortonPB00,
  author       = {Steven B. Horton and
                  R. Gary Parker and
                  Richard B. Borie},
  title        = {On minimum cuts and the linear arrangement problem},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {127--139},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00173-6},
  doi          = {10.1016/S0166-218X(00)00173-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HortonPB00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HsuH00,
  author       = {D. Frank Hsu and
                  Xiao{-}Dong Hu},
  title        = {On shortest three-edge-connected Steiner networks with Euclidean distance},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {141--152},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00222-X},
  doi          = {10.1016/S0166-218X(99)00222-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HsuH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/IliePRS00,
  author       = {Lucian Ilie and
                  Gheorghe Paun and
                  Grzegorz Rozenberg and
                  Arto Salomaa},
  title        = {On strongly context-free languages},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {153--165},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00239-5},
  doi          = {10.1016/S0166-218X(99)00239-5},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/IliePRS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KhullerRW00,
  author       = {Samir Khuller and
                  Azriel Rosenfeld and
                  Angela Y. Wu},
  title        = {Centers of sets of pixels},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {297--306},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00248-6},
  doi          = {10.1016/S0166-218X(99)00248-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KhullerRW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KimDP00,
  author       = {Dongsoo S. Kim and
                  Ding{-}Zhu Du and
                  Panos M. Pardalos},
  title        = {A coloring problem on the n-cube},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {307--311},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00249-8},
  doi          = {10.1016/S0166-218X(99)00249-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KimDP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MolnarovaP00,
  author       = {Monika Moln{\'{a}}rov{\'{a}} and
                  J{\'{a}}n Pribis},
  title        = {Matrix period in max-algebra},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {167--175},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00242-5},
  doi          = {10.1016/S0166-218X(99)00242-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MolnarovaP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/PoetS00,
  author       = {Jeffrey L. Poet and
                  Bryan L. Shader},
  title        = {Score certificate numbers of upset tournaments},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {177--189},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00243-7},
  doi          = {10.1016/S0166-218X(99)00243-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/PoetS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/RobertsS00,
  author       = {Fred S. Roberts and
                  Li Sheng},
  title        = {Phylogeny numbers for graphs with two triangles},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {191--207},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00209-7},
  doi          = {10.1016/S0166-218X(99)00209-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RobertsS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/RomeijnM00,
  author       = {H. Edwin Romeijn and
                  Dolores Romero Morales},
  title        = {A class of greedy algorithms for the generalized assignment problem},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {209--235},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00224-3},
  doi          = {10.1016/S0166-218X(99)00224-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RomeijnM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/SauerhoffWW00,
  author       = {Martin Sauerhoff and
                  Ingo Wegener and
                  Ralph Werchner},
  title        = {Optimal ordered binary decision diagrams for read-once formulas},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {237--258},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(99)00210-3},
  doi          = {10.1016/S0166-218X(99)00210-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/SauerhoffWW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/XingZ00,
  author       = {Wenxun Xing and
                  Jiawei Zhang},
  title        = {Parallel machine scheduling with splitting jobs},
  journal      = {Discret. Appl. Math.},
  volume       = {103},
  number       = {1-3},
  pages        = {259--269},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00176-1},
  doi          = {10.1016/S0166-218X(00)00176-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/XingZ00.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.