Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ; day:11 ; month:1 ; year:2023 ; pages:1-22
Algorithmica ; (11.1.2023), 1-22
- Creator
-
Misra, Pranabendu
Saurabh, Saket
Sharma, Roohani
Zehavi, Meirav
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-01093-w
- URN
-
urn:nbn:de:101:1-2023032021065292499293
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Misra, Pranabendu
- Saurabh, Saket
- Sharma, Roohani
- Zehavi, Meirav
- SpringerLink (Online service)
Other Objects (12)
Exponential domination, exponential independence, and the clustering coefficient
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
kappa-bounded Exponential-Logarithmic Power Series Fields
The parameterized space complexity of model-checking bounded variable first-order logic
Exponential stability analysis of nonlinear systems with bounded gain error
Some parameterized inequalities by means of fractional integrals with exponential kernels and their applications
Amortized Analysis of Exponential Time- and Parameterized Algorithms: Measure & Conquer and Reference Search Trees
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Exponential domination, exponential independence, and the clustering coefficient
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
kappa-bounded Exponential-Logarithmic Power Series Fields
The parameterized space complexity of model-checking bounded variable first-order logic
Exponential stability analysis of nonlinear systems with bounded gain error
Some parameterized inequalities by means of fractional integrals with exponential kernels and their applications
Amortized Analysis of Exponential Time- and Parameterized Algorithms: Measure & Conquer and Reference Search Trees
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Exponential domination, exponential independence, and the clustering coefficient
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
kappa-bounded Exponential-Logarithmic Power Series Fields
The parameterized space complexity of model-checking bounded variable first-order logic
Exponential stability analysis of nonlinear systems with bounded gain error
Some parameterized inequalities by means of fractional integrals with exponential kernels and their applications
Amortized Analysis of Exponential Time- and Parameterized Algorithms: Measure & Conquer and Reference Search Trees
Parameterized complexity
Parameterized approximability
Parameterized randomization
Parameterized maximization