default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam55.bht:"
download as .bib file
@article{DBLP:journals/dam/ArkinH94,
author = {Esther M. Arkin and
Refael Hassin},
title = {Approximation Algorithms for the Geometric Covering Salesman Problem},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {197--218},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90008-6},
doi = {10.1016/0166-218X(94)90008-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArkinH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bar-NoyK94,
author = {Amotz Bar{-}Noy and
Shlomo Kipnis},
title = {Broadcasting Multiple Messages in Simultaneous Send/receive Systems},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {95--105},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90001-9},
doi = {10.1016/0166-218X(94)90001-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-NoyK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderJW94,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
title = {Scheduling with Incompatible Jobs},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {219--232},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90009-4},
doi = {10.1016/0166-218X(94)90009-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderJW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BorosHS94,
author = {Endre Boros and
Peter L. Hammer and
Xiaorong Sun},
title = {Recognition of q-Horn Formulae in Linear Time},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {1--13},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90033-7},
doi = {10.1016/0166-218X(94)90033-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BorosHS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cai94a,
author = {Mao{-}cheng Cai},
title = {An Algorithm for an Eulerian Trail Traversing Specified Edges in Given
order},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {233--239},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90010-8},
doi = {10.1016/0166-218X(94)90010-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Cai94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CameronW94,
author = {Helen Cameron and
Derick Wood},
title = {Maximal Path Length of Binary Trees},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {15--35},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90034-5},
doi = {10.1016/0166-218X(94)90034-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CameronW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChestonF94,
author = {Grant A. Cheston and
Gerd Fricke},
title = {Classes of Graphs for Which Upper Fractional Domination Equals Independence,
Upper Domination, and upper Irredundance},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {241--258},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90011-6},
doi = {10.1016/0166-218X(94)90011-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChestonF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GautierG94,
author = {Antoine Gautier and
Frieda Granot},
title = {on the Equivalence of Constrained and Unconstrained Flows},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {113--132},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90003-5},
doi = {10.1016/0166-218X(94)90003-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GautierG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hoang94,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng},
title = {Efficient Algorithms for Minimum Weighted Colouring of Some Classes
of Perfect Graphs},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {133--143},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90004-3},
doi = {10.1016/0166-218X(94)90004-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hoang94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoogeveenVV94,
author = {J. A. Hoogeveen and
Steef L. van de Velde and
Bart Veltman},
title = {Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor
Allocations},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {259--272},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90012-4},
doi = {10.1016/0166-218X(94)90012-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HoogeveenVV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/IstrateP94,
author = {Gabriel Istrate and
Gheorghe Paun},
title = {Some Combinatorial Properties of Self-reading Sequences},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {83--86},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90037-X},
doi = {10.1016/0166-218X(94)90037-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/IstrateP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KolenKHW94,
author = {Antoon W. J. Kolen and
A. H. G. Rinnooy Kan and
C. P. M. van Hoesel and
Albert P. M. Wagelmans},
title = {Sensitivity Analysis of List Scheduling Heuristics},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {145--162},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90005-1},
doi = {10.1016/0166-218X(94)90005-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KolenKHW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Krynski94,
author = {Stanislaw Krynski},
title = {Graphs in Which All Hamiltonian Cycles Have the Same Length},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {87--89},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90038-8},
doi = {10.1016/0166-218X(94)90038-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Krynski94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LaffondLB94,
author = {Gilbert Laffond and
Jean{-}Fran{\c{c}}ois Laslier and
Michel Le Breton},
title = {The Copeland Measure of Condorcet Choice Functions},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {273--279},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90013-2},
doi = {10.1016/0166-218X(94)90013-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LaffondLB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeM94,
author = {Jon Lee and
Walter D. Morris Jr.},
title = {Geometric Comparison of Combinatorial Polytopes},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {163--182},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90006-X},
doi = {10.1016/0166-218X(94)90006-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MautorR94,
author = {Thierry Mautor and
Catherine Roucairol},
title = {A New Exact Algorithm for the Solution of Quadratic Assignment Problems},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {281--293},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90014-0},
doi = {10.1016/0166-218X(94)90014-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MautorR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NishizekiP94,
author = {Takao Nishizeki and
Svatopluk Poljak},
title = {k-Connectivity and Decomposition of Graphs into Forests},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {295--301},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90015-9},
doi = {10.1016/0166-218X(94)90015-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NishizekiP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Penne94,
author = {Rudi Penne},
title = {Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure
Conditions},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {37--57},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90035-3},
doi = {10.1016/0166-218X(94)90035-3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Penne94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PunnenN94,
author = {Abraham P. Punnen and
Kunhiraman Nair},
title = {Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite
Matching Problem},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {91--93},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90039-6},
doi = {10.1016/0166-218X(94)90039-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PunnenN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Sevastjanov94,
author = {Sergey Vasil'evich Sevast'janov},
title = {on Some Geometric Methods in Scheduling Theory: {A} Survey},
journal = {Discret. Appl. Math.},
volume = {55},
number = {1},
pages = {59--82},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90036-1},
doi = {10.1016/0166-218X(94)90036-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Sevastjanov94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Werra94,
author = {Dominique de Werra},
title = {on an optimization Problem occurring in FMSs: {A} Hypergraph-theoretical
Formulation},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {107--111},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90002-7},
doi = {10.1016/0166-218X(94)90002-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Werra94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Yinnone94,
author = {Hananya Yinnone},
title = {Maximum Number of Disjoint Paths Connecting Specified Terminals in
a Graph},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {183--195},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90007-8},
doi = {10.1016/0166-218X(94)90007-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Yinnone94.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 2024-11-25 15:23 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:
