Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/BujtasJ18,
  author       = {Csilla Bujt{\'{a}}s and
                  Szil{\'{a}}rd Jask{\'{o}}},
  title        = {Bounds on the 2-domination number},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {4--15},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.05.014},
  doi          = {10.1016/J.DAM.2017.05.014},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BujtasJ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Dosa18,
  author       = {Gy{\"{o}}rgy D{\'{o}}sa},
  title        = {The Intermediate Price of Anarchy (IPoA) in bin packing games},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {16--25},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.10.010},
  doi          = {10.1016/J.DAM.2017.10.010},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Dosa18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FortierKLST18,
  author       = {Quentin Fortier and
                  Csaba Kir{\'{a}}ly and
                  Marion L{\'{e}}onard and
                  Zolt{\'{a}}n Szigeti and
                  Alexandre Talon},
  title        = {Old and new results on packing arborescences in directed hypergraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {26--33},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.11.004},
  doi          = {10.1016/J.DAM.2017.11.004},
  timestamp    = {Fri, 03 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/FortierKLST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HillV18,
  author       = {Alessandro Hill and
                  Stefan Vo{\ss}},
  title        = {Generalized local branching heuristics and the capacitated ring tree
                  problem},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {34--52},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.09.010},
  doi          = {10.1016/J.DAM.2017.09.010},
  timestamp    = {Thu, 29 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HillV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JaehnK18,
  author       = {Florian Jaehn and
                  Dominik Kress},
  title        = {Scheduling cooperative gantry cranes with seaside and landside jobs},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {53--68},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.06.015},
  doi          = {10.1016/J.DAM.2017.06.015},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JaehnK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JordanKM18,
  author       = {Tibor Jord{\'{a}}n and
                  Tam{\'{a}}s Kis and
                  Silvano Martello},
  title        = {Computational advances in combinatorial optimization},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {1--3},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.02.002},
  doi          = {10.1016/J.DAM.2018.02.002},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JordanKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JuttnerM18,
  author       = {Alp{\'{a}}r J{\"{u}}ttner and
                  P{\'{e}}ter Madarasi},
  title        = {{VF2++} - An improved subgraph isomorphism algorithm},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {69--81},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.02.018},
  doi          = {10.1016/J.DAM.2018.02.018},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JuttnerM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kiraly18,
  author       = {Zolt{\'{a}}n Kir{\'{a}}ly},
  title        = {Spanning tree with lower bound on the degrees},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {82--88},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.12.005},
  doi          = {10.1016/J.DAM.2017.12.005},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kiraly18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KressMP18,
  author       = {Dominik Kress and
                  Sebastian Meiswinkel and
                  Erwin Pesch},
  title        = {Incentive compatible mechanisms for scheduling two-parameter job agents
                  on parallel identical machines to minimize the weighted number of
                  late jobs},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {89--101},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.08.026},
  doi          = {10.1016/J.DAM.2017.08.026},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KressMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Manyem18,
  author       = {Prabhu Manyem},
  title        = {Disruption recovery at airports: Integer programming formulations
                  and polynomial time algorithms},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {102--117},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2017.11.010},
  doi          = {10.1016/J.DAM.2017.11.010},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Manyem18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/SzaboZ18,
  author       = {S{\'{a}}ndor Szab{\'{o}} and
                  Bogd{\'{a}}n Zav{\'{a}}lnij},
  title        = {Decomposing clique search problems into smaller instances based on
                  node and edge colorings},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {118--129},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.01.006},
  doi          = {10.1016/J.DAM.2018.01.006},
  timestamp    = {Sat, 25 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/SzaboZ18.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.