default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 193
Volume 193, October 2015
- Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan
:
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases. 1-10 - Weikang Qian, Marc D. Riedel, Ivo G. Rosenberg:
Synthesizing cubes to satisfy a given intersection pattern. 11-38
- Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer:
Identifying codes and searching with balls in graphs. 39-47 - Viktor Kiss, Lilla Tóthmérész:
Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph. 48-56
- Jan Goedgebeur:
A counterexample to the pseudo 2-factor isomorphic graph conjecture. 57-60
- Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces. 61-79 - Jørgen Bang-Jensen, Carl Johan Casselgren:
Restricted cycle factors and arc-decompositions of digraphs. 80-93 - Bob Chen, Jeong Han Kim, Michael Tait, Jacques Verstraëte:
On coupon colorings of graphs. 94-101 - Xiaolin Chen, Xueliang Li, Huishu Lian:
The matching energy of random graphs. 102-109 - Ajit A. Diwan, Soumitra Pal, Abhiram G. Ranade:
Fragmented coloring of proper interval and split graphs. 110-118 - Xiaolan Hu, Yaojun Chen, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing edge colorings of sparse graphs. 119-125 - Frank Kammer:
A linear-time kernelization for the Rooted k-Leaf Outbranching Problem. 126-138 - Rex K. Kincaid, Allison Oldham, Gexin Yu:
Optimal open-locating-dominating sets in infinite triangular grids. 139-144 - Christian Komusiewicz, Manuel Sorge:
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. 145-161 - Shuchao Li, Yueyu Wu, Huihui Zhang:
On the reformulated reciprocal sum-degree distance of graph transformations. 162-173 - Amine El Sahili, Mekkia Kouider, Maidoun Mortada:
On the b-chromatic number of regular bounded graphs. 174-179 - Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida:
Cycles in complementary prisms. 180-186 - Jarkko Peltomäki:
Privileged factors in the Thue-Morse word - A comparison of privileged words and palindromes. 187-199 - Guangjun Xu, Sanming Zhou:
Three-arc graphs: Characterization and domination. 200-207
- Sherry H. F. Yan:
Bijective counting of humps and peaks in (k, a)-paths. 208-212
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 2024-11-07 20:35 CET 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:
