default search action
Search dblp for Publications
export results for "toc:db/journals/disopt/disopt46.bht:"
@article{DBLP:journals/disopt/ChenCZ22, author = {Hua Chen and Lin Chen and Guochuan Zhang}, title = {Block-structured integer programming: Can we parameterize without the largest coefficient?}, journal = {Discret. Optim.}, volume = {46}, pages = {100743}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100743}, doi = {10.1016/J.DISOPT.2022.100743}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/ChenCZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/CordoneFS22, author = {Roberto Cordone and Davide Franchi and Andrea Scozzari}, title = {Cardinality constrained connected balanced partitions of trees under different criteria}, journal = {Discret. Optim.}, volume = {46}, pages = {100742}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100742}, doi = {10.1016/J.DISOPT.2022.100742}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/CordoneFS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/GokeMM22, author = {Alexander G{\"{o}}ke and D{\'{a}}niel Marx and Matthias Mnich}, title = {Parameterized algorithms for generalizations of Directed Feedback Vertex Set}, journal = {Discret. Optim.}, volume = {46}, pages = {100740}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100740}, doi = {10.1016/J.DISOPT.2022.100740}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/GokeMM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/Herrman22, author = {Rebekah Herrman}, title = {The (d-2)-leaky forcing number of Qd and {\(\mathscr{l}\)}-leaky forcing number of GP(n, 1)}, journal = {Discret. Optim.}, volume = {46}, pages = {100744}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100744}, doi = {10.1016/J.DISOPT.2022.100744}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/Herrman22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/MourtosS22, author = {Ioannis Mourtos and Michalis Samaris}, title = {Stable allocations and partially ordered sets}, journal = {Discret. Optim.}, volume = {46}, pages = {100731}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100731}, doi = {10.1016/J.DISOPT.2022.100731}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/MourtosS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/SiemannW22, author = {Marije Siemann and Matthias Walter}, title = {A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem}, journal = {Discret. Optim.}, volume = {46}, pages = {100741}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100741}, doi = {10.1016/J.DISOPT.2022.100741}, timestamp = {Thu, 05 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/SiemannW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/SunGZ22, author = {Yuefang Sun and Gregory Z. Gutin and Xiaoyan Zhang}, title = {Packing strong subgraph in digraphs}, journal = {Discret. Optim.}, volume = {46}, pages = {100745}, year = {2022}, url = {https://doi.org/10.1016/j.disopt.2022.100745}, doi = {10.1016/J.DISOPT.2022.100745}, timestamp = {Sun, 31 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/SunGZ22.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.