Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam69.bht:"
download as .bib file
@article{DBLP:journals/dam/BalachandhranR96,
author = {V. Balachandhran and
C. Pandu Rangan},
title = {All-pairs-shortest-length on Strongly Chordal Graphs},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {169--182},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00088-9},
doi = {10.1016/0166-218X(95)00088-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BalachandhranR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brown96,
author = {Jason I. Brown},
title = {The Complexity of Generalized Graph Colorings},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {257--270},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(96)00096-0},
doi = {10.1016/0166-218X(96)00096-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Brown96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenH96,
author = {Zhi{-}Zhong Chen and
Xin He},
title = {Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced
Forests},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {183--198},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(96)00089-3},
doi = {10.1016/0166-218X(96)00089-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DemetrovicsT96,
author = {J{\'{a}}nos Demetrovics and
Vu Duc Thi},
title = {Some Results About Normal Forms for Functional Dependency in the Relational
Datamodel},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {61--74},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00076-4},
doi = {10.1016/0166-218X(95)00076-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DemetrovicsT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FabregaF96,
author = {Josep F{\`{a}}brega and
Miguel Angel Fiol},
title = {Bipartite Graphs and Digraphs with Maximum Connectivity},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {271--279},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00097-B},
doi = {10.1016/0166-218X(95)00097-B},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FabregaF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Flotow96,
author = {Carsten Flotow},
title = {On Powers of Circular Arc Graphs and Proper Circular Arc Graphs},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {199--207},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00091-5},
doi = {10.1016/0166-218X(95)00091-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Flotow96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GutinY96,
author = {Gregory Z. Gutin and
Anders Yeo},
title = {Ranking the Vertices of a Complete Multipartite Paired Comparison
Digraph},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {75--82},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00077-5},
doi = {10.1016/0166-218X(95)00077-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GutinY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KhullerRY96,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {On Strongly Connected Digraphs with Bounded Cycle Length},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {281--289},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00105-Z},
doi = {10.1016/0166-218X(95)00105-Z},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KhullerRY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LimPC96,
author = {Hyeong{-}Seok Lim and
Jung{-}Heum Park and
Kyung{-}Yong Chwa},
title = {Embedding Trees in Recursive Circulants},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {83--99},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00078-6},
doi = {10.1016/0166-218X(95)00078-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LimPC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MakinoI96,
author = {Kazuhisa Makino and
Toshihide Ibaraki},
title = {Interior and Exterior Functions of Boolean Functions},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {209--231},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00092-6},
doi = {10.1016/0166-218X(95)00092-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MakinoI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Nachtigall96,
author = {Karl Nachtigall},
title = {Periodic Network Optimization with Different Arc Frequencies},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {1--17},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00073-Z},
doi = {10.1016/0166-218X(95)00073-Z},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Nachtigall96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Newberg96,
author = {Lee Aaron Newberg},
title = {The Number of Clone Orderings},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {233--245},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(96)00093-5},
doi = {10.1016/0166-218X(96)00093-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Newberg96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NgW96,
author = {Meei Pyng Ng and
Nicholas C. Wormald},
title = {Reconstruction of Rooted Trees From Subtrees},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {19--31},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00074-2},
doi = {10.1016/0166-218X(95)00074-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NgW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Pixton96,
author = {Dennis Pixton},
title = {Regularity of Splicing Languages},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {101--124},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00079-7},
doi = {10.1016/0166-218X(95)00079-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Pixton96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Stephens96,
author = {Peter W. Stephens},
title = {Gap Strings and Spanning Forests for Bridge Graphs of Biconnected
Graphs},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {125--145},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00080-B},
doi = {10.1016/0166-218X(95)00080-B},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Stephens96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WoodS96,
author = {Jeffrey Wood and
John Shawe{-}Taylor},
title = {Representation Theory and Invariant Neural Networks},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {33--60},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00075-3},
doi = {10.1016/0166-218X(95)00075-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WoodS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YanCC96,
author = {Jing{-}Ho Yan and
Jer{-}Jeong Chen and
Gerard J. Chang},
title = {Quasi-threshold Graphs},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {247--255},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(96)00094-7},
doi = {10.1016/0166-218X(96)00094-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YanCC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZhangZ96,
author = {Heping Zhang and
Fuji Zhang},
title = {The Clar Covering Polynomial of Hexagonal Systems {I}},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {147--167},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00081-2},
doi = {10.1016/0166-218X(95)00081-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ZhangZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-08 06:50 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:
