Discrete Applied Mathematics, Volume 253 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Discrete Applied Mathematics

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 253, January 2019

14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2016)

• 
  • 
  • 
  • 
  • 
    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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: