Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of short schedules for uet bipartite graphs."

Evripidis Bampis (1999)

> Home

Details and statistics

DOI: 10.1051/RO:1999115

access: closed

type: Journal Article

metadata version: 2021-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/Bampis99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/Bampis99
Evripidis Bampis:
The complexity of short schedules for uet bipartite graphs. RAIRO Oper. Res. 33(3): 367-370 (1999)

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.