Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Valery S. Gordon

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Frank Werner 0001

> Home > Persons > Valery S. Gordon

Publications

2011
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/OrlovichDFGW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/OrlovichDFGW11
Yury L. Orlovich, Alexandre Dolgui, Gerd Finke, Valery S. Gordon, Frank Werner:
The complexity of dissociation set problems in graphs. Discret. Appl. Math. 159(13): 1352-1366 (2011)
2008
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/GordonOW08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/GordonOW08
Valery S. Gordon, Yury L. Orlovich, Frank Werner:
Hamiltonian properties of triangular grid graphs. Discret. Math. 308(24): 6166-6188 (2008)
2001
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/rairo/GordonWY01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/GordonWY01
Valery S. Gordon, Frank Werner, O. A. Yanushkevich:
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals. RAIRO Oper. Res. 35(1): 71-83 (2001)

a service of

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.