default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 165
Volume 165, March 2014
- Ulrich Faigle, Gaia Nicosia
, Andrea Pacifici:
Preface. 1 - Alessandro Agnetis, Paolo Detti, Marco Pranzo:
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines. 2-11 - Alexandre Albano, Alair Pereira do Lago:
A convexity upper bound for the number of maximal bicliques of a bipartite graph. 12-24 - Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel:
On a base exchange game on bispanning graphs. 25-36 - Nicola Apollonio, Bruno Simeone:
The maximum vertex coverage problem on bipartite graphs. 37-48 - Claudia Archetti, Nicola Bianchessi, Alain Hertz:
A branch-and-price algorithm for the robust graph coloring problem. 49-59 - Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Toughness and binding number. 60-68 - Sergio Bermudo, Henning Fernau:
Computing the differential of a graph: Hardness, approximability and exact algorithms. 69-82 - Flavia Bonomo, Jayme Luiz Szwarcfiter:
Characterization of classical graph classes by weighted clique graphs. 83-95 - Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato:
The Gateway Location Problem: Assessing the impact of candidate site selection policies. 96-111 - Alberto Ceselli, Fabio Colombo, Roberto Cordone, Marco Trubian:
Employee workload balancing by graph partitioning. 112-129 - Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Combined location and routing problems for drug distribution. 130-145 - Július Czap, Jochen Harant, Dávid Hudák:
An upper bound on the sum of powers of the degrees of simple 1-planar graphs. 146-151 - Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
Feasibility Pump-like heuristics for mixed integer problems. 152-167 - Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy:
Co-TT graphs and a characterization of split co-TT graphs. 168-174 - Walter Kern, Xian Qiu:
Note on non-uniform bin packing games. 175-184 - Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition hypergraphs of doubly partial orders. 185-191 - Stefanie Kosuch:
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights. 192-204 - Vadim E. Levit, Martin Milanic:
Equistable simplicial, very well-covered, and line graphs. 205-212 - Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
On the number of realizations of certain Henneberg graphs arising in protein conformation. 213-232 - Sara Nicoloso, Ugo Pietropaoli:
Bipartite finite Toeplitz graphs. 233-244 - Paolo Nobili, Antonio Sassano:
A reduction algorithm for the weighted stable set problem in claw-free graphs. 245-262 - Petros A. Petrosyan, Rafael R. Kamalian:
On sum edge-coloring of regular, bipartite and split graphs. 263-269 - Paolo Serafini:
Classifying negative and positive points by optimal box clustering. 270-282 - Bruno Simeone, Gilbert Nouno, M. Mezzadri, Isabella Lari:
A Boolean theory of signatures for tonal scales. 283-294 - Zdzislaw Skupien:
Majorization and the minimum number of dominating sets. 295-302 - Xuehou Tan, Bo Jiang, Jing Zhang:
Characterizing and recognizing LR-visibility polygons. 303-311 - Anke van Zuylen, Frans Schalekamp, David P. Williamson:
Popular ranking. 312-316
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-18 01:04 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:
