default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 195
Volume 195, November 2015
- Johann L. Hurink
, Bodo Manthey:
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013). 1 - Alexander Apke, Rainer Schrader:
On the non-unit count of interval graphs. 2-7 - Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best monotone degree conditions for binding number and cycle structure. 8-17 - Binay Bhattacharya, Tsunehiko Kameda, Zhao Song:
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. 18-30 - Adrian Bock, Laura Sanità:
The Capacitated Orienteering Problem. 31-42 - Nina Chiarelli, Martin Milanic:
On a class of graphs between threshold and total domishold graphs. 43-58 - Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the termination of some biclique operators on multipartite graphs. 59-73 - Sven de Vries:
Faster separation of 1-wheel inequalities by graph products. 74-83 - Michael Etscheid:
Performance guarantees for scheduling algorithms under perturbed machine speeds. 84-100 - Stefan Hougardy, Mirko Wilde:
On the nearest neighbor rule for the metric traveling salesman problem. 101-103 - N. S. Narayanaswamy, G. Ramakrishna:
Tree t-spanners in outerplanar graphs via supply demand partition. 104-109 - Jeongmi Park, Yoshio Sano:
The double competition hypergraph of a digraph. 110-113 - Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid base problems. 114-128
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-11-26 07:59 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:
