- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithmica (85:7) - Heidelberg : Springer Nature - S. 2028-2064
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2023
- Urheber
- DOI
-
10.14279/depositonce-19593
- Handle
-
11303/20795
- URN
-
urn:nbn:de:101:1-2023121301020909863128
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fluschnik, Till
- Niedermeier, Rolf
- Schubert, Carsten
- Zschoche, Philipp
- Technische Universität Berlin
Entstanden
- 2023
Ähnliche Objekte (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