"On the Parameterized Complexity of Eulerian Strong Component Arc Deletion."

Václav Blazej et al. (2025)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01336-6

access: closed

type: Journal Article

metadata version: 2025-10-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BlazejJRS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BlazejJRS25
Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. Algorithmica 87(11): 1669-1709 (2025)

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.