- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Multistage s–t Path: Confronting Similarity with Dissimilarity ; day:3 ; month:1 ; year:2023 ; pages:1-37
Algorithmica ; (3.1.2023), 1-37
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-01077-w
- URN
-
urn:nbn:de:101:1-2023031909023451209687
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 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
- Fluschnik, Till
- Niedermeier, Rolf
- Schubert, Carsten
- Zschoche, Philipp
- SpringerLink (Online service)
Other Objects (12)
Multistage s–t Path: Confronting Similarity with Dissimilarity
Multistage Vertex Cover
Multistage vertex cover
Aspects of Preprocessing Applied to Combinatorial Graph Problems
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
Multistage s–t Path: Confronting Similarity with Dissimilarity
Multistage Vertex Cover
Multistage vertex cover
Aspects of Preprocessing Applied to Combinatorial Graph Problems
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
Multistage s–t Path: Confronting Similarity with Dissimilarity
Multistage Vertex Cover
Multistage vertex cover
Aspects of Preprocessing Applied to Combinatorial Graph Problems
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching