default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam11.bht:"
download as .bib file
@article{DBLP:journals/dam/AalbersbergR85,
author = {IJsbrand Jan Aalbersberg and
Grzegorz Rozenberg},
title = {Traces, dependency graphs and {DNLC} grammars},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {299--306},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90080-0},
doi = {10.1016/0166-218X(85)90080-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AalbersbergR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AraozE85,
author = {Juli{\'{a}}n Ar{\'{a}}oz and
Jack Edmonds},
title = {A case of non-convergent dual changes in assignment problems},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {95--102},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80001-9},
doi = {10.1016/S0166-218X(85)80001-9},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AraozE85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeckerP85,
author = {Ronald I. Becker and
Yehoshua Perl},
title = {Finding the two-core of a tree},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {103--113},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80002-0},
doi = {10.1016/S0166-218X(85)80002-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeckerP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ButkovicH85,
author = {Peter Butkovic and
Ferdinand Hevery},
title = {A condition for the strong regularity of matrices in the minimax algebra},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {209--222},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90073-3},
doi = {10.1016/0166-218X(85)90073-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ButkovicH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DemetrovicsFK85,
author = {J{\'{a}}nos Demetrovics and
Zolt{\'{a}}n F{\"{u}}redi and
Gyula O. H. Katona},
title = {Minimum matrix representation of closure operations},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {115--128},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80003-2},
doi = {10.1016/S0166-218X(85)80003-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DemetrovicsFK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Dergis85,
author = {Ulrich Derigs},
title = {Some basic exchange properties in combinatorial optimization and their
application to constructing the K-best solutions},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {129--141},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80004-4},
doi = {10.1016/S0166-218X(85)80004-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Dergis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/El-ZaharR85,
author = {Mohamed H. El{-}Zahar and
I. Rival},
title = {Greedy linear extensions to minimize jumps},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {143--156},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80005-6},
doi = {10.1016/S0166-218X(85)80005-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/El-ZaharR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaleS85,
author = {David Gale and
Marilda Sotomayor},
title = {Some remarks on the stable matching problem},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {223--232},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90074-5},
doi = {10.1016/0166-218X(85)90074-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GaleS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Gunther85,
author = {Georg Gunther},
title = {Neighbour-connectivity in regular graphs},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {233--243},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90075-7},
doi = {10.1016/0166-218X(85)90075-7},
timestamp = {Fri, 04 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Gunther85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Helleseth85,
author = {Tor Helleseth},
title = {On the covering radius of cyclic linear codes and arithmetic codes},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {157--173},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80006-8},
doi = {10.1016/S0166-218X(85)80006-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Helleseth85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HonkalaHK85,
author = {Iiro S. Honkala and
Heikki O. H{\"{a}}m{\"{a}}l{\"{a}}inen and
Markku K. Kaikkonen},
title = {A modification of the Zinoviev lower bound for constant weight codes},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {307--310},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90081-2},
doi = {10.1016/0166-218X(85)90081-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HonkalaHK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MasudaIN85,
author = {Teruo Masuda and
Hiroaki Ishii and
Toshio Nishida},
title = {The mixed shop scheduling problem},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {175--186},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80007-X},
doi = {10.1016/S0166-218X(85)80007-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MasudaIN85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NguyenS85,
author = {Truc T. Nguyen and
Allan R. Sampson},
title = {Counting the number of p {\texttimes} q integer matrices more concordant
than a given matrix},
journal = {Discret. Appl. Math.},
volume = {11},
number = {2},
pages = {187--205},
year = {1985},
url = {https://doi.org/10.1016/S0166-218X(85)80008-1},
doi = {10.1016/S0166-218X(85)80008-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NguyenS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RobertT85,
author = {Yves Robert and
Maurice Tchuent{\'{e}}},
title = {Connection-graph and iteration-graph of monotone boolean functions},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {245--253},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90076-9},
doi = {10.1016/0166-218X(85)90076-9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RobertT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Saviozzi85,
author = {G. Saviozzi},
title = {On degeneracy in linear complementarity problems},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {311--314},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90082-4},
doi = {10.1016/0166-218X(85)90082-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Saviozzi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Seebold85,
author = {Patrice S{\'{e}}{\'{e}}bold},
title = {Sequences generated by infinitely iterated morphisms},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {255--264},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90077-0},
doi = {10.1016/0166-218X(85)90077-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Seebold85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SenS85,
author = {Suvrajeet Sen and
Hanif D. Sherali},
title = {A branch and bound algorithm for extreme point mathematical programming
problems},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {265--280},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90078-2},
doi = {10.1016/0166-218X(85)90078-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SenS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Steiner85,
author = {George Steiner},
title = {A compact labeling scheme for series-parallel graphs},
journal = {Discret. Appl. Math.},
volume = {11},
number = {3},
pages = {281--297},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90079-4},
doi = {10.1016/0166-218X(85)90079-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Steiner85.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.
retrieved on 2025-02-20 13:17 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
