default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 177
Volume 177, November 2014
- Anne Berry, Romain Pogorelcnik, Geneviève Simonet:
Organizing the atoms of the clique separator decomposition into an atom tree. 1-13 - Bostjan Bresar, Rastislav Krivos-Bellus, Gabriel Semanisin
, Priomoz Sparl:
On the weighted k-path vertex cover problem. 14-18 - Jason I. Brown, Danielle Cox, Richard Ehrenborg:
The average reliability of a graph. 19-33 - Christoph Buchheim, Laura Klein:
Combinatorial optimization with one quadratic term: Spanning trees and forests. 34-52 - Eglantine Camby, Oliver Schaudt:
The price of connectivity for dominating set: Upper bounds and complexity. 53-59 - Bocong Chen, Hai Q. Dinh, Hongwei Liu:
Repeated-root constacyclic codes of length ℓp5 and their duals. 60-70 - Lily Chen, Xueliang Li, Mengmeng Liu:
Tricyclic graphs with maximal revised Szeged index. 71-79 - Sylwia Cichacz:
Distance magic graphs G×Cn. 80-87 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Improved bounds on the domination number of a tree. 88-94 - Genghua Fan, Yanmei Hong, Qinghai Liu:
Ore's condition for completely independent spanning trees. 95-100 - Andrej Gajdos, Mirko Hornák, Peter Hudák, Tomás Madaras:
On the maximum weight of a planar graph of given order and size. 101-110 - Andreas M. Hinz, Caroline Holz auf der Heide:
An efficient algorithm to determine all shortest paths in Sierpiński graphs. 111-120 - Ola Jabali, Walter Rei, Michel Gendreau, Gilbert Laporte:
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. 121-136 - Dorota Kepa-Maksymowicz, Yuri Kozitsky:
Paths and animals in infinite graphs with tempered degree growth. 137-145 - Le Anh Vinh:
On point-line incidences in vector spaces over finite fields. 146-151
- Alexander R. Griffing, Benjamin R. Lynch, Eric A. Stone:
Structural properties of the minimum cut of partially-supplied graphs. 152-157 - Nadia N. Li, Wenchang Chu:
q-derivative operator proof for a conjecture of Melham. 158-164
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-09-02 00:59 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.
