Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam62.bht:"
@article{DBLP:journals/dam/AndreattaM95, author = {Giovanni Andreatta and Francesco Mason}, title = {Path Covering Problems and Testing of Printed Circuits}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {5--13}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00142-Z}, doi = {10.1016/0166-218X(94)00142-Z}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AndreattaM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeckerP95, author = {Ronald I. Becker and Yehoshua Perl}, title = {The Shifting Algorithm Technique for the Partitioning of Trees}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {15--34}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00143-2}, doi = {10.1016/0166-218X(94)00143-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BeckerP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BiancoDS95, author = {Lucio Bianco and Paolo Dell'Olmo and Maria Grazia Speranza}, title = {Scheduling Independent Tasks with Multiple Modes}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {35--50}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(95)00003-A}, doi = {10.1016/0166-218X(95)00003-A}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BiancoDS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BorosGHIK95, author = {Endre Boros and Vladimir Gurvich and Peter L. Hammer and Toshihide Ibaraki and Alexander Kogan}, title = {Decomposability of Partially Defined Boolean Functions}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {51--75}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00145-4}, doi = {10.1016/0166-218X(94)00145-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BorosGHIK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Brucker95, author = {Peter Brucker}, title = {Efficient Algorithms for Some Path Partitioning Problems}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {77--85}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00146-5}, doi = {10.1016/0166-218X(94)00146-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Brucker95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Chopra95, author = {Sunil Chopra}, title = {Compositions for Matroids with the Fulkerson Property}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {87--101}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00147-6}, doi = {10.1016/0166-218X(94)00147-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Chopra95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ConfortiCR95, author = {Michele Conforti and G{\'{e}}rard Cornu{\'{e}}jols and M. R. Rao}, title = {Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {103--117}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00148-7}, doi = {10.1016/0166-218X(94)00148-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ConfortiCR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CvetkovicRS95, author = {Dragos M. Cvetkovic and Peter Rowlinson and Slobodan K. Simic}, title = {on Some Algorithmic Investigations of Star Partitions of Graphs}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {119--130}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00149-8}, doi = {10.1016/0166-218X(94)00149-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CvetkovicRS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Davis-MoradkhanR95, author = {Madlaine Davis{-}Moradkhan and Catherine Roucairol}, title = {Graph Partitioning Applied to the Logic Testing of Combinational Circuits}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {131--165}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00150-C}, doi = {10.1016/0166-218X(94)00150-C}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Davis-MoradkhanR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EulerV95, author = {Reinhardt Euler and Herv{\'{e}} Le Verge}, title = {Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {193--208}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(95)98954-Y}, doi = {10.1016/0166-218X(95)98954-Y}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/EulerV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LucertiniRSS95, author = {Mario Lucertini and Giovanni Rinaldi and Antonio Sassano and Bruno Simeone}, title = {Preface}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {1--3}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(95)90003-X}, doi = {10.1016/0166-218X(95)90003-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LucertiniRSS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Mahjoub95, author = {Ali Ridha Mahjoub}, title = {A Min-max Relation for K\({}_{\mbox{3}}\)-covers in Graphs Noncontractible to K\({}_{\mbox{5}}\)e}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {209--219}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00153-5}, doi = {10.1016/0166-218X(94)00153-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Mahjoub95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MingozziRS95, author = {Aristide Mingozzi and Salvatore Ricciardelli and Massimo Spadoni}, title = {Partitioning a Matrix to Minimize the Maximum Cost}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {221--248}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00154-6}, doi = {10.1016/0166-218X(94)00154-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MingozziRS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PoljakR95, author = {Svatopluk Poljak and Franz Rendl}, title = {Solving the Max-cut Problem Using Eigenvalues}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {249--278}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00155-7}, doi = {10.1016/0166-218X(94)00155-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PoljakR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SouzaL95, author = {Cid C. de Souza and Monique Laurent}, title = {Some New Classes of Facets for the Equicut Polytope}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {167--191}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00151-3}, doi = {10.1016/0166-218X(94)00151-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SouzaL95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Tinhofer95, author = {Gottfried Tinhofer}, title = {Bin-packing and Matchings in Threshold Graphs}, journal = {Discret. Appl. Math.}, volume = {62}, number = {1-3}, pages = {279--289}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00156-8}, doi = {10.1016/0166-218X(94)00156-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Tinhofer95.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.