Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity of Maximum Cut on Interval Graphs."

Ranendu Adhikary et al. (2023)

> Home

Details and statistics

DOI: 10.1007/S00454-022-00472-Y

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dcg/AdhikaryBMR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/AdhikaryBMR23
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. Discret. Comput. Geom. 70(2): 307-322 (2023)

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.