default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 253
Volume 253, January 2019
- Alberto Ceselli
, Roberto Cordone:
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016). 1 - Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
On the P3-hull number of some products of graphs. 2-13 - Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar:
On the chromatic number of 2K2-free graphs. 14-24 - Bartosz Makuracki, Daniel Simson:
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm. 25-36 - Dinabandhu Pradhan, B. S. Panda:
Computing a minimum paired-dominating set in strongly orderable graphs. 37-50 - Cláudia Marcela Justel, Carlos Rocha, Emanuelle Chaves, Anderson Chaves, Geraldo Avelino:
Augmenting the algebraic connectivity for certain families of graphs. 51-60 - Jesmmer Alves, Diane Castonguay, Thomas Brüstle:
A polynomial recognition of unit forms using graph-based strategies. 61-72 - Amal Gassara, Ismael Bouassida Rodriguez, Mohamed Jmaiel, Khalil Drira:
Executing bigraphical reactive systems. 73-92 - Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Gaussian random projections for Euclidean membership problems. 93-102 - Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. 103-121 - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
New exact approaches and approximation results for the Penalized Knapsack Problem. 122-135 - Sunil Chopra, Sangho Shim, Daniel E. Steffy:
A concise characterization of strong knapsack facets. 136-152 - Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen:
The matching relaxation for a class of generalized set partitioning problems. 153-166 - Matthew Anderson, Matthew D. Williamson, K. Subramani:
Empirical analysis of algorithms for the shortest negative cost cycle problem. 167-184 - Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services. 185-200
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-21 19: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:
