default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 200
Volume 200, February 2016
- Navid Talebanfard
:
On the structure and the number of prime implicants of 2-s. 1-4
- Vyacheslav A. Artamonov, Sucheta Chakrabarti, Saibal K. Pal:
Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations. 5-17 - Huilan Chang, Yi-Tsz Tsai:
Improvements on some error-tolerance pooling designs. 18-22 - Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier:
Algorithmic aspects of switch cographs. 23-42 - Konrad Kazimierz Dabrowski, Daniël Paulusma:
Classifying the clique-width of H-free bipartite graphs. 43-51 - Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse:
Locating-dominating sets in twin-free graphs. 52-58 - Jelena Govorcin, Riste Skrekovski, Vida Vukasinovic, Damir Vukicevic:
A measure for a balanced workload and its extremal values. 59-66 - Kei Kimura, Kazuhisa Makino:
Trichotomy for integer linear systems based on their sign patterns. 67-78 - Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai:
Supereulerian graphs with width s and s-collapsible graphs. 79-94 - Jia-Bao Liu, Xiang-Feng Pan, Lei Yu, Dong Li:
Complete characterization of bicyclic graphs with minimal Kirchhoff index. 95-107 - Silvio Micali, Zeyuan Allen Zhu:
Reconstructing Markov processes from independent and anonymous experiments. 108-122 - Atsuyoshi Nakamura, Ichigaku Takigawa, Hisashi Tosaka, Mineichi Kudo, Hiroshi Mamitsuka:
Mining approximate patterns with frequent locally optimal occurrences. 123-152 - Wenjie Ning, Mei Lu, Jia Guo:
Bounds on the differentiating-total domination number of a tree. 153-160 - Wojciech Olszewski, Rakesh Vohra:
Simultaneous selection. 161-169 - Yuejian Peng, Hao Peng, Qingsong Tang, Cheng Zhao:
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications. 170-175 - P. Roushini Leely Pushpam, Padmapriea Sampath:
Global Roman domination in graphs. 176-185 - Jianhua Tu, Zemin Jin:
An FPT algorithm for the vertex cover P4 problem. 186-190 - Yaling Zhong, Xuding Zhu:
Fractional Thue chromatic number of graphs. 191-199
- Ligang Jin, Ying-li Kang, Eckhard Steffen:
Remarks on planar edge-chromatic critical graphs. 200-202 - Cong X. Kang:
On domination number and distance in graphs. 203-206
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.
last updated on 2026-07-14 00:34 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
