default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam60.bht:"
download as .bib file
@article{DBLP:journals/dam/AlfterH95,
author = {Marion Alfter and
Winfried Hochst{\"{a}}ttler},
title = {On Pseudomodular Matroids and Adjoints},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {3--11},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00039-G},
doi = {10.1016/0166-218X(94)00039-G},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlfterH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnnexsteinF95,
author = {Fred S. Annexstein and
John V. Franco},
title = {Work-preserving Emulations of Shuffle-exchange Networks: An Analysis
of the Complex Plane Diagram},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {13--23},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00040-K},
doi = {10.1016/0166-218X(94)00040-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AnnexsteinF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BagchiSS95,
author = {Ansuman Bagchi and
Brigitte Servatius and
Weigeng Shi},
title = {2-satisfiability and Diagnosing Faulty Processors in Massively Parallel
Computing Systems},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {25--37},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00041-B},
doi = {10.1016/0166-218X(94)00041-B},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BagchiSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BarthelemyHIRT95,
author = {Jean{-}Pierre Barth{\'{e}}lemy and
Olivier Hudry and
Garth Isaak and
Fred S. Roberts and
Barry A. Tesman},
title = {The Reversing Number of a Digraph},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {39--76},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00042-C},
doi = {10.1016/0166-218X(94)00042-C},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BarthelemyHIRT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BermanFS95,
author = {Kenneth A. Berman and
John V. Franco and
John S. Schlipf},
title = {Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear
Time},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {77--91},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00043-D},
doi = {10.1016/0166-218X(94)00043-D},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BermanFS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BogartBM95,
author = {Kenneth P. Bogart and
Joseph E. Bonin and
Jutta Mitas},
title = {Interval orders Based on Weak orders},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {93--98},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(95)00110-D},
doi = {10.1016/0166-218X(95)00110-D},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BogartBM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BogartFIL95,
author = {Kenneth P. Bogart and
Peter C. Fishburn and
Garth Isaak and
Larry J. Langley},
title = {Proper and Unit Tolerance Graphs},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {99--117},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00044-E},
doi = {10.1016/0166-218X(94)00044-E},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BogartFIL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Boros95,
author = {Endre Boros},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {1},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(95)90083-R},
doi = {10.1016/0166-218X(95)90083-R},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Boros95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ColbournPV95,
author = {Charles J. Colbourn and
J. Scott Provan and
Dirk Vertigan},
title = {A New Approach to Solving Three Combinatorial Enumeration Problems
on Planar Graphs},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {119--129},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(95)E0111-3},
doi = {10.1016/0166-218X(95)E0111-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ColbournPV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Du95,
author = {Ding{-}Zhu Du},
title = {on Component-size Bounded Steiner Trees},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {131--140},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00045-F},
doi = {10.1016/0166-218X(94)00045-F},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Du95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErdosF95,
author = {Paul Erd{\"{o}}s and
Peter C. Fishburn},
title = {Multiplicities of Interpoint Distances in Finite Planar Sets},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {141--147},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00046-G},
doi = {10.1016/0166-218X(94)00046-G},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErdosF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErdosF95a,
author = {Paul Erd{\"{o}}s and
Peter C. Fishburn},
title = {Intervertex Distances in Convex Polygons},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {149--158},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00047-H},
doi = {10.1016/0166-218X(94)00047-H},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErdosF95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GalloP95,
author = {Giorgio Gallo and
Daniele Pretolani},
title = {A New Algorithm for the Propositional Satisfiability Problem},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {159--179},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00048-I},
doi = {10.1016/0166-218X(94)00048-I},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GalloP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HansenJA95,
author = {Pierre Hansen and
Brigitte Jaumard and
Marcus Poggi de Arag{\~{a}}o},
title = {Boole's Conditions of Possible Experience and Reasoning under Uncertainty},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {181--193},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00050-N},
doi = {10.1016/0166-218X(94)00050-N},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HansenJA95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hertz95,
author = {Alain Hertz},
title = {Polynomially Solvable Cases for the Maximum Stable Set Problem},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {195--210},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00051-E},
doi = {10.1016/0166-218X(94)00051-E},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hertz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hoke95,
author = {Kathy Williamson Hoke},
title = {Extending Shelling orders and a Hierarchy of Functions of Unimodal
Simple Polytopes},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {211--217},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00052-F},
doi = {10.1016/0166-218X(94)00052-F},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hoke95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hwang95,
author = {Frank K. Hwang},
title = {The Time Complexity of Deterministic Broadcast Radio Networks},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {219--222},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00053-G},
doi = {10.1016/0166-218X(94)00053-G},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hwang95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KlinzRW95,
author = {Bettina Klinz and
R{\"{u}}diger Rudolf and
Gerhard J. Woeginger},
title = {Permuting Matrices to Avoid Forbidden Submatrices},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {223--248},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00054-H},
doi = {10.1016/0166-218X(94)00054-H},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KlinzRW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kogan95,
author = {Alexander Kogan},
title = {on the Essential Test Sets of Discrete Matrices},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {249--255},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00055-I},
doi = {10.1016/0166-218X(94)00055-I},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kogan95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Langley95,
author = {Larry J. Langley},
title = {A Recognition Algorithm for orders of Interval Dimension Two},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {257--266},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00056-J},
doi = {10.1016/0166-218X(94)00056-J},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Langley95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Langley95a,
author = {Larry J. Langley},
title = {Irreflexive and Reflexive Dimension},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {267--273},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00057-K},
doi = {10.1016/0166-218X(94)00057-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Langley95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LazebnikU95,
author = {Felix Lazebnik and
Vasiliy A. Ustimenko},
title = {Explicit Construction of Graphs with an Arbitrary Large Girth and
of Large Size},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {275--284},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00058-L},
doi = {10.1016/0166-218X(94)00058-L},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LazebnikU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lu95,
author = {Xiaoyun Lu},
title = {A Note on Biased and Non-biased Games},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {285--291},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00059-M},
doi = {10.1016/0166-218X(94)00059-M},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lu95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NutovP95,
author = {Zeev Nutov and
Michal Penn},
title = {on the Integral Dicycle Packings and Covers and the Linear ordering
Polytope},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {293--309},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00060-Q},
doi = {10.1016/0166-218X(94)00060-Q},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NutovP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PeledS95,
author = {Uri N. Peled and
Feng Sun},
title = {Enumeration of Difference Graphs},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {311--318},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00061-H},
doi = {10.1016/0166-218X(94)00061-H},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PeledS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Penrice95,
author = {Stephen G. Penrice},
title = {on-line Algorithms for ordered Sets and Comparability Graphs},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {319--329},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00062-I},
doi = {10.1016/0166-218X(94)00062-I},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Penrice95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Picouleau95,
author = {Christophe Picouleau},
title = {New Complexity Results on Scheduling with Small Communication Delays},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {331--342},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00063-J},
doi = {10.1016/0166-218X(94)00063-J},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Picouleau95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Rajpal95,
author = {Sanjay Rajpal},
title = {on Paving Matroids and a Generalization of {MDS} Codes},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {343--347},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00064-K},
doi = {10.1016/0166-218X(94)00064-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Rajpal95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Syslo95,
author = {Maciej M. Syslo},
title = {on Some New Types of Greedy Chains and Greedy Linear Extensions of
Partially ordered Sets},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {349--358},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00065-L},
doi = {10.1016/0166-218X(94)00065-L},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Syslo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Trenk95,
author = {Ann N. Trenk},
title = {Generalized Perfect Graphs: Characterizations and Inversion},
journal = {Discret. Appl. Math.},
volume = {60},
number = {1-3},
pages = {359--387},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00066-M},
doi = {10.1016/0166-218X(94)00066-M},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Trenk95.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-09-18 15:57 CEST 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:
