default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 225
Volume 225, July 2017
- Kazutoshi Ando
, Ryosuke Inagaki, Kazuya Shoji:
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. 1-10
- Kirk Boyer, Paul Horn, Mario Alberto López:
On the barrier graph of an arrangement of ray sensors. 11-21 - Walter Carballosa, José M. Rodríguez, José María Sigarreta, Yadira Torres-Nuñez:
Alliance polynomial of regular graphs. 22-32 - José F. De Jesús, Alexander K. Kelmans:
k-circular matroids of graphs. 33-50 - Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. 51-63 - Shannon L. Fitzpatrick, John Paul Larkin:
The game of Cops and Robber on circulant graphs. 64-73 - P. Francis, S. Francis Raj:
On b-coloring of powers of hypercubes. 74-86 - Jan Gorzny, Jing Huang:
End-vertices of LBFS of (AT-free) bigraphs. 87-94 - Wolfgang F. Riedl:
A complete characterization of jump inequalities for the hop-constrained shortest path problem. 95-113 - Biao Wu, Yuejian Peng:
The connection between polynomial optimization, maximum cliques and Turán densities. 114-121
- Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer:
Color-blind index in graphs of very low degree. 122-129 - Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach:
Interval scheduling maximizing minimum coverage. 130-135 - Barnaby Martin, Franco Raimondi, Taolue Chen, Jos Martin:
The packing chromatic number of the infinite square lattice is between 13 and 15. 136-142
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 2025-02-10 21: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:
