Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/AalbersbergRE86,
  author       = {IJsbrand Jan Aalbersberg and
                  Grzegorz Rozenberg and
                  Andrzej Ehrenfeucht},
  title        = {On the membership problem for regular {DNLC} grammars},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {79--85},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90070-3},
  doi          = {10.1016/0166-218X(86)90070-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AalbersbergRE86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AliK86,
  author       = {Agha Iqbal Ali and
                  Jeff L. Kennington},
  title        = {The asymmetric M-travelling salesmen problem: {A} duality based branch-and-bound
                  algorithm},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {259--276},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90087-9},
  doi          = {10.1016/0166-218X(86)90087-9},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AliK86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Anstee86,
  author       = {Richard P. Anstee},
  title        = {Invariant sets of arcs in network flow problems},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {1--7},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90063-6},
  doi          = {10.1016/0166-218X(86)90063-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Anstee86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AtallahF86,
  author       = {Mikhail J. Atallah and
                  Greg N. Frederickson},
  title        = {A note on finding a maximum empty rectangle},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {87--91},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90071-5},
  doi          = {10.1016/0166-218X(86)90071-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AtallahF86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AtallahH86,
  author       = {Mikhail J. Atallah and
                  Susanne E. Hambrusch},
  title        = {An assignment algorithm with applications to integrated circuit layout},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {9--22},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90064-8},
  doi          = {10.1016/0166-218X(86)90064-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AtallahH86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Barahona86,
  author       = {Francisco Barahona},
  title        = {A solvable case of quadratic 0-1 programming},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {23--26},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90065-X},
  doi          = {10.1016/0166-218X(86)90065-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Barahona86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BarrosW86,
  author       = {Oscar Barros and
                  Andr{\'{e}}s Weintraub},
  title        = {Spatial market equilibrium problems as network models},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {109--130},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90077-6},
  doi          = {10.1016/0166-218X(86)90077-6},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BarrosW86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Bovet86,
  author       = {Jean Bovet},
  title        = {Une amelioration de la methode de Dijkstra pour la recherche d'un
                  plus court chemin dans un reseau},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {93--96},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90072-7},
  doi          = {10.1016/0166-218X(86)90072-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Bovet86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GloverN86,
  author       = {Fred W. Glover and
                  Beth Novick},
  title        = {The 2-quasi-greedy algorithm for cardinality constrained matroid bases},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {277--286},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90088-0},
  doi          = {10.1016/0166-218X(86)90088-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GloverN86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GoldmanT86,
  author       = {Alan J. Goldman and
                  Prasoon Tiwari},
  title        = {Allowable processing orders in the accelerated cascade algorithm},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {213--221},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90083-1},
  doi          = {10.1016/0166-218X(86)90083-1},
  timestamp    = {Sun, 02 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/GoldmanT86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Goles86,
  author       = {Eric Goles},
  title        = {Antisymmetrical neural networks},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {97--100},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90073-9},
  doi          = {10.1016/0166-218X(86)90073-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Goles86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GranotH86,
  author       = {Frieda Granot and
                  Refael Hassin},
  title        = {Multi-terminal maximum flows in node-capacitated networks},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {157--163},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90079-X},
  doi          = {10.1016/0166-218X(86)90079-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GranotH86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HedetniemiLP86,
  author       = {Stephen T. Hedetniemi and
                  Renu C. Laskar and
                  John Pfaff},
  title        = {A linear algorithm for finding a minimum dominating set in a cactus},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {287--292},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90089-2},
  doi          = {10.1016/0166-218X(86)90089-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HedetniemiLP86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HungRW86,
  author       = {Ming S. Hung and
                  Walter O. Rom and
                  Allan D. Waren},
  title        = {Degeneracy in transportation problems},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {223--237},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90084-3},
  doi          = {10.1016/0166-218X(86)90084-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HungRW86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/IkuraN86,
  author       = {Yoshiro Ikura and
                  George L. Nemhauser},
  title        = {Computational experience with a polynomial-time dual simplex algorithm
                  for the transportation problem},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {239--248},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90085-5},
  doi          = {10.1016/0166-218X(86)90085-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/IkuraN86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JonesSS86,
  author       = {Philip C. Jones and
                  Romesh Saigal and
                  Michael H. Schneider},
  title        = {A variable-dimension homotopy on networks for computing linear spatial
                  equilibria},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {131--156},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90078-8},
  doi          = {10.1016/0166-218X(86)90078-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JonesSS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KlingmanS86,
  author       = {Darwin D. Klingman and
                  Robert F. Schneider},
  title        = {Microcomputer-based algorithms for large scale shortest path problems},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {183--206},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90081-8},
  doi          = {10.1016/0166-218X(86)90081-8},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KlingmanS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Mote86,
  author       = {John Mote},
  title        = {The family constrained network problem},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {249--257},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90086-7},
  doi          = {10.1016/0166-218X(86)90086-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Mote86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Phillips86,
  author       = {Nancy V. Phillips},
  title        = {A new variant of the partitioning shortest path algorithm},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {207--212},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90082-X},
  doi          = {10.1016/0166-218X(86)90082-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Phillips86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/PoljakT86,
  author       = {Svatopluk Poljak and
                  Daniel Turz{\'{\i}}k},
  title        = {On an application of convexity to discrete systems},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {27--32},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90066-1},
  doi          = {10.1016/0166-218X(86)90066-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/PoljakT86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/PoljakT86a,
  author       = {Svatopluk Poljak and
                  Daniel Turz{\'{\i}}k},
  title        = {On pre-periods of discrete influence systems},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {33--39},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90067-3},
  doi          = {10.1016/0166-218X(86)90067-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/PoljakT86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Rosenberg86,
  author       = {Ivo G. Rosenberg},
  title        = {Structural rigidity {II:} Almost infinitesimally rigid bar frameworks},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {41--59},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90068-5},
  doi          = {10.1016/0166-218X(86)90068-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Rosenberg86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ShingH86,
  author       = {M. T. Shing and
                  T. C. Hu},
  title        = {A decomposition algorithm for multi-terminal networks flows},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {2-3},
  pages        = {165--181},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90080-6},
  doi          = {10.1016/0166-218X(86)90080-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ShingH86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Vlach86,
  author       = {Milan Vlach},
  title        = {Conditions for the existence of solutions of the three-dimensional
                  planar transportation problem},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {61--78},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90069-7},
  doi          = {10.1016/0166-218X(86)90069-7},
  timestamp    = {Mon, 01 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/Vlach86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ZalcsteinF86,
  author       = {Yechezkel Zalcstein and
                  Stanley P. Franklin},
  title        = {Testing homotopy equivalence is isomorphism complete},
  journal      = {Discret. Appl. Math.},
  volume       = {13},
  number       = {1},
  pages        = {101--104},
  year         = {1986},
  url          = {https://doi.org/10.1016/0166-218X(86)90074-0},
  doi          = {10.1016/0166-218X(86)90074-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ZalcsteinF86.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.