Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam29.bht:"
@article{DBLP:journals/dam/AdamsBS90, author = {Warren E. Adams and Alain Billionnet and Alain Sutter}, title = {Unconstrained 0-1 optimization and Lagrangean relaxation}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {131--142}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90139-4}, doi = {10.1016/0166-218X(90)90139-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AdamsBS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Beame90, author = {Paul Beame}, title = {Lower bounds for recognizing small cliques on {CRCW} PRAM's}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {3--20}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90079-R}, doi = {10.1016/0166-218X(90)90079-R}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Beame90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BergerFF90, author = {Marc A. Berger and Alexander Felzenbaum and Aviezri S. Fraenkel}, title = {Irreducible disjoint covering systems (with an application to boolean algebra)}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {143--164}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90140-8}, doi = {10.1016/0166-218X(90)90140-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BergerFF90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChandraT90, author = {Ashok K. Chandra and Martin Tompa}, title = {The complexity of short two-person games}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {21--33}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90080-V}, doi = {10.1016/0166-218X(90)90080-V}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChandraT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChvatalE90, author = {Vasek Chv{\'{a}}tal and C. Ebenegger}, title = {A note on line digraphs and the directed max-cut problem}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {165--170}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90141-X}, doi = {10.1016/0166-218X(90)90141-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChvatalE90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CramaHJ90, author = {Yves Crama and Pierre Hansen and Brigitte Jaumard}, title = {The basic algorithm for pseudo-Boolean programming revisited}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {171--185}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90142-Y}, doi = {10.1016/0166-218X(90)90142-Y}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CramaHJ90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Fich90, author = {Faith E. Fich}, title = {Preface}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {1--2}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90078-Q}, doi = {10.1016/0166-218X(90)90078-Q}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Fich90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GibbonsKMS90, author = {Phillip B. Gibbons and Richard M. Karp and Gary L. Miller and Danny Soroker}, title = {Subtree isomorphism is in random {NC}}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {35--62}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90081-M}, doi = {10.1016/0166-218X(90)90081-M}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GibbonsKMS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GrolmuszR90, author = {Vince Grolmusz and Prabhakar Ragde}, title = {Incomparability in parallel computation}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {63--78}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90082-N}, doi = {10.1016/0166-218X(90)90082-N}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GrolmuszR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HansenLS90, author = {Pierre Hansen and Shi{-}Hui Lu and Bruno Simeone}, title = {On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {187--193}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90143-Z}, doi = {10.1016/0166-218X(90)90143-Z}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HansenLS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HansenW90, author = {Pierre Hansen and Dominique de Werra}, title = {Preface}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {129}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90138-3}, doi = {10.1016/0166-218X(90)90138-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HansenW90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KirkpatrickP90, author = {David G. Kirkpatrick and Teresa M. Przytycka}, title = {Parallel recognition of complement reducible graphs and cotree construction}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {79--96}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90083-O}, doi = {10.1016/0166-218X(90)90083-O}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KirkpatrickP90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MinouxB90, author = {Michel Minoux and Kamel Barkaoui}, title = {Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {195--210}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90144-2}, doi = {10.1016/0166-218X(90)90144-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MinouxB90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PeledS90, author = {Uri N. Peled and Murali K. Srinivasan}, title = {Vicinal orders of trees}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {211--219}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90145-3}, doi = {10.1016/0166-218X(90)90145-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PeledS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Roberts90, author = {Fred S. Roberts}, title = {Meaningfulness of conclusions from combinatorial optimization}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {221--241}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90146-4}, doi = {10.1016/0166-218X(90)90146-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Roberts90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SchieberV90, author = {Baruch Schieber and Uzi Vishkin}, title = {Finding all nearest neighbors for convex polygons in parallel: {A} new lower bound technique and a matching algorithm}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {97--111}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90084-P}, doi = {10.1016/0166-218X(90)90084-P}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SchieberV90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SimeoneWC90, author = {Bruno Simeone and Dominique de Werra and Maurice Cochand}, title = {Recognition of a class of unimodular functions}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {243--250}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90147-5}, doi = {10.1016/0166-218X(90)90147-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SimeoneWC90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Soroker90, author = {Danny Soroker}, title = {Optimal parallel construction of prescribed tournaments}, journal = {Discret. Appl. Math.}, volume = {29}, number = {1}, pages = {113--125}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90085-Q}, doi = {10.1016/0166-218X(90)90085-Q}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Soroker90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Wolsey90, author = {Laurence A. Wolsey}, title = {Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints}, journal = {Discret. Appl. Math.}, volume = {29}, number = {2-3}, pages = {251--261}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90148-6}, doi = {10.1016/0166-218X(90)90148-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Wolsey90.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.